%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP730-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 : n010.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:41:03 PM UTC 2026
% Result : Unsatisfiable 2.35s 1.01s
% Output : CNFRefutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 5 RR)
% Number of literals : 33 ( 32 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 60 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c06,axiom,
mult(i(X1),mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c04,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c02,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c05,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c10,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c10) ).
cnf(c11,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c11) ).
cnf(c01,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c03,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c21,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c21) ).
cnf(goals,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(i(X1),mult(X1,X2)) = X2,
c06 ).
cnf(c_0_11,axiom,
mult(i(X1),X1) = unit,
c04 ).
cnf(c_0_12,axiom,
mult(X1,unit) = X1,
c02 ).
cnf(c_0_13,axiom,
i(mult(X1,X2)) = mult(i(X1),i(X2)),
c05 ).
cnf(c_0_14,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,mult(X2,X3)),asoc(X1,X2,X3)),
c10 ).
cnf(c_0_16,plain,
mult(X1,i(mult(X1,X2))) = i(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_13]),c_0_14]) ).
cnf(c_0_17,axiom,
mult(X1,X2) = mult(mult(X2,X1),op_k(X1,X2)),
c11 ).
cnf(c_0_18,axiom,
mult(unit,X1) = X1,
c01 ).
cnf(c_0_19,axiom,
mult(X1,i(X1)) = unit,
c03 ).
cnf(c_0_20,plain,
mult(i(mult(X1,mult(X2,X3))),mult(mult(X1,X2),X3)) = asoc(X1,X2,X3),
inference(spm,[status(thm)],[c_0_10,c_0_15]) ).
cnf(c_0_21,plain,
mult(mult(X1,X2),i(mult(X2,X1))) = i(op_k(X2,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
i(unit) = unit,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
mult(i(mult(X1,X2)),mult(X2,X1)) = op_k(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_24,axiom,
asoc(asoc(X1,X2,X3),X4,X5) = unit,
c21 ).
cnf(c_0_25,plain,
asoc(X1,X2,i(mult(X2,X1))) = i(op_k(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16]),c_0_19]),c_0_22]),c_0_18]) ).
cnf(c_0_26,plain,
i(op_k(i(X1),i(X2))) = op_k(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_13]),c_0_14]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_28,plain,
asoc(i(op_k(X1,X2)),X3,X4) = unit,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
op_k(i(X1),i(X2)) = i(op_k(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
asoc(op_k(a,b),c,d) != unit,
c_0_27 ).
cnf(c_0_31,plain,
asoc(op_k(X1,X2),X3,X4) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP730-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.49 % Computer : n010.cluster.edu
% 0.18/0.49 % Model : x86_64 x86_64
% 0.18/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.49 % Memory : 8046.5625MB
% 0.18/0.49 % OS : Linux 6.8.0-71-generic
% 0.18/0.49 % CPULimit : 300
% 0.18/0.49 % WCLimit : 300
% 0.18/0.49 % DateTime : Sun Sep 20 20:36:24 UTC 2026
% 0.18/0.50 % CPUTime :
% 0.18/0.50 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.59 Running first-order theorem proving
% 0.23/0.59 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
% 2.35/1.01 % Version: 3.5.1
% 2.35/1.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.35/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.35/1.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.35/1.01 % Starting new_bool_3 with 300s (1) cores
% 2.35/1.01 % Starting new_bool_1 with 300s (1) cores
% 2.35/1.01 % Starting sh5l with 300s (1) cores
% 2.35/1.01 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3477563 completed with status 0
% 2.35/1.01 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.35/1.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.35/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.35/1.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.35/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.35/1.01 % No SInE strategy applied
% 2.35/1.01 % Search class: FUUPM-FFMF32-DFFFFFNN
% 2.35/1.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.35/1.01 % Starting SubtermCWHack with 136s (1) cores
% 2.35/1.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.35/1.01 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 226s (1) cores
% 2.35/1.01 % Starting new_bool_3 with 226s (1) cores
% 2.35/1.01 % Starting new_bool_1 with 226s (1) cores
% 2.35/1.01 % SubtermCWHack with pid 3477567 completed with status 0
% 2.35/1.01 % Result found by SubtermCWHack
% 2.35/1.01 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.35/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.35/1.01 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.35/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.35/1.01 % No SInE strategy applied
% 2.35/1.01 % Search class: FUUPM-FFMF32-DFFFFFNN
% 2.35/1.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.35/1.01 % Starting SubtermCWHack with 136s (1) cores
% 2.35/1.01 % Preprocessing time : 0.002 s
% 2.35/1.01
% 2.35/1.01 % Proof found!
% 2.35/1.01 % SZS status Unsatisfiable
% 2.35/1.01 % SZS output start CNFRefutation
% See solution above
% 2.35/1.01 % Parsed axioms : 23
% 2.35/1.01 % Removed by relevancy pruning/SinE : 0
% 2.35/1.01 % Initial clauses : 23
% 2.35/1.01 % Removed in clause preprocessing : 3
% 2.35/1.01 % Initial clauses in saturation : 20
% 2.35/1.01 % Processed clauses : 478
% 2.35/1.01 % ...of these trivial : 211
% 2.35/1.01 % ...subsumed : 73
% 2.35/1.01 % ...remaining for further processing : 194
% 2.35/1.01 % Other redundant clauses eliminated : 0
% 2.35/1.01 % Clauses deleted for lack of memory : 0
% 2.35/1.01 % Backward-subsumed : 0
% 2.35/1.01 % Backward-rewritten : 36
% 2.35/1.01 % Generated clauses : 15240
% 2.35/1.01 % ...of the previous two non-redundant : 10923
% 2.35/1.01 % ...aggressively subsumed : 0
% 2.35/1.01 % Contextual simplify-reflections : 0
% 2.35/1.01 % Paramodulations : 15240
% 2.35/1.01 % Factorizations : 0
% 2.35/1.01 % NegExts : 0
% 2.35/1.01 % Equation resolutions : 0
% 2.35/1.01 % Disequality decompositions : 0
% 2.35/1.01 % Total rewrite steps : 24629
% 2.35/1.01 % ...of those cached : 21181
% 2.35/1.01 % Propositional unsat checks : 0
% 2.35/1.01 % Propositional check models : 0
% 2.35/1.01 % Propositional check unsatisfiable : 0
% 2.35/1.01 % Propositional clauses : 0
% 2.35/1.01 % Propositional clauses after purity: 0
% 2.35/1.01 % Propositional unsat core size : 0
% 2.35/1.01 % Propositional preprocessing time : 0.000
% 2.35/1.01 % Propositional encoding time : 0.000
% 2.35/1.01 % Propositional solver time : 0.000
% 2.35/1.01 % Success case prop preproc time : 0.000
% 2.35/1.01 % Success case prop encoding time : 0.000
% 2.35/1.01 % Success case prop solver time : 0.000
% 2.35/1.01 % Current number of processed clauses : 158
% 2.35/1.01 % Positive orientable unit clauses : 151
% 2.35/1.01 % Positive unorientable unit clauses: 7
% 2.35/1.01 % Negative unit clauses : 0
% 2.35/1.01 % Non-unit-clauses : 0
% 2.35/1.01 % Current number of unprocessed clauses: 10306
% 2.35/1.01 % ...number of literals in the above : 10306
% 2.35/1.01 % Current number of archived formulas : 0
% 2.35/1.01 % Current number of archived clauses : 39
% 2.35/1.01 % Clause-clause subsumption calls (NU) : 0
% 2.35/1.01 % Rec. Clause-clause subsumption calls : 0
% 2.35/1.01 % Non-unit clause-clause subsumptions : 0
% 2.35/1.01 % Unit Clause-clause subsumption calls : 3
% 2.35/1.01 % Rewrite failures with RHS unbound : 0
% 2.35/1.01 % BW rewrite match attempts : 298
% 2.35/1.01 % BW rewrite match successes : 42
% 2.35/1.01 % Condensation attempts : 0
% 2.35/1.01 % Condensation successes : 0
% 2.35/1.01 % Termbank termtop insertions : 257799
% 2.35/1.01 % Search garbage collected termcells : 2
% 2.35/1.01
% 2.35/1.01 % -------------------------------------------------
% 2.35/1.01 % User time : 0.345 s
% 2.35/1.01 % System time : 0.024 s
% 2.35/1.01 % Total time : 0.369 s
% 2.35/1.01 % Maximum resident set size: 3592 pages
% 2.35/1.01
% 2.35/1.01 % -------------------------------------------------
% 2.35/1.01 % User time : 1.622 s
% 2.35/1.01 % System time : 0.118 s
% 2.35/1.01 % Total time : 1.739 s
% 2.35/1.01 % Maximum resident set size: 4864 pages
% 2.35/1.01 % E exiting
%------------------------------------------------------------------------------