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