%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU362+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:07 PM UTC 2026
% Result : Theorem 26.10s 4.38s
% Output : CNFRefutation 26.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 19 unt; 0 def)
% Number of atoms : 126 ( 8 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 135 ( 47 ~; 44 |; 19 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d13_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( rel_str(X2)
=> ( subrelstr(X2,X1)
<=> ( subset(the_InternalRel(X2),the_InternalRel(X1))
& subset(the_carrier(X2),the_carrier(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d13_yellow_0) ).
fof(dt_m1_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m1_yellow_0) ).
fof(t60_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( related(X2,X5,X6)
& X6 = X4
& X5 = X3 )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_yellow_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d9_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( related(X1,X2,X3)
<=> in(ordered_pair(X2,X3),the_InternalRel(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_orders_2) ).
fof(c_0_5,plain,
! [X34,X35] :
( ( ~ rel_str(X34)
| ~ rel_str(X35)
| subrelstr(X35,X34)
| ~ subset(the_InternalRel(X35),the_InternalRel(X34))
| ~ subset(the_carrier(X35),the_carrier(X34)) )
& ( ~ rel_str(X34)
| ~ rel_str(X35)
| ~ subrelstr(X35,X34)
| subset(the_InternalRel(X35),the_InternalRel(X34)) )
& ( ~ rel_str(X34)
| ~ rel_str(X35)
| ~ subrelstr(X35,X34)
| subset(the_carrier(X35),the_carrier(X34)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d13_yellow_0])])])])]) ).
fof(c_0_6,plain,
! [X36,X37] :
( rel_str(X37)
| ~ subrelstr(X37,X36)
| ~ rel_str(X36) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( subrelstr(X2,X1)
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( related(X2,X5,X6)
& X6 = X4
& X5 = X3 )
=> related(X1,X3,X4) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t60_yellow_0]) ).
cnf(c_0_8,plain,
( ~ rel_str(X2)
| ~ rel_str(X1)
| ~ subrelstr(X1,X2)
| subset(the_InternalRel(X1),the_InternalRel(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ subrelstr(X2,X1)
| ~ rel_str(X1)
| rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
( ~ related(esk1_0,esk3_0,esk4_0)
& related(esk2_0,esk5_0,esk6_0)
& esk6_0 = esk4_0
& esk5_0 = esk3_0
& element(esk6_0,the_carrier(esk2_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk4_0,the_carrier(esk1_0))
& element(esk3_0,the_carrier(esk1_0))
& subrelstr(esk2_0,esk1_0)
& rel_str(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_11,plain,
! [X78,X79,X80,X81,X82] :
( ( subset(X81,X82)
| ~ in(esk16_2(X81,X82),X82) )
& ( subset(X81,X82)
| in(esk16_2(X81,X82),X81) )
& ( in(X80,X79)
| ~ in(X80,X78)
| ~ subset(X78,X79) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_12,plain,
( ~ rel_str(X2)
| ~ subrelstr(X1,X2)
| subset(the_InternalRel(X1),the_InternalRel(X2)) ),
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
subrelstr(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_15,plain,
! [X91,X92,X93] :
( ( ~ rel_str(X91)
| ~ element(X92,the_carrier(X91))
| ~ element(X93,the_carrier(X91))
| related(X91,X92,X93)
| ~ in(ordered_pair(X92,X93),the_InternalRel(X91)) )
& ( ~ rel_str(X91)
| ~ element(X92,the_carrier(X91))
| ~ element(X93,the_carrier(X91))
| in(ordered_pair(X92,X93),the_InternalRel(X91))
| ~ related(X91,X92,X93) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_orders_2])])])])]) ).
cnf(c_0_16,negated_conjecture,
related(esk2_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
esk5_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
element(esk5_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
element(esk4_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
esk6_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
subset(the_InternalRel(esk2_0),the_InternalRel(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_23,plain,
( ~ rel_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ related(X1,X2,X3)
| in(ordered_pair(X2,X3),the_InternalRel(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
related(esk2_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
element(esk6_0,the_carrier(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
element(esk3_0,the_carrier(esk2_0)),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_27,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_14])]) ).
cnf(c_0_28,plain,
( ~ rel_str(X3)
| ~ element(X1,the_carrier(X3))
| ~ element(X2,the_carrier(X3))
| ~ in(ordered_pair(X1,X2),the_InternalRel(X3))
| related(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,negated_conjecture,
element(esk6_0,the_carrier(esk1_0)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( ~ in(X1,the_InternalRel(esk2_0))
| in(X1,the_InternalRel(esk1_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk2_0)),
inference(cn,[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_26]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
~ related(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_33,negated_conjecture,
( ~ in(ordered_pair(X1,esk6_0),the_InternalRel(esk1_0))
| ~ element(X1,the_carrier(esk1_0))
| related(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14])]) ).
cnf(c_0_34,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
in(ordered_pair(esk3_0,esk6_0),the_InternalRel(esk1_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
~ related(esk1_0,esk3_0,esk6_0),
inference(rw,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU362+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.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:20:07 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
% 26.10/4.38 % Version: 3.5.1
% 26.10/4.38 % Preprocessing class: FSLMSMSSSSSNFFN.
% 26.10/4.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.10/4.38 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 26.10/4.38 % Starting new_bool_3 with 600s (2) cores
% 26.10/4.38 % Starting new_bool_1 with 600s (2) cores
% 26.10/4.38 % Starting sh5l with 300s (1) cores
% 26.10/4.38 % new_bool_1 with pid 1739429 completed with status 0
% 26.10/4.38 % Result found by new_bool_1
% 26.10/4.38 % Preprocessing class: FSLMSMSSSSSNFFN.
% 26.10/4.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.10/4.38 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 26.10/4.38 % Starting new_bool_3 with 600s (2) cores
% 26.10/4.38 % Starting new_bool_1 with 600s (2) cores
% 26.10/4.38 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 26.10/4.38 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 26.10/4.38 % Search class: FGHSM-FMLM32-MFFFFFNN
% 26.10/4.38 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 26.10/4.38 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 26.10/4.38 % Starting SubtermCWHack with 55s (1) cores
% 26.10/4.38 % Starting new_bool_1 with 61s (1) cores
% 26.10/4.38 % new_bool_1 with pid 1739441 completed with status 0
% 26.10/4.38 % Result found by new_bool_1
% 26.10/4.38 % Preprocessing class: FSLMSMSSSSSNFFN.
% 26.10/4.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.10/4.38 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 26.10/4.38 % Starting new_bool_3 with 600s (2) cores
% 26.10/4.38 % Starting new_bool_1 with 600s (2) cores
% 26.10/4.38 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 26.10/4.38 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 26.10/4.38 % Search class: FGHSM-FMLM32-MFFFFFNN
% 26.10/4.38 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 26.10/4.38 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 26.10/4.38 % Starting SubtermCWHack with 55s (1) cores
% 26.10/4.38 % Starting new_bool_1 with 61s (1) cores
% 26.10/4.38 % Preprocessing time : 0.023 s
% 26.10/4.38 % Presaturation interreduction done
% 26.10/4.38
% 26.10/4.38 % Proof found!
% 26.10/4.38 % SZS status Theorem
% 26.10/4.38 % SZS output start CNFRefutation
% See solution above
% 26.10/4.38 % Parsed axioms : 691
% 26.10/4.38 % Removed by relevancy pruning/SinE : 559
% 26.10/4.38 % Initial clauses : 985
% 26.10/4.38 % Removed in clause preprocessing : 9
% 26.10/4.38 % Initial clauses in saturation : 976
% 26.10/4.38 % Processed clauses : 15095
% 26.10/4.38 % ...of these trivial : 37
% 26.10/4.38 % ...subsumed : 10551
% 26.10/4.38 % ...remaining for further processing : 4507
% 26.10/4.38 % Other redundant clauses eliminated : 1130
% 26.10/4.38 % Clauses deleted for lack of memory : 0
% 26.10/4.38 % Backward-subsumed : 521
% 26.10/4.38 % Backward-rewritten : 444
% 26.10/4.38 % Generated clauses : 101692
% 26.10/4.38 % ...of the previous two non-redundant : 97874
% 26.10/4.38 % ...aggressively subsumed : 0
% 26.10/4.38 % Contextual simplify-reflections : 305
% 26.10/4.38 % Paramodulations : 100676
% 26.10/4.38 % Factorizations : 4
% 26.10/4.38 % NegExts : 0
% 26.10/4.38 % Equation resolutions : 1134
% 26.10/4.38 % Disequality decompositions : 0
% 26.10/4.38 % Total rewrite steps : 6661
% 26.10/4.38 % ...of those cached : 6345
% 26.10/4.38 % Propositional unsat checks : 0
% 26.10/4.38 % Propositional check models : 0
% 26.10/4.38 % Propositional check unsatisfiable : 0
% 26.10/4.38 % Propositional clauses : 0
% 26.10/4.38 % Propositional clauses after purity: 0
% 26.10/4.38 % Propositional unsat core size : 0
% 26.10/4.38 % Propositional preprocessing time : 0.000
% 26.10/4.38 % Propositional encoding time : 0.000
% 26.10/4.38 % Propositional solver time : 0.000
% 26.10/4.38 % Success case prop preproc time : 0.000
% 26.10/4.38 % Success case prop encoding time : 0.000
% 26.10/4.38 % Success case prop solver time : 0.000
% 26.10/4.38 % Current number of processed clauses : 2297
% 26.10/4.38 % Positive orientable unit clauses : 223
% 26.10/4.38 % Positive unorientable unit clauses: 0
% 26.10/4.38 % Negative unit clauses : 277
% 26.10/4.38 % Non-unit-clauses : 1797
% 26.10/4.38 % Current number of unprocessed clauses: 83704
% 26.10/4.38 % ...number of literals in the above : 444499
% 26.10/4.38 % Current number of archived formulas : 0
% 26.10/4.38 % Current number of archived clauses : 1880
% 26.10/4.38 % Clause-clause subsumption calls (NU) : 1519098
% 26.10/4.38 % Rec. Clause-clause subsumption calls : 451085
% 26.10/4.38 % Non-unit clause-clause subsumptions : 8072
% 26.10/4.38 % Unit Clause-clause subsumption calls : 72890
% 26.10/4.38 % Rewrite failures with RHS unbound : 0
% 26.10/4.38 % BW rewrite match attempts : 116
% 26.10/4.38 % BW rewrite match successes : 51
% 26.10/4.38 % Condensation attempts : 0
% 26.10/4.38 % Condensation successes : 0
% 26.10/4.38 % Termbank termtop insertions : 2072389
% 26.10/4.38 % Search garbage collected termcells : 15623
% 26.10/4.38
% 26.10/4.38 % -------------------------------------------------
% 26.10/4.38 % User time : 3.726 s
% 26.10/4.38 % System time : 0.081 s
% 26.10/4.38 % Total time : 3.807 s
% 26.10/4.38 % Maximum resident set size: 6384 pages
% 26.10/4.38
% 26.10/4.38 % -------------------------------------------------
% 26.10/4.38 % User time : 7.451 s
% 26.10/4.38 % System time : 0.208 s
% 26.10/4.38 % Total time : 7.659 s
% 26.10/4.38 % Maximum resident set size: 5632 pages
% 26.10/4.38 % E exiting
%------------------------------------------------------------------------------