%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP679-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 : n009.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:40:44 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.58s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 16 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goals,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c07,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c08,axiom,
mult(op_c,X1) = mult(X1,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c_0_5,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_6,axiom,
mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3),
c07 ).
cnf(c_0_7,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_8,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_9,axiom,
mult(op_c,X1) = mult(X1,op_c),
c08 ).
cnf(c_0_10,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
c_0_5 ).
cnf(c_0_11,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
cnf(c_0_12,plain,
ld(op_c,mult(X1,op_c)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
mult(a,mult(op_c,op_c)) != mult(op_c,mult(op_c,a)),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP679-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n009.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sun Sep 20 20:32:42 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 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.26/0.58 % Version: 3.5.1
% 0.26/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.58 % Starting sh5l with 300s (1) cores
% 0.26/0.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10378 completed with status 0
% 0.26/0.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.26/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.58 % No SInE strategy applied
% 0.26/0.58 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.26/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.58 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.26/0.58 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.58 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.58 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 10386 completed with status 0
% 0.26/0.58 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.26/0.58 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.58 % No SInE strategy applied
% 0.26/0.58 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.26/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.58 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.26/0.58 % Preprocessing time : 0.002 s
% 0.26/0.58
% 0.26/0.58 % Proof found!
% 0.26/0.58 % SZS status Unsatisfiable
% 0.26/0.58 % SZS output start CNFRefutation
% See solution above
% 0.26/0.58 % Parsed axioms : 9
% 0.26/0.58 % Removed by relevancy pruning/SinE : 0
% 0.26/0.58 % Initial clauses : 9
% 0.26/0.58 % Removed in clause preprocessing : 0
% 0.26/0.58 % Initial clauses in saturation : 9
% 0.26/0.58 % Processed clauses : 40
% 0.26/0.58 % ...of these trivial : 5
% 0.26/0.58 % ...subsumed : 9
% 0.26/0.58 % ...remaining for further processing : 26
% 0.26/0.58 % Other redundant clauses eliminated : 0
% 0.26/0.58 % Clauses deleted for lack of memory : 0
% 0.26/0.58 % Backward-subsumed : 0
% 0.26/0.58 % Backward-rewritten : 3
% 0.26/0.58 % Generated clauses : 192
% 0.26/0.58 % ...of the previous two non-redundant : 118
% 0.26/0.58 % ...aggressively subsumed : 0
% 0.26/0.58 % Contextual simplify-reflections : 0
% 0.26/0.58 % Paramodulations : 192
% 0.26/0.58 % Factorizations : 0
% 0.26/0.58 % NegExts : 0
% 0.26/0.58 % Equation resolutions : 0
% 0.26/0.58 % Disequality decompositions : 0
% 0.26/0.58 % Total rewrite steps : 169
% 0.26/0.58 % ...of those cached : 79
% 0.26/0.58 % Propositional unsat checks : 0
% 0.26/0.58 % Propositional check models : 0
% 0.26/0.58 % Propositional check unsatisfiable : 0
% 0.26/0.58 % Propositional clauses : 0
% 0.26/0.58 % Propositional clauses after purity: 0
% 0.26/0.58 % Propositional unsat core size : 0
% 0.26/0.58 % Propositional preprocessing time : 0.000
% 0.26/0.58 % Propositional encoding time : 0.000
% 0.26/0.58 % Propositional solver time : 0.000
% 0.26/0.58 % Success case prop preproc time : 0.000
% 0.26/0.58 % Success case prop encoding time : 0.000
% 0.26/0.58 % Success case prop solver time : 0.000
% 0.26/0.58 % Current number of processed clauses : 23
% 0.26/0.58 % Positive orientable unit clauses : 20
% 0.26/0.58 % Positive unorientable unit clauses: 3
% 0.26/0.58 % Negative unit clauses : 0
% 0.26/0.58 % Non-unit-clauses : 0
% 0.26/0.58 % Current number of unprocessed clauses: 87
% 0.26/0.58 % ...number of literals in the above : 87
% 0.26/0.58 % Current number of archived formulas : 0
% 0.26/0.58 % Current number of archived clauses : 3
% 0.26/0.58 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.58 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.58 % Non-unit clause-clause subsumptions : 0
% 0.26/0.58 % Unit Clause-clause subsumption calls : 3
% 0.26/0.58 % Rewrite failures with RHS unbound : 0
% 0.26/0.58 % BW rewrite match attempts : 24
% 0.26/0.58 % BW rewrite match successes : 7
% 0.26/0.58 % Condensation attempts : 0
% 0.26/0.58 % Condensation successes : 0
% 0.26/0.58 % Termbank termtop insertions : 2514
% 0.26/0.58 % Search garbage collected termcells : 2
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.010 s
% 0.26/0.58 % System time : 0.005 s
% 0.26/0.58 % Total time : 0.014 s
% 0.26/0.58 % Maximum resident set size: 3632 pages
% 0.26/0.58
% 0.26/0.58 % -------------------------------------------------
% 0.26/0.58 % User time : 0.049 s
% 0.26/0.58 % System time : 0.018 s
% 0.26/0.58 % Total time : 0.066 s
% 0.26/0.58 % Maximum resident set size: 4608 pages
% 0.26/0.58 % E exiting
%------------------------------------------------------------------------------