%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP698-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:57 PM UTC 2026
% Result : Unsatisfiable 0.57s 0.50s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c07,axiom,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(c_0_5,axiom,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
c07 ).
cnf(c_0_6,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_7,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_8,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
cnf(c_0_9,plain,
rd(mult(X1,mult(mult(X2,X1),X1)),X1) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_11,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(mult(X1,rd(X2,X1)),X1),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_13,plain,
mult(mult(X1,rd(rd(X2,X1),X1)),X1) = rd(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
mult(a,mult(b,c)) != mult(rd(mult(a,b),a),mult(a,c)),
c_0_12 ).
cnf(c_0_15,plain,
mult(rd(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_10]),c_0_10]) ).
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.03 % Problem : GRP698-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 20:29:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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/benchmark/theBenchmark.p
% 0.57/0.50 % Version: 3.5.1
% 0.57/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.57/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.57/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.57/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.57/0.50 % Starting sh5l with 300s (1) cores
% 0.57/0.50 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 588410 completed with status 0
% 0.57/0.50 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.57/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.57/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.57/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.50 % No SInE strategy applied
% 0.57/0.50 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.57/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.57/0.50 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.57/0.50 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.50 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.50 % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 588421 completed with status 0
% 0.57/0.50 % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.57/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.57/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.57/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.57/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.57/0.50 % No SInE strategy applied
% 0.57/0.50 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.57/0.50 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.57/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.57/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.57/0.50 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.57/0.50 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.50 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.57/0.50 % Preprocessing time : 0.001 s
% 0.57/0.50 % Presaturation interreduction done
% 0.57/0.50
% 0.57/0.50 % Proof found!
% 0.57/0.50 % SZS status Unsatisfiable
% 0.57/0.50 % SZS output start CNFRefutation
% See solution above
% 0.57/0.50 % Parsed axioms : 9
% 0.57/0.50 % Removed by relevancy pruning/SinE : 0
% 0.57/0.50 % Initial clauses : 9
% 0.57/0.50 % Removed in clause preprocessing : 0
% 0.57/0.50 % Initial clauses in saturation : 9
% 0.57/0.50 % Processed clauses : 227
% 0.57/0.50 % ...of these trivial : 67
% 0.57/0.50 % ...subsumed : 0
% 0.57/0.50 % ...remaining for further processing : 160
% 0.57/0.50 % Other redundant clauses eliminated : 0
% 0.57/0.50 % Clauses deleted for lack of memory : 0
% 0.57/0.50 % Backward-subsumed : 0
% 0.57/0.50 % Backward-rewritten : 56
% 0.57/0.50 % Generated clauses : 4879
% 0.57/0.50 % ...of the previous two non-redundant : 3166
% 0.57/0.50 % ...aggressively subsumed : 0
% 0.57/0.50 % Contextual simplify-reflections : 0
% 0.57/0.50 % Paramodulations : 4879
% 0.57/0.50 % Factorizations : 0
% 0.57/0.50 % NegExts : 0
% 0.57/0.50 % Equation resolutions : 0
% 0.57/0.50 % Disequality decompositions : 0
% 0.57/0.50 % Total rewrite steps : 12266
% 0.57/0.50 % ...of those cached : 11593
% 0.57/0.50 % Propositional unsat checks : 0
% 0.57/0.50 % Propositional check models : 0
% 0.57/0.50 % Propositional check unsatisfiable : 0
% 0.57/0.50 % Propositional clauses : 0
% 0.57/0.50 % Propositional clauses after purity: 0
% 0.57/0.50 % Propositional unsat core size : 0
% 0.57/0.50 % Propositional preprocessing time : 0.000
% 0.57/0.50 % Propositional encoding time : 0.000
% 0.57/0.50 % Propositional solver time : 0.000
% 0.57/0.50 % Success case prop preproc time : 0.000
% 0.57/0.50 % Success case prop encoding time : 0.000
% 0.57/0.50 % Success case prop solver time : 0.000
% 0.57/0.50 % Current number of processed clauses : 95
% 0.57/0.50 % Positive orientable unit clauses : 95
% 0.57/0.50 % Positive unorientable unit clauses: 0
% 0.57/0.50 % Negative unit clauses : 0
% 0.57/0.50 % Non-unit-clauses : 0
% 0.57/0.50 % Current number of unprocessed clauses: 2915
% 0.57/0.50 % ...number of literals in the above : 2915
% 0.57/0.50 % Current number of archived formulas : 0
% 0.57/0.50 % Current number of archived clauses : 65
% 0.57/0.50 % Clause-clause subsumption calls (NU) : 0
% 0.57/0.50 % Rec. Clause-clause subsumption calls : 0
% 0.57/0.50 % Non-unit clause-clause subsumptions : 0
% 0.57/0.50 % Unit Clause-clause subsumption calls : 0
% 0.57/0.50 % Rewrite failures with RHS unbound : 0
% 0.57/0.50 % BW rewrite match attempts : 146
% 0.57/0.50 % BW rewrite match successes : 49
% 0.57/0.50 % Condensation attempts : 0
% 0.57/0.50 % Condensation successes : 0
% 0.57/0.50 % Termbank termtop insertions : 73751
% 0.57/0.50 % Search garbage collected termcells : 2
% 0.57/0.50
% 0.57/0.50 % -------------------------------------------------
% 0.57/0.50 % User time : 0.063 s
% 0.57/0.50 % System time : 0.006 s
% 0.57/0.50 % Total time : 0.069 s
% 0.57/0.50 % Maximum resident set size: 3636 pages
% 0.57/0.50
% 0.57/0.50 % -------------------------------------------------
% 0.57/0.50 % User time : 0.294 s
% 0.57/0.50 % System time : 0.030 s
% 0.57/0.50 % Total time : 0.324 s
% 0.57/0.50 % Maximum resident set size: 4608 pages
% 0.57/0.50 % E exiting
%------------------------------------------------------------------------------