%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU262+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 : n020.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:29 PM UTC 2026
% Result : Theorem 2.17s 0.80s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 5 unt; 0 def)
% Number of atoms : 142 ( 12 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 161 ( 64 ~; 68 |; 15 &)
% ( 7 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-3 aty)
% Number of variables : 112 ( 10 sgn 58 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_relset_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t12_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_rng(X3),X2)
& subset(relation_dom(X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X2,X4)
& in(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(c_0_8,plain,
! [X15,X16] :
( ( element(X15,powerset(X16))
| ~ subset(X15,X16) )
& ( subset(X15,X16)
| ~ element(X15,powerset(X16)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_9,plain,
! [X37,X38,X39] :
( element(X39,powerset(cartesian_product2(X37,X38)))
| ~ relation_of2_as_subset(X39,X37,X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
fof(c_0_10,plain,
! [X8,X9,X10,X11,X12] :
( ( subset(X11,X12)
| ~ in(esk4_2(X11,X12),X12) )
& ( subset(X11,X12)
| in(esk4_2(X11,X12),X11) )
& ( in(X10,X9)
| ~ in(X10,X8)
| ~ subset(X8,X9) ) ),
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_11,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_rng(X3),X2)
& subset(relation_dom(X3),X1) ) ),
inference(assume_negation,[status(cth)],[t12_relset_1]) ).
cnf(c_0_14,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,negated_conjecture,
( ( ~ subset(relation_rng(esk3_0),esk2_0)
| ~ subset(relation_dom(esk3_0),esk1_0) )
& relation_of2_as_subset(esk3_0,esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_17,plain,
! [X64,X65,X66] :
( relation(X66)
| ~ element(X66,powerset(cartesian_product2(X64,X65))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
fof(c_0_18,plain,
! [X48,X49,X50,X51] :
( ( in(ordered_pair(X48,X49),cartesian_product2(X50,X51))
| ~ in(X49,X51)
| ~ in(X48,X50) )
& ( ~ in(ordered_pair(X48,X49),cartesian_product2(X50,X51))
| in(X49,X51) )
& ( ~ in(ordered_pair(X48,X49),cartesian_product2(X50,X51))
| in(X48,X50) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
cnf(c_0_19,plain,
( ~ in(X1,X4)
| ~ relation_of2_as_subset(X4,X2,X3)
| in(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
relation_of2_as_subset(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X27,X28,X29,X31,X32,X33,X35] :
( ( ~ relation(X27)
| X33 = relation_dom(X27)
| in(ordered_pair(esk9_2(X27,X33),esk10_2(X27,X33)),X27)
| in(esk9_2(X27,X33),X33) )
& ( ~ relation(X27)
| X33 = relation_dom(X27)
| ~ in(ordered_pair(esk9_2(X27,X33),X35),X27)
| ~ in(esk9_2(X27,X33),X33) )
& ( ~ relation(X27)
| X28 != relation_dom(X27)
| in(X31,X28)
| ~ in(ordered_pair(X31,X32),X27) )
& ( ~ relation(X27)
| X28 != relation_dom(X27)
| in(ordered_pair(X29,esk8_3(X27,X28,X29)),X27)
| ~ in(X29,X28) ) ),
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)],[d4_relat_1])])])])])])]) ).
cnf(c_0_22,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,esk3_0)
| in(X1,cartesian_product2(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ relation(X3)
| X2 != relation_dom(X3)
| ~ in(X1,X2)
| in(ordered_pair(X1,esk8_3(X3,X2,X1)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
fof(c_0_27,plain,
! [X17,X18,X19,X21,X22,X23,X25] :
( ( ~ relation(X17)
| X23 = relation_rng(X17)
| in(ordered_pair(esk7_2(X17,X23),esk6_2(X17,X23)),X17)
| in(esk6_2(X17,X23),X23) )
& ( ~ relation(X17)
| X23 = relation_rng(X17)
| ~ in(ordered_pair(X25,esk6_2(X17,X23)),X17)
| ~ in(esk6_2(X17,X23),X23) )
& ( ~ relation(X17)
| X18 != relation_rng(X17)
| in(X21,X18)
| ~ in(ordered_pair(X22,X21),X17) )
& ( ~ relation(X17)
| X18 != relation_rng(X17)
| in(ordered_pair(esk5_3(X17,X18,X19),X19),X17)
| ~ in(X19,X18) ) ),
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)],[d5_relat_1])])])])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ in(ordered_pair(X1,X2),esk3_0)
| in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ in(X1,relation_dom(X2))
| ~ relation(X2)
| in(ordered_pair(X1,esk8_3(X2,relation_dom(X2),X1)),X2) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
relation(esk3_0),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,plain,
( ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk5_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ in(X1,relation_dom(esk3_0))
| in(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_35,negated_conjecture,
( ~ in(ordered_pair(X2,X1),esk3_0)
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_36,plain,
( ~ in(X2,relation_rng(X1))
| ~ relation(X1)
| in(ordered_pair(esk5_3(X1,relation_rng(X1),X2),X2),X1) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( ~ in(esk4_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
( in(esk4_2(relation_dom(esk3_0),X1),esk1_0)
| subset(relation_dom(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(X1,relation_rng(esk3_0))
| in(X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30])]) ).
cnf(c_0_40,negated_conjecture,
( ~ subset(relation_rng(esk3_0),esk2_0)
| ~ subset(relation_dom(esk3_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_41,negated_conjecture,
subset(relation_dom(esk3_0),esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( in(esk4_2(relation_rng(esk3_0),X1),esk2_0)
| subset(relation_rng(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
~ subset(relation_rng(esk3_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU262+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n020.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 06:05:47 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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
% 2.17/0.80 % Version: 3.5.1
% 2.17/0.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.17/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.17/0.80 % Starting new_bool_3 with 300s (1) cores
% 2.17/0.80 % Starting new_bool_1 with 300s (1) cores
% 2.17/0.80 % Starting sh5l with 300s (1) cores
% 2.17/0.80 % sh5l with pid 2167115 completed with status 0
% 2.17/0.80 % Result found by sh5l
% 2.17/0.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.17/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.17/0.80 % Starting new_bool_3 with 300s (1) cores
% 2.17/0.80 % Starting new_bool_1 with 300s (1) cores
% 2.17/0.80 % Starting sh5l with 300s (1) cores
% 2.17/0.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.17/0.80 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.17/0.80 % Search class: FGHSM-FFMS31-SFFFFFNN
% 2.17/0.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.17/0.80 % Starting SubtermCWHack with 31s (1) cores
% 2.17/0.80 % SubtermCWHack with pid 2167123 completed with status 0
% 2.17/0.80 % Result found by SubtermCWHack
% 2.17/0.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.17/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.17/0.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.17/0.80 % Starting new_bool_3 with 300s (1) cores
% 2.17/0.80 % Starting new_bool_1 with 300s (1) cores
% 2.17/0.80 % Starting sh5l with 300s (1) cores
% 2.17/0.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.17/0.80 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.17/0.80 % Search class: FGHSM-FFMS31-SFFFFFNN
% 2.17/0.80 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.17/0.80 % Starting SubtermCWHack with 31s (1) cores
% 2.17/0.80 % Preprocessing time : 0.003 s
% 2.17/0.80
% 2.17/0.80 % Proof found!
% 2.17/0.80 % SZS status Theorem
% 2.17/0.80 % SZS output start CNFRefutation
% See solution above
% 2.17/0.81 % Parsed axioms : 37
% 2.17/0.81 % Removed by relevancy pruning/SinE : 10
% 2.17/0.81 % Initial clauses : 40
% 2.17/0.81 % Removed in clause preprocessing : 0
% 2.17/0.81 % Initial clauses in saturation : 40
% 2.17/0.81 % Processed clauses : 1569
% 2.17/0.81 % ...of these trivial : 23
% 2.17/0.81 % ...subsumed : 1056
% 2.17/0.81 % ...remaining for further processing : 490
% 2.17/0.81 % Other redundant clauses eliminated : 4
% 2.17/0.81 % Clauses deleted for lack of memory : 0
% 2.17/0.81 % Backward-subsumed : 94
% 2.17/0.81 % Backward-rewritten : 10
% 2.17/0.81 % Generated clauses : 9405
% 2.17/0.81 % ...of the previous two non-redundant : 8347
% 2.17/0.81 % ...aggressively subsumed : 0
% 2.17/0.81 % Contextual simplify-reflections : 9
% 2.17/0.81 % Paramodulations : 9390
% 2.17/0.81 % Factorizations : 10
% 2.17/0.81 % NegExts : 0
% 2.17/0.81 % Equation resolutions : 4
% 2.17/0.81 % Disequality decompositions : 0
% 2.17/0.81 % Total rewrite steps : 2039
% 2.17/0.81 % ...of those cached : 1962
% 2.17/0.81 % Propositional unsat checks : 0
% 2.17/0.81 % Propositional check models : 0
% 2.17/0.81 % Propositional check unsatisfiable : 0
% 2.17/0.81 % Propositional clauses : 0
% 2.17/0.81 % Propositional clauses after purity: 0
% 2.17/0.81 % Propositional unsat core size : 0
% 2.17/0.81 % Propositional preprocessing time : 0.000
% 2.17/0.81 % Propositional encoding time : 0.000
% 2.17/0.81 % Propositional solver time : 0.000
% 2.17/0.81 % Success case prop preproc time : 0.000
% 2.17/0.81 % Success case prop encoding time : 0.000
% 2.17/0.81 % Success case prop solver time : 0.000
% 2.17/0.81 % Current number of processed clauses : 381
% 2.17/0.81 % Positive orientable unit clauses : 37
% 2.17/0.81 % Positive unorientable unit clauses: 1
% 2.17/0.81 % Negative unit clauses : 9
% 2.17/0.81 % Non-unit-clauses : 334
% 2.17/0.81 % Current number of unprocessed clauses: 6247
% 2.17/0.81 % ...number of literals in the above : 23579
% 2.17/0.81 % Current number of archived formulas : 0
% 2.17/0.81 % Current number of archived clauses : 105
% 2.17/0.81 % Clause-clause subsumption calls (NU) : 41519
% 2.17/0.81 % Rec. Clause-clause subsumption calls : 32769
% 2.17/0.81 % Non-unit clause-clause subsumptions : 822
% 2.17/0.81 % Unit Clause-clause subsumption calls : 873
% 2.17/0.81 % Rewrite failures with RHS unbound : 0
% 2.17/0.81 % BW rewrite match attempts : 27
% 2.17/0.81 % BW rewrite match successes : 8
% 2.17/0.81 % Condensation attempts : 0
% 2.17/0.81 % Condensation successes : 0
% 2.17/0.81 % Termbank termtop insertions : 117676
% 2.17/0.81 % Search garbage collected termcells : 681
% 2.17/0.81
% 2.17/0.81 % -------------------------------------------------
% 2.17/0.81 % User time : 0.232 s
% 2.17/0.81 % System time : 0.006 s
% 2.17/0.81 % Total time : 0.238 s
% 2.17/0.81 % Maximum resident set size: 3660 pages
% 2.17/0.81
% 2.17/0.81 % -------------------------------------------------
% 2.17/0.81 % User time : 0.235 s
% 2.17/0.81 % System time : 0.010 s
% 2.17/0.81 % Total time : 0.245 s
% 2.17/0.81 % Maximum resident set size: 4608 pages
% 2.17/0.81 % E exiting
%------------------------------------------------------------------------------