%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU307+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 : n003.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:55 PM UTC 2026
% Result : Theorem 0.26s 0.64s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 52 ( 16 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 43 ( 18 ~; 13 |; 4 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 37 ( 1 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t15_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t15_pre_topc) ).
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(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(redefinition_k5_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
inference(assume_negation,[status(cth)],[t15_pre_topc]) ).
fof(c_0_7,negated_conjecture,
( subset_intersection2(the_carrier(esk1_0),esk2_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_6])])])]) ).
fof(c_0_8,plain,
! [X19] :
( cast_as_carrier_subset(X19) = the_carrier(X19)
| ~ one_sorted_str(X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_9,plain,
! [X98,X99] :
( ( element(X98,powerset(X99))
| ~ subset(X98,X99) )
& ( subset(X98,X99)
| ~ element(X98,powerset(X99)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_10,plain,
! [X97] : subset(X97,X97),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_11,plain,
! [X74,X75] :
( set_intersection2(X74,X75) = X74
| ~ subset(X74,X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).
cnf(c_0_12,negated_conjecture,
subset_intersection2(the_carrier(esk1_0),esk2_0,cast_as_carrier_subset(esk1_0)) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X12,X13,X14] :
( subset_intersection2(X12,X13,X14) = set_intersection2(X13,X14)
| ~ element(X14,powerset(X12))
| ~ element(X13,powerset(X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_subset_1])])]) ).
cnf(c_0_16,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( ~ subset(X1,X2)
| set_intersection2(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
subset_intersection2(the_carrier(esk1_0),esk2_0,the_carrier(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_21,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_intersection2(X2,X1,X3) = set_intersection2(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
( ~ element(X1,powerset(X2))
| set_intersection2(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
set_intersection2(esk2_0,the_carrier(esk1_0)) != esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_23]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU307+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n003.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 06:11:32 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.52 Running first-order theorem proving
% 0.18/0.52 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.64 % Version: 3.5.1
% 0.26/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % Starting sh5l with 300s (1) cores
% 0.26/0.64 % sh5l with pid 3581685 completed with status 0
% 0.26/0.64 % Result found by sh5l
% 0.26/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % Starting sh5l with 300s (1) cores
% 0.26/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.64 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.26/0.64 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.64 % SubtermCWHack with pid 3581693 completed with status 0
% 0.26/0.64 % Result found by SubtermCWHack
% 0.26/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.64 % Starting sh5l with 300s (1) cores
% 0.26/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.64 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.64 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.26/0.64 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.64 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.64 % Preprocessing time : 0.003 s
% 0.26/0.64
% 0.26/0.64 % Proof found!
% 0.26/0.64 % SZS status Theorem
% 0.26/0.64 % SZS output start CNFRefutation
% See solution above
% 0.26/0.64 % Parsed axioms : 59
% 0.26/0.64 % Removed by relevancy pruning/SinE : 6
% 0.26/0.64 % Initial clauses : 112
% 0.26/0.64 % Removed in clause preprocessing : 0
% 0.26/0.64 % Initial clauses in saturation : 112
% 0.26/0.64 % Processed clauses : 440
% 0.26/0.64 % ...of these trivial : 1
% 0.26/0.64 % ...subsumed : 153
% 0.26/0.64 % ...remaining for further processing : 286
% 0.26/0.64 % Other redundant clauses eliminated : 0
% 0.26/0.64 % Clauses deleted for lack of memory : 0
% 0.26/0.64 % Backward-subsumed : 0
% 0.26/0.64 % Backward-rewritten : 6
% 0.26/0.64 % Generated clauses : 537
% 0.26/0.64 % ...of the previous two non-redundant : 420
% 0.26/0.64 % ...aggressively subsumed : 0
% 0.26/0.64 % Contextual simplify-reflections : 0
% 0.26/0.64 % Paramodulations : 537
% 0.26/0.64 % Factorizations : 0
% 0.26/0.64 % NegExts : 0
% 0.26/0.64 % Equation resolutions : 0
% 0.26/0.64 % Disequality decompositions : 0
% 0.26/0.64 % Total rewrite steps : 136
% 0.26/0.64 % ...of those cached : 122
% 0.26/0.64 % Propositional unsat checks : 0
% 0.26/0.64 % Propositional check models : 0
% 0.26/0.64 % Propositional check unsatisfiable : 0
% 0.26/0.64 % Propositional clauses : 0
% 0.26/0.64 % Propositional clauses after purity: 0
% 0.26/0.64 % Propositional unsat core size : 0
% 0.26/0.64 % Propositional preprocessing time : 0.000
% 0.26/0.64 % Propositional encoding time : 0.000
% 0.26/0.64 % Propositional solver time : 0.000
% 0.26/0.64 % Success case prop preproc time : 0.000
% 0.26/0.64 % Success case prop encoding time : 0.000
% 0.26/0.64 % Success case prop solver time : 0.000
% 0.26/0.64 % Current number of processed clauses : 280
% 0.26/0.64 % Positive orientable unit clauses : 22
% 0.26/0.64 % Positive unorientable unit clauses: 1
% 0.26/0.64 % Negative unit clauses : 5
% 0.26/0.64 % Non-unit-clauses : 252
% 0.26/0.64 % Current number of unprocessed clauses: 90
% 0.26/0.64 % ...number of literals in the above : 299
% 0.26/0.64 % Current number of archived formulas : 0
% 0.26/0.64 % Current number of archived clauses : 6
% 0.26/0.64 % Clause-clause subsumption calls (NU) : 15391
% 0.26/0.64 % Rec. Clause-clause subsumption calls : 14400
% 0.26/0.64 % Non-unit clause-clause subsumptions : 153
% 0.26/0.64 % Unit Clause-clause subsumption calls : 6
% 0.26/0.64 % Rewrite failures with RHS unbound : 0
% 0.26/0.64 % BW rewrite match attempts : 12
% 0.26/0.64 % BW rewrite match successes : 7
% 0.26/0.64 % Condensation attempts : 0
% 0.26/0.64 % Condensation successes : 0
% 0.26/0.64 % Termbank termtop insertions : 11228
% 0.26/0.64 % Search garbage collected termcells : 875
% 0.26/0.64
% 0.26/0.64 % -------------------------------------------------
% 0.26/0.64 % User time : 0.040 s
% 0.26/0.64 % System time : 0.005 s
% 0.26/0.64 % Total time : 0.045 s
% 0.26/0.64 % Maximum resident set size: 3912 pages
% 0.26/0.64
% 0.26/0.64 % -------------------------------------------------
% 0.26/0.64 % User time : 0.041 s
% 0.26/0.64 % System time : 0.014 s
% 0.26/0.64 % Total time : 0.055 s
% 0.26/0.64 % Maximum resident set size: 4864 pages
% 0.26/0.64 % E exiting
%------------------------------------------------------------------------------