%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ALG173+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 11:55:16 AM UTC 2026
% Result : Theorem 0.14s 5.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 227 ( 219 equ)
% Maximal formula atoms : 50 ( 15 avg)
% Number of connectives : 328 ( 116 ~; 17 |; 194 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 11 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
~ ( op(e4,op(e4,e4)) = e4
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e0)) = e0
& op(e3,op(e3,e4)) = e4
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e0)) = e0
& op(e2,op(e2,e4)) = e4
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e0)) = e0
& op(e1,op(e1,e4)) = e4
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e0)) = e0
& op(e0,op(e0,e4)) = e4
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e0)) = e0
& ( ( op(e4,e4) != e4
& op(e4,e3) != e3
& op(e4,e2) != e2
& op(e4,e1) != e1
& op(e4,e0) != e0 )
| ( op(e3,e4) != e4
& op(e3,e3) != e3
& op(e3,e2) != e2
& op(e3,e1) != e1
& op(e3,e0) != e0 )
| ( op(e2,e4) != e4
& op(e2,e3) != e3
& op(e2,e2) != e2
& op(e2,e1) != e1
& op(e2,e0) != e0 )
| ( op(e1,e4) != e4
& op(e1,e3) != e3
& op(e1,e2) != e2
& op(e1,e1) != e1
& op(e1,e0) != e0 )
| ( op(e0,e4) != e4
& op(e0,e3) != e3
& op(e0,e2) != e2
& op(e0,e1) != e1
& op(e0,e0) != e0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax5,axiom,
( e3 != e4
& e2 != e4
& e2 != e3
& e1 != e4
& e1 != e3
& e1 != e2
& e0 != e4
& e0 != e3
& e0 != e2
& e0 != e1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(ax6,axiom,
( e4 = op(e3,op(e3,e3))
& e2 = op(e3,e3)
& e1 = op(e3,op(e3,op(e3,e3)))
& e0 = op(op(e3,op(e3,e3)),op(e3,op(e3,e3))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).
fof(c_0_3,negated_conjecture,
~ ~ ( op(e4,op(e4,e4)) = e4
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e0)) = e0
& op(e3,op(e3,e4)) = e4
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e0)) = e0
& op(e2,op(e2,e4)) = e4
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e0)) = e0
& op(e1,op(e1,e4)) = e4
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e0)) = e0
& op(e0,op(e0,e4)) = e4
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e0)) = e0
& ( ( op(e4,e4) != e4
& op(e4,e3) != e3
& op(e4,e2) != e2
& op(e4,e1) != e1
& op(e4,e0) != e0 )
| ( op(e3,e4) != e4
& op(e3,e3) != e3
& op(e3,e2) != e2
& op(e3,e1) != e1
& op(e3,e0) != e0 )
| ( op(e2,e4) != e4
& op(e2,e3) != e3
& op(e2,e2) != e2
& op(e2,e1) != e1
& op(e2,e0) != e0 )
| ( op(e1,e4) != e4
& op(e1,e3) != e3
& op(e1,e2) != e2
& op(e1,e1) != e1
& op(e1,e0) != e0 )
| ( op(e0,e4) != e4
& op(e0,e3) != e3
& op(e0,e2) != e2
& op(e0,e1) != e1
& op(e0,e0) != e0 ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,plain,
( epred2_0
<=> ( ( op(e3,e4) != e4
& op(e3,e3) != e3
& op(e3,e2) != e2
& op(e3,e1) != e1
& op(e3,e0) != e0 )
| ( op(e2,e4) != e4
& op(e2,e3) != e3
& op(e2,e2) != e2
& op(e2,e1) != e1
& op(e2,e0) != e0 )
| ( op(e1,e4) != e4
& op(e1,e3) != e3
& op(e1,e2) != e2
& op(e1,e1) != e1
& op(e1,e0) != e0 )
| ( op(e0,e4) != e4
& op(e0,e3) != e3
& op(e0,e2) != e2
& op(e0,e1) != e1
& op(e0,e0) != e0 ) ) ),
introduced(definition) ).
fof(c_0_5,negated_conjecture,
~ ~ ( op(e4,op(e4,e4)) = e4
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e0)) = e0
& op(e3,op(e3,e4)) = e4
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e0)) = e0
& op(e2,op(e2,e4)) = e4
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e0)) = e0
& op(e1,op(e1,e4)) = e4
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e0)) = e0
& op(e0,op(e0,e4)) = e4
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e0)) = e0
& ( ( op(e4,e4) != e4
& op(e4,e3) != e3
& op(e4,e2) != e2
& op(e4,e1) != e1
& op(e4,e0) != e0 )
| epred2_0 ) ),
inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3]),c_0_4]) ).
fof(c_0_6,plain,
( e3 != e4
& e2 != e4
& e2 != e3
& e1 != e4
& e1 != e3
& e1 != e2
& e0 != e4
& e0 != e3
& e0 != e2
& e0 != e1 ),
inference(fof_simplification,[status(thm)],[ax5]) ).
fof(c_0_7,negated_conjecture,
( op(e4,op(e4,e4)) = e4
& op(e4,op(e4,e3)) = e3
& op(e4,op(e4,e2)) = e2
& op(e4,op(e4,e1)) = e1
& op(e4,op(e4,e0)) = e0
& op(e3,op(e3,e4)) = e4
& op(e3,op(e3,e3)) = e3
& op(e3,op(e3,e2)) = e2
& op(e3,op(e3,e1)) = e1
& op(e3,op(e3,e0)) = e0
& op(e2,op(e2,e4)) = e4
& op(e2,op(e2,e3)) = e3
& op(e2,op(e2,e2)) = e2
& op(e2,op(e2,e1)) = e1
& op(e2,op(e2,e0)) = e0
& op(e1,op(e1,e4)) = e4
& op(e1,op(e1,e3)) = e3
& op(e1,op(e1,e2)) = e2
& op(e1,op(e1,e1)) = e1
& op(e1,op(e1,e0)) = e0
& op(e0,op(e0,e4)) = e4
& op(e0,op(e0,e3)) = e3
& op(e0,op(e0,e2)) = e2
& op(e0,op(e0,e1)) = e1
& op(e0,op(e0,e0)) = e0
& ( epred2_0
| op(e4,e4) != e4 )
& ( epred2_0
| op(e4,e3) != e3 )
& ( epred2_0
| op(e4,e2) != e2 )
& ( epred2_0
| op(e4,e1) != e1 )
& ( epred2_0
| op(e4,e0) != e0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_8,plain,
e4 = op(e3,op(e3,e3)),
inference(split_conjunct,[status(thm)],[ax6]) ).
cnf(c_0_9,plain,
e2 = op(e3,e3),
inference(split_conjunct,[status(thm)],[ax6]) ).
fof(c_0_10,plain,
( e3 != e4
& e2 != e4
& e2 != e3
& e1 != e4
& e1 != e3
& e1 != e2
& e0 != e4
& e0 != e3
& e0 != e2
& e0 != e1 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
op(e3,op(e3,e3)) = e3,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
op(e3,e2) = e4,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
e3 != e4,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG173+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.41 % Computer : n014.cluster.edu
% 0.14/5.41 % Model : x86_64 x86_64
% 0.14/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.41 % Memory : 8046.5625MB
% 0.14/5.41 % OS : Linux 6.8.0-71-generic
% 0.14/5.41 % CPULimit : 300
% 0.14/5.41 % WCLimit : 300
% 0.14/5.41 % DateTime : Mon Sep 21 13:00:41 UTC 2026
% 0.14/5.41 % CPUTime :
% 0.14/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.46 Running first-order theorem proving
% 0.14/5.46 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.14/5.49 % Version: 3.5.1
% 0.14/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.49 % Starting sh5l with 300s (1) cores
% 0.14/5.49 % new_bool_3 with pid 4122176 completed with status 0
% 0.14/5.49 % Result found by new_bool_3
% 0.14/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.49 % Search class: FGHSF-FSLM22-MFFFFFNN
% 0.14/5.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.49 % SubtermCWHack with pid 4122183 completed with status 0
% 0.14/5.49 % Result found by SubtermCWHack
% 0.14/5.49 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/5.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.49 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/5.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/5.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/5.49 % Search class: FGHSF-FSLM22-MFFFFFNN
% 0.14/5.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/5.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/5.49 % Preprocessing time : 0.003 s
% 0.14/5.49
% 0.14/5.49 % Proof found!
% 0.14/5.49 % SZS status Theorem
% 0.14/5.49 % SZS output start CNFRefutation
% See solution above
% 0.14/5.49 % Parsed axioms : 7
% 0.14/5.49 % Removed by relevancy pruning/SinE : 0
% 0.14/5.49 % Initial clauses : 294
% 0.14/5.49 % Removed in clause preprocessing : 0
% 0.14/5.49 % Initial clauses in saturation : 294
% 0.14/5.49 % Processed clauses : 36
% 0.14/5.49 % ...of these trivial : 0
% 0.14/5.49 % ...subsumed : 0
% 0.14/5.49 % ...remaining for further processing : 35
% 0.14/5.49 % Other redundant clauses eliminated : 0
% 0.14/5.49 % Clauses deleted for lack of memory : 0
% 0.14/5.49 % Backward-subsumed : 0
% 0.14/5.49 % Backward-rewritten : 0
% 0.14/5.49 % Generated clauses : 0
% 0.14/5.49 % ...of the previous two non-redundant : 0
% 0.14/5.49 % ...aggressively subsumed : 0
% 0.14/5.49 % Contextual simplify-reflections : 0
% 0.14/5.49 % Paramodulations : 0
% 0.14/5.49 % Factorizations : 0
% 0.14/5.49 % NegExts : 0
% 0.14/5.49 % Equation resolutions : 0
% 0.14/5.49 % Disequality decompositions : 0
% 0.14/5.49 % Total rewrite steps : 4
% 0.14/5.49 % ...of those cached : 2
% 0.14/5.49 % Propositional unsat checks : 0
% 0.14/5.49 % Propositional check models : 0
% 0.14/5.49 % Propositional check unsatisfiable : 0
% 0.14/5.49 % Propositional clauses : 0
% 0.14/5.49 % Propositional clauses after purity: 0
% 0.14/5.49 % Propositional unsat core size : 0
% 0.14/5.49 % Propositional preprocessing time : 0.000
% 0.14/5.49 % Propositional encoding time : 0.000
% 0.14/5.49 % Propositional solver time : 0.000
% 0.14/5.49 % Success case prop preproc time : 0.000
% 0.14/5.49 % Success case prop encoding time : 0.000
% 0.14/5.49 % Success case prop solver time : 0.000
% 0.14/5.49 % Current number of processed clauses : 35
% 0.14/5.49 % Positive orientable unit clauses : 20
% 0.14/5.49 % Positive unorientable unit clauses: 0
% 0.14/5.49 % Negative unit clauses : 10
% 0.14/5.49 % Non-unit-clauses : 5
% 0.14/5.49 % Current number of unprocessed clauses: 258
% 0.14/5.49 % ...number of literals in the above : 683
% 0.14/5.49 % Current number of archived formulas : 0
% 0.14/5.49 % Current number of archived clauses : 0
% 0.14/5.49 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.49 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.49 % Non-unit clause-clause subsumptions : 0
% 0.14/5.49 % Unit Clause-clause subsumption calls : 0
% 0.14/5.49 % Rewrite failures with RHS unbound : 0
% 0.14/5.49 % BW rewrite match attempts : 0
% 0.14/5.49 % BW rewrite match successes : 0
% 0.14/5.49 % Condensation attempts : 0
% 0.14/5.49 % Condensation successes : 0
% 0.14/5.49 % Termbank termtop insertions : 17237
% 0.14/5.49 % Search garbage collected termcells : 1041
% 0.14/5.49
% 0.14/5.49 % -------------------------------------------------
% 0.14/5.49 % User time : 0.010 s
% 0.14/5.49 % System time : 0.002 s
% 0.14/5.49 % Total time : 0.012 s
% 0.14/5.49 % Maximum resident set size: 4000 pages
% 0.14/5.49
% 0.14/5.49 % -------------------------------------------------
% 0.14/5.49 % User time : 0.015 s
% 0.14/5.49 % System time : 0.006 s
% 0.14/5.49 % Total time : 0.021 s
% 0.14/5.49 % Maximum resident set size: 4864 pages
% 0.14/5.49 % E exiting
%------------------------------------------------------------------------------