%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP710-10 : 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 : n007.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:01 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 25 equ; 3 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 : 38 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f03,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f05,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f02,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f04,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(goal,negated_conjecture,
mult(x0,X1) != x1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_6,axiom,
mult(X1,unit) = X1,
f01 ).
cnf(c_0_7,axiom,
mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3),
f03 ).
cnf(c_0_8,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_9,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
mult(i(X1),X1) = unit,
f05 ).
cnf(c_0_11,axiom,
mult(unit,X1) = X1,
f02 ).
cnf(c_0_12,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,axiom,
mult(X1,i(X1)) = unit,
f04 ).
cnf(c_0_14,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
mult(i(mult(X1,X1)),X1) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_6]) ).
cnf(c_0_16,plain,
i(mult(i(X1),i(X1))) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_10]),c_0_6]) ).
cnf(c_0_17,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_11]) ).
cnf(c_0_18,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_19,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_13]),c_0_6]) ).
cnf(c_0_20,plain,
mult(X1,mult(i(X1),mult(X1,X2))) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_18]),c_0_19]) ).
cnf(c_0_21,negated_conjecture,
mult(x0,X1) != x1,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_22,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_12]) ).
cnf(c_0_23,negated_conjecture,
mult(x0,X1) != x1,
c_0_21 ).
cnf(c_0_24,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP710-10 : 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/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 20:32:20 UTC 2026
% 0.15/0.37 % CPUTime :
% 0.15/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.43 % Version: 3.5.1
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 % Starting sh5l with 300s (1) cores
% 0.15/0.43 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3541944 completed with status 0
% 0.15/0.43 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.43 % No SInE strategy applied
% 0.15/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.43 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.43 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.15/0.43 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.15/0.43 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.15/0.43 % SubtermCWHack with pid 3541948 completed with status 0
% 0.15/0.43 % Result found by SubtermCWHack
% 0.15/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.43 % No SInE strategy applied
% 0.15/0.43 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.43 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.43 % Preprocessing time : 0.001 s
% 0.15/0.43
% 0.15/0.43 % Proof found!
% 0.15/0.43 % SZS status Unsatisfiable
% 0.15/0.43 % SZS output start CNFRefutation
% See solution above
% 0.15/0.43 % Parsed axioms : 6
% 0.15/0.43 % Removed by relevancy pruning/SinE : 0
% 0.15/0.43 % Initial clauses : 6
% 0.15/0.43 % Removed in clause preprocessing : 0
% 0.15/0.43 % Initial clauses in saturation : 6
% 0.15/0.43 % Processed clauses : 35
% 0.15/0.43 % ...of these trivial : 3
% 0.15/0.43 % ...subsumed : 4
% 0.15/0.43 % ...remaining for further processing : 28
% 0.15/0.43 % Other redundant clauses eliminated : 1
% 0.15/0.43 % Clauses deleted for lack of memory : 0
% 0.15/0.43 % Backward-subsumed : 0
% 0.15/0.43 % Backward-rewritten : 7
% 0.15/0.43 % Generated clauses : 288
% 0.15/0.43 % ...of the previous two non-redundant : 160
% 0.15/0.43 % ...aggressively subsumed : 0
% 0.15/0.43 % Contextual simplify-reflections : 0
% 0.15/0.43 % Paramodulations : 287
% 0.15/0.43 % Factorizations : 0
% 0.15/0.43 % NegExts : 0
% 0.15/0.43 % Equation resolutions : 1
% 0.15/0.43 % Disequality decompositions : 0
% 0.15/0.43 % Total rewrite steps : 491
% 0.15/0.43 % ...of those cached : 397
% 0.15/0.43 % Propositional unsat checks : 0
% 0.15/0.43 % Propositional check models : 0
% 0.15/0.43 % Propositional check unsatisfiable : 0
% 0.15/0.43 % Propositional clauses : 0
% 0.15/0.43 % Propositional clauses after purity: 0
% 0.15/0.43 % Propositional unsat core size : 0
% 0.15/0.43 % Propositional preprocessing time : 0.000
% 0.15/0.43 % Propositional encoding time : 0.000
% 0.15/0.43 % Propositional solver time : 0.000
% 0.15/0.43 % Success case prop preproc time : 0.000
% 0.15/0.43 % Success case prop encoding time : 0.000
% 0.15/0.43 % Success case prop solver time : 0.000
% 0.15/0.43 % Current number of processed clauses : 21
% 0.15/0.43 % Positive orientable unit clauses : 17
% 0.15/0.43 % Positive unorientable unit clauses: 0
% 0.15/0.43 % Negative unit clauses : 4
% 0.15/0.43 % Non-unit-clauses : 0
% 0.15/0.43 % Current number of unprocessed clauses: 117
% 0.15/0.43 % ...number of literals in the above : 117
% 0.15/0.43 % Current number of archived formulas : 0
% 0.15/0.43 % Current number of archived clauses : 7
% 0.15/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.43 % Non-unit clause-clause subsumptions : 0
% 0.15/0.43 % Unit Clause-clause subsumption calls : 5
% 0.15/0.43 % Rewrite failures with RHS unbound : 0
% 0.15/0.43 % BW rewrite match attempts : 16
% 0.15/0.43 % BW rewrite match successes : 6
% 0.15/0.43 % Condensation attempts : 0
% 0.15/0.43 % Condensation successes : 0
% 0.15/0.43 % Termbank termtop insertions : 3039
% 0.15/0.43 % Search garbage collected termcells : 2
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.005 s
% 0.15/0.43 % System time : 0.003 s
% 0.15/0.43 % Total time : 0.008 s
% 0.15/0.43 % Maximum resident set size: 3632 pages
% 0.15/0.43
% 0.15/0.43 % -------------------------------------------------
% 0.15/0.43 % User time : 0.025 s
% 0.15/0.43 % System time : 0.011 s
% 0.15/0.43 % Total time : 0.036 s
% 0.15/0.43 % Maximum resident set size: 4864 pages
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------