%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP702+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:44:58 PM UTC 2026
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 18 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 5 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 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 : 31 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f11,axiom,
! [X2] : op_d = ld(X2,mult(op_c,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
fof(f02,axiom,
! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
fof(f10,axiom,
! [X1,X2] : mult(X2,mult(op_c,X1)) = mult(mult(X2,op_c),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).
fof(f09,axiom,
! [X1,X2] : mult(X2,mult(X1,op_c)) = mult(mult(X2,X1),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
fof(f08,axiom,
! [X1,X2] : mult(op_c,mult(X2,X1)) = mult(mult(op_c,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).
fof(c_0_6,negated_conjecture,
~ ! [X4,X5] :
( mult(X4,mult(op_d,X5)) = mult(mult(X4,op_d),X5)
& mult(X4,mult(X5,op_d)) = mult(mult(X4,X5),op_d)
& mult(op_d,mult(X4,X5)) = mult(mult(op_d,X4),X5) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X25] : op_d = ld(X25,mult(op_c,X25)),
inference(variable_rename,[status(thm)],[f11]) ).
fof(c_0_8,plain,
! [X8,X9] : ld(X9,mult(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[f02]) ).
fof(c_0_9,negated_conjecture,
( mult(esk1_0,mult(op_d,esk2_0)) != mult(mult(esk1_0,op_d),esk2_0)
| mult(esk1_0,mult(esk2_0,op_d)) != mult(mult(esk1_0,esk2_0),op_d)
| mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,plain,
op_d = ld(X1,mult(op_c,X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
ld(X1,mult(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X23,X24] : mult(X24,mult(op_c,X23)) = mult(mult(X24,op_c),X23),
inference(variable_rename,[status(thm)],[f10]) ).
cnf(c_0_13,negated_conjecture,
( mult(esk1_0,mult(op_d,esk2_0)) != mult(mult(esk1_0,op_d),esk2_0)
| mult(esk1_0,mult(esk2_0,op_d)) != mult(mult(esk1_0,esk2_0),op_d)
| mult(op_d,mult(esk1_0,esk2_0)) != mult(mult(op_d,esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
op_d = op_c,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X21,X22] : mult(X22,mult(X21,op_c)) = mult(mult(X22,X21),op_c),
inference(variable_rename,[status(thm)],[f09]) ).
cnf(c_0_17,negated_conjecture,
( mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c))
| mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0)) ),
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)],[c_0_13,c_0_14]),c_0_14]),c_0_14]),c_0_15]),c_0_14]),c_0_14]),c_0_14])]) ).
cnf(c_0_18,plain,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X19,X20] : mult(op_c,mult(X20,X19)) = mult(mult(op_c,X20),X19),
inference(variable_rename,[status(thm)],[f08]) ).
cnf(c_0_20,negated_conjecture,
mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
mult(op_c,mult(X1,X2)) = mult(mult(op_c,X1),X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP702+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n026.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 20 20:37:06 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 % Version: 3.5.1
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.48 % Starting sh5l with 300s (1) cores
% 0.20/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 552361 completed with status 0
% 0.20/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.48 % No SInE strategy applied
% 0.20/0.48 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.20/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.48 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.20/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.20/0.48 % new_bool_3 with pid 552368 completed with status 0
% 0.20/0.48 % Result found by new_bool_3
% 0.20/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.48 % No SInE strategy applied
% 0.20/0.48 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.20/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.48 % Starting H----_102_C18_F1_PI_AE_Q4_CS_SP_PS_S5PRR_S2S with 136s (1) cores
% 0.20/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.20/0.48 % Preprocessing time : 0.001 s
% 0.20/0.48 % Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 % Proof found!
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start CNFRefutation
% See solution above
% 0.20/0.48 % Parsed axioms : 14
% 0.20/0.48 % Removed by relevancy pruning/SinE : 0
% 0.20/0.48 % Initial clauses : 14
% 0.20/0.48 % Removed in clause preprocessing : 0
% 0.20/0.48 % Initial clauses in saturation : 14
% 0.20/0.48 % Processed clauses : 31
% 0.20/0.48 % ...of these trivial : 1
% 0.20/0.48 % ...subsumed : 0
% 0.20/0.48 % ...remaining for further processing : 30
% 0.20/0.48 % Other redundant clauses eliminated : 0
% 0.20/0.48 % Clauses deleted for lack of memory : 0
% 0.20/0.48 % Backward-subsumed : 0
% 0.20/0.48 % Backward-rewritten : 4
% 0.20/0.48 % Generated clauses : 39
% 0.20/0.48 % ...of the previous two non-redundant : 26
% 0.20/0.48 % ...aggressively subsumed : 0
% 0.20/0.48 % Contextual simplify-reflections : 0
% 0.20/0.48 % Paramodulations : 39
% 0.20/0.48 % Factorizations : 0
% 0.20/0.48 % NegExts : 0
% 0.20/0.48 % Equation resolutions : 0
% 0.20/0.48 % Disequality decompositions : 0
% 0.20/0.48 % Total rewrite steps : 24
% 0.20/0.48 % ...of those cached : 7
% 0.20/0.48 % Propositional unsat checks : 0
% 0.20/0.48 % Propositional check models : 0
% 0.20/0.48 % Propositional check unsatisfiable : 0
% 0.20/0.48 % Propositional clauses : 0
% 0.20/0.48 % Propositional clauses after purity: 0
% 0.20/0.48 % Propositional unsat core size : 0
% 0.20/0.48 % Propositional preprocessing time : 0.000
% 0.20/0.48 % Propositional encoding time : 0.000
% 0.20/0.48 % Propositional solver time : 0.000
% 0.20/0.48 % Success case prop preproc time : 0.000
% 0.20/0.48 % Success case prop encoding time : 0.000
% 0.20/0.48 % Success case prop solver time : 0.000
% 0.20/0.48 % Current number of processed clauses : 12
% 0.20/0.48 % Positive orientable unit clauses : 12
% 0.20/0.48 % Positive unorientable unit clauses: 0
% 0.20/0.48 % Negative unit clauses : 0
% 0.20/0.48 % Non-unit-clauses : 0
% 0.20/0.48 % Current number of unprocessed clauses: 21
% 0.20/0.48 % ...number of literals in the above : 21
% 0.20/0.48 % Current number of archived formulas : 0
% 0.20/0.48 % Current number of archived clauses : 18
% 0.20/0.48 % Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 % Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 % Non-unit clause-clause subsumptions : 0
% 0.20/0.48 % Unit Clause-clause subsumption calls : 0
% 0.20/0.48 % Rewrite failures with RHS unbound : 0
% 0.20/0.48 % BW rewrite match attempts : 8
% 0.20/0.48 % BW rewrite match successes : 3
% 0.20/0.48 % Condensation attempts : 0
% 0.20/0.48 % Condensation successes : 0
% 0.20/0.48 % Termbank termtop insertions : 1097
% 0.20/0.48 % Search garbage collected termcells : 43
% 0.20/0.48
% 0.20/0.48 % -------------------------------------------------
% 0.20/0.48 % User time : 0.005 s
% 0.20/0.48 % System time : 0.002 s
% 0.20/0.48 % Total time : 0.007 s
% 0.20/0.48 % Maximum resident set size: 3644 pages
% 0.20/0.48
% 0.20/0.48 % -------------------------------------------------
% 0.20/0.48 % User time : 0.017 s
% 0.20/0.48 % System time : 0.012 s
% 0.20/0.48 % Total time : 0.029 s
% 0.20/0.48 % Maximum resident set size: 4864 pages
% 0.20/0.48 % E exiting
%------------------------------------------------------------------------------