%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET586+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 : n012.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:26 PM UTC 2026
% Result : Theorem 0.08s 0.35s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 5 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 25 |; 6 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 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 : 56 ( 4 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_intersection_of_subset,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(intersection(X1,X3),intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_of_subset) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(intersection(X1,X3),intersection(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_intersection_of_subset]) ).
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(intersection(esk3_0,esk5_0),intersection(esk4_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,esk4_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,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(esk1_2(X1,esk4_0),esk3_0)
| subset(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
subset(intersection(esk3_0,X1),esk4_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(esk1_2(X1,intersection(X2,X3)),X2)
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| subset(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(X1,intersection(esk3_0,X2))
| member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(esk1_2(intersection(X1,X2),intersection(X3,X2)),X3)
| subset(intersection(X1,X2),intersection(X3,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( member(esk1_2(intersection(esk3_0,X1),X2),esk4_0)
| subset(intersection(esk3_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
~ subset(intersection(esk3_0,esk5_0),intersection(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
subset(intersection(esk3_0,X1),intersection(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET586+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Mon Sep 21 05:27:23 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.33 Running first-order theorem proving
% 0.08/0.33 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.08/0.35 % Version: 3.5.1
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.35 % Starting sh5l with 300s (1) cores
% 0.08/0.35 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1638106 completed with status 0
% 0.08/0.35 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.08/0.35 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.35 % Starting new_bool_1 with 136s (1) cores
% 0.08/0.35 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1638112 completed with status 0
% 0.08/0.35 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.35 % No SInE strategy applied
% 0.08/0.35 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.08/0.35 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.35 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.35 % Preprocessing time : 0.001 s
% 0.08/0.35
% 0.08/0.35 % Proof found!
% 0.08/0.35 % SZS status Theorem
% 0.08/0.35 % SZS output start CNFRefutation
% See solution above
% 0.08/0.35 % Parsed axioms : 6
% 0.08/0.35 % Removed by relevancy pruning/SinE : 0
% 0.08/0.35 % Initial clauses : 14
% 0.08/0.35 % Removed in clause preprocessing : 2
% 0.08/0.35 % Initial clauses in saturation : 12
% 0.08/0.35 % Processed clauses : 133
% 0.08/0.35 % ...of these trivial : 18
% 0.08/0.35 % ...subsumed : 40
% 0.08/0.35 % ...remaining for further processing : 75
% 0.08/0.35 % Other redundant clauses eliminated : 0
% 0.08/0.35 % Clauses deleted for lack of memory : 0
% 0.08/0.35 % Backward-subsumed : 0
% 0.08/0.35 % Backward-rewritten : 1
% 0.08/0.35 % Generated clauses : 542
% 0.08/0.35 % ...of the previous two non-redundant : 472
% 0.08/0.35 % ...aggressively subsumed : 0
% 0.08/0.35 % Contextual simplify-reflections : 3
% 0.08/0.35 % Paramodulations : 532
% 0.08/0.35 % Factorizations : 10
% 0.08/0.35 % NegExts : 0
% 0.08/0.35 % Equation resolutions : 0
% 0.08/0.35 % Disequality decompositions : 0
% 0.08/0.35 % Total rewrite steps : 79
% 0.08/0.35 % ...of those cached : 38
% 0.08/0.35 % Propositional unsat checks : 0
% 0.08/0.35 % Propositional check models : 0
% 0.08/0.35 % Propositional check unsatisfiable : 0
% 0.08/0.35 % Propositional clauses : 0
% 0.08/0.35 % Propositional clauses after purity: 0
% 0.08/0.35 % Propositional unsat core size : 0
% 0.08/0.35 % Propositional preprocessing time : 0.000
% 0.08/0.35 % Propositional encoding time : 0.000
% 0.08/0.35 % Propositional solver time : 0.000
% 0.08/0.35 % Success case prop preproc time : 0.000
% 0.08/0.35 % Success case prop encoding time : 0.000
% 0.08/0.35 % Success case prop solver time : 0.000
% 0.08/0.35 % Current number of processed clauses : 74
% 0.08/0.35 % Positive orientable unit clauses : 28
% 0.08/0.35 % Positive unorientable unit clauses: 1
% 0.08/0.35 % Negative unit clauses : 0
% 0.08/0.35 % Non-unit-clauses : 45
% 0.08/0.35 % Current number of unprocessed clauses: 351
% 0.08/0.35 % ...number of literals in the above : 798
% 0.08/0.35 % Current number of archived formulas : 0
% 0.08/0.35 % Current number of archived clauses : 1
% 0.08/0.35 % Clause-clause subsumption calls (NU) : 397
% 0.08/0.35 % Rec. Clause-clause subsumption calls : 371
% 0.08/0.35 % Non-unit clause-clause subsumptions : 43
% 0.08/0.35 % Unit Clause-clause subsumption calls : 47
% 0.08/0.35 % Rewrite failures with RHS unbound : 0
% 0.08/0.35 % BW rewrite match attempts : 46
% 0.08/0.35 % BW rewrite match successes : 5
% 0.08/0.35 % Condensation attempts : 0
% 0.08/0.35 % Condensation successes : 0
% 0.08/0.35 % Termbank termtop insertions : 7423
% 0.08/0.35 % Search garbage collected termcells : 255
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.010 s
% 0.08/0.35 % System time : 0.001 s
% 0.08/0.35 % Total time : 0.011 s
% 0.08/0.35 % Maximum resident set size: 3632 pages
% 0.08/0.35
% 0.08/0.35 % -------------------------------------------------
% 0.08/0.35 % User time : 0.045 s
% 0.08/0.35 % System time : 0.006 s
% 0.08/0.35 % Total time : 0.051 s
% 0.08/0.35 % Maximum resident set size: 4864 pages
% 0.08/0.35 % E exiting
%------------------------------------------------------------------------------