%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU308+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 : n016.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:39 PM UTC 2026
% Result : Theorem 0.26s 0.56s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 44 ( 16 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 39 ( 17 ~; 11 |; 3 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 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 : 25 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t17_pre_topc,conjecture,
! [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(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(dt_k2_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_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(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(c_0_5,negated_conjecture,
~ ! [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) ) ),
inference(assume_negation,[status(cth)],[t17_pre_topc]) ).
fof(c_0_6,negated_conjecture,
( subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& one_sorted_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_7,plain,
! [X6,X7,X8] :
( subset_difference(X6,X7,X8) = set_difference(X7,X8)
| ~ element(X8,powerset(X6))
| ~ element(X7,powerset(X6)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])])]) ).
cnf(c_0_8,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_difference(X2,X1,X3) = set_difference(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X12] :
( element(cast_as_carrier_subset(X12),powerset(the_carrier(X12)))
| ~ one_sorted_str(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(esk1_0)))
| subset_complement(the_carrier(esk1_0),esk2_0) != set_difference(cast_as_carrier_subset(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_13,plain,
( ~ one_sorted_str(X1)
| element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X18,X19] :
( subset_complement(X18,X19) = set_difference(X18,X19)
| ~ element(X19,powerset(X18)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
cnf(c_0_16,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) != set_difference(cast_as_carrier_subset(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X13] :
( cast_as_carrier_subset(X13) = the_carrier(X13)
| ~ one_sorted_str(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
cnf(c_0_19,negated_conjecture,
set_difference(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_16,c_0_17]),c_0_10])]) ).
cnf(c_0_20,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU308+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.15/0.43 % Computer : n016.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Mon Sep 21 06:14:53 UTC 2026
% 0.15/0.44 % CPUTime :
% 0.15/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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.26/0.56 % Version: 3.5.1
% 0.26/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % Starting sh5l with 300s (1) cores
% 0.26/0.56 % new_bool_1 with pid 1731017 completed with status 0
% 0.26/0.56 % Result found by new_bool_1
% 0.26/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.56 % Search class: FHUSF-FFMM31-SFFFFFNN
% 0.26/0.56 % partial match(1): FHUSF-FFMM32-SFFFFFNN
% 0.26/0.56 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.56 % SubtermCWHack with pid 1731021 completed with status 0
% 0.26/0.56 % Result found by SubtermCWHack
% 0.26/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.56 % Search class: FHUSF-FFMM31-SFFFFFNN
% 0.26/0.56 % partial match(1): FHUSF-FFMM32-SFFFFFNN
% 0.26/0.56 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.56 % Preprocessing time : 0.002 s
% 0.26/0.56
% 0.26/0.56 % Proof found!
% 0.26/0.56 % SZS status Theorem
% 0.26/0.56 % SZS output start CNFRefutation
% See solution above
% 0.26/0.56 % Parsed axioms : 53
% 0.26/0.56 % Removed by relevancy pruning/SinE : 27
% 0.26/0.56 % Initial clauses : 57
% 0.26/0.56 % Removed in clause preprocessing : 0
% 0.26/0.56 % Initial clauses in saturation : 57
% 0.26/0.56 % Processed clauses : 233
% 0.26/0.56 % ...of these trivial : 0
% 0.26/0.56 % ...subsumed : 101
% 0.26/0.56 % ...remaining for further processing : 132
% 0.26/0.56 % Other redundant clauses eliminated : 0
% 0.26/0.56 % Clauses deleted for lack of memory : 0
% 0.26/0.56 % Backward-subsumed : 1
% 0.26/0.56 % Backward-rewritten : 0
% 0.26/0.56 % Generated clauses : 233
% 0.26/0.56 % ...of the previous two non-redundant : 217
% 0.26/0.56 % ...aggressively subsumed : 0
% 0.26/0.56 % Contextual simplify-reflections : 1
% 0.26/0.56 % Paramodulations : 233
% 0.26/0.56 % Factorizations : 0
% 0.26/0.56 % NegExts : 0
% 0.26/0.56 % Equation resolutions : 0
% 0.26/0.56 % Disequality decompositions : 0
% 0.26/0.56 % Total rewrite steps : 13
% 0.26/0.56 % ...of those cached : 10
% 0.26/0.56 % Propositional unsat checks : 0
% 0.26/0.56 % Propositional check models : 0
% 0.26/0.56 % Propositional check unsatisfiable : 0
% 0.26/0.56 % Propositional clauses : 0
% 0.26/0.56 % Propositional clauses after purity: 0
% 0.26/0.56 % Propositional unsat core size : 0
% 0.26/0.56 % Propositional preprocessing time : 0.000
% 0.26/0.56 % Propositional encoding time : 0.000
% 0.26/0.56 % Propositional solver time : 0.000
% 0.26/0.56 % Success case prop preproc time : 0.000
% 0.26/0.56 % Success case prop encoding time : 0.000
% 0.26/0.56 % Success case prop solver time : 0.000
% 0.26/0.56 % Current number of processed clauses : 131
% 0.26/0.56 % Positive orientable unit clauses : 9
% 0.26/0.56 % Positive unorientable unit clauses: 0
% 0.26/0.56 % Negative unit clauses : 5
% 0.26/0.56 % Non-unit-clauses : 117
% 0.26/0.56 % Current number of unprocessed clauses: 41
% 0.26/0.56 % ...number of literals in the above : 154
% 0.26/0.56 % Current number of archived formulas : 0
% 0.26/0.56 % Current number of archived clauses : 1
% 0.26/0.56 % Clause-clause subsumption calls (NU) : 868
% 0.26/0.56 % Rec. Clause-clause subsumption calls : 845
% 0.26/0.56 % Non-unit clause-clause subsumptions : 102
% 0.26/0.56 % Unit Clause-clause subsumption calls : 6
% 0.26/0.56 % Rewrite failures with RHS unbound : 0
% 0.26/0.56 % BW rewrite match attempts : 0
% 0.26/0.56 % BW rewrite match successes : 0
% 0.26/0.56 % Condensation attempts : 0
% 0.26/0.56 % Condensation successes : 0
% 0.26/0.56 % Termbank termtop insertions : 6049
% 0.26/0.56 % Search garbage collected termcells : 590
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.019 s
% 0.26/0.56 % System time : 0.006 s
% 0.26/0.56 % Total time : 0.025 s
% 0.26/0.56 % Maximum resident set size: 3680 pages
% 0.26/0.56
% 0.26/0.56 % -------------------------------------------------
% 0.26/0.56 % User time : 0.024 s
% 0.26/0.56 % System time : 0.011 s
% 0.26/0.56 % Total time : 0.035 s
% 0.26/0.56 % Maximum resident set size: 4608 pages
% 0.26/0.56 % E exiting
%------------------------------------------------------------------------------