TSTP Solution File: GRP729-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP729-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:43:04 EDT 2023
% Result : Unsatisfiable 1.26s 0.68s
% Output : CNFRefutation 1.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 3 RR)
% Number of literals : 27 ( 26 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 50 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c06) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c04) ).
cnf(c02,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c02) ).
cnf(c10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c10) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c05) ).
cnf(c11,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c11) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c03) ).
cnf(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c01) ).
cnf(c22,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',c22) ).
cnf(goals,negated_conjecture,
asoc(a,b,op_k(c,d)) != unit,
file('/export/starexec/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p',goals) ).
cnf(c_0_10,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_11,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_12,axiom,
mult(X1,unit) = X1,
c02 ).
cnf(c_0_13,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_14,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_15,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
c11 ).
cnf(c_0_16,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
mult(mult(i(X1),mult(i(X2),i(X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
mult(mult(i(X1),i(X2)),mult(X2,X1)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_15]),c_0_14]) ).
cnf(c_0_19,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_21,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_22,axiom,
asoc(X1,X2,asoc(X3,X4,X5)) = unit,
c22 ).
cnf(c_0_23,plain,
asoc(i(X1),i(X2),mult(X2,X1)) = op_k(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]),c_0_16]),c_0_14]),c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
asoc(a,b,op_k(c,d)) != unit,
goals ).
cnf(c_0_25,plain,
asoc(X1,X2,op_k(X3,X4)) = unit,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP729-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n001.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Oct 3 02:50:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.m4411wemhl/E---3.1_29513.p
% 1.26/0.68 # Version: 3.1pre001
% 1.26/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.26/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.26/0.68 # Starting sh5l with 300s (1) cores
% 1.26/0.68 # new_bool_3 with pid 29592 completed with status 0
% 1.26/0.68 # Result found by new_bool_3
% 1.26/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.26/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.26/0.68 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1.26/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.26/0.68 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 1.26/0.68 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 29595 completed with status 0
% 1.26/0.68 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 1.26/0.68 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.26/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.26/0.68 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.26/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.26/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.26/0.68 # Search class: FUUPM-FFMF32-MFFFFFNN
% 1.26/0.68 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.26/0.68 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 1.26/0.68 # Preprocessing time : 0.001 s
% 1.26/0.68
% 1.26/0.68 # Proof found!
% 1.26/0.68 # SZS status Unsatisfiable
% 1.26/0.68 # SZS output start CNFRefutation
% See solution above
% 1.26/0.68 # Parsed axioms : 23
% 1.26/0.68 # Removed by relevancy pruning/SinE : 4
% 1.26/0.68 # Initial clauses : 19
% 1.26/0.68 # Removed in clause preprocessing : 0
% 1.26/0.68 # Initial clauses in saturation : 19
% 1.26/0.68 # Processed clauses : 573
% 1.26/0.68 # ...of these trivial : 266
% 1.26/0.68 # ...subsumed : 25
% 1.26/0.68 # ...remaining for further processing : 282
% 1.26/0.68 # Other redundant clauses eliminated : 0
% 1.26/0.68 # Clauses deleted for lack of memory : 0
% 1.26/0.68 # Backward-subsumed : 0
% 1.26/0.68 # Backward-rewritten : 42
% 1.26/0.68 # Generated clauses : 16010
% 1.26/0.68 # ...of the previous two non-redundant : 10107
% 1.26/0.68 # ...aggressively subsumed : 0
% 1.26/0.68 # Contextual simplify-reflections : 0
% 1.26/0.68 # Paramodulations : 16010
% 1.26/0.68 # Factorizations : 0
% 1.26/0.68 # NegExts : 0
% 1.26/0.68 # Equation resolutions : 0
% 1.26/0.68 # Total rewrite steps : 39321
% 1.26/0.68 # Propositional unsat checks : 0
% 1.26/0.68 # Propositional check models : 0
% 1.26/0.68 # Propositional check unsatisfiable : 0
% 1.26/0.68 # Propositional clauses : 0
% 1.26/0.68 # Propositional clauses after purity: 0
% 1.26/0.68 # Propositional unsat core size : 0
% 1.26/0.68 # Propositional preprocessing time : 0.000
% 1.26/0.68 # Propositional encoding time : 0.000
% 1.26/0.68 # Propositional solver time : 0.000
% 1.26/0.68 # Success case prop preproc time : 0.000
% 1.26/0.68 # Success case prop encoding time : 0.000
% 1.26/0.68 # Success case prop solver time : 0.000
% 1.26/0.68 # Current number of processed clauses : 240
% 1.26/0.68 # Positive orientable unit clauses : 233
% 1.26/0.68 # Positive unorientable unit clauses: 7
% 1.26/0.68 # Negative unit clauses : 0
% 1.26/0.68 # Non-unit-clauses : 0
% 1.26/0.68 # Current number of unprocessed clauses: 9483
% 1.26/0.68 # ...number of literals in the above : 9483
% 1.26/0.68 # Current number of archived formulas : 0
% 1.26/0.68 # Current number of archived clauses : 42
% 1.26/0.68 # Clause-clause subsumption calls (NU) : 0
% 1.26/0.68 # Rec. Clause-clause subsumption calls : 0
% 1.26/0.68 # Non-unit clause-clause subsumptions : 0
% 1.26/0.68 # Unit Clause-clause subsumption calls : 31
% 1.26/0.68 # Rewrite failures with RHS unbound : 0
% 1.26/0.68 # BW rewrite match attempts : 355
% 1.26/0.68 # BW rewrite match successes : 40
% 1.26/0.68 # Condensation attempts : 0
% 1.26/0.68 # Condensation successes : 0
% 1.26/0.68 # Termbank termtop insertions : 229659
% 1.26/0.68
% 1.26/0.68 # -------------------------------------------------
% 1.26/0.68 # User time : 0.160 s
% 1.26/0.68 # System time : 0.011 s
% 1.26/0.68 # Total time : 0.171 s
% 1.26/0.68 # Maximum resident set size: 1620 pages
% 1.26/0.68
% 1.26/0.68 # -------------------------------------------------
% 1.26/0.68 # User time : 0.162 s
% 1.26/0.68 # System time : 0.013 s
% 1.26/0.68 # Total time : 0.175 s
% 1.26/0.68 # Maximum resident set size: 1680 pages
% 1.26/0.68 % E---3.1 exiting
% 1.26/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------