%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP703-11 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 : Unsatisfiable 0.15s 5.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 6 RR)
% Number of literals : 19 ( 18 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f10,axiom,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f10) ).
cnf(f12,axiom,
op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f12) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(goal,negated_conjecture,
mult(x2,mult(x3,op_e)) != mult(mult(x2,x3),op_e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(f09,axiom,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).
cnf(c_0_6,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_7,axiom,
mult(X1,mult(op_c,X2)) = mult(mult(X1,op_c),X2),
f10 ).
cnf(c_0_8,axiom,
op_e = mult(mult(rd(op_c,mult(X1,X2)),X2),X1),
f12 ).
cnf(c_0_9,plain,
rd(mult(X1,mult(op_c,X2)),X2) = mult(X1,op_c),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_11,plain,
mult(rd(op_c,mult(X1,X2)),X2) = rd(op_e,X1),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
mult(rd(X1,mult(op_c,X2)),op_c) = rd(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
mult(x2,mult(x3,op_e)) != mult(mult(x2,x3),op_e),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_14,plain,
rd(op_e,op_c) = rd(op_c,op_c),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
mult(x2,mult(x3,op_e)) != mult(mult(x2,x3),op_e),
c_0_13 ).
cnf(c_0_16,plain,
op_e = op_c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_10]) ).
cnf(c_0_17,axiom,
mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
f09 ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP703-11 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n001.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Sun Sep 20 20:39:48 UTC 2026
% 0.15/5.40 % CPUTime :
% 0.15/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 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.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_3 with pid 1371920 completed with status 0
% 0.15/5.46 % Result found by new_bool_3
% 0.15/5.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/5.46 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 1371926 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.47 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/5.47 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.47 % Preprocessing time : 0.001 s
% 0.15/5.47
% 0.15/5.47 % Proof found!
% 0.15/5.47 % SZS status Unsatisfiable
% 0.15/5.47 % SZS output start CNFRefutation
% See solution above
% 0.15/5.47 % Parsed axioms : 14
% 0.15/5.47 % Removed by relevancy pruning/SinE : 6
% 0.15/5.47 % Initial clauses : 8
% 0.15/5.47 % Removed in clause preprocessing : 0
% 0.15/5.47 % Initial clauses in saturation : 8
% 0.15/5.47 % Processed clauses : 17
% 0.15/5.47 % ...of these trivial : 0
% 0.15/5.47 % ...subsumed : 0
% 0.15/5.47 % ...remaining for further processing : 17
% 0.15/5.47 % Other redundant clauses eliminated : 0
% 0.15/5.47 % Clauses deleted for lack of memory : 0
% 0.15/5.47 % Backward-subsumed : 0
% 0.15/5.47 % Backward-rewritten : 4
% 0.15/5.47 % Generated clauses : 123
% 0.15/5.47 % ...of the previous two non-redundant : 104
% 0.15/5.47 % ...aggressively subsumed : 0
% 0.15/5.47 % Contextual simplify-reflections : 0
% 0.15/5.47 % Paramodulations : 123
% 0.15/5.47 % Factorizations : 0
% 0.15/5.47 % NegExts : 0
% 0.15/5.47 % Equation resolutions : 0
% 0.15/5.47 % Disequality decompositions : 0
% 0.15/5.47 % Total rewrite steps : 87
% 0.15/5.47 % ...of those cached : 38
% 0.15/5.47 % Propositional unsat checks : 0
% 0.15/5.47 % Propositional check models : 0
% 0.15/5.47 % Propositional check unsatisfiable : 0
% 0.15/5.47 % Propositional clauses : 0
% 0.15/5.47 % Propositional clauses after purity: 0
% 0.15/5.47 % Propositional unsat core size : 0
% 0.15/5.47 % Propositional preprocessing time : 0.000
% 0.15/5.47 % Propositional encoding time : 0.000
% 0.15/5.47 % Propositional solver time : 0.000
% 0.15/5.47 % Success case prop preproc time : 0.000
% 0.15/5.47 % Success case prop encoding time : 0.000
% 0.15/5.47 % Success case prop solver time : 0.000
% 0.15/5.47 % Current number of processed clauses : 13
% 0.15/5.47 % Positive orientable unit clauses : 13
% 0.15/5.47 % Positive unorientable unit clauses: 0
% 0.15/5.47 % Negative unit clauses : 0
% 0.15/5.47 % Non-unit-clauses : 0
% 0.15/5.47 % Current number of unprocessed clauses: 91
% 0.15/5.47 % ...number of literals in the above : 91
% 0.15/5.47 % Current number of archived formulas : 0
% 0.15/5.47 % Current number of archived clauses : 4
% 0.15/5.47 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.47 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.47 % Non-unit clause-clause subsumptions : 0
% 0.15/5.47 % Unit Clause-clause subsumption calls : 0
% 0.15/5.47 % Rewrite failures with RHS unbound : 0
% 0.15/5.47 % BW rewrite match attempts : 2
% 0.15/5.47 % BW rewrite match successes : 2
% 0.15/5.47 % Condensation attempts : 0
% 0.15/5.47 % Condensation successes : 0
% 0.15/5.47 % Termbank termtop insertions : 1574
% 0.15/5.47 % Search garbage collected termcells : 20
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.004 s
% 0.15/5.47 % System time : 0.002 s
% 0.15/5.47 % Total time : 0.006 s
% 0.15/5.47 % Maximum resident set size: 3636 pages
% 0.15/5.47
% 0.15/5.47 % -------------------------------------------------
% 0.15/5.47 % User time : 0.006 s
% 0.15/5.47 % System time : 0.007 s
% 0.15/5.47 % Total time : 0.013 s
% 0.15/5.47 % Maximum resident set size: 4864 pages
% 0.15/5.47 % E exiting
%------------------------------------------------------------------------------