%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU309+2 : 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:28:56 PM UTC 2026
% Result : Theorem 12.07s 7.57s
% Output : CNFRefutation 12.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 44 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 14 ~; 10 |; 2 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 28 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t22_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_pre_topc) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',t17_pre_topc) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)) = X2 ) ),
inference(assume_negation,[status(cth)],[t22_pre_topc]) ).
fof(c_0_6,plain,
! [X437,X438] :
( subset_complement(X437,X438) = set_difference(X437,X438)
| ~ element(X438,powerset(X437)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
fof(c_0_7,negated_conjecture,
( subset_difference(the_carrier(esk287_0),cast_as_carrier_subset(esk287_0),subset_difference(the_carrier(esk287_0),cast_as_carrier_subset(esk287_0),esk288_0)) != esk288_0
& element(esk288_0,powerset(the_carrier(esk287_0)))
& one_sorted_str(esk287_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,
! [X1221,X1222] :
( subset_complement(the_carrier(X1221),X1222) = subset_difference(the_carrier(X1221),cast_as_carrier_subset(X1221),X1222)
| ~ element(X1222,powerset(the_carrier(X1221)))
| ~ one_sorted_str(X1221) ),
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(esk288_0,powerset(the_carrier(esk287_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X675,X676] :
( subset_complement(X675,subset_complement(X675,X676)) = X676
| ~ element(X676,powerset(X675)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).
fof(c_0_12,plain,
! [X535,X536] :
( element(subset_complement(X535,X536),powerset(X535))
| ~ element(X536,powerset(X535)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])])]) ).
cnf(c_0_13,negated_conjecture,
subset_difference(the_carrier(esk287_0),cast_as_carrier_subset(esk287_0),subset_difference(the_carrier(esk287_0),cast_as_carrier_subset(esk287_0),esk288_0)) != esk288_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,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_15,negated_conjecture,
subset_complement(the_carrier(esk287_0),esk288_0) = set_difference(the_carrier(esk287_0),esk288_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
one_sorted_str(esk287_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,subset_complement(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ element(X1,powerset(X2))
| element(subset_complement(X2,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
subset_difference(the_carrier(esk287_0),cast_as_carrier_subset(esk287_0),set_difference(the_carrier(esk287_0),esk288_0)) != esk288_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16]),c_0_10])]) ).
cnf(c_0_20,negated_conjecture,
subset_complement(the_carrier(esk287_0),set_difference(the_carrier(esk287_0),esk288_0)) = esk288_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_10])]) ).
cnf(c_0_21,negated_conjecture,
element(set_difference(the_carrier(esk287_0),esk288_0),powerset(the_carrier(esk287_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_10])]) ).
cnf(c_0_22,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_20]),c_0_16]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU309+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.66 % Computer : n020.cluster.edu
% 0.17/5.66 % Model : x86_64 x86_64
% 0.17/5.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.66 % Memory : 8046.5625MB
% 0.17/5.66 % OS : Linux 6.8.0-71-generic
% 0.17/5.66 % CPULimit : 300
% 0.17/5.66 % WCLimit : 300
% 0.17/5.66 % DateTime : Mon Sep 21 06:11:23 UTC 2026
% 0.17/5.66 % CPUTime :
% 0.17/5.66 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.71 Running first-order theorem proving
% 0.23/5.71 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
% 12.07/7.57 % Version: 3.5.1
% 12.07/7.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.07/7.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.07/7.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.07/7.57 % Starting new_bool_3 with 600s (2) cores
% 12.07/7.57 % Starting new_bool_1 with 600s (2) cores
% 12.07/7.57 % Starting sh5l with 300s (1) cores
% 12.07/7.57 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2174805 completed with status 0
% 12.07/7.57 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 12.07/7.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.07/7.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.07/7.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.07/7.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.07/7.57 % No SInE strategy applied
% 12.07/7.57 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.07/7.57 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 12.07/7.57 % Starting SubtermCWHack with 82s (1) cores
% 12.07/7.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 12.07/7.57 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 12.07/7.57 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2174816 completed with status 0
% 12.07/7.57 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 12.07/7.57 % Preprocessing class: FSLMSMSSSSSNFFN.
% 12.07/7.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.07/7.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 12.07/7.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.07/7.57 % No SInE strategy applied
% 12.07/7.57 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.07/7.57 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 12.07/7.57 % Starting SubtermCWHack with 82s (1) cores
% 12.07/7.57 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 12.07/7.57 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 12.07/7.57 % Preprocessing time : 0.051 s
% 12.07/7.57 % Presaturation interreduction done
% 12.07/7.57
% 12.07/7.57 % Proof found!
% 12.07/7.57 % SZS status Theorem
% 12.07/7.57 % SZS output start CNFRefutation
% See solution above
% 12.07/7.57 % Parsed axioms : 496
% 12.07/7.57 % Removed by relevancy pruning/SinE : 0
% 12.07/7.57 % Initial clauses : 1885
% 12.07/7.57 % Removed in clause preprocessing : 40
% 12.07/7.57 % Initial clauses in saturation : 1845
% 12.07/7.57 % Processed clauses : 4897
% 12.07/7.57 % ...of these trivial : 68
% 12.07/7.57 % ...subsumed : 1514
% 12.07/7.57 % ...remaining for further processing : 3315
% 12.07/7.57 % Other redundant clauses eliminated : 534
% 12.07/7.57 % Clauses deleted for lack of memory : 0
% 12.07/7.57 % Backward-subsumed : 25
% 12.07/7.57 % Backward-rewritten : 56
% 12.07/7.57 % Generated clauses : 6529
% 12.07/7.57 % ...of the previous two non-redundant : 5682
% 12.07/7.57 % ...aggressively subsumed : 0
% 12.07/7.57 % Contextual simplify-reflections : 199
% 12.07/7.57 % Paramodulations : 6120
% 12.07/7.57 % Factorizations : 0
% 12.07/7.57 % NegExts : 0
% 12.07/7.57 % Equation resolutions : 537
% 12.07/7.57 % Disequality decompositions : 0
% 12.07/7.57 % Total rewrite steps : 1636
% 12.07/7.57 % ...of those cached : 1368
% 12.07/7.57 % Propositional unsat checks : 0
% 12.07/7.57 % Propositional check models : 0
% 12.07/7.57 % Propositional check unsatisfiable : 0
% 12.07/7.57 % Propositional clauses : 0
% 12.07/7.57 % Propositional clauses after purity: 0
% 12.07/7.57 % Propositional unsat core size : 0
% 12.07/7.57 % Propositional preprocessing time : 0.000
% 12.07/7.57 % Propositional encoding time : 0.000
% 12.07/7.57 % Propositional solver time : 0.000
% 12.07/7.57 % Success case prop preproc time : 0.000
% 12.07/7.57 % Success case prop encoding time : 0.000
% 12.07/7.57 % Success case prop solver time : 0.000
% 12.07/7.57 % Current number of processed clauses : 1165
% 12.07/7.57 % Positive orientable unit clauses : 192
% 12.07/7.57 % Positive unorientable unit clauses: 3
% 12.07/7.57 % Negative unit clauses : 178
% 12.07/7.57 % Non-unit-clauses : 792
% 12.07/7.57 % Current number of unprocessed clauses: 4206
% 12.07/7.57 % ...number of literals in the above : 14130
% 12.07/7.57 % Current number of archived formulas : 0
% 12.07/7.57 % Current number of archived clauses : 1786
% 12.07/7.57 % Clause-clause subsumption calls (NU) : 1953903
% 12.07/7.57 % Rec. Clause-clause subsumption calls : 348537
% 12.07/7.57 % Non-unit clause-clause subsumptions : 1138
% 12.07/7.57 % Unit Clause-clause subsumption calls : 13804
% 12.07/7.57 % Rewrite failures with RHS unbound : 0
% 12.07/7.57 % BW rewrite match attempts : 105
% 12.07/7.57 % BW rewrite match successes : 73
% 12.07/7.57 % Condensation attempts : 0
% 12.07/7.57 % Condensation successes : 0
% 12.07/7.57 % Termbank termtop insertions : 214698
% 12.07/7.57 % Search garbage collected termcells : 25773
% 12.07/7.57
% 12.07/7.57 % -------------------------------------------------
% 12.07/7.57 % User time : 1.733 s
% 12.07/7.57 % System time : 0.035 s
% 12.07/7.57 % Total time : 1.768 s
% 12.07/7.57 % Maximum resident set size: 8376 pages
% 12.07/7.57
% 12.07/7.57 % -------------------------------------------------
% 12.07/7.57 % User time : 4.717 s
% 12.07/7.57 % System time : 0.126 s
% 12.07/7.57 % Total time : 4.844 s
% 12.07/7.57 % Maximum resident set size: 5120 pages
% 12.07/7.57 % E exiting
%------------------------------------------------------------------------------