%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU307+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 : n006.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.15s 10.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 57 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 18 ~; 15 |; 5 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 25 !; 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(l71_subset_1,lemma,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_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(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_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,
! [X35] :
( cast_as_carrier_subset(X35) = the_carrier(X35)
| ~ one_sorted_str(X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])])]) ).
fof(c_0_9,lemma,
! [X45,X46] :
( ( element(X45,powerset(X46))
| ~ in(esk4_2(X45,X46),X46) )
& ( element(X45,powerset(X46))
| in(esk4_2(X45,X46),X45) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l71_subset_1])])])])]) ).
cnf(c_0_10,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_11,plain,
( ~ one_sorted_str(X1)
| cast_as_carrier_subset(X1) = the_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,plain,
! [X32,X33,X34] :
( subset_intersection2(X32,X33,X34) = set_intersection2(X33,X34)
| ~ element(X34,powerset(X32))
| ~ element(X33,powerset(X32)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_subset_1])])]) ).
cnf(c_0_14,lemma,
( ~ in(esk4_2(X1,X2),X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,lemma,
( element(X1,powerset(X2))
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,plain,
! [X56,X57] :
( ( element(X56,powerset(X57))
| ~ subset(X56,X57) )
& ( subset(X56,X57)
| ~ element(X56,powerset(X57)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_17,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_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,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_13]) ).
cnf(c_0_19,lemma,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_21,lemma,
! [X101,X102] :
( set_intersection2(X101,X102) = X101
| ~ subset(X101,X102) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).
cnf(c_0_22,plain,
( ~ element(X1,powerset(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,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_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,lemma,
( ~ subset(X1,X2)
| set_intersection2(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
subset(esk2_0,the_carrier(esk1_0)),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_26,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU307+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/10.38 % Computer : n006.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Mon Sep 21 06:09:53 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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.15/10.50 % Version: 3.5.1
% 0.15/10.50 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.15/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.50 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.15/10.50 % Starting new_bool_3 with 600s (2) cores
% 0.15/10.50 % Starting new_bool_1 with 600s (2) cores
% 0.15/10.50 % Starting sh5l with 300s (1) cores
% 0.15/10.50 % new_bool_1 with pid 2159571 completed with status 0
% 0.15/10.50 % Result found by new_bool_1
% 0.15/10.50 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.15/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.50 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.15/10.50 % Starting new_bool_3 with 600s (2) cores
% 0.15/10.50 % Starting new_bool_1 with 600s (2) cores
% 0.15/10.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.50 % Search class: FGHSM-FSLM31-SFFFFFNN
% 0.15/10.50 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.15/10.50 % Starting SubtermCWHack with 55s (1) cores
% 0.15/10.50 % Starting new_bool_1 with 61s (1) cores
% 0.15/10.50 % SubtermCWHack with pid 2159574 completed with status 0
% 0.15/10.50 % Result found by SubtermCWHack
% 0.15/10.50 % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.15/10.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.50 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.15/10.50 % Starting new_bool_3 with 600s (2) cores
% 0.15/10.50 % Starting new_bool_1 with 600s (2) cores
% 0.15/10.50 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.50 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.50 % Search class: FGHSM-FSLM31-SFFFFFNN
% 0.15/10.50 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.15/10.50 % Starting SubtermCWHack with 55s (1) cores
% 0.15/10.50 % Preprocessing time : 0.005 s
% 0.15/10.50
% 0.15/10.50 % Proof found!
% 0.15/10.50 % SZS status Theorem
% 0.15/10.50 % SZS output start CNFRefutation
% See solution above
% 0.15/10.50 % Parsed axioms : 489
% 0.15/10.50 % Removed by relevancy pruning/SinE : 409
% 0.15/10.50 % Initial clauses : 259
% 0.15/10.50 % Removed in clause preprocessing : 2
% 0.15/10.50 % Initial clauses in saturation : 257
% 0.15/10.50 % Processed clauses : 661
% 0.15/10.50 % ...of these trivial : 16
% 0.15/10.50 % ...subsumed : 368
% 0.15/10.50 % ...remaining for further processing : 277
% 0.15/10.50 % Other redundant clauses eliminated : 18
% 0.15/10.50 % Clauses deleted for lack of memory : 0
% 0.15/10.50 % Backward-subsumed : 4
% 0.15/10.50 % Backward-rewritten : 11
% 0.15/10.50 % Generated clauses : 1715
% 0.15/10.50 % ...of the previous two non-redundant : 1259
% 0.15/10.50 % ...aggressively subsumed : 0
% 0.15/10.50 % Contextual simplify-reflections : 0
% 0.15/10.50 % Paramodulations : 1690
% 0.15/10.50 % Factorizations : 2
% 0.15/10.50 % NegExts : 0
% 0.15/10.50 % Equation resolutions : 20
% 0.15/10.50 % Disequality decompositions : 0
% 0.15/10.50 % Total rewrite steps : 527
% 0.15/10.50 % ...of those cached : 454
% 0.15/10.50 % Propositional unsat checks : 0
% 0.15/10.50 % Propositional check models : 0
% 0.15/10.50 % Propositional check unsatisfiable : 0
% 0.15/10.50 % Propositional clauses : 0
% 0.15/10.50 % Propositional clauses after purity: 0
% 0.15/10.50 % Propositional unsat core size : 0
% 0.15/10.50 % Propositional preprocessing time : 0.000
% 0.15/10.50 % Propositional encoding time : 0.000
% 0.15/10.50 % Propositional solver time : 0.000
% 0.15/10.50 % Success case prop preproc time : 0.000
% 0.15/10.50 % Success case prop encoding time : 0.000
% 0.15/10.50 % Success case prop solver time : 0.000
% 0.15/10.50 % Current number of processed clauses : 249
% 0.15/10.50 % Positive orientable unit clauses : 50
% 0.15/10.50 % Positive unorientable unit clauses: 1
% 0.15/10.50 % Negative unit clauses : 22
% 0.15/10.50 % Non-unit-clauses : 176
% 0.15/10.50 % Current number of unprocessed clauses: 853
% 0.15/10.50 % ...number of literals in the above : 2773
% 0.15/10.50 % Current number of archived formulas : 0
% 0.15/10.50 % Current number of archived clauses : 18
% 0.15/10.50 % Clause-clause subsumption calls (NU) : 5489
% 0.15/10.50 % Rec. Clause-clause subsumption calls : 4540
% 0.15/10.50 % Non-unit clause-clause subsumptions : 287
% 0.15/10.50 % Unit Clause-clause subsumption calls : 202
% 0.15/10.50 % Rewrite failures with RHS unbound : 0
% 0.15/10.50 % BW rewrite match attempts : 46
% 0.15/10.50 % BW rewrite match successes : 14
% 0.15/10.50 % Condensation attempts : 0
% 0.15/10.50 % Condensation successes : 0
% 0.15/10.50 % Termbank termtop insertions : 35255
% 0.15/10.50 % Search garbage collected termcells : 6672
% 0.15/10.50
% 0.15/10.50 % -------------------------------------------------
% 0.15/10.50 % User time : 0.044 s
% 0.15/10.50 % System time : 0.008 s
% 0.15/10.50 % Total time : 0.052 s
% 0.15/10.50 % Maximum resident set size: 5040 pages
% 0.15/10.50
% 0.15/10.50 % -------------------------------------------------
% 0.15/10.50 % User time : 0.084 s
% 0.15/10.50 % System time : 0.018 s
% 0.15/10.50 % Total time : 0.102 s
% 0.15/10.50 % Maximum resident set size: 5376 pages
% 0.15/10.50 % E exiting
%------------------------------------------------------------------------------