%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET002+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 : n002.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:12:58 PM UTC 2026
% Result : Theorem 0.08s 0.43s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 22 ~; 25 |; 7 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 43 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI14,conjecture,
! [X1] : equal_set(union(X1,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI14) ).
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(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : equal_set(union(X1,X1),X1),
inference(assume_negation,[status(cth)],[thI14]) ).
fof(c_0_5,plain,
! [X12,X13,X14,X15,X16] :
( ( subset(X15,X16)
| ~ member(esk2_2(X15,X16),X16) )
& ( subset(X15,X16)
| member(esk2_2(X15,X16),X15) )
& ( member(X14,X13)
| ~ member(X14,X12)
| ~ subset(X12,X13) ) ),
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_6,plain,
! [X9,X10,X11] :
( ( member(X9,union(X10,X11))
| ~ member(X9,X11) )
& ( member(X9,union(X10,X11))
| ~ member(X9,X10) )
& ( member(X9,X11)
| member(X9,X10)
| ~ member(X9,union(X10,X11)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
fof(c_0_7,negated_conjecture,
~ equal_set(union(esk1_0,esk1_0),esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,plain,
! [X7,X8] :
( ( equal_set(X7,X8)
| ~ subset(X8,X7)
| ~ subset(X7,X8) )
& ( ~ equal_set(X7,X8)
| subset(X8,X7) )
& ( ~ equal_set(X7,X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
cnf(c_0_9,plain,
( ~ member(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
~ equal_set(union(esk1_0,esk1_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ member(esk2_2(X1,union(X2,X3)),X3)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
( subset(union(X1,X2),X3)
| member(esk2_2(union(X1,X2),X3),X1)
| member(esk2_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ subset(union(esk1_0,esk1_0),esk1_0)
| ~ subset(esk1_0,union(esk1_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,plain,
( subset(union(X1,X1),X2)
| member(esk2_2(union(X1,X1),X2),X1) ),
inference(ef,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ subset(union(esk1_0,esk1_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,plain,
subset(union(X1,X1),X1),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET002+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.08/0.36 % Computer : n002.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 04:43:32 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.43 % Version: 3.5.1
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.43 % Starting sh5l with 300s (1) cores
% 0.08/0.43 % new_bool_3 with pid 2448010 completed with status 0
% 0.08/0.43 % Result found by new_bool_3
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.08/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.43 % SubtermCWHack with pid 2448013 completed with status 0
% 0.08/0.43 % Result found by SubtermCWHack
% 0.08/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.08/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.08/0.43 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.08/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.08/0.43 % Preprocessing time : 0.001 s
% 0.08/0.43
% 0.08/0.43 % Proof found!
% 0.08/0.43 % SZS status Theorem
% 0.08/0.43 % SZS output start CNFRefutation
% See solution above
% 0.08/0.43 % Parsed axioms : 12
% 0.08/0.43 % Removed by relevancy pruning/SinE : 8
% 0.08/0.43 % Initial clauses : 10
% 0.08/0.43 % Removed in clause preprocessing : 0
% 0.08/0.43 % Initial clauses in saturation : 10
% 0.08/0.43 % Processed clauses : 26
% 0.08/0.43 % ...of these trivial : 0
% 0.08/0.43 % ...subsumed : 3
% 0.08/0.43 % ...remaining for further processing : 23
% 0.08/0.43 % Other redundant clauses eliminated : 0
% 0.08/0.43 % Clauses deleted for lack of memory : 0
% 0.08/0.43 % Backward-subsumed : 0
% 0.08/0.43 % Backward-rewritten : 2
% 0.08/0.43 % Generated clauses : 45
% 0.08/0.43 % ...of the previous two non-redundant : 40
% 0.08/0.43 % ...aggressively subsumed : 0
% 0.08/0.43 % Contextual simplify-reflections : 0
% 0.08/0.43 % Paramodulations : 43
% 0.08/0.43 % Factorizations : 2
% 0.08/0.43 % NegExts : 0
% 0.08/0.43 % Equation resolutions : 0
% 0.08/0.43 % Disequality decompositions : 0
% 0.08/0.43 % Total rewrite steps : 2
% 0.08/0.43 % ...of those cached : 0
% 0.08/0.43 % Propositional unsat checks : 0
% 0.08/0.43 % Propositional check models : 0
% 0.08/0.43 % Propositional check unsatisfiable : 0
% 0.08/0.43 % Propositional clauses : 0
% 0.08/0.43 % Propositional clauses after purity: 0
% 0.08/0.43 % Propositional unsat core size : 0
% 0.08/0.43 % Propositional preprocessing time : 0.000
% 0.08/0.43 % Propositional encoding time : 0.000
% 0.08/0.43 % Propositional solver time : 0.000
% 0.08/0.43 % Success case prop preproc time : 0.000
% 0.08/0.43 % Success case prop encoding time : 0.000
% 0.08/0.43 % Success case prop solver time : 0.000
% 0.08/0.43 % Current number of processed clauses : 21
% 0.08/0.43 % Positive orientable unit clauses : 5
% 0.08/0.43 % Positive unorientable unit clauses: 0
% 0.08/0.43 % Negative unit clauses : 1
% 0.08/0.43 % Non-unit-clauses : 15
% 0.08/0.43 % Current number of unprocessed clauses: 24
% 0.08/0.43 % ...number of literals in the above : 50
% 0.08/0.43 % Current number of archived formulas : 0
% 0.08/0.43 % Current number of archived clauses : 2
% 0.08/0.43 % Clause-clause subsumption calls (NU) : 40
% 0.08/0.43 % Rec. Clause-clause subsumption calls : 38
% 0.08/0.43 % Non-unit clause-clause subsumptions : 3
% 0.08/0.43 % Unit Clause-clause subsumption calls : 13
% 0.08/0.43 % Rewrite failures with RHS unbound : 0
% 0.08/0.43 % BW rewrite match attempts : 9
% 0.08/0.43 % BW rewrite match successes : 2
% 0.08/0.43 % Condensation attempts : 0
% 0.08/0.43 % Condensation successes : 0
% 0.08/0.43 % Termbank termtop insertions : 1256
% 0.08/0.43 % Search garbage collected termcells : 224
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.002 s
% 0.08/0.43 % System time : 0.004 s
% 0.08/0.43 % Total time : 0.006 s
% 0.08/0.43 % Maximum resident set size: 3648 pages
% 0.08/0.43
% 0.08/0.43 % -------------------------------------------------
% 0.08/0.43 % User time : 0.005 s
% 0.08/0.43 % System time : 0.006 s
% 0.08/0.43 % Total time : 0.011 s
% 0.08/0.43 % Maximum resident set size: 4608 pages
% 0.08/0.43 % E exiting
%------------------------------------------------------------------------------