TSTP Solution File: GRP704+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Sat May 4 08:01:54 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 27 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f09,axiom,
! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f09) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f01) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f02) ).
fof(f13,axiom,
! [X1,X2] : op_f = mult(X2,mult(X1,ld(mult(X2,X1),op_c))),
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f13) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
& mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
& mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',goals) ).
fof(f08,axiom,
! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f08) ).
fof(f10,axiom,
! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
file('/export/starexec/sandbox/tmp/tmp.y3oqub3Z40/E---3.1_11722.p',f10) ).
fof(c_0_7,plain,
! [X19,X20] : mult(X20,mult(X19,op_c)) = mult(mult(X20,X19),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
fof(c_0_8,plain,
! [X13,X14] : mult(X14,ld(X14,X13)) = X13,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_9,plain,
! [X15,X16] : ld(X16,mult(X16,X15)) = X15,
inference(variable_rename,[status(thm)],[f02]) ).
cnf(c_0_10,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
mult(X1,mult(ld(X1,X2),op_c)) = mult(X2,op_c),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,plain,
! [X11,X12] : op_f = mult(X12,mult(X11,ld(mult(X12,X11),op_c))),
inference(variable_rename,[status(thm)],[f13]) ).
cnf(c_0_15,plain,
ld(X1,mult(X2,op_c)) = mult(ld(X1,X2),op_c),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,negated_conjecture,
~ ! [X4,X5] :
( mult(op_f,mult(X4,X5)) = mult(mult(op_f,X4),X5)
& mult(X4,mult(X5,op_f)) = mult(mult(X4,X5),op_f)
& mult(X4,mult(op_f,X5)) = mult(mult(X4,op_f),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_17,plain,
! [X17,X18] : mult(op_c,mult(X18,X17)) = mult(mult(op_c,X18),X17),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_18,plain,
op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
mult(ld(X1,X1),op_c) = op_c,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
fof(c_0_20,negated_conjecture,
( mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_f)) != mult(mult(esk1_0,esk2_0),op_f)
| mult(esk1_0,mult(op_f,esk2_0)) != mult(mult(esk1_0,op_f),esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
op_c = op_f,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_11]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( mult(op_f,mult(esk1_0,esk2_0)) != mult(mult(op_f,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_f)) != mult(mult(esk1_0,esk2_0),op_f)
| mult(esk1_0,mult(op_f,esk2_0)) != mult(mult(esk1_0,op_f),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
mult(mult(op_f,X1),X2) = mult(op_f,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
fof(c_0_25,plain,
! [X21,X22] : mult(X22,mult(op_c,X21)) = mult(mult(X22,op_c),X21),
inference(variable_rename,[status(thm)],[f10]) ).
cnf(c_0_26,negated_conjecture,
( mult(mult(esk1_0,op_f),esk2_0) != mult(esk1_0,mult(op_f,esk2_0))
| mult(mult(esk1_0,esk2_0),op_f) != mult(esk1_0,mult(esk2_0,op_f)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
mult(mult(X1,X2),op_f) = mult(X1,mult(X2,op_f)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_22]),c_0_22]) ).
cnf(c_0_28,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
mult(mult(esk1_0,op_f),esk2_0) != mult(esk1_0,mult(op_f,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
mult(mult(X1,op_f),X2) = mult(X1,mult(op_f,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n024.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 16:25:52 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.y3oqub3Z40/E---3.1_11722.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_1 with pid 11801 completed with status 0
% 0.15/0.43 # Result found by new_bool_1
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.15/0.43 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 11807 completed with status 0
% 0.15/0.43 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 14
% 0.15/0.43 # Removed by relevancy pruning/SinE : 6
% 0.15/0.43 # Initial clauses : 8
% 0.15/0.43 # Removed in clause preprocessing : 0
% 0.15/0.43 # Initial clauses in saturation : 8
% 0.15/0.43 # Processed clauses : 32
% 0.15/0.43 # ...of these trivial : 1
% 0.15/0.43 # ...subsumed : 0
% 0.15/0.43 # ...remaining for further processing : 31
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 10
% 0.15/0.43 # Generated clauses : 156
% 0.15/0.43 # ...of the previous two non-redundant : 118
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 156
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 148
% 0.15/0.43 # ...of those cached : 62
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 13
% 0.15/0.43 # Positive orientable unit clauses : 13
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 0
% 0.15/0.43 # Non-unit-clauses : 0
% 0.15/0.43 # Current number of unprocessed clauses: 100
% 0.15/0.43 # ...number of literals in the above : 100
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 18
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 # Non-unit clause-clause subsumptions : 0
% 0.15/0.43 # Unit Clause-clause subsumption calls : 0
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 8
% 0.15/0.43 # BW rewrite match successes : 6
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 2429
% 0.15/0.43 # Search garbage collected termcells : 70
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.003 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.006 s
% 0.15/0.43 # Maximum resident set size: 1608 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.005 s
% 0.15/0.43 # System time : 0.004 s
% 0.15/0.43 # Total time : 0.008 s
% 0.15/0.43 # Maximum resident set size: 1696 pages
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------