TSTP Solution File: GRP031-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP031-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:43:42 EDT 2024
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 14 RR)
% Number of literals : 44 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 57 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity1,axiom,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP002-0.ax',associativity1) ).
cnf(associativity2,axiom,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP002-0.ax',associativity2) ).
cnf(left_identity,hypothesis,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
cnf(left_inverse,hypothesis,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
cnf(prove_a_has_an_inverse,negated_conjecture,
~ product(a,X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_has_an_inverse) ).
cnf(c_0_5,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
cnf(c_0_6,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_7,plain,
( product(X1,X5,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X3,X4,X6) ),
c_0_5 ).
cnf(c_0_8,hypothesis,
product(identity,X1,X1),
left_identity ).
cnf(c_0_9,plain,
( product(X3,X4,X6)
| ~ product(X1,X2,X3)
| ~ product(X2,X4,X5)
| ~ product(X1,X5,X6) ),
c_0_6 ).
cnf(c_0_10,hypothesis,
( product(X1,X2,X3)
| ~ product(X1,X4,identity)
| ~ product(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,hypothesis,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_12,hypothesis,
( product(X1,X2,X3)
| ~ product(X4,identity,X1)
| ~ product(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,hypothesis,
( product(X1,identity,X2)
| ~ product(X1,inverse(X2),identity) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ product(a,X1,identity),
inference(fof_simplification,[status(thm)],[prove_a_has_an_inverse]) ).
cnf(c_0_15,hypothesis,
( product(X1,X2,identity)
| ~ product(inverse(X2),identity,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,hypothesis,
product(inverse(inverse(X1)),identity,X1),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
~ product(a,X1,identity),
c_0_14 ).
cnf(c_0_18,hypothesis,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP031-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 05:41:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 # Version: 3.1.0
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # new_bool_3 with pid 6633 completed with status 0
% 0.18/0.46 # Result found by new_bool_3
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FHUSS-FFSF11-SFFFFFNN
% 0.18/0.46 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.18/0.46 # G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with pid 6637 completed with status 0
% 0.18/0.46 # Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.18/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46 # Search class: FHUSS-FFSF11-SFFFFFNN
% 0.18/0.46 # partial match(1): FHUSS-FFSF21-SFFFFFNN
% 0.18/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I with 181s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46 # Presaturation interreduction done
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Unsatisfiable
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 7
% 0.18/0.46 # Removed by relevancy pruning/SinE : 1
% 0.18/0.46 # Initial clauses : 6
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 6
% 0.18/0.46 # Processed clauses : 39
% 0.18/0.46 # ...of these trivial : 1
% 0.18/0.46 # ...subsumed : 7
% 0.18/0.46 # ...remaining for further processing : 31
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 4
% 0.18/0.46 # Generated clauses : 69
% 0.18/0.46 # ...of the previous two non-redundant : 47
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 69
% 0.18/0.46 # Factorizations : 0
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Disequality decompositions : 0
% 0.18/0.46 # Total rewrite steps : 24
% 0.18/0.46 # ...of those cached : 18
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 21
% 0.18/0.46 # Positive orientable unit clauses : 6
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 1
% 0.18/0.46 # Non-unit-clauses : 14
% 0.18/0.46 # Current number of unprocessed clauses: 20
% 0.18/0.46 # ...number of literals in the above : 46
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 10
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 104
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 93
% 0.18/0.46 # Non-unit clause-clause subsumptions : 7
% 0.18/0.46 # Unit Clause-clause subsumption calls : 0
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 4
% 0.18/0.46 # BW rewrite match successes : 1
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 938
% 0.18/0.46 # Search garbage collected termcells : 21
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.004 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.005 s
% 0.18/0.46 # Maximum resident set size: 1612 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.006 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.008 s
% 0.18/0.46 # Maximum resident set size: 1700 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E exiting
%------------------------------------------------------------------------------