TSTP Solution File: GRP748-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP748-2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:50:33 EDT 2023
% Result : Unsatisfiable 3.37s 0.79s
% Output : CNFRefutation 3.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 40 ( 34 unt; 4 nHn; 6 RR)
% Number of literals : 46 ( 45 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f11,axiom,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f11) ).
cnf(f01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f01) ).
cnf(f08,axiom,
mult(mult(X1,X2),i(X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f08) ).
cnf(f09,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f09) ).
cnf(f06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f06) ).
cnf(f07,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f07) ).
cnf(f10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f10) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',f02) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
file('/export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p',goals) ).
cnf(c_0_9,axiom,
( mult(X1,X2) = mult(X2,X1)
| mult(i(X1),mult(X1,X2)) = X2 ),
f11 ).
cnf(c_0_10,axiom,
mult(X1,ld(X1,X2)) = X2,
f01 ).
cnf(c_0_11,axiom,
mult(mult(X1,X2),i(X2)) = X1,
f08 ).
cnf(c_0_12,plain,
( ld(X1,X2) = mult(i(X1),X2)
| mult(ld(X1,X2),X1) = X2 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ld(X1,X2) = mult(i(X1),X2)
| ld(X1,X2) = mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( ld(X1,X2) = mult(X2,i(X1))
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_15,axiom,
mult(X1,i(X1)) = unit,
f09 ).
cnf(c_0_16,axiom,
mult(unit,X1) = X1,
f06 ).
cnf(c_0_17,axiom,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
f07 ).
cnf(c_0_18,axiom,
mult(i(X1),X1) = unit,
f10 ).
cnf(c_0_19,plain,
( mult(X1,mult(X2,i(X1))) = X2
| mult(i(X1),X2) != mult(X2,i(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_20,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_16]) ).
cnf(c_0_21,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_22,plain,
mult(i(X1),mult(mult(X1,X2),X1)) = mult(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_23,plain,
ld(i(X1),X2) = mult(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_20]),c_0_10])]) ).
cnf(c_0_24,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_26,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),i(X2)) = mult(mult(X1,X2),X3),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_27,plain,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,plain,
mult(X1,i(mult(X2,X1))) = i(X2),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_29,plain,
mult(mult(X1,i(X2)),mult(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_26]),c_0_18]),c_0_16]),c_0_20]),c_0_27]) ).
cnf(c_0_30,plain,
i(mult(X1,X2)) = mult(i(X2),i(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_31,plain,
mult(mult(X1,i(X2)),mult(mult(X2,X3),X1)) = mult(X1,mult(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_30]),c_0_20]) ).
cnf(c_0_32,plain,
mult(mult(X1,mult(X2,X1)),i(X1)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_33,plain,
mult(mult(X1,i(X2)),X2) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
mult(a,mult(b,mult(a,c))) != mult(mult(mult(a,b),a),c),
goals ).
cnf(c_0_35,plain,
mult(mult(X1,X2),mult(X3,X1)) = mult(X1,mult(mult(X2,X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_20]) ).
cnf(c_0_36,plain,
mult(mult(X1,X2),i(X1)) = mult(X1,mult(X2,i(X1))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
mult(mult(a,mult(b,a)),c) != mult(a,mult(b,mult(a,c))),
inference(rw,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_38,plain,
mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_35]),c_0_36]),c_0_11]),c_0_27]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : GRP748-2 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.08 % Command : run_E %s %d THM
% 0.07/0.27 % Computer : n006.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 2400
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Tue Oct 3 02:19:24 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.35 Running first-order model finding
% 0.11/0.35 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.aCwVxR42Cs/E---3.1_4302.p
% 3.37/0.79 # Version: 3.1pre001
% 3.37/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.37/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.37/0.79 # Starting new_bool_3 with 300s (1) cores
% 3.37/0.79 # Starting new_bool_1 with 300s (1) cores
% 3.37/0.79 # Starting sh5l with 300s (1) cores
% 3.37/0.79 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 4394 completed with status 0
% 3.37/0.79 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.37/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.37/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.37/0.79 # No SInE strategy applied
% 3.37/0.79 # Search class: FGUPM-FFSF21-MFFFFFNN
% 3.37/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.37/0.79 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.37/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.37/0.79 # Starting new_bool_3 with 136s (1) cores
% 3.37/0.79 # Starting new_bool_1 with 136s (1) cores
% 3.37/0.79 # Starting sh5l with 136s (1) cores
% 3.37/0.79 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 4398 completed with status 0
% 3.37/0.79 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 3.37/0.79 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.37/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.37/0.79 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.37/0.79 # No SInE strategy applied
% 3.37/0.79 # Search class: FGUPM-FFSF21-MFFFFFNN
% 3.37/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.37/0.79 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.37/0.79 # Preprocessing time : 0.001 s
% 3.37/0.79 # Presaturation interreduction done
% 3.37/0.79
% 3.37/0.79 # Proof found!
% 3.37/0.79 # SZS status Unsatisfiable
% 3.37/0.79 # SZS output start CNFRefutation
% See solution above
% 3.37/0.79 # Parsed axioms : 12
% 3.37/0.79 # Removed by relevancy pruning/SinE : 0
% 3.37/0.79 # Initial clauses : 12
% 3.37/0.79 # Removed in clause preprocessing : 0
% 3.37/0.79 # Initial clauses in saturation : 12
% 3.37/0.79 # Processed clauses : 971
% 3.37/0.79 # ...of these trivial : 169
% 3.37/0.79 # ...subsumed : 520
% 3.37/0.79 # ...remaining for further processing : 282
% 3.37/0.79 # Other redundant clauses eliminated : 0
% 3.37/0.79 # Clauses deleted for lack of memory : 0
% 3.37/0.79 # Backward-subsumed : 9
% 3.37/0.79 # Backward-rewritten : 95
% 3.37/0.79 # Generated clauses : 25928
% 3.37/0.79 # ...of the previous two non-redundant : 19216
% 3.37/0.79 # ...aggressively subsumed : 0
% 3.37/0.79 # Contextual simplify-reflections : 0
% 3.37/0.79 # Paramodulations : 25915
% 3.37/0.79 # Factorizations : 2
% 3.37/0.79 # NegExts : 0
% 3.37/0.79 # Equation resolutions : 11
% 3.37/0.79 # Total rewrite steps : 123702
% 3.37/0.79 # Propositional unsat checks : 0
% 3.37/0.79 # Propositional check models : 0
% 3.37/0.79 # Propositional check unsatisfiable : 0
% 3.37/0.79 # Propositional clauses : 0
% 3.37/0.79 # Propositional clauses after purity: 0
% 3.37/0.79 # Propositional unsat core size : 0
% 3.37/0.79 # Propositional preprocessing time : 0.000
% 3.37/0.79 # Propositional encoding time : 0.000
% 3.37/0.79 # Propositional solver time : 0.000
% 3.37/0.79 # Success case prop preproc time : 0.000
% 3.37/0.79 # Success case prop encoding time : 0.000
% 3.37/0.79 # Success case prop solver time : 0.000
% 3.37/0.79 # Current number of processed clauses : 166
% 3.37/0.79 # Positive orientable unit clauses : 92
% 3.37/0.79 # Positive unorientable unit clauses: 0
% 3.37/0.79 # Negative unit clauses : 0
% 3.37/0.79 # Non-unit-clauses : 74
% 3.37/0.79 # Current number of unprocessed clauses: 16013
% 3.37/0.79 # ...number of literals in the above : 23438
% 3.37/0.79 # Current number of archived formulas : 0
% 3.37/0.79 # Current number of archived clauses : 116
% 3.37/0.79 # Clause-clause subsumption calls (NU) : 10404
% 3.37/0.79 # Rec. Clause-clause subsumption calls : 7476
% 3.37/0.79 # Non-unit clause-clause subsumptions : 520
% 3.37/0.79 # Unit Clause-clause subsumption calls : 150
% 3.37/0.79 # Rewrite failures with RHS unbound : 0
% 3.37/0.79 # BW rewrite match attempts : 947
% 3.37/0.79 # BW rewrite match successes : 85
% 3.37/0.79 # Condensation attempts : 0
% 3.37/0.79 # Condensation successes : 0
% 3.37/0.79 # Termbank termtop insertions : 571468
% 3.37/0.79
% 3.37/0.79 # -------------------------------------------------
% 3.37/0.79 # User time : 0.310 s
% 3.37/0.79 # System time : 0.014 s
% 3.37/0.79 # Total time : 0.324 s
% 3.37/0.79 # Maximum resident set size: 1552 pages
% 3.37/0.79
% 3.37/0.79 # -------------------------------------------------
% 3.37/0.79 # User time : 2.004 s
% 3.37/0.79 # System time : 0.034 s
% 3.37/0.79 # Total time : 2.037 s
% 3.37/0.79 # Maximum resident set size: 1672 pages
% 3.37/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------