%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU444+3 : 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 : 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 02:25:13 PM UTC 2026
% Result : Theorem 92.18s 13.98s
% Output : CNFRefutation 92.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 3 unt; 0 def)
% Number of atoms : 25 ( 15 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,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])])])]) ).
fof(c_0_4,plain,
! [X46,X47,X48] :
( ( ~ m2_relset_1(X48,X47,X46)
| k2_funct_5(X48) = k10_relset_1(X47,X46,X48,X47) )
& ( ~ m2_relset_1(X48,X47,X46)
| k1_funct_5(X48) = k10_relset_1(X46,X47,k6_relset_1(X47,X46,X48),X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])])]) ).
cnf(c_0_5,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_3]) ).
cnf(c_0_6,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_4]) ).
cnf(c_0_7,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,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)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).
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_4]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU444+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 06:31:08 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 92.18/13.98 % Version: 3.5.1
% 92.18/13.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 92.18/13.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.18/13.98 % Starting new_bool_3 with 900s (3) cores
% 92.18/13.98 % Starting new_bool_1 with 900s (3) cores
% 92.18/13.98 % Starting sh5l with 300s (1) cores
% 92.18/13.98 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 92.18/13.98 % new_bool_1 with pid 432743 completed with status 0
% 92.18/13.98 % Result found by new_bool_1
% 92.18/13.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 92.18/13.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.18/13.98 % Starting new_bool_3 with 900s (3) cores
% 92.18/13.98 % Starting new_bool_1 with 900s (3) cores
% 92.18/13.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 92.18/13.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 92.18/13.98 % Search class: FGHSM-SMLM32-MFFFFFNN
% 92.18/13.98 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 92.18/13.98 % Starting SubtermCWHack with 82s (1) cores
% 92.18/13.98 % Starting new_bool_1 with 91s (1) cores
% 92.18/13.98 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 92.18/13.98 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 433024 completed with status 0
% 92.18/13.98 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 92.18/13.98 % Preprocessing class: FMLLMMLLSSSNFFN.
% 92.18/13.98 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 92.18/13.98 % Starting new_bool_3 with 900s (3) cores
% 92.18/13.98 % Starting new_bool_1 with 900s (3) cores
% 92.18/13.98 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 92.18/13.98 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 92.18/13.98 % Search class: FGHSM-SMLM32-MFFFFFNN
% 92.18/13.98 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 92.18/13.98 % Starting SubtermCWHack with 82s (1) cores
% 92.18/13.98 % Starting new_bool_1 with 91s (1) cores
% 92.18/13.98 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 92.18/13.98 % Preprocessing time : 0.173 s
% 92.18/13.98 % Presaturation interreduction done
% 92.18/13.98
% 92.18/13.98 % Proof found!
% 92.18/13.98 % SZS status Theorem
% 92.18/13.98 % SZS output start CNFRefutation
% See solution above
% 92.18/13.98 % Parsed axioms : 19127
% 92.18/13.98 % Removed by relevancy pruning/SinE : 16396
% 92.18/13.98 % Initial clauses : 6748
% 92.18/13.98 % Removed in clause preprocessing : 177
% 92.18/13.98 % Initial clauses in saturation : 6571
% 92.18/13.98 % Processed clauses : 25724
% 92.18/13.98 % ...of these trivial : 335
% 92.18/13.98 % ...subsumed : 13090
% 92.18/13.98 % ...remaining for further processing : 12299
% 92.18/13.98 % Other redundant clauses eliminated : 711
% 92.18/13.98 % Clauses deleted for lack of memory : 0
% 92.18/13.98 % Backward-subsumed : 231
% 92.18/13.98 % Backward-rewritten : 182
% 92.18/13.98 % Generated clauses : 105121
% 92.18/13.98 % ...of the previous two non-redundant : 75242
% 92.18/13.98 % ...aggressively subsumed : 0
% 92.18/13.98 % Contextual simplify-reflections : 451
% 92.18/13.98 % Paramodulations : 104438
% 92.18/13.98 % Factorizations : 1
% 92.18/13.98 % NegExts : 0
% 92.18/13.98 % Equation resolutions : 719
% 92.18/13.98 % Disequality decompositions : 0
% 92.18/13.98 % Total rewrite steps : 68076
% 92.18/13.98 % ...of those cached : 65884
% 92.18/13.98 % Propositional unsat checks : 3
% 92.18/13.98 % Propositional check models : 2
% 92.18/13.98 % Propositional check unsatisfiable : 0
% 92.18/13.98 % Propositional clauses : 0
% 92.18/13.98 % Propositional clauses after purity: 0
% 92.18/13.98 % Propositional unsat core size : 0
% 92.18/13.98 % Propositional preprocessing time : 0.000
% 92.18/13.98 % Propositional encoding time : 0.143
% 92.18/13.98 % Propositional solver time : 0.083
% 92.18/13.98 % Success case prop preproc time : 0.000
% 92.18/13.98 % Success case prop encoding time : 0.000
% 92.18/13.98 % Success case prop solver time : 0.000
% 92.18/13.98 % Current number of processed clauses : 5526
% 92.18/13.98 % Positive orientable unit clauses : 917
% 92.18/13.98 % Positive unorientable unit clauses: 4
% 92.18/13.98 % Negative unit clauses : 953
% 92.18/13.98 % Non-unit-clauses : 3652
% 92.18/13.98 % Current number of unprocessed clauses: 61065
% 92.18/13.98 % ...number of literals in the above : 180264
% 92.18/13.98 % Current number of archived formulas : 0
% 92.18/13.98 % Current number of archived clauses : 6307
% 92.18/13.98 % Clause-clause subsumption calls (NU) : 29887475
% 92.18/13.98 % Rec. Clause-clause subsumption calls : 3174546
% 92.18/13.98 % Non-unit clause-clause subsumptions : 6235
% 92.18/13.98 % Unit Clause-clause subsumption calls : 680061
% 92.18/13.98 % Rewrite failures with RHS unbound : 12
% 92.18/13.98 % BW rewrite match attempts : 626
% 92.18/13.98 % BW rewrite match successes : 392
% 92.18/13.98 % Condensation attempts : 0
% 92.18/13.98 % Condensation successes : 0
% 92.18/13.98 % Termbank termtop insertions : 2547383
% 92.18/13.98 % Search garbage collected termcells : 281734
% 92.18/13.98
% 92.18/13.98 % -------------------------------------------------
% 92.18/13.98 % User time : 12.141 s
% 92.18/13.98 % System time : 0.253 s
% 92.18/13.98 % Total time : 12.394 s
% 92.18/13.98 % Maximum resident set size: 54656 pages
% 92.18/13.98
% 92.18/13.98 % -------------------------------------------------
% 92.18/13.98 % User time : 35.863 s
% 92.18/13.98 % System time : 0.700 s
% 92.18/13.98 % Total time : 36.563 s
% 92.18/13.98 % Maximum resident set size: 33024 pages
% 92.18/13.98 % E exiting
%------------------------------------------------------------------------------