%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU319+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 : 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:28:58 PM UTC 2026
% Result : Theorem 10.40s 2.20s
% Output : CNFRefutation 10.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 72 ( 9 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 73 ( 29 ~; 27 |; 4 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 27 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t29_tops_1,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t29_tops_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
fof(t17_pre_topc,lemma,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_pre_topc) ).
fof(d6_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d6_pre_topc) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( closed_subset(X2,X1)
<=> open_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[t29_tops_1]) ).
fof(c_0_6,plain,
! [X36,X37] :
( subset_complement(X36,X37) = set_difference(X36,X37)
| ~ element(X37,powerset(X36)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
fof(c_0_7,negated_conjecture,
( ( open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0)
| closed_subset(esk2_0,esk1_0) )
& ( ~ open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ closed_subset(esk2_0,esk1_0) )
& element(esk2_0,powerset(the_carrier(esk1_0)))
& top_str(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,lemma,
! [X47,X48] :
( subset_complement(the_carrier(X47),X48) = subset_difference(the_carrier(X47),cast_as_carrier_subset(X47),X48)
| ~ element(X48,powerset(the_carrier(X47)))
| ~ one_sorted_str(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t17_pre_topc])])])]) ).
cnf(c_0_9,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,lemma,
( ~ element(X2,powerset(the_carrier(X1)))
| ~ one_sorted_str(X1)
| subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
fof(c_0_13,plain,
! [X118] :
( one_sorted_str(X118)
| ~ top_str(X118) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_14,plain,
! [X34,X35] :
( ( ~ top_str(X34)
| ~ element(X35,powerset(the_carrier(X34)))
| closed_subset(X35,X34)
| ~ open_subset(subset_difference(the_carrier(X34),cast_as_carrier_subset(X34),X35),X34) )
& ( ~ top_str(X34)
| ~ element(X35,powerset(the_carrier(X34)))
| open_subset(subset_difference(the_carrier(X34),cast_as_carrier_subset(X34),X35),X34)
| ~ closed_subset(X35,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)],[d6_pre_topc])])])])]) ).
cnf(c_0_15,negated_conjecture,
( ~ one_sorted_str(esk1_0)
| subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_16,plain,
( ~ top_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0)
| closed_subset(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( ~ open_subset(subset_complement(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ closed_subset(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ open_subset(subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2),X1)
| closed_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0) = set_difference(the_carrier(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0)
| closed_subset(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ closed_subset(esk2_0,esk1_0) ),
inference(rw,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
closed_subset(esk2_0,esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),c_0_10])]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ closed_subset(X1,X2)
| open_subset(subset_difference(the_carrier(X2),cast_as_carrier_subset(X2),X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,negated_conjecture,
~ open_subset(set_difference(the_carrier(esk1_0),esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_21]),c_0_17]),c_0_10])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU319+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n010.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 06:11:40 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.51 Running first-order theorem proving
% 0.17/0.51 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
% 10.40/2.20 % Version: 3.5.1
% 10.40/2.20 % Preprocessing class: FSLMSMSSSSSNFFN.
% 10.40/2.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.40/2.20 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 10.40/2.20 % Starting new_bool_3 with 600s (2) cores
% 10.40/2.20 % Starting new_bool_1 with 600s (2) cores
% 10.40/2.20 % Starting sh5l with 300s (1) cores
% 10.40/2.20 % new_bool_1 with pid 185072 completed with status 0
% 10.40/2.20 % Result found by new_bool_1
% 10.40/2.20 % Preprocessing class: FSLMSMSSSSSNFFN.
% 10.40/2.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.40/2.20 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 10.40/2.20 % Starting new_bool_3 with 600s (2) cores
% 10.40/2.20 % Starting new_bool_1 with 600s (2) cores
% 10.40/2.20 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.40/2.20 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.40/2.20 % Search class: FGHSM-FSLM31-MFFFFFNN
% 10.40/2.20 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 10.40/2.20 % Starting SubtermCWHack with 55s (1) cores
% 10.40/2.20 % Starting new_bool_1 with 61s (1) cores
% 10.40/2.20 % new_bool_1 with pid 185077 completed with status 0
% 10.40/2.20 % Result found by new_bool_1
% 10.40/2.20 % Preprocessing class: FSLMSMSSSSSNFFN.
% 10.40/2.20 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.40/2.20 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 10.40/2.20 % Starting new_bool_3 with 600s (2) cores
% 10.40/2.20 % Starting new_bool_1 with 600s (2) cores
% 10.40/2.20 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 10.40/2.20 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.40/2.20 % Search class: FGHSM-FSLM31-MFFFFFNN
% 10.40/2.20 % Scheduled 8 strats onto 2 cores with 600 seconds (600 total)
% 10.40/2.20 % Starting SubtermCWHack with 55s (1) cores
% 10.40/2.20 % Starting new_bool_1 with 61s (1) cores
% 10.40/2.20 % Preprocessing time : 0.021 s
% 10.40/2.20 % Presaturation interreduction done
% 10.40/2.20
% 10.40/2.20 % Proof found!
% 10.40/2.20 % SZS status Theorem
% 10.40/2.20 % SZS output start CNFRefutation
% See solution above
% 10.40/2.20 % Parsed axioms : 521
% 10.40/2.20 % Removed by relevancy pruning/SinE : 344
% 10.40/2.20 % Initial clauses : 693
% 10.40/2.20 % Removed in clause preprocessing : 2
% 10.40/2.20 % Initial clauses in saturation : 691
% 10.40/2.20 % Processed clauses : 6800
% 10.40/2.20 % ...of these trivial : 114
% 10.40/2.20 % ...subsumed : 3681
% 10.40/2.20 % ...remaining for further processing : 3004
% 10.40/2.20 % Other redundant clauses eliminated : 335
% 10.40/2.20 % Clauses deleted for lack of memory : 0
% 10.40/2.20 % Backward-subsumed : 71
% 10.40/2.20 % Backward-rewritten : 328
% 10.40/2.20 % Generated clauses : 39621
% 10.40/2.20 % ...of the previous two non-redundant : 38291
% 10.40/2.20 % ...aggressively subsumed : 0
% 10.40/2.20 % Contextual simplify-reflections : 65
% 10.40/2.20 % Paramodulations : 39306
% 10.40/2.20 % Factorizations : 10
% 10.40/2.20 % NegExts : 0
% 10.40/2.20 % Equation resolutions : 337
% 10.40/2.20 % Disequality decompositions : 0
% 10.40/2.20 % Total rewrite steps : 21322
% 10.40/2.20 % ...of those cached : 20876
% 10.40/2.20 % Propositional unsat checks : 0
% 10.40/2.20 % Propositional check models : 0
% 10.40/2.20 % Propositional check unsatisfiable : 0
% 10.40/2.20 % Propositional clauses : 0
% 10.40/2.20 % Propositional clauses after purity: 0
% 10.40/2.20 % Propositional unsat core size : 0
% 10.40/2.20 % Propositional preprocessing time : 0.000
% 10.40/2.20 % Propositional encoding time : 0.000
% 10.40/2.20 % Propositional solver time : 0.000
% 10.40/2.20 % Success case prop preproc time : 0.000
% 10.40/2.20 % Success case prop encoding time : 0.000
% 10.40/2.20 % Success case prop solver time : 0.000
% 10.40/2.20 % Current number of processed clauses : 1849
% 10.40/2.20 % Positive orientable unit clauses : 249
% 10.40/2.20 % Positive unorientable unit clauses: 1
% 10.40/2.20 % Negative unit clauses : 180
% 10.40/2.20 % Non-unit-clauses : 1419
% 10.40/2.20 % Current number of unprocessed clauses: 32582
% 10.40/2.20 % ...number of literals in the above : 130496
% 10.40/2.20 % Current number of archived formulas : 0
% 10.40/2.20 % Current number of archived clauses : 1034
% 10.40/2.20 % Clause-clause subsumption calls (NU) : 806738
% 10.40/2.20 % Rec. Clause-clause subsumption calls : 293049
% 10.40/2.20 % Non-unit clause-clause subsumptions : 2115
% 10.40/2.20 % Unit Clause-clause subsumption calls : 15542
% 10.40/2.20 % Rewrite failures with RHS unbound : 2
% 10.40/2.20 % BW rewrite match attempts : 382
% 10.40/2.20 % BW rewrite match successes : 60
% 10.40/2.20 % Condensation attempts : 0
% 10.40/2.20 % Condensation successes : 0
% 10.40/2.20 % Termbank termtop insertions : 924865
% 10.40/2.20 % Search garbage collected termcells : 11660
% 10.40/2.20
% 10.40/2.20 % -------------------------------------------------
% 10.40/2.20 % User time : 1.208 s
% 10.40/2.20 % System time : 0.047 s
% 10.40/2.20 % Total time : 1.255 s
% 10.40/2.20 % Maximum resident set size: 5860 pages
% 10.40/2.20
% 10.40/2.20 % -------------------------------------------------
% 10.40/2.20 % User time : 2.681 s
% 10.40/2.20 % System time : 0.098 s
% 10.40/2.20 % Total time : 2.779 s
% 10.40/2.20 % Maximum resident set size: 5632 pages
% 10.40/2.20 % E exiting
%------------------------------------------------------------------------------