%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET014+4 : 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 : n008.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:03 PM UTC 2026
% Result : Theorem 0.10s 0.46s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 33 ( 3 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 100 ( 42 ~; 45 |; 8 &)
% ( 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 : 46 ( 4 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI45,conjecture,
! [X1,X3,X5] :
( ( subset(X5,X1)
& subset(X3,X1) )
<=> subset(union(X3,X5),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI45) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X3,X5] :
( ( subset(X5,X1)
& subset(X3,X1) )
<=> subset(union(X3,X5),X1) ),
inference(assume_negation,[status(cth)],[thI45]) ).
fof(c_0_4,plain,
! [X6,X7,X8,X9,X10] :
( ( subset(X9,X10)
| ~ member(esk1_2(X9,X10),X10) )
& ( subset(X9,X10)
| member(esk1_2(X9,X10),X9) )
& ( member(X8,X7)
| ~ member(X8,X6)
| ~ subset(X6,X7) ) ),
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,plain,
! [X19,X20,X21] :
( ( member(X19,union(X20,X21))
| ~ member(X19,X21) )
& ( member(X19,union(X20,X21))
| ~ member(X19,X20) )
& ( member(X19,X21)
| member(X19,X20)
| ~ member(X19,union(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
fof(c_0_6,negated_conjecture,
( ( subset(union(esk5_0,esk6_0),esk4_0)
| subset(esk6_0,esk4_0) )
& ( subset(union(esk5_0,esk6_0),esk4_0)
| subset(esk5_0,esk4_0) )
& ( ~ subset(union(esk5_0,esk6_0),esk4_0)
| ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_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])])])])]) ).
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,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ subset(union(esk5_0,esk6_0),esk4_0)
| ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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,plain,
( ~ subset(union(X4,X3),X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( subset(union(esk5_0,esk6_0),esk4_0)
| subset(esk6_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_0)
| member(esk1_2(union(esk5_0,esk6_0),esk4_0),union(esk5_0,esk6_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,esk6_0)
| member(X1,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_0)
| member(esk1_2(union(esk5_0,esk6_0),esk4_0),esk6_0)
| member(esk1_2(union(esk5_0,esk6_0),esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_0)
| ~ member(esk1_2(union(esk5_0,esk6_0),esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ subset(esk6_0,esk4_0)
| ~ subset(esk5_0,esk4_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_7]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ subset(esk5_0,esk4_0)
| member(esk1_2(esk6_0,esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_21,negated_conjecture,
( ~ subset(esk5_0,esk4_0)
| ~ member(esk1_2(esk6_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_2(esk5_0,esk4_0),esk4_0)
| member(esk1_2(esk6_0,esk4_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(esk1_2(esk5_0,esk4_0),esk4_0)
| ~ member(esk1_2(esk6_0,esk4_0),esk4_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,plain,
( ~ subset(union(X3,X4),X2)
| ~ member(X1,X3)
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( subset(union(esk5_0,esk6_0),esk4_0)
| subset(esk5_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_27,negated_conjecture,
( member(esk1_2(esk6_0,esk4_0),esk6_0)
| member(esk1_2(esk5_0,esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(esk1_2(esk6_0,esk4_0),esk4_0)
| member(esk1_2(esk5_0,esk4_0),esk5_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_29,negated_conjecture,
~ member(esk1_2(esk5_0,esk4_0),esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,esk5_0)
| member(X1,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_7]) ).
cnf(c_0_31,negated_conjecture,
member(esk1_2(esk5_0,esk4_0),esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_27]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET014+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n008.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.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 04:42:53 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 163194 completed with status 0
% 0.10/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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: FGHSF-FFMF21-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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.45 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.10/0.46 % G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with pid 163205 completed with status 0
% 0.10/0.46 % Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N
% 0.10/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.46 % No SInE strategy applied
% 0.10/0.46 % Search class: FGHSF-FFMF21-SFFFFFNN
% 0.10/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.46 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.10/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.46 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S033N with 136s (1) cores
% 0.10/0.46 % Preprocessing time : 0.002 s
% 0.10/0.46 % Presaturation interreduction done
% 0.10/0.46
% 0.10/0.46 % Proof found!
% 0.10/0.46 % SZS status Theorem
% 0.10/0.46 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46 % Parsed axioms : 12
% 0.10/0.46 % Removed by relevancy pruning/SinE : 0
% 0.10/0.46 % Initial clauses : 32
% 0.10/0.46 % Removed in clause preprocessing : 0
% 0.10/0.46 % Initial clauses in saturation : 32
% 0.10/0.46 % Processed clauses : 158
% 0.10/0.46 % ...of these trivial : 0
% 0.10/0.46 % ...subsumed : 19
% 0.10/0.46 % ...remaining for further processing : 139
% 0.10/0.46 % Other redundant clauses eliminated : 3
% 0.10/0.46 % Clauses deleted for lack of memory : 0
% 0.10/0.46 % Backward-subsumed : 14
% 0.10/0.46 % Backward-rewritten : 2
% 0.10/0.46 % Generated clauses : 403
% 0.10/0.46 % ...of the previous two non-redundant : 283
% 0.10/0.46 % ...aggressively subsumed : 0
% 0.10/0.46 % Contextual simplify-reflections : 6
% 0.10/0.46 % Paramodulations : 400
% 0.10/0.46 % Factorizations : 0
% 0.10/0.46 % NegExts : 0
% 0.10/0.46 % Equation resolutions : 3
% 0.10/0.46 % Disequality decompositions : 0
% 0.10/0.46 % Total rewrite steps : 105
% 0.10/0.46 % ...of those cached : 87
% 0.10/0.46 % Propositional unsat checks : 0
% 0.10/0.46 % Propositional check models : 0
% 0.10/0.46 % Propositional check unsatisfiable : 0
% 0.10/0.46 % Propositional clauses : 0
% 0.10/0.46 % Propositional clauses after purity: 0
% 0.10/0.46 % Propositional unsat core size : 0
% 0.10/0.46 % Propositional preprocessing time : 0.000
% 0.10/0.46 % Propositional encoding time : 0.000
% 0.10/0.46 % Propositional solver time : 0.000
% 0.10/0.46 % Success case prop preproc time : 0.000
% 0.10/0.46 % Success case prop encoding time : 0.000
% 0.10/0.46 % Success case prop solver time : 0.000
% 0.10/0.46 % Current number of processed clauses : 88
% 0.10/0.46 % Positive orientable unit clauses : 14
% 0.10/0.46 % Positive unorientable unit clauses: 0
% 0.10/0.46 % Negative unit clauses : 2
% 0.10/0.46 % Non-unit-clauses : 72
% 0.10/0.46 % Current number of unprocessed clauses: 182
% 0.10/0.46 % ...number of literals in the above : 484
% 0.10/0.46 % Current number of archived formulas : 0
% 0.10/0.46 % Current number of archived clauses : 48
% 0.10/0.46 % Clause-clause subsumption calls (NU) : 2775
% 0.10/0.46 % Rec. Clause-clause subsumption calls : 1889
% 0.10/0.46 % Non-unit clause-clause subsumptions : 35
% 0.10/0.46 % Unit Clause-clause subsumption calls : 18
% 0.10/0.46 % Rewrite failures with RHS unbound : 0
% 0.10/0.46 % BW rewrite match attempts : 5
% 0.10/0.46 % BW rewrite match successes : 1
% 0.10/0.46 % Condensation attempts : 0
% 0.10/0.46 % Condensation successes : 0
% 0.10/0.46 % Termbank termtop insertions : 7034
% 0.10/0.46 % Search garbage collected termcells : 495
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.018 s
% 0.10/0.46 % System time : 0.005 s
% 0.10/0.46 % Total time : 0.022 s
% 0.10/0.46 % Maximum resident set size: 3648 pages
% 0.10/0.46
% 0.10/0.46 % -------------------------------------------------
% 0.10/0.46 % User time : 0.079 s
% 0.10/0.46 % System time : 0.018 s
% 0.10/0.46 % Total time : 0.098 s
% 0.10/0.46 % Maximum resident set size: 4864 pages
% 0.10/0.46 % E exiting
%------------------------------------------------------------------------------