%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:13:53 PM UTC 2026
% Result : Theorem 0.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 4 unt; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 18 ~; 21 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_intersection_of_subsets,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X3)
& subset(X1,X2) )
=> subset(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_intersection_of_subsets) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X3)
& subset(X1,X2) )
=> subset(X1,intersection(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_intersection_of_subsets]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X11] :
( ( subset(X10,X11)
| ~ member(esk1_2(X10,X11),X11) )
& ( subset(X10,X11)
| member(esk1_2(X10,X11),X10) )
& ( member(X9,X8)
| ~ member(X9,X7)
| ~ subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_defn])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ subset(esk3_0,intersection(esk4_0,esk5_0))
& subset(esk3_0,esk5_0)
& subset(esk3_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ( member(X6,intersection(X4,X5))
| ~ member(X6,X5)
| ~ member(X6,X4) )
& ( ~ member(X6,intersection(X4,X5))
| member(X6,X5) )
& ( ~ member(X6,intersection(X4,X5))
| member(X6,X4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( member(esk1_2(esk3_0,X1),esk5_0)
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(esk1_2(esk3_0,X1),X2)
| member(esk1_2(esk3_0,X1),intersection(X2,esk5_0))
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( member(esk1_2(esk3_0,X1),esk4_0)
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_17,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( member(esk1_2(esk3_0,X1),intersection(esk4_0,esk5_0))
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ subset(esk3_0,intersection(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 05:00:24 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 0.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 74371 completed with status 0
% 0.10/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.45 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.45 % new_bool_3 with pid 74382 completed with status 0
% 0.10/0.45 % Result found by new_bool_3
% 0.10/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.45 % No SInE strategy applied
% 0.10/0.45 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.45 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.45 % Preprocessing time : 0.001 s
% 0.10/0.45 % Presaturation interreduction done
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 6
% 0.10/0.45 % Removed by relevancy pruning/SinE : 0
% 0.10/0.45 % Initial clauses : 15
% 0.10/0.45 % Removed in clause preprocessing : 2
% 0.10/0.45 % Initial clauses in saturation : 13
% 0.10/0.45 % Processed clauses : 47
% 0.10/0.45 % ...of these trivial : 1
% 0.10/0.45 % ...subsumed : 8
% 0.10/0.45 % ...remaining for further processing : 38
% 0.10/0.45 % Other redundant clauses eliminated : 0
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 0
% 0.10/0.45 % Backward-rewritten : 0
% 0.10/0.45 % Generated clauses : 66
% 0.10/0.45 % ...of the previous two non-redundant : 53
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 64
% 0.10/0.45 % Factorizations : 2
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 0
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 8
% 0.10/0.45 % ...of those cached : 2
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 25
% 0.10/0.45 % Positive orientable unit clauses : 6
% 0.10/0.45 % Positive unorientable unit clauses: 1
% 0.10/0.45 % Negative unit clauses : 1
% 0.10/0.45 % Non-unit-clauses : 17
% 0.10/0.45 % Current number of unprocessed clauses: 29
% 0.10/0.45 % ...number of literals in the above : 76
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 13
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 42
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 40
% 0.10/0.45 % Non-unit clause-clause subsumptions : 8
% 0.10/0.45 % Unit Clause-clause subsumption calls : 7
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 13
% 0.10/0.45 % BW rewrite match successes : 4
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 1664
% 0.10/0.45 % Search garbage collected termcells : 265
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.005 s
% 0.10/0.45 % System time : 0.005 s
% 0.10/0.45 % Total time : 0.010 s
% 0.10/0.45 % Maximum resident set size: 3376 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.024 s
% 0.10/0.45 % System time : 0.015 s
% 0.10/0.45 % Total time : 0.040 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------