TSTP Solution File: GRP703+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:42:59 EDT 2023
% Result : Theorem 0.23s 0.55s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 30 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f02) ).
fof(f11,axiom,
! [X2] : op_d = ld(X2,mult(op_c,X2)),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f11) ).
fof(f01,axiom,
! [X1,X2] : mult(X2,ld(X2,X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f01) ).
fof(goals,conjecture,
! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),X5) ),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',goals) ).
fof(f12,axiom,
! [X1,X2] : op_e = mult(mult(rd(op_c,mult(X2,X1)),X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f12) ).
fof(f10,axiom,
! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f10) ).
fof(f03,axiom,
! [X1,X2] : mult(rd(X2,X1),X1) = X2,
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f03) ).
fof(f08,axiom,
! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f08) ).
fof(f09,axiom,
! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
file('/export/starexec/sandbox2/tmp/tmp.QQFjP2aygw/E---3.1_13284.p',f09) ).
fof(c_0_9,plain,
! [X10,X11] : ld(X11,mult(X11,X10)) = X10,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_10,plain,
! [X27] : op_d = ld(X27,mult(op_c,X27)),
inference(variable_rename,[status(thm)],[f11]) ).
cnf(c_0_11,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
op_d = ld(X1,mult(op_c,X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
op_d = op_c,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X8,X9] : mult(X9,ld(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f01]) ).
cnf(c_0_15,plain,
ld(X1,mult(op_c,X1)) = op_c,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
mult(X1,ld(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,negated_conjecture,
~ ! [X4,X5] :
( mult(op_e,mult(X4,X5)) = mult(mult(op_e,X4),X5)
& mult(X4,mult(X5,op_e)) = mult(mult(X4,X5),op_e)
& mult(X4,mult(op_e,X5)) = mult(mult(X4,op_e),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X25,X26] : op_e = mult(mult(rd(op_c,mult(X26,X25)),X25),X26),
inference(variable_rename,[status(thm)],[f12]) ).
cnf(c_0_19,plain,
ld(ld(op_c,X1),X1) = op_c,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,plain,
! [X23,X24] : mult(X24,mult(op_c,X23)) = mult(mult(X24,op_c),X23),
inference(variable_rename,[status(thm)],[f10]) ).
fof(c_0_21,plain,
! [X12,X13] : mult(rd(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[f03]) ).
fof(c_0_22,negated_conjecture,
( mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_e)) != mult(mult(esk1_0,esk2_0),op_e)
| mult(esk1_0,mult(op_e,esk2_0)) != mult(mult(esk1_0,op_e),esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_23,plain,
op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
mult(ld(op_c,X1),op_c) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_25,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
mult(rd(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,plain,
! [X19,X20] : mult(op_c,mult(X20,X19)) = mult(mult(op_c,X20),X19),
inference(variable_rename,[status(thm)],[f08]) ).
fof(c_0_28,plain,
! [X21,X22] : mult(X22,mult(X21,op_c)) = mult(mult(X22,X21),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_29,negated_conjecture,
( mult(op_e,mult(esk1_0,esk2_0)) != mult(mult(op_e,esk1_0),esk2_0)
| mult(esk1_0,mult(esk2_0,op_e)) != mult(mult(esk1_0,esk2_0),op_e)
| mult(esk1_0,mult(op_e,esk2_0)) != mult(mult(esk1_0,op_e),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
op_e = op_c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_16]),c_0_26]) ).
cnf(c_0_31,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,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_29,c_0_30]),c_0_31]),c_0_30]),c_0_30]),c_0_25]),c_0_30]),c_0_30]),c_0_32]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.15 % Problem : GRP703+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.16 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n021.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 2400
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Tue Oct 3 02:46:59 EDT 2023
% 0.15/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.QQFjP2aygw/E---3.1_13284.p
% 0.23/0.55 # Version: 3.1pre001
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # sh5l with pid 13365 completed with status 0
% 0.23/0.55 # Result found by sh5l
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.55 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.23/0.55 # H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with pid 13373 completed with status 0
% 0.23/0.55 # Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y
% 0.23/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.55 # Starting sh5l with 300s (1) cores
% 0.23/0.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.23/0.55 # Search class: FUHPM-FFSF22-MFFFFFNN
% 0.23/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.55 # Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 181s (1) cores
% 0.23/0.55 # Preprocessing time : 0.001 s
% 0.23/0.55 # Presaturation interreduction done
% 0.23/0.55
% 0.23/0.55 # Proof found!
% 0.23/0.55 # SZS status Theorem
% 0.23/0.55 # SZS output start CNFRefutation
% See solution above
% 0.23/0.55 # Parsed axioms : 14
% 0.23/0.55 # Removed by relevancy pruning/SinE : 2
% 0.23/0.55 # Initial clauses : 12
% 0.23/0.55 # Removed in clause preprocessing : 0
% 0.23/0.55 # Initial clauses in saturation : 12
% 0.23/0.55 # Processed clauses : 29
% 0.23/0.55 # ...of these trivial : 0
% 0.23/0.55 # ...subsumed : 0
% 0.23/0.55 # ...remaining for further processing : 29
% 0.23/0.55 # Other redundant clauses eliminated : 0
% 0.23/0.55 # Clauses deleted for lack of memory : 0
% 0.23/0.55 # Backward-subsumed : 0
% 0.23/0.55 # Backward-rewritten : 3
% 0.23/0.55 # Generated clauses : 90
% 0.23/0.55 # ...of the previous two non-redundant : 82
% 0.23/0.55 # ...aggressively subsumed : 0
% 0.23/0.55 # Contextual simplify-reflections : 0
% 0.23/0.55 # Paramodulations : 90
% 0.23/0.55 # Factorizations : 0
% 0.23/0.55 # NegExts : 0
% 0.23/0.55 # Equation resolutions : 0
% 0.23/0.55 # Total rewrite steps : 52
% 0.23/0.55 # Propositional unsat checks : 0
% 0.23/0.55 # Propositional check models : 0
% 0.23/0.55 # Propositional check unsatisfiable : 0
% 0.23/0.55 # Propositional clauses : 0
% 0.23/0.55 # Propositional clauses after purity: 0
% 0.23/0.55 # Propositional unsat core size : 0
% 0.23/0.55 # Propositional preprocessing time : 0.000
% 0.23/0.55 # Propositional encoding time : 0.000
% 0.23/0.55 # Propositional solver time : 0.000
% 0.23/0.55 # Success case prop preproc time : 0.000
% 0.23/0.55 # Success case prop encoding time : 0.000
% 0.23/0.55 # Success case prop solver time : 0.000
% 0.23/0.55 # Current number of processed clauses : 14
% 0.23/0.55 # Positive orientable unit clauses : 14
% 0.23/0.55 # Positive unorientable unit clauses: 0
% 0.23/0.55 # Negative unit clauses : 0
% 0.23/0.55 # Non-unit-clauses : 0
% 0.23/0.55 # Current number of unprocessed clauses: 76
% 0.23/0.55 # ...number of literals in the above : 76
% 0.23/0.55 # Current number of archived formulas : 0
% 0.23/0.55 # Current number of archived clauses : 15
% 0.23/0.55 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.55 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.55 # Non-unit clause-clause subsumptions : 0
% 0.23/0.55 # Unit Clause-clause subsumption calls : 0
% 0.23/0.55 # Rewrite failures with RHS unbound : 0
% 0.23/0.55 # BW rewrite match attempts : 3
% 0.23/0.55 # BW rewrite match successes : 2
% 0.23/0.55 # Condensation attempts : 0
% 0.23/0.55 # Condensation successes : 0
% 0.23/0.55 # Termbank termtop insertions : 1637
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.005 s
% 0.23/0.55 # System time : 0.001 s
% 0.23/0.55 # Total time : 0.006 s
% 0.23/0.55 # Maximum resident set size: 1752 pages
% 0.23/0.55
% 0.23/0.55 # -------------------------------------------------
% 0.23/0.55 # User time : 0.008 s
% 0.23/0.55 # System time : 0.001 s
% 0.23/0.55 # Total time : 0.010 s
% 0.23/0.55 # Maximum resident set size: 1680 pages
% 0.23/0.55 % E---3.1 exiting
% 0.23/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------