%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU444+4 : TPTP v9.3.1. Released v3.4.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 02:29:29 PM UTC 2026
% Result : Theorem 213.33s 38.86s
% Output : CNFRefutation 213.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 26 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 24 ( 10 ~; 6 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relset_2,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t56_relset_2) ).
fof(t51_relset_2,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2)
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t51_relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
& k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
inference(assume_negation,[status(cth)],[t56_relset_2]) ).
fof(c_0_3,plain,
! [X193,X194,X195] :
( ( ~ m2_relset_1(X195,X194,X193)
| k2_funct_5(X195) = k10_relset_1(X194,X193,X195,X194) )
& ( ~ m2_relset_1(X195,X194,X193)
| k1_funct_5(X195) = k10_relset_1(X193,X194,k6_relset_1(X194,X193,X195),X193) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])])]) ).
fof(c_0_4,negated_conjecture,
( ( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
| k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) )
& m2_relset_1(esk3_0,esk2_0,esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
( ~ m2_relset_1(X1,X2,X3)
| k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
| k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0) = k2_funct_5(esk3_0),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( ~ m2_relset_1(X1,X3,X2)
| k1_funct_5(X1) = k10_relset_1(X2,X3,k6_relset_1(X3,X2,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU444+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n006.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 06:33:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 213.33/38.86 % Version: 3.5.1
% 213.33/38.86 % Preprocessing class: FMLLMLLLSSSNFFN.
% 213.33/38.86 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 213.33/38.86 % Starting new_bool_3 with 882s (3) cores
% 213.33/38.86 % Starting new_bool_1 with 882s (3) cores
% 213.33/38.86 % Starting sh5l with 294s (1) cores
% 213.33/38.86 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 294s (1) cores
% 213.33/38.86 % new_bool_1 with pid 2226595 completed with status 0
% 213.33/38.86 % Result found by new_bool_1
% 213.33/38.86 % Preprocessing class: FMLLMLLLSSSNFFN.
% 213.33/38.86 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 213.33/38.86 % Starting new_bool_3 with 882s (3) cores
% 213.33/38.86 % Starting new_bool_1 with 882s (3) cores
% 213.33/38.86 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 213.33/38.86 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 213.33/38.86 % Search class: FGHSM-SMLM32-DFFFFFNN
% 213.33/38.86 % Scheduled 13 strats onto 3 cores with 880 seconds (880 total)
% 213.33/38.86 % Starting SubtermCWHack with 80s (1) cores
% 213.33/38.86 % Starting new_bool_1 with 89s (1) cores
% 213.33/38.86 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 66s (1) cores
% 213.33/38.86 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 2226601 completed with status 0
% 213.33/38.86 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 213.33/38.86 % Preprocessing class: FMLLMLLLSSSNFFN.
% 213.33/38.86 % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 213.33/38.86 % Starting new_bool_3 with 882s (3) cores
% 213.33/38.86 % Starting new_bool_1 with 882s (3) cores
% 213.33/38.86 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 213.33/38.86 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 213.33/38.86 % Search class: FGHSM-SMLM32-DFFFFFNN
% 213.33/38.86 % Scheduled 13 strats onto 3 cores with 880 seconds (880 total)
% 213.33/38.86 % Starting SubtermCWHack with 80s (1) cores
% 213.33/38.86 % Starting new_bool_1 with 89s (1) cores
% 213.33/38.86 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 66s (1) cores
% 213.33/38.86 % Preprocessing time : 0.689 s
% 213.33/38.86
% 213.33/38.86 % Proof found!
% 213.33/38.86 % SZS status Theorem
% 213.33/38.86 % SZS output start CNFRefutation
% See solution above
% 213.33/38.86 % Parsed axioms : 71138
% 213.33/38.86 % Removed by relevancy pruning/SinE : 65528
% 213.33/38.86 % Initial clauses : 13379
% 213.33/38.86 % Removed in clause preprocessing : 290
% 213.33/38.86 % Initial clauses in saturation : 13089
% 213.33/38.86 % Processed clauses : 13093
% 213.33/38.86 % ...of these trivial : 209
% 213.33/38.86 % ...subsumed : 961
% 213.33/38.86 % ...remaining for further processing : 11922
% 213.33/38.86 % Other redundant clauses eliminated : 2013
% 213.33/38.86 % Clauses deleted for lack of memory : 0
% 213.33/38.86 % Backward-subsumed : 13
% 213.33/38.86 % Backward-rewritten : 77
% 213.33/38.86 % Generated clauses : 173659
% 213.33/38.86 % ...of the previous two non-redundant : 168988
% 213.33/38.86 % ...aggressively subsumed : 0
% 213.33/38.86 % Contextual simplify-reflections : 658
% 213.33/38.86 % Paramodulations : 171575
% 213.33/38.86 % Factorizations : 42
% 213.33/38.86 % NegExts : 0
% 213.33/38.86 % Equation resolutions : 2242
% 213.33/38.86 % Disequality decompositions : 0
% 213.33/38.86 % Total rewrite steps : 49875
% 213.33/38.86 % ...of those cached : 47036
% 213.33/38.86 % Propositional unsat checks : 0
% 213.33/38.86 % Propositional check models : 0
% 213.33/38.86 % Propositional check unsatisfiable : 0
% 213.33/38.86 % Propositional clauses : 0
% 213.33/38.86 % Propositional clauses after purity: 0
% 213.33/38.86 % Propositional unsat core size : 0
% 213.33/38.86 % Propositional preprocessing time : 0.000
% 213.33/38.86 % Propositional encoding time : 0.000
% 213.33/38.86 % Propositional solver time : 0.000
% 213.33/38.86 % Success case prop preproc time : 0.000
% 213.33/38.86 % Success case prop encoding time : 0.000
% 213.33/38.86 % Success case prop solver time : 0.000
% 213.33/38.86 % Current number of processed clauses : 10909
% 213.33/38.86 % Positive orientable unit clauses : 1114
% 213.33/38.86 % Positive unorientable unit clauses: 6
% 213.33/38.86 % Negative unit clauses : 152
% 213.33/38.86 % Non-unit-clauses : 9637
% 213.33/38.86 % Current number of unprocessed clauses: 168984
% 213.33/38.86 % ...number of literals in the above : 759296
% 213.33/38.86 % Current number of archived formulas : 0
% 213.33/38.86 % Current number of archived clauses : 90
% 213.33/38.86 % Clause-clause subsumption calls (NU) : 74293933
% 213.33/38.86 % Rec. Clause-clause subsumption calls : 3173916
% 213.33/38.86 % Non-unit clause-clause subsumptions : 1599
% 213.33/38.86 % Unit Clause-clause subsumption calls : 322505
% 213.33/38.86 % Rewrite failures with RHS unbound : 0
% 213.33/38.86 % BW rewrite match attempts : 536
% 213.33/38.86 % BW rewrite match successes : 100
% 213.33/38.86 % Condensation attempts : 0
% 213.33/38.86 % Condensation successes : 0
% 213.33/38.86 % Termbank termtop insertions : 7502312
% 213.33/38.86 % Search garbage collected termcells : 979293
% 213.33/38.86
% 213.33/38.86 % -------------------------------------------------
% 213.33/38.86 % User time : 30.726 s
% 213.33/38.86 % System time : 0.601 s
% 213.33/38.86 % Total time : 31.327 s
% 213.33/38.86 % Maximum resident set size: 162668 pages
% 213.33/38.86
% 213.33/38.86 % -------------------------------------------------
% 213.33/38.86 % User time : 93.963 s
% 213.33/38.86 % System time : 2.067 s
% 213.33/38.86 % Total time : 96.030 s
% 213.33/38.86 % Maximum resident set size: 121600 pages
% 213.33/38.86 % E exiting
%------------------------------------------------------------------------------