%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU317+1 : 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 : n010.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:41 PM UTC 2026
% Result : Theorem 1.28s 0.63s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 133 ( 53 ~; 57 |; 10 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 54 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(t45_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( in(X3,the_carrier(X1))
=> ( in(X3,topstr_closure(X1,X2))
<=> ! [X4] :
( element(X4,powerset(the_carrier(X1)))
=> ( ( subset(X2,X4)
& closed_subset(X4,X1) )
=> in(X3,X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t45_pre_topc) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(t48_pre_topc,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_pre_topc) ).
fof(c_0_4,plain,
! [X32,X33,X34,X35,X36] :
( ( subset(X35,X36)
| ~ in(esk1_2(X35,X36),X36) )
& ( subset(X35,X36)
| in(esk1_2(X35,X36),X35) )
& ( in(X34,X33)
| ~ in(X34,X32)
| ~ subset(X32,X33) ) ),
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])])])])])])]) ).
fof(c_0_5,plain,
! [X58,X59,X60,X61] :
( ( ~ top_str(X58)
| ~ element(X59,powerset(the_carrier(X58)))
| ~ in(X60,the_carrier(X58))
| in(X60,topstr_closure(X58,X59))
| ~ in(X60,esk8_3(X58,X59,X60)) )
& ( ~ top_str(X58)
| ~ element(X59,powerset(the_carrier(X58)))
| ~ in(X60,the_carrier(X58))
| in(X60,topstr_closure(X58,X59))
| subset(X59,esk8_3(X58,X59,X60)) )
& ( ~ top_str(X58)
| ~ element(X59,powerset(the_carrier(X58)))
| ~ in(X60,the_carrier(X58))
| in(X60,topstr_closure(X58,X59))
| closed_subset(esk8_3(X58,X59,X60),X58) )
& ( ~ top_str(X58)
| ~ element(X59,powerset(the_carrier(X58)))
| ~ in(X60,the_carrier(X58))
| in(X60,topstr_closure(X58,X59))
| element(esk8_3(X58,X59,X60),powerset(the_carrier(X58))) )
& ( ~ top_str(X58)
| ~ element(X59,powerset(the_carrier(X58)))
| ~ in(X60,the_carrier(X58))
| in(X60,X61)
| ~ subset(X59,X61)
| ~ closed_subset(X61,X58)
| ~ element(X61,powerset(the_carrier(X58)))
| ~ in(X60,topstr_closure(X58,X59)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_pre_topc])])])])])]) ).
fof(c_0_6,plain,
! [X56,X57] :
( ( element(X56,powerset(X57))
| ~ subset(X56,X57) )
& ( subset(X56,X57)
| ~ element(X56,powerset(X57)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_7,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ in(X3,the_carrier(X2))
| in(X3,topstr_closure(X2,X1))
| subset(X1,esk8_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,the_carrier(X2))
| ~ in(X1,esk8_3(X2,X3,X1))
| in(X1,topstr_closure(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( ~ in(X1,X3)
| ~ in(X4,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2)
| in(X4,topstr_closure(X2,X3))
| in(X1,esk8_3(X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ in(X1,X3)
| ~ element(X3,powerset(X2))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t48_pre_topc]) ).
cnf(c_0_14,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( ~ in(X1,X3)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2)
| in(X1,topstr_closure(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_16,negated_conjecture,
( ~ subset(esk10_0,topstr_closure(esk9_0,esk10_0))
& element(esk10_0,powerset(the_carrier(esk9_0)))
& top_str(esk9_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,plain,
( ~ in(esk1_2(X1,topstr_closure(X2,X3)),X3)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ top_str(X2)
| subset(X1,topstr_closure(X2,X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
~ subset(esk10_0,topstr_closure(esk9_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( ~ element(X1,powerset(the_carrier(X2)))
| ~ top_str(X2)
| subset(X1,topstr_closure(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
top_str(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
element(esk10_0,powerset(the_carrier(esk9_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
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_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU317+1 : 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.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 06:11:24 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.41 Running first-order theorem proving
% 0.10/0.41 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
% 1.28/0.63 % Version: 3.5.1
% 1.28/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.63 % Starting new_bool_3 with 300s (1) cores
% 1.28/0.63 % Starting new_bool_1 with 300s (1) cores
% 1.28/0.63 % Starting sh5l with 300s (1) cores
% 1.28/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 184642 completed with status 0
% 1.28/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.28/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/0.63 % No SInE strategy applied
% 1.28/0.63 % Search class: FGHSM-FFMM31-SFFFFFNN
% 1.28/0.63 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 1.28/0.63 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.28/0.63 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.28/0.63 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 184649 completed with status 0
% 1.28/0.63 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 1.28/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.28/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.28/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.28/0.63 % No SInE strategy applied
% 1.28/0.63 % Search class: FGHSM-FFMM31-SFFFFFNN
% 1.28/0.63 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.28/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.28/0.63 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 1.28/0.63 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 1.28/0.63 % Preprocessing time : 0.003 s
% 1.28/0.63
% 1.28/0.63 % Proof found!
% 1.28/0.63 % SZS status Theorem
% 1.28/0.63 % SZS output start CNFRefutation
% See solution above
% 1.28/0.63 % Parsed axioms : 43
% 1.28/0.63 % Removed by relevancy pruning/SinE : 0
% 1.28/0.63 % Initial clauses : 88
% 1.28/0.63 % Removed in clause preprocessing : 5
% 1.28/0.63 % Initial clauses in saturation : 83
% 1.28/0.63 % Processed clauses : 1442
% 1.28/0.63 % ...of these trivial : 0
% 1.28/0.63 % ...subsumed : 750
% 1.28/0.63 % ...remaining for further processing : 692
% 1.28/0.63 % Other redundant clauses eliminated : 0
% 1.28/0.63 % Clauses deleted for lack of memory : 0
% 1.28/0.63 % Backward-subsumed : 44
% 1.28/0.63 % Backward-rewritten : 5
% 1.28/0.63 % Generated clauses : 2991
% 1.28/0.63 % ...of the previous two non-redundant : 2743
% 1.28/0.63 % ...aggressively subsumed : 0
% 1.28/0.63 % Contextual simplify-reflections : 2
% 1.28/0.63 % Paramodulations : 2991
% 1.28/0.63 % Factorizations : 0
% 1.28/0.63 % NegExts : 0
% 1.28/0.63 % Equation resolutions : 0
% 1.28/0.63 % Disequality decompositions : 0
% 1.28/0.63 % Total rewrite steps : 342
% 1.28/0.63 % ...of those cached : 306
% 1.28/0.63 % Propositional unsat checks : 0
% 1.28/0.63 % Propositional check models : 0
% 1.28/0.63 % Propositional check unsatisfiable : 0
% 1.28/0.63 % Propositional clauses : 0
% 1.28/0.63 % Propositional clauses after purity: 0
% 1.28/0.63 % Propositional unsat core size : 0
% 1.28/0.63 % Propositional preprocessing time : 0.000
% 1.28/0.63 % Propositional encoding time : 0.000
% 1.28/0.63 % Propositional solver time : 0.000
% 1.28/0.63 % Success case prop preproc time : 0.000
% 1.28/0.63 % Success case prop encoding time : 0.000
% 1.28/0.63 % Success case prop solver time : 0.000
% 1.28/0.63 % Current number of processed clauses : 643
% 1.28/0.63 % Positive orientable unit clauses : 31
% 1.28/0.63 % Positive unorientable unit clauses: 0
% 1.28/0.63 % Negative unit clauses : 9
% 1.28/0.63 % Non-unit-clauses : 603
% 1.28/0.63 % Current number of unprocessed clauses: 1199
% 1.28/0.63 % ...number of literals in the above : 5822
% 1.28/0.63 % Current number of archived formulas : 0
% 1.28/0.63 % Current number of archived clauses : 49
% 1.28/0.63 % Clause-clause subsumption calls (NU) : 103504
% 1.28/0.63 % Rec. Clause-clause subsumption calls : 29395
% 1.28/0.63 % Non-unit clause-clause subsumptions : 659
% 1.28/0.63 % Unit Clause-clause subsumption calls : 426
% 1.28/0.63 % Rewrite failures with RHS unbound : 0
% 1.28/0.63 % BW rewrite match attempts : 21
% 1.28/0.63 % BW rewrite match successes : 4
% 1.28/0.63 % Condensation attempts : 0
% 1.28/0.63 % Condensation successes : 0
% 1.28/0.63 % Termbank termtop insertions : 54968
% 1.28/0.63 % Search garbage collected termcells : 887
% 1.28/0.63
% 1.28/0.63 % -------------------------------------------------
% 1.28/0.63 % User time : 0.099 s
% 1.28/0.63 % System time : 0.008 s
% 1.28/0.63 % Total time : 0.107 s
% 1.28/0.63 % Maximum resident set size: 3672 pages
% 1.28/0.63
% 1.28/0.63 % -------------------------------------------------
% 1.28/0.63 % User time : 0.793 s
% 1.28/0.63 % System time : 0.040 s
% 1.28/0.63 % Total time : 0.833 s
% 1.28/0.63 % Maximum resident set size: 4864 pages
% 1.28/0.63 % E exiting
%------------------------------------------------------------------------------