%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET199+4 : 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 : n014.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.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 88 ( 36 ~; 38 |; 9 &)
% ( 4 <=>; 1 =>; 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 : 48 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI46,conjecture,
! [X1,X3,X5] :
( ( subset(X1,X5)
& subset(X1,X3) )
<=> subset(X1,intersection(X3,X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI46) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X3,X5] :
( ( subset(X1,X5)
& subset(X1,X3) )
<=> subset(X1,intersection(X3,X5)) ),
inference(assume_negation,[status(cth)],[thI46]) ).
fof(c_0_4,plain,
! [X9,X10,X11,X12,X13] :
( ( subset(X12,X13)
| ~ member(esk4_2(X12,X13),X13) )
& ( subset(X12,X13)
| member(esk4_2(X12,X13),X12) )
& ( member(X11,X10)
| ~ member(X11,X9)
| ~ subset(X9,X10) ) ),
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])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ( subset(esk1_0,intersection(esk2_0,esk3_0))
| subset(esk1_0,esk3_0) )
& ( subset(esk1_0,intersection(esk2_0,esk3_0))
| subset(esk1_0,esk2_0) )
& ( ~ subset(esk1_0,intersection(esk2_0,esk3_0))
| ~ subset(esk1_0,esk3_0)
| ~ subset(esk1_0,esk2_0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X15,X16,X17] :
( ( member(X15,intersection(X16,X17))
| ~ member(X15,X17)
| ~ member(X15,X16) )
& ( ~ member(X15,intersection(X16,X17))
| member(X15,X17) )
& ( ~ member(X15,intersection(X16,X17))
| member(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
cnf(c_0_7,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( subset(esk1_0,intersection(esk2_0,esk3_0))
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ member(X1,esk1_0)
| subset(esk1_0,esk2_0)
| member(X1,intersection(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( subset(esk1_0,intersection(esk2_0,esk3_0))
| subset(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ member(esk4_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]) ).
cnf(c_0_14,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(X1,esk1_0)
| subset(esk1_0,esk3_0)
| member(X1,intersection(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(esk4_2(X1,esk2_0),esk1_0)
| subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7]) ).
cnf(c_0_20,plain,
( ~ member(esk4_2(X1,intersection(X2,X3)),X2)
| ~ member(esk4_2(X1,intersection(X2,X3)),X3)
| subset(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ subset(esk1_0,intersection(esk2_0,esk3_0))
| ~ subset(esk1_0,esk3_0)
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk4_2(X1,esk3_0),esk1_0)
| subset(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(esk4_2(X1,intersection(X2,esk3_0)),X2)
| ~ member(esk4_2(X1,intersection(X2,esk3_0)),esk1_0)
| subset(X1,intersection(X2,esk3_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( ~ subset(esk1_0,esk3_0)
| ~ subset(esk1_0,intersection(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
subset(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk4_2(esk1_0,intersection(X1,esk3_0)),X1)
| subset(esk1_0,intersection(X1,esk3_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
~ subset(esk1_0,intersection(esk2_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
~ member(esk4_2(esk1_0,intersection(esk2_0,esk3_0)),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_18]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET199+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.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:00:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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.13/0.48 % Version: 3.5.1
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % new_bool_1 with pid 3190679 completed with status 0
% 0.13/0.48 % Result found by new_bool_1
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.48 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.13/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.48 % SubtermCWHack with pid 3190685 completed with status 0
% 0.13/0.48 % Result found by SubtermCWHack
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.48 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.13/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.48 % Preprocessing time : 0.001 s
% 0.13/0.48
% 0.13/0.48 % Proof found!
% 0.13/0.48 % SZS status Theorem
% 0.13/0.48 % SZS output start CNFRefutation
% See solution above
% 0.13/0.48 % Parsed axioms : 12
% 0.13/0.48 % Removed by relevancy pruning/SinE : 9
% 0.13/0.48 % Initial clauses : 9
% 0.13/0.48 % Removed in clause preprocessing : 0
% 0.13/0.48 % Initial clauses in saturation : 9
% 0.13/0.48 % Processed clauses : 761
% 0.13/0.48 % ...of these trivial : 11
% 0.13/0.48 % ...subsumed : 376
% 0.13/0.48 % ...remaining for further processing : 374
% 0.13/0.48 % Other redundant clauses eliminated : 0
% 0.13/0.48 % Clauses deleted for lack of memory : 0
% 0.13/0.48 % Backward-subsumed : 0
% 0.13/0.48 % Backward-rewritten : 7
% 0.13/0.48 % Generated clauses : 2328
% 0.13/0.48 % ...of the previous two non-redundant : 2205
% 0.13/0.48 % ...aggressively subsumed : 0
% 0.13/0.48 % Contextual simplify-reflections : 2
% 0.13/0.48 % Paramodulations : 2328
% 0.13/0.48 % Factorizations : 0
% 0.13/0.48 % NegExts : 0
% 0.13/0.48 % Equation resolutions : 0
% 0.13/0.48 % Disequality decompositions : 0
% 0.13/0.48 % Total rewrite steps : 120
% 0.13/0.48 % ...of those cached : 11
% 0.13/0.48 % Propositional unsat checks : 0
% 0.13/0.48 % Propositional check models : 0
% 0.13/0.48 % Propositional check unsatisfiable : 0
% 0.13/0.48 % Propositional clauses : 0
% 0.13/0.48 % Propositional clauses after purity: 0
% 0.13/0.48 % Propositional unsat core size : 0
% 0.13/0.48 % Propositional preprocessing time : 0.000
% 0.13/0.48 % Propositional encoding time : 0.000
% 0.13/0.48 % Propositional solver time : 0.000
% 0.13/0.48 % Success case prop preproc time : 0.000
% 0.13/0.48 % Success case prop encoding time : 0.000
% 0.13/0.48 % Success case prop solver time : 0.000
% 0.13/0.48 % Current number of processed clauses : 367
% 0.13/0.48 % Positive orientable unit clauses : 229
% 0.13/0.48 % Positive unorientable unit clauses: 0
% 0.13/0.48 % Negative unit clauses : 2
% 0.13/0.48 % Non-unit-clauses : 136
% 0.13/0.48 % Current number of unprocessed clauses: 1447
% 0.13/0.48 % ...number of literals in the above : 2913
% 0.13/0.48 % Current number of archived formulas : 0
% 0.13/0.48 % Current number of archived clauses : 7
% 0.13/0.48 % Clause-clause subsumption calls (NU) : 3979
% 0.13/0.48 % Rec. Clause-clause subsumption calls : 3972
% 0.13/0.48 % Non-unit clause-clause subsumptions : 378
% 0.13/0.48 % Unit Clause-clause subsumption calls : 2595
% 0.13/0.48 % Rewrite failures with RHS unbound : 0
% 0.13/0.48 % BW rewrite match attempts : 2650
% 0.13/0.48 % BW rewrite match successes : 2
% 0.13/0.48 % Condensation attempts : 0
% 0.13/0.48 % Condensation successes : 0
% 0.13/0.48 % Termbank termtop insertions : 40327
% 0.13/0.48 % Search garbage collected termcells : 253
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.042 s
% 0.13/0.48 % System time : 0.008 s
% 0.13/0.48 % Total time : 0.050 s
% 0.13/0.48 % Maximum resident set size: 3648 pages
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.044 s
% 0.13/0.48 % System time : 0.012 s
% 0.13/0.48 % Total time : 0.056 s
% 0.13/0.48 % Maximum resident set size: 4608 pages
% 0.13/0.48 % E exiting
%------------------------------------------------------------------------------