%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP656-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 : n020.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:40:37 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.64s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 19 ( 18 equ; 4 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; 0 con; 1-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
cnf(f05,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(f03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(goal,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_5,axiom,
rd(mult(X1,X2),X2) = X1,
f04 ).
cnf(c_0_6,axiom,
mult(mult(X1,X2),mult(X3,X1)) = mult(mult(X1,mult(X2,X3)),X1),
f05 ).
cnf(c_0_7,plain,
rd(mult(mult(X1,X2),mult(X3,X1)),X1) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
mult(rd(X1,X2),X2) = X1,
f03 ).
cnf(c_0_9,plain,
rd(mult(mult(X1,X2),X3),X1) = mult(X1,mult(X2,rd(X3,X1))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
ld(X1,mult(X1,X2)) = X2,
f02 ).
cnf(c_0_11,plain,
mult(X1,mult(X2,rd(X1,X1))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_13,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1)) != tuple(x1(X1),x1_2(X1)),
c_0_12 ).
cnf(c_0_15,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
tuple(mult(rd(X1,X1),x1(rd(X1,X1))),x1_2(rd(X1,X1))) != tuple(x1(rd(X1,X1)),x1_2(rd(X1,X1))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_17,plain,
mult(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP656-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n020.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 20 20:30:17 UTC 2026
% 0.19/0.48 % CPUTime :
% 0.19/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.57 Running first-order theorem proving
% 0.25/0.57 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.25/0.64 % Version: 3.5.1
% 0.25/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.64 % Starting sh5l with 300s (1) cores
% 0.25/0.64 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1176809 completed with status 0
% 0.25/0.64 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.64 % No SInE strategy applied
% 0.25/0.64 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.25/0.64 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/0.64 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.25/0.64 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.25/0.64 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.25/0.64 % U----_043_B31_F1_PI_AE_CS_SP_S2S with pid 1176820 completed with status 0
% 0.25/0.64 % Result found by U----_043_B31_F1_PI_AE_CS_SP_S2S
% 0.25/0.64 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.64 % No SInE strategy applied
% 0.25/0.64 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.25/0.64 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.64 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/0.64 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.25/0.64 % Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 0.25/0.64 % Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 0.25/0.64 % Preprocessing time : 0.002 s
% 0.25/0.64
% 0.25/0.64 % Proof found!
% 0.25/0.64 % SZS status Unsatisfiable
% 0.25/0.64 % SZS output start CNFRefutation
% See solution above
% 0.25/0.64 % Parsed axioms : 6
% 0.25/0.64 % Removed by relevancy pruning/SinE : 0
% 0.25/0.64 % Initial clauses : 6
% 0.25/0.64 % Removed in clause preprocessing : 0
% 0.25/0.64 % Initial clauses in saturation : 6
% 0.25/0.64 % Processed clauses : 18
% 0.25/0.64 % ...of these trivial : 1
% 0.25/0.64 % ...subsumed : 0
% 0.25/0.64 % ...remaining for further processing : 17
% 0.25/0.64 % Other redundant clauses eliminated : 0
% 0.25/0.64 % Clauses deleted for lack of memory : 0
% 0.25/0.64 % Backward-subsumed : 0
% 0.25/0.64 % Backward-rewritten : 2
% 0.25/0.64 % Generated clauses : 106
% 0.25/0.64 % ...of the previous two non-redundant : 85
% 0.25/0.64 % ...aggressively subsumed : 0
% 0.25/0.64 % Contextual simplify-reflections : 0
% 0.25/0.64 % Paramodulations : 106
% 0.25/0.64 % Factorizations : 0
% 0.25/0.64 % NegExts : 0
% 0.25/0.64 % Equation resolutions : 0
% 0.25/0.64 % Disequality decompositions : 0
% 0.25/0.64 % Total rewrite steps : 47
% 0.25/0.64 % ...of those cached : 16
% 0.25/0.64 % Propositional unsat checks : 0
% 0.25/0.64 % Propositional check models : 0
% 0.25/0.64 % Propositional check unsatisfiable : 0
% 0.25/0.64 % Propositional clauses : 0
% 0.25/0.64 % Propositional clauses after purity: 0
% 0.25/0.64 % Propositional unsat core size : 0
% 0.25/0.64 % Propositional preprocessing time : 0.000
% 0.25/0.64 % Propositional encoding time : 0.000
% 0.25/0.64 % Propositional solver time : 0.000
% 0.25/0.64 % Success case prop preproc time : 0.000
% 0.25/0.64 % Success case prop encoding time : 0.000
% 0.25/0.64 % Success case prop solver time : 0.000
% 0.25/0.64 % Current number of processed clauses : 15
% 0.25/0.64 % Positive orientable unit clauses : 12
% 0.25/0.64 % Positive unorientable unit clauses: 1
% 0.25/0.64 % Negative unit clauses : 2
% 0.25/0.64 % Non-unit-clauses : 0
% 0.25/0.64 % Current number of unprocessed clauses: 72
% 0.25/0.64 % ...number of literals in the above : 72
% 0.25/0.64 % Current number of archived formulas : 0
% 0.25/0.64 % Current number of archived clauses : 2
% 0.25/0.64 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.64 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.64 % Non-unit clause-clause subsumptions : 0
% 0.25/0.64 % Unit Clause-clause subsumption calls : 3
% 0.25/0.64 % Rewrite failures with RHS unbound : 5
% 0.25/0.64 % BW rewrite match attempts : 14
% 0.25/0.64 % BW rewrite match successes : 3
% 0.25/0.64 % Condensation attempts : 0
% 0.25/0.64 % Condensation successes : 0
% 0.25/0.64 % Termbank termtop insertions : 1372
% 0.25/0.64 % Search garbage collected termcells : 2
% 0.25/0.64
% 0.25/0.64 % -------------------------------------------------
% 0.25/0.64 % User time : 0.006 s
% 0.25/0.64 % System time : 0.006 s
% 0.25/0.64 % Total time : 0.013 s
% 0.25/0.64 % Maximum resident set size: 3376 pages
% 0.25/0.64
% 0.25/0.64 % -------------------------------------------------
% 0.25/0.64 % User time : 0.033 s
% 0.25/0.64 % System time : 0.023 s
% 0.25/0.64 % Total time : 0.056 s
% 0.25/0.64 % Maximum resident set size: 4608 pages
% 0.25/0.64 % E exiting
%------------------------------------------------------------------------------