%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU308+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 : n015.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 5.12s 1.21s
% Output : CNFRefutation 5.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 43 ( 18 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 13 ~; 8 |; 3 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 29 ( 0 sgn 20 !; 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/sandbox/benchmark/theBenchmark.p',t17_pre_topc) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_pre_topc) ).
fof(dt_k2_subset_1,axiom,
! [X1] : element(cast_to_subset(X1),powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_subset_1) ).
fof(d4_subset_1,axiom,
! [X1] : cast_to_subset(X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_subset_1) ).
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/sandbox/benchmark/theBenchmark.p',redefinition_k6_subset_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(c_0_6,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_7,negated_conjecture,
( subset_complement(the_carrier(esk286_0),esk287_0) != subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),esk287_0)
& element(esk287_0,powerset(the_carrier(esk286_0)))
& one_sorted_str(esk286_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X335] :
( cast_as_carrier_subset(X335) = the_carrier(X335)
| ~ one_sorted_str(X335) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_9,plain,
! [X529] : element(cast_to_subset(X529),powerset(X529)),
inference(variable_rename,[status(thm)],[dt_k2_subset_1]) ).
fof(c_0_10,plain,
! [X385] : cast_to_subset(X385) = X385,
inference(variable_rename,[status(thm)],[d4_subset_1]) ).
cnf(c_0_11,negated_conjecture,
subset_complement(the_carrier(esk286_0),esk287_0) != subset_difference(the_carrier(esk286_0),cast_as_carrier_subset(esk286_0),esk287_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
one_sorted_str(esk286_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X796,X797,X798] :
( subset_difference(X796,X797,X798) = set_difference(X797,X798)
| ~ element(X798,powerset(X796))
| ~ element(X797,powerset(X796)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])])]) ).
cnf(c_0_15,plain,
element(cast_to_subset(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
cast_to_subset(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
subset_difference(the_carrier(esk286_0),the_carrier(esk286_0),esk287_0) != subset_complement(the_carrier(esk286_0),esk287_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_18,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_14]) ).
cnf(c_0_19,negated_conjecture,
element(esk287_0,powerset(the_carrier(esk286_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
element(X1,powerset(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,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])])]) ).
cnf(c_0_22,negated_conjecture,
subset_complement(the_carrier(esk286_0),esk287_0) != set_difference(the_carrier(esk286_0),esk287_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU308+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 06:13:21 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.42 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
% 5.12/1.21 % Version: 3.5.1
% 5.12/1.21 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.12/1.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.12/1.21 % Starting new_bool_3 with 600s (2) cores
% 5.12/1.21 % Starting new_bool_1 with 600s (2) cores
% 5.12/1.21 % Starting sh5l with 300s (1) cores
% 5.12/1.21 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 733030 completed with status 0
% 5.12/1.21 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 5.12/1.21 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.12/1.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.12/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.12/1.21 % No SInE strategy applied
% 5.12/1.21 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.12/1.21 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.12/1.21 % Starting SubtermCWHack with 82s (1) cores
% 5.12/1.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 5.12/1.21 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.12/1.21 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 733040 completed with status 0
% 5.12/1.21 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 5.12/1.21 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.12/1.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.12/1.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.12/1.21 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.12/1.21 % No SInE strategy applied
% 5.12/1.21 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.12/1.21 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.12/1.21 % Starting SubtermCWHack with 82s (1) cores
% 5.12/1.21 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 5.12/1.21 % Preprocessing time : 0.022 s
% 5.12/1.21 % Presaturation interreduction done
% 5.12/1.21
% 5.12/1.21 % Proof found!
% 5.12/1.21 % SZS status Theorem
% 5.12/1.21 % SZS output start CNFRefutation
% See solution above
% 5.12/1.21 % Parsed axioms : 495
% 5.12/1.21 % Removed by relevancy pruning/SinE : 0
% 5.12/1.21 % Initial clauses : 1884
% 5.12/1.21 % Removed in clause preprocessing : 40
% 5.12/1.21 % Initial clauses in saturation : 1844
% 5.12/1.21 % Processed clauses : 5732
% 5.12/1.21 % ...of these trivial : 55
% 5.12/1.21 % ...subsumed : 2051
% 5.12/1.21 % ...remaining for further processing : 3626
% 5.12/1.21 % Other redundant clauses eliminated : 525
% 5.12/1.21 % Clauses deleted for lack of memory : 0
% 5.12/1.21 % Backward-subsumed : 47
% 5.12/1.21 % Backward-rewritten : 53
% 5.12/1.21 % Generated clauses : 9618
% 5.12/1.21 % ...of the previous two non-redundant : 8290
% 5.12/1.21 % ...aggressively subsumed : 0
% 5.12/1.21 % Contextual simplify-reflections : 204
% 5.12/1.21 % Paramodulations : 9219
% 5.12/1.21 % Factorizations : 0
% 5.12/1.21 % NegExts : 0
% 5.12/1.21 % Equation resolutions : 528
% 5.12/1.21 % Disequality decompositions : 0
% 5.12/1.21 % Total rewrite steps : 2501
% 5.12/1.21 % ...of those cached : 2231
% 5.12/1.21 % Propositional unsat checks : 0
% 5.12/1.21 % Propositional check models : 0
% 5.12/1.21 % Propositional check unsatisfiable : 0
% 5.12/1.21 % Propositional clauses : 0
% 5.12/1.21 % Propositional clauses after purity: 0
% 5.12/1.21 % Propositional unsat core size : 0
% 5.12/1.21 % Propositional preprocessing time : 0.000
% 5.12/1.21 % Propositional encoding time : 0.000
% 5.12/1.21 % Propositional solver time : 0.000
% 5.12/1.21 % Success case prop preproc time : 0.000
% 5.12/1.21 % Success case prop encoding time : 0.000
% 5.12/1.21 % Success case prop solver time : 0.000
% 5.12/1.21 % Current number of processed clauses : 1459
% 5.12/1.21 % Positive orientable unit clauses : 173
% 5.12/1.21 % Positive unorientable unit clauses: 3
% 5.12/1.21 % Negative unit clauses : 229
% 5.12/1.21 % Non-unit-clauses : 1054
% 5.12/1.21 % Current number of unprocessed clauses: 5906
% 5.12/1.21 % ...number of literals in the above : 18873
% 5.12/1.21 % Current number of archived formulas : 0
% 5.12/1.21 % Current number of archived clauses : 1803
% 5.12/1.21 % Clause-clause subsumption calls (NU) : 2098930
% 5.12/1.21 % Rec. Clause-clause subsumption calls : 459124
% 5.12/1.21 % Non-unit clause-clause subsumptions : 1380
% 5.12/1.21 % Unit Clause-clause subsumption calls : 12803
% 5.12/1.21 % Rewrite failures with RHS unbound : 0
% 5.12/1.21 % BW rewrite match attempts : 102
% 5.12/1.21 % BW rewrite match successes : 67
% 5.12/1.21 % Condensation attempts : 0
% 5.12/1.21 % Condensation successes : 0
% 5.12/1.21 % Termbank termtop insertions : 247503
% 5.12/1.21 % Search garbage collected termcells : 25761
% 5.12/1.21
% 5.12/1.21 % -------------------------------------------------
% 5.12/1.21 % User time : 0.728 s
% 5.12/1.21 % System time : 0.020 s
% 5.12/1.21 % Total time : 0.748 s
% 5.12/1.21 % Maximum resident set size: 8884 pages
% 5.12/1.21
% 5.12/1.21 % -------------------------------------------------
% 5.12/1.21 % User time : 1.996 s
% 5.12/1.21 % System time : 0.066 s
% 5.12/1.21 % Total time : 2.061 s
% 5.12/1.21 % Maximum resident set size: 5120 pages
% 5.12/1.21 % E exiting
%------------------------------------------------------------------------------