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