TSTP Solution File: GRP665+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:01 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 25 unt; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 11 ~; 6 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',goals) ).
fof(f08,axiom,
! [X3,X1,X2] : mult(mult(X2,X1),X3) = mult(mult(X2,X3),ld(X3,mult(X1,X3))),
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f08) ).
fof(f09,axiom,
! [X2] : mult(op_c,X2) = mult(X2,op_c),
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f09) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f02) ).
fof(f07,axiom,
! [X3,X1,X2] : mult(X2,mult(X1,X3)) = mult(rd(mult(X2,X1),X2),mult(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f07) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f01) ).
fof(f04,axiom,
! [X1,X2] : rd(mult(X2,X1),X1) = X2,
file('/export/starexec/sandbox/tmp/tmp.kZJqNc1Ul9/E---3.1_23191.p',f04) ).
fof(c_0_7,negated_conjecture,
~ ! [X4,X5] :
( mult(op_c,mult(X4,X5)) = mult(mult(op_c,X4),X5)
& mult(mult(X4,op_c),X5) = mult(X4,mult(op_c,X5))
& mult(mult(X4,X5),op_c) = mult(X4,mult(X5,op_c)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,plain,
! [X21,X22,X23] : mult(mult(X23,X22),X21) = mult(mult(X23,X21),ld(X21,mult(X22,X21))),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_9,plain,
! [X24] : mult(op_c,X24) = mult(X24,op_c),
inference(variable_rename,[status(thm)],[f09]) ).
fof(c_0_10,plain,
! [X10,X11] : ld(X11,mult(X11,X10)) = X10,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_11,plain,
! [X18,X19,X20] : mult(X20,mult(X19,X18)) = mult(rd(mult(X20,X19),X20),mult(X20,X18)),
inference(variable_rename,[status(thm)],[f07]) ).
fof(c_0_12,plain,
! [X8,X9] : mult(X9,ld(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_13,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0)
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_14,plain,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
mult(op_c,X1) = mult(X1,op_c),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X14,X15] : rd(mult(X15,X14),X14) = X15,
inference(variable_rename,[status(thm)],[f04]) ).
cnf(c_0_20,negated_conjecture,
( mult(op_c,mult(esk1_0,esk2_0)) != mult(mult(op_c,esk1_0),esk2_0)
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_15]) ).
cnf(c_0_22,plain,
mult(rd(mult(X1,X2),X1),X3) = mult(X1,mult(X2,ld(X1,X3))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
rd(mult(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(op_c,esk1_0),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_25,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_26,plain,
mult(op_c,mult(X1,ld(op_c,X2))) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_15]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
mult(esk1_0,mult(op_c,esk2_0)) != mult(op_c,mult(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25])]) ).
cnf(c_0_28,plain,
mult(op_c,mult(X1,X2)) = mult(X1,mult(op_c,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP665+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:59:22 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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.kZJqNc1Ul9/E---3.1_23191.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # sh5l with pid 23271 completed with status 0
% 0.15/0.44 # Result found by sh5l
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.15/0.44 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 23279 completed with status 0
% 0.15/0.44 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.44 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 10
% 0.15/0.44 # Removed by relevancy pruning/SinE : 0
% 0.15/0.44 # Initial clauses : 10
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 10
% 0.15/0.44 # Processed clauses : 175
% 0.15/0.44 # ...of these trivial : 46
% 0.15/0.44 # ...subsumed : 30
% 0.15/0.44 # ...remaining for further processing : 99
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 0
% 0.15/0.44 # Backward-rewritten : 24
% 0.15/0.44 # Generated clauses : 1601
% 0.15/0.44 # ...of the previous two non-redundant : 857
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 1601
% 0.15/0.44 # Factorizations : 0
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 2451
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 65
% 0.15/0.44 # Positive orientable unit clauses : 63
% 0.15/0.44 # Positive unorientable unit clauses: 2
% 0.15/0.44 # Negative unit clauses : 0
% 0.15/0.44 # Non-unit-clauses : 0
% 0.15/0.44 # Current number of unprocessed clauses: 676
% 0.15/0.44 # ...number of literals in the above : 676
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 34
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.44 # Non-unit clause-clause subsumptions : 0
% 0.15/0.44 # Unit Clause-clause subsumption calls : 2
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 46
% 0.15/0.44 # BW rewrite match successes : 35
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 18200
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.015 s
% 0.15/0.44 # System time : 0.002 s
% 0.15/0.44 # Total time : 0.017 s
% 0.15/0.44 # Maximum resident set size: 1768 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.016 s
% 0.15/0.44 # System time : 0.004 s
% 0.15/0.44 # Total time : 0.020 s
% 0.15/0.44 # Maximum resident set size: 1676 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------