TSTP Solution File: GRP704+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n026.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 07:54:05 EDT 2024
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 20 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',goals) ).
fof(f06,axiom,
! [X2] : mult(unit,X2) = X2,
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f06) ).
fof(f13,axiom,
! [X1,X2] : op_f = mult(X2,mult(X1,ld(mult(X2,X1),op_c))),
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f13) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f01) ).
fof(f08,axiom,
! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f08) ).
fof(f10,axiom,
! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f10) ).
fof(f09,axiom,
! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
file('/export/starexec/sandbox2/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p',f09) ).
fof(c_0_7,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_8,plain,
! [X15] : mult(unit,X15) = X15,
inference(variable_rename,[status(thm)],[f06]) ).
fof(c_0_9,plain,
! [X28,X29] : op_f = mult(X29,mult(X28,ld(mult(X29,X28),op_c))),
inference(variable_rename,[status(thm)],[f13]) ).
fof(c_0_10,plain,
! [X6,X7] : mult(X7,ld(X7,X6)) = X6,
inference(variable_rename,[status(thm)],[f01]) ).
fof(c_0_11,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_7])])])]) ).
cnf(c_0_12,plain,
mult(unit,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
op_f = mult(X1,mult(X2,ld(mult(X1,X2),op_c))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X19,X20] : mult(op_c,mult(X20,X19)) = mult(mult(op_c,X20),X19),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_16,plain,
! [X23,X24] : mult(X24,mult(op_c,X23)) = mult(mult(X24,op_c),X23),
inference(variable_rename,[status(thm)],[f10]) ).
fof(c_0_17,plain,
! [X21,X22] : mult(X22,mult(X21,op_c)) = mult(mult(X22,X21),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_18,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_11]) ).
cnf(c_0_19,plain,
op_f = op_c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_12]),c_0_14]) ).
cnf(c_0_20,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_19]),c_0_19]),c_0_21]),c_0_19]),c_0_19]),c_0_22]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n026.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 16:25:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.yA3ZaekxJ6/E---3.1_15774.p
% 0.22/0.52 # Version: 3.1.0
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 15910 completed with status 0
% 0.22/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.22/0.52 # Starting sh5l with 136s (1) cores
% 0.22/0.52 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 15915 completed with status 0
% 0.22/0.52 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # No SInE strategy applied
% 0.22/0.52 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.22/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.52 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 811s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 14
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 14
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 14
% 0.22/0.52 # Processed clauses : 30
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 0
% 0.22/0.52 # ...remaining for further processing : 30
% 0.22/0.52 # Other redundant clauses eliminated : 0
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 0
% 0.22/0.52 # Backward-rewritten : 3
% 0.22/0.52 # Generated clauses : 101
% 0.22/0.52 # ...of the previous two non-redundant : 88
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 0
% 0.22/0.52 # Paramodulations : 101
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 0
% 0.22/0.52 # Disequality decompositions : 0
% 0.22/0.52 # Total rewrite steps : 75
% 0.22/0.52 # ...of those cached : 27
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 13
% 0.22/0.52 # Positive orientable unit clauses : 13
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 0
% 0.22/0.52 # Non-unit-clauses : 0
% 0.22/0.52 # Current number of unprocessed clauses: 86
% 0.22/0.52 # ...number of literals in the above : 86
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 17
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.22/0.52 # Non-unit clause-clause subsumptions : 0
% 0.22/0.52 # Unit Clause-clause subsumption calls : 0
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 3
% 0.22/0.52 # BW rewrite match successes : 2
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 1729
% 0.22/0.52 # Search garbage collected termcells : 43
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.005 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.007 s
% 0.22/0.52 # Maximum resident set size: 1684 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.021 s
% 0.22/0.52 # System time : 0.008 s
% 0.22/0.52 # Total time : 0.029 s
% 0.22/0.52 # Maximum resident set size: 1692 pages
% 0.22/0.52 % E---3.1 exiting
% 0.41/0.52 % E exiting
%------------------------------------------------------------------------------