%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET585+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:14:25 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 11 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 3 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_intersection_subset_of_union,conjecture,
! [X1,X2,X3] : subset(intersection(X1,X2),union(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).
fof(transitivity_of_subset,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_subset) ).
fof(subset_of_union,axiom,
! [X1,X2] : subset(X1,union(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).
fof(intersection_is_subset,axiom,
! [X1,X2] : subset(intersection(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_is_subset) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] : subset(intersection(X1,X2),union(X1,X3)),
inference(assume_negation,[status(cth)],[prove_intersection_subset_of_union]) ).
fof(c_0_5,plain,
! [X7,X8,X9] :
( subset(X7,X9)
| ~ subset(X8,X9)
| ~ subset(X7,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_subset])])]) ).
fof(c_0_6,plain,
! [X10,X11] : subset(X10,union(X10,X11)),
inference(variable_rename,[status(thm)],[subset_of_union]) ).
fof(c_0_7,negated_conjecture,
~ subset(intersection(esk1_0,esk2_0),union(esk1_0,esk3_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
subset(X1,union(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X12,X13] : subset(intersection(X12,X13),X12),
inference(variable_rename,[status(thm)],[intersection_is_subset]) ).
cnf(c_0_11,negated_conjecture,
~ subset(intersection(esk1_0,esk2_0),union(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ subset(X1,X2)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
subset(intersection(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET585+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:30:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % sh5l with pid 649564 completed with status 0
% 0.10/0.43 % Result found by sh5l
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FGUSM-FFSF22-SFFFFFNN
% 0.10/0.43 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 649566 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FGUSM-FFSF22-SFFFFFNN
% 0.10/0.43 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 11
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 20
% 0.10/0.43 % Removed in clause preprocessing : 2
% 0.10/0.43 % Initial clauses in saturation : 18
% 0.10/0.43 % Processed clauses : 39
% 0.10/0.43 % ...of these trivial : 8
% 0.10/0.43 % ...subsumed : 8
% 0.10/0.43 % ...remaining for further processing : 23
% 0.10/0.43 % Other redundant clauses eliminated : 0
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 0
% 0.10/0.43 % Generated clauses : 78
% 0.10/0.43 % ...of the previous two non-redundant : 54
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 78
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 0
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 26
% 0.10/0.43 % ...of those cached : 8
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 23
% 0.10/0.43 % Positive orientable unit clauses : 9
% 0.10/0.43 % Positive unorientable unit clauses: 2
% 0.10/0.43 % Negative unit clauses : 1
% 0.10/0.43 % Non-unit-clauses : 11
% 0.10/0.43 % Current number of unprocessed clauses: 33
% 0.10/0.43 % ...number of literals in the above : 62
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 0
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 20
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 20
% 0.10/0.43 % Non-unit clause-clause subsumptions : 8
% 0.10/0.43 % Unit Clause-clause subsumption calls : 0
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 8
% 0.10/0.43 % BW rewrite match successes : 4
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 1689
% 0.10/0.43 % Search garbage collected termcells : 291
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.001 s
% 0.10/0.43 % Total time : 0.006 s
% 0.10/0.43 % Maximum resident set size: 3636 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.007 s
% 0.10/0.43 % System time : 0.005 s
% 0.10/0.43 % Total time : 0.012 s
% 0.10/0.43 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------