%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU110+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:23:50 PM UTC 2026
% Result : Theorem 0.24s 0.59s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 9 unt; 0 def)
% Number of atoms : 153 ( 10 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 168 ( 66 ~; 70 |; 21 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 95 ( 4 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fc1_finsub_1,axiom,
! [X1] :
( preboolean(powerset(X1))
& diff_closed(powerset(X1))
& cup_closed(powerset(X1))
& ~ empty(powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_finsub_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t23_finsub_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_finsub_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(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(d5_finsub_1,axiom,
! [X1,X2] :
( preboolean(X2)
=> ( X2 = finite_subsets(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( finite(X3)
& subset(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(c_0_9,plain,
! [X1] :
( preboolean(powerset(X1))
& diff_closed(powerset(X1))
& cup_closed(powerset(X1))
& ~ empty(powerset(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_finsub_1]) ).
fof(c_0_10,plain,
! [X52,X53] :
( in(X52,X53)
| empty(X53)
| ~ element(X52,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_11,plain,
! [X54,X55] :
( ( element(X54,powerset(X55))
| ~ subset(X54,X55) )
& ( subset(X54,X55)
| ~ element(X54,powerset(X55)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_12,plain,
! [X27] :
( preboolean(powerset(X27))
& diff_closed(powerset(X27))
& cup_closed(powerset(X27))
& ~ empty(powerset(X27)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> subset(finite_subsets(X1),finite_subsets(X2)) ),
inference(assume_negation,[status(cth)],[t23_finsub_1]) ).
fof(c_0_14,plain,
! [X13,X14,X15,X16,X17] :
( ( subset(X16,X17)
| ~ in(esk1_2(X16,X17),X17) )
& ( subset(X16,X17)
| in(esk1_2(X16,X17),X16) )
& ( in(X15,X14)
| ~ in(X15,X13)
| ~ subset(X13,X14) ) ),
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_15,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X47,X48,X49] :
( subset(X47,X49)
| ~ subset(X48,X49)
| ~ subset(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_19,negated_conjecture,
( ~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0))
& subset(esk13_0,esk14_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_20,plain,
! [X19,X20,X21,X22] :
( ( ~ preboolean(X20)
| X20 = finite_subsets(X19)
| in(esk2_2(X19,X20),X20)
| finite(esk2_2(X19,X20)) )
& ( ~ preboolean(X20)
| X20 = finite_subsets(X19)
| in(esk2_2(X19,X20),X20)
| subset(esk2_2(X19,X20),X19) )
& ( ~ preboolean(X20)
| X20 = finite_subsets(X19)
| ~ finite(esk2_2(X19,X20))
| ~ subset(esk2_2(X19,X20),X19)
| ~ in(esk2_2(X19,X20),X20) )
& ( ~ preboolean(X20)
| X20 != finite_subsets(X19)
| in(X22,X20)
| ~ finite(X22)
| ~ subset(X22,X19) )
& ( ~ preboolean(X20)
| X20 != finite_subsets(X19)
| ~ in(X21,X20)
| finite(X21) )
& ( ~ preboolean(X20)
| X20 != finite_subsets(X19)
| ~ in(X21,X20)
| subset(X21,X19) ) ),
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_finsub_1])])])])])])]) ).
fof(c_0_21,plain,
! [X24] : preboolean(finite_subsets(X24)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
cnf(c_0_22,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ subset(X1,X2)
| in(X1,powerset(X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
subset(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ preboolean(X3)
| X3 != finite_subsets(X2)
| ~ in(X1,X3)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X56,X57,X58] :
( element(X56,X58)
| ~ element(X57,powerset(X58))
| ~ in(X56,X57) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_29,plain,
( ~ subset(esk1_2(X1,powerset(X2)),X2)
| subset(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ subset(X1,esk13_0)
| subset(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ in(X1,finite_subsets(X2))
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27])]) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ subset(esk1_2(X1,powerset(esk14_0)),esk13_0)
| subset(X1,powerset(esk14_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( subset(finite_subsets(X1),X2)
| subset(esk1_2(finite_subsets(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( ~ in(X1,X3)
| ~ subset(X3,X2)
| element(X1,X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_37,negated_conjecture,
subset(finite_subsets(esk13_0),powerset(esk14_0)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( ~ preboolean(X3)
| X3 != finite_subsets(X2)
| ~ finite(X1)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_39,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,negated_conjecture,
( ~ in(X1,finite_subsets(esk13_0))
| element(X1,powerset(esk14_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( ~ finite(X1)
| ~ subset(X1,X2)
| in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_27])]) ).
cnf(c_0_42,negated_conjecture,
( ~ in(X1,finite_subsets(esk13_0))
| subset(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( ~ preboolean(X2)
| X2 != finite_subsets(X3)
| ~ in(X1,X2)
| finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_44,plain,
( ~ finite(esk1_2(X1,finite_subsets(X2)))
| ~ subset(esk1_2(X1,finite_subsets(X2)),X2)
| subset(X1,finite_subsets(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( subset(finite_subsets(esk13_0),X1)
| subset(esk1_2(finite_subsets(esk13_0),X1),esk14_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_32]) ).
cnf(c_0_46,negated_conjecture,
~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_47,plain,
( ~ in(X1,finite_subsets(X2))
| finite(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_27])]) ).
cnf(c_0_48,negated_conjecture,
~ finite(esk1_2(finite_subsets(esk13_0),finite_subsets(esk14_0))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
( finite(esk1_2(finite_subsets(X1),X2))
| subset(finite_subsets(X1),X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_32]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU110+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 05:46:11 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.51 Running first-order theorem proving
% 0.24/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
% 0.24/0.59 % Version: 3.5.1
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.59 % Starting sh5l with 300s (1) cores
% 0.24/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1563547 completed with status 0
% 0.24/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59 % No SInE strategy applied
% 0.24/0.59 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.24/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.24/0.59 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.24/0.59 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.24/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1563555 completed with status 0
% 0.24/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.24/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.59 % No SInE strategy applied
% 0.24/0.59 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.24/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.24/0.59 % Preprocessing time : 0.002 s
% 0.24/0.59 % Presaturation interreduction done
% 0.24/0.59
% 0.24/0.59 % Proof found!
% 0.24/0.59 % SZS status Theorem
% 0.24/0.59 % SZS output start CNFRefutation
% See solution above
% 0.24/0.59 % Parsed axioms : 34
% 0.24/0.59 % Removed by relevancy pruning/SinE : 0
% 0.24/0.59 % Initial clauses : 70
% 0.24/0.59 % Removed in clause preprocessing : 0
% 0.24/0.59 % Initial clauses in saturation : 70
% 0.24/0.59 % Processed clauses : 852
% 0.24/0.59 % ...of these trivial : 3
% 0.24/0.59 % ...subsumed : 429
% 0.24/0.59 % ...remaining for further processing : 420
% 0.24/0.59 % Other redundant clauses eliminated : 3
% 0.24/0.59 % Clauses deleted for lack of memory : 0
% 0.24/0.59 % Backward-subsumed : 8
% 0.24/0.59 % Backward-rewritten : 13
% 0.24/0.59 % Generated clauses : 1997
% 0.24/0.59 % ...of the previous two non-redundant : 1644
% 0.24/0.59 % ...aggressively subsumed : 0
% 0.24/0.59 % Contextual simplify-reflections : 8
% 0.24/0.59 % Paramodulations : 1994
% 0.24/0.59 % Factorizations : 0
% 0.24/0.59 % NegExts : 0
% 0.24/0.59 % Equation resolutions : 3
% 0.24/0.59 % Disequality decompositions : 0
% 0.24/0.59 % Total rewrite steps : 453
% 0.24/0.59 % ...of those cached : 375
% 0.24/0.59 % Propositional unsat checks : 0
% 0.24/0.59 % Propositional check models : 0
% 0.24/0.59 % Propositional check unsatisfiable : 0
% 0.24/0.59 % Propositional clauses : 0
% 0.24/0.59 % Propositional clauses after purity: 0
% 0.24/0.59 % Propositional unsat core size : 0
% 0.24/0.59 % Propositional preprocessing time : 0.000
% 0.24/0.59 % Propositional encoding time : 0.000
% 0.24/0.59 % Propositional solver time : 0.000
% 0.24/0.59 % Success case prop preproc time : 0.000
% 0.24/0.59 % Success case prop encoding time : 0.000
% 0.24/0.59 % Success case prop solver time : 0.000
% 0.24/0.59 % Current number of processed clauses : 328
% 0.24/0.59 % Positive orientable unit clauses : 64
% 0.24/0.59 % Positive unorientable unit clauses: 0
% 0.24/0.59 % Negative unit clauses : 16
% 0.24/0.59 % Non-unit-clauses : 248
% 0.24/0.59 % Current number of unprocessed clauses: 898
% 0.24/0.59 % ...number of literals in the above : 2319
% 0.24/0.59 % Current number of archived formulas : 0
% 0.24/0.59 % Current number of archived clauses : 89
% 0.24/0.59 % Clause-clause subsumption calls (NU) : 5427
% 0.24/0.59 % Rec. Clause-clause subsumption calls : 4299
% 0.24/0.59 % Non-unit clause-clause subsumptions : 283
% 0.24/0.59 % Unit Clause-clause subsumption calls : 476
% 0.24/0.59 % Rewrite failures with RHS unbound : 0
% 0.24/0.59 % BW rewrite match attempts : 71
% 0.24/0.59 % BW rewrite match successes : 8
% 0.24/0.59 % Condensation attempts : 0
% 0.24/0.59 % Condensation successes : 0
% 0.24/0.59 % Termbank termtop insertions : 26297
% 0.24/0.59 % Search garbage collected termcells : 653
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.047 s
% 0.24/0.59 % System time : 0.007 s
% 0.24/0.59 % Total time : 0.055 s
% 0.24/0.59 % Maximum resident set size: 3612 pages
% 0.24/0.59
% 0.24/0.59 % -------------------------------------------------
% 0.24/0.59 % User time : 0.207 s
% 0.24/0.59 % System time : 0.022 s
% 0.24/0.59 % Total time : 0.228 s
% 0.24/0.59 % Maximum resident set size: 4864 pages
% 0.24/0.59 % E exiting
%------------------------------------------------------------------------------