%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU361+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:24:51 PM UTC 2026
% Result : Theorem 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 165 ( 11 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 216 ( 82 ~; 76 |; 38 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 42 ( 1 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t44_yellow_0,conjecture,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_yellow_0) ).
fof(t42_yellow_0,axiom,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ( ex_inf_of_relstr_set(X1,the_carrier(X1))
& ex_sup_of_relstr_set(X1,empty_set) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t42_yellow_0) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(t30_yellow_0,axiom,
! [X1] :
( ( rel_str(X1)
& antisymmetric_relstr(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( ( ( ! [X4] :
( element(X4,the_carrier(X1))
=> ( relstr_set_smaller(X1,X3,X4)
=> related(X1,X2,X4) ) )
& relstr_set_smaller(X1,X3,X2) )
=> ( ex_sup_of_relstr_set(X1,X3)
& X2 = join_on_relstr(X1,X3) ) )
& ( ( ex_sup_of_relstr_set(X1,X3)
& X2 = join_on_relstr(X1,X3) )
=> ( ! [X4] :
( element(X4,the_carrier(X1))
=> ( relstr_set_smaller(X1,X3,X4)
=> related(X1,X2,X4) ) )
& relstr_set_smaller(X1,X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_yellow_0) ).
fof(dt_k1_yellow_0,axiom,
! [X1,X2] :
( rel_str(X1)
=> element(join_on_relstr(X1,X2),the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_yellow_0) ).
fof(t6_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_element_smaller(X1,empty_set,X2)
& relstr_set_smaller(X1,empty_set,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_yellow_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(assume_negation,[status(cth)],[t44_yellow_0]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ( ex_inf_of_relstr_set(X1,the_carrier(X1))
& ex_sup_of_relstr_set(X1,empty_set) ) ),
inference(fof_simplification,[status(thm)],[t42_yellow_0]) ).
fof(c_0_9,negated_conjecture,
( ~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0)
& element(esk2_0,the_carrier(esk1_0))
& rel_str(esk1_0)
& lower_bounded_relstr(esk1_0)
& antisymmetric_relstr(esk1_0)
& ~ empty_carrier(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X13] :
( bottom_of_relstr(X13) = join_on_relstr(X13,empty_set)
| ~ rel_str(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])])]) ).
fof(c_0_11,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| ~ related(X7,X8,esk3_3(X7,X8,X11))
| ex_sup_of_relstr_set(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| ~ related(X7,X8,esk3_3(X7,X8,X11))
| X8 = join_on_relstr(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| relstr_set_smaller(X7,X11,esk3_3(X7,X8,X11))
| ex_sup_of_relstr_set(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| relstr_set_smaller(X7,X11,esk3_3(X7,X8,X11))
| X8 = join_on_relstr(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| element(esk3_3(X7,X8,X11),the_carrier(X7))
| ex_sup_of_relstr_set(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ relstr_set_smaller(X7,X11,X8)
| element(esk3_3(X7,X8,X11),the_carrier(X7))
| X8 = join_on_relstr(X7,X11) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ ex_sup_of_relstr_set(X7,X9)
| X8 != join_on_relstr(X7,X9)
| related(X7,X8,X10)
| ~ relstr_set_smaller(X7,X9,X10)
| ~ element(X10,the_carrier(X7)) )
& ( ~ rel_str(X7)
| ~ antisymmetric_relstr(X7)
| ~ element(X8,the_carrier(X7))
| ~ ex_sup_of_relstr_set(X7,X9)
| X8 != join_on_relstr(X7,X9)
| relstr_set_smaller(X7,X9,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_yellow_0])])])])])])]) ).
fof(c_0_12,plain,
! [X15,X16] :
( element(join_on_relstr(X15,X16),the_carrier(X15))
| ~ rel_str(X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_yellow_0])])]) ).
fof(c_0_13,plain,
! [X26] :
( ( ~ rel_str(X26)
| ~ lower_bounded_relstr(X26)
| ~ antisymmetric_relstr(X26)
| empty_carrier(X26)
| ex_inf_of_relstr_set(X26,the_carrier(X26)) )
& ( ~ rel_str(X26)
| ~ lower_bounded_relstr(X26)
| ~ antisymmetric_relstr(X26)
| empty_carrier(X26)
| ex_sup_of_relstr_set(X26,empty_set) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_14,negated_conjecture,
~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ rel_str(X1)
| bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ rel_str(X2)
| ~ antisymmetric_relstr(X2)
| ~ element(X4,the_carrier(X2))
| ~ ex_sup_of_relstr_set(X2,X3)
| X4 != join_on_relstr(X2,X3)
| ~ relstr_set_smaller(X2,X3,X1)
| ~ element(X1,the_carrier(X2))
| related(X2,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ rel_str(X1)
| element(join_on_relstr(X1,X2),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| empty_carrier(X1)
| ex_sup_of_relstr_set(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
lower_bounded_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
antisymmetric_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
~ related(esk1_0,join_on_relstr(esk1_0,empty_set),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_24,plain,
( ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ antisymmetric_relstr(X1)
| ~ ex_sup_of_relstr_set(X1,X2)
| ~ relstr_set_smaller(X1,X2,X3)
| related(X1,join_on_relstr(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_17]),c_0_18]) ).
cnf(c_0_25,negated_conjecture,
ex_sup_of_relstr_set(esk1_0,empty_set),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_16])]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_27,plain,
! [X28,X29] :
( ( ~ rel_str(X28)
| ~ element(X29,the_carrier(X28))
| relstr_element_smaller(X28,empty_set,X29) )
& ( ~ rel_str(X28)
| ~ element(X29,the_carrier(X28))
| relstr_set_smaller(X28,empty_set,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_yellow_0])])])])]) ).
cnf(c_0_28,negated_conjecture,
~ relstr_set_smaller(esk1_0,empty_set,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_21]),c_0_26]),c_0_16])]) ).
cnf(c_0_29,plain,
( ~ rel_str(X1)
| ~ element(X2,the_carrier(X1))
| relstr_set_smaller(X1,empty_set,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU361+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.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:16:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.51 % Version: 3.5.1
% 0.15/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % Starting sh5l with 300s (1) cores
% 0.15/0.51 % sh5l with pid 318576 completed with status 0
% 0.15/0.51 % Result found by sh5l
% 0.15/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % Starting sh5l with 300s (1) cores
% 0.15/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.51 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.15/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.51 % SubtermCWHack with pid 318583 completed with status 0
% 0.15/0.51 % Result found by SubtermCWHack
% 0.15/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % Starting sh5l with 300s (1) cores
% 0.15/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.51 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.51 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.15/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.51 % Preprocessing time : 0.002 s
% 0.15/0.51
% 0.15/0.51 % Proof found!
% 0.15/0.51 % SZS status Theorem
% 0.15/0.51 % SZS output start CNFRefutation
% See solution above
% 0.15/0.51 % Parsed axioms : 28
% 0.15/0.51 % Removed by relevancy pruning/SinE : 4
% 0.15/0.51 % Initial clauses : 40
% 0.15/0.51 % Removed in clause preprocessing : 0
% 0.15/0.51 % Initial clauses in saturation : 40
% 0.15/0.51 % Processed clauses : 60
% 0.15/0.51 % ...of these trivial : 0
% 0.15/0.51 % ...subsumed : 4
% 0.15/0.51 % ...remaining for further processing : 56
% 0.15/0.51 % Other redundant clauses eliminated : 2
% 0.15/0.51 % Clauses deleted for lack of memory : 0
% 0.15/0.51 % Backward-subsumed : 0
% 0.15/0.51 % Backward-rewritten : 1
% 0.15/0.51 % Generated clauses : 27
% 0.15/0.51 % ...of the previous two non-redundant : 24
% 0.15/0.51 % ...aggressively subsumed : 0
% 0.15/0.51 % Contextual simplify-reflections : 2
% 0.15/0.51 % Paramodulations : 25
% 0.15/0.51 % Factorizations : 0
% 0.15/0.51 % NegExts : 0
% 0.15/0.51 % Equation resolutions : 2
% 0.15/0.51 % Disequality decompositions : 0
% 0.15/0.51 % Total rewrite steps : 12
% 0.15/0.51 % ...of those cached : 6
% 0.15/0.51 % Propositional unsat checks : 0
% 0.15/0.51 % Propositional check models : 0
% 0.15/0.51 % Propositional check unsatisfiable : 0
% 0.15/0.51 % Propositional clauses : 0
% 0.15/0.51 % Propositional clauses after purity: 0
% 0.15/0.51 % Propositional unsat core size : 0
% 0.15/0.51 % Propositional preprocessing time : 0.000
% 0.15/0.51 % Propositional encoding time : 0.000
% 0.15/0.51 % Propositional solver time : 0.000
% 0.15/0.51 % Success case prop preproc time : 0.000
% 0.15/0.51 % Success case prop encoding time : 0.000
% 0.15/0.51 % Success case prop solver time : 0.000
% 0.15/0.51 % Current number of processed clauses : 53
% 0.15/0.51 % Positive orientable unit clauses : 12
% 0.15/0.51 % Positive unorientable unit clauses: 0
% 0.15/0.51 % Negative unit clauses : 9
% 0.15/0.51 % Non-unit-clauses : 32
% 0.15/0.51 % Current number of unprocessed clauses: 4
% 0.15/0.51 % ...number of literals in the above : 32
% 0.15/0.51 % Current number of archived formulas : 0
% 0.15/0.51 % Current number of archived clauses : 1
% 0.15/0.51 % Clause-clause subsumption calls (NU) : 219
% 0.15/0.51 % Rec. Clause-clause subsumption calls : 60
% 0.15/0.51 % Non-unit clause-clause subsumptions : 5
% 0.15/0.51 % Unit Clause-clause subsumption calls : 11
% 0.15/0.51 % Rewrite failures with RHS unbound : 0
% 0.15/0.51 % BW rewrite match attempts : 1
% 0.15/0.51 % BW rewrite match successes : 1
% 0.15/0.51 % Condensation attempts : 0
% 0.15/0.51 % Condensation successes : 0
% 0.15/0.51 % Termbank termtop insertions : 2948
% 0.15/0.51 % Search garbage collected termcells : 496
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.014 s
% 0.15/0.51 % System time : 0.004 s
% 0.15/0.51 % Total time : 0.018 s
% 0.15/0.51 % Maximum resident set size: 3652 pages
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.018 s
% 0.15/0.51 % System time : 0.010 s
% 0.15/0.51 % Total time : 0.028 s
% 0.15/0.51 % Maximum resident set size: 4864 pages
% 0.15/0.51 % E exiting
%------------------------------------------------------------------------------