%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET694+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 : n011.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:17:59 PM UTC 2026
% Result : Theorem 227.12s 34.00s
% Output : CNFRefutation 227.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 74 ( 27 ~; 38 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 88 ( 8 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).
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(thI22,conjecture,
! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI22) ).
fof(c_0_4,plain,
! [X16,X17] :
( ( member(X16,power_set(X17))
| ~ subset(X16,X17) )
& ( subset(X16,X17)
| ~ member(X16,power_set(X17)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])])]) ).
fof(c_0_5,plain,
! [X8,X9,X10,X11,X12] :
( ( subset(X11,X12)
| ~ member(esk3_2(X11,X12),X12) )
& ( subset(X11,X12)
| member(esk3_2(X11,X12),X11) )
& ( member(X10,X9)
| ~ member(X10,X8)
| ~ subset(X8,X9) ) ),
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])])])])])])]) ).
cnf(c_0_6,plain,
( ~ member(X1,power_set(X2))
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X18,X19,X20] :
( ( member(X18,union(X19,X20))
| ~ member(X18,X20) )
& ( member(X18,union(X19,X20))
| ~ member(X18,X19) )
& ( member(X18,X20)
| member(X18,X19)
| ~ member(X18,union(X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])]) ).
cnf(c_0_9,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(power_set(X1),X2)
| subset(esk3_2(power_set(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( ~ member(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ member(X1,esk3_2(power_set(X2),X3))
| subset(power_set(X2),X3)
| member(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ subset(X1,X2)
| member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
( ~ member(esk3_2(X1,union(X2,X3)),X2)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( subset(power_set(X1),X2)
| subset(esk3_2(power_set(X1),X2),X3)
| member(esk3_2(esk3_2(power_set(X1),X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,plain,
( ~ member(esk3_2(X1,union(X2,X3)),X3)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_19,plain,
( ~ subset(esk3_2(X1,power_set(X2)),X2)
| subset(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,plain,
( subset(power_set(X1),X2)
| subset(esk3_2(power_set(X1),X2),union(X1,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( subset(power_set(X1),X2)
| subset(esk3_2(power_set(X1),X2),union(X3,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,plain,
subset(power_set(X1),power_set(union(X1,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
subset(power_set(X1),power_set(union(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_24,plain,
( ~ member(X1,power_set(X2))
| member(X1,power_set(union(X2,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_25,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_26,negated_conjecture,
~ ! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
inference(assume_negation,[status(cth)],[thI22]) ).
cnf(c_0_27,plain,
( ~ member(X1,power_set(X3))
| member(X1,power_set(union(X2,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
cnf(c_0_28,plain,
( ~ member(esk3_2(X1,power_set(union(X2,X3))),power_set(X2))
| subset(X1,power_set(union(X2,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_29,plain,
( subset(union(X1,X2),X3)
| member(esk3_2(union(X1,X2),X3),X2)
| member(esk3_2(union(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
fof(c_0_30,negated_conjecture,
~ subset(union(power_set(esk1_0),power_set(esk2_0)),power_set(union(esk1_0,esk2_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
cnf(c_0_31,plain,
( ~ member(esk3_2(X1,power_set(union(X2,X3))),power_set(X3))
| subset(X1,power_set(union(X2,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_32,plain,
( subset(union(power_set(X1),X2),power_set(union(X1,X3)))
| member(esk3_2(union(power_set(X1),X2),power_set(union(X1,X3))),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ subset(union(power_set(esk1_0),power_set(esk2_0)),power_set(union(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET694+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.36 % Computer : n011.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:32:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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
% 227.12/34.00 % Version: 3.5.1
% 227.12/34.00 % Preprocessing class: FSMSSMSSSSSNFFN.
% 227.12/34.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.12/34.00 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.12/34.00 % Starting new_bool_3 with 300s (1) cores
% 227.12/34.00 % Starting new_bool_1 with 300s (1) cores
% 227.12/34.00 % Starting sh5l with 300s (1) cores
% 227.12/34.00 % sh5l with pid 1071085 completed with status 0
% 227.12/34.00 % Result found by sh5l
% 227.12/34.00 % Preprocessing class: FSMSSMSSSSSNFFN.
% 227.12/34.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.12/34.00 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.12/34.00 % Starting new_bool_3 with 300s (1) cores
% 227.12/34.00 % Starting new_bool_1 with 300s (1) cores
% 227.12/34.00 % Starting sh5l with 300s (1) cores
% 227.12/34.00 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 227.12/34.00 % SinE strategy is gf500_gu_R04_F100_L20000
% 227.12/34.00 % Search class: FGUNF-FFSF21-SFFFFFNN
% 227.12/34.00 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 227.12/34.00 % Starting SubtermCWHack with 31s (1) cores
% 227.12/34.00 % SubtermCWHack with pid 1071088 completed with status 8
% 227.12/34.00 % Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 227.12/34.00 % SAT001_MinMin_p005000_rr_RG with pid 1071548 completed with status 0
% 227.12/34.00 % Result found by SAT001_MinMin_p005000_rr_RG
% 227.12/34.00 % Preprocessing class: FSMSSMSSSSSNFFN.
% 227.12/34.00 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 227.12/34.00 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 227.12/34.00 % Starting new_bool_3 with 300s (1) cores
% 227.12/34.00 % Starting new_bool_1 with 300s (1) cores
% 227.12/34.00 % Starting sh5l with 300s (1) cores
% 227.12/34.00 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 227.12/34.00 % SinE strategy is gf500_gu_R04_F100_L20000
% 227.12/34.00 % Search class: FGUNF-FFSF21-SFFFFFNN
% 227.12/34.00 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 227.12/34.00 % Starting SubtermCWHack with 31s (1) cores
% 227.12/34.00 % SubtermCWHack with pid 1071088 completed with status 8
% 227.12/34.00 % Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 227.12/34.00 % Preprocessing time : 0.002 s
% 227.12/34.00 % Presaturation interreduction done
% 227.12/34.00
% 227.12/34.00 % Proof found!
% 227.12/34.00 % SZS status Theorem
% 227.12/34.00 % SZS output start CNFRefutation
% See solution above
% 227.12/34.00 % Parsed axioms : 12
% 227.12/34.00 % Removed by relevancy pruning/SinE : 7
% 227.12/34.00 % Initial clauses : 12
% 227.12/34.00 % Removed in clause preprocessing : 0
% 227.12/34.00 % Initial clauses in saturation : 12
% 227.12/34.00 % Processed clauses : 2405
% 227.12/34.00 % ...of these trivial : 0
% 227.12/34.00 % ...subsumed : 1609
% 227.12/34.00 % ...remaining for further processing : 796
% 227.12/34.00 % Other redundant clauses eliminated : 0
% 227.12/34.00 % Clauses deleted for lack of memory : 0
% 227.12/34.00 % Backward-subsumed : 0
% 227.12/34.00 % Backward-rewritten : 1
% 227.12/34.00 % Generated clauses : 38651
% 227.12/34.00 % ...of the previous two non-redundant : 38376
% 227.12/34.00 % ...aggressively subsumed : 0
% 227.12/34.00 % Contextual simplify-reflections : 0
% 227.12/34.00 % Paramodulations : 38601
% 227.12/34.00 % Factorizations : 50
% 227.12/34.00 % NegExts : 0
% 227.12/34.00 % Equation resolutions : 0
% 227.12/34.00 % Disequality decompositions : 0
% 227.12/34.00 % Total rewrite steps : 187
% 227.12/34.00 % ...of those cached : 49
% 227.12/34.00 % Propositional unsat checks : 0
% 227.12/34.00 % Propositional check models : 0
% 227.12/34.00 % Propositional check unsatisfiable : 0
% 227.12/34.00 % Propositional clauses : 0
% 227.12/34.00 % Propositional clauses after purity: 0
% 227.12/34.00 % Propositional unsat core size : 0
% 227.12/34.00 % Propositional preprocessing time : 0.000
% 227.12/34.00 % Propositional encoding time : 0.000
% 227.12/34.00 % Propositional solver time : 0.000
% 227.12/34.00 % Success case prop preproc time : 0.000
% 227.12/34.00 % Success case prop encoding time : 0.000
% 227.12/34.00 % Success case prop solver time : 0.000
% 227.12/34.00 % Current number of processed clauses : 783
% 227.12/34.00 % Positive orientable unit clauses : 284
% 227.12/34.00 % Positive unorientable unit clauses: 0
% 227.12/34.00 % Negative unit clauses : 4
% 227.12/34.00 % Non-unit-clauses : 495
% 227.12/34.00 % Current number of unprocessed clauses: 35995
% 227.12/34.00 % ...number of literals in the above : 90306
% 227.12/34.00 % Current number of archived formulas : 0
% 227.12/34.00 % Current number of archived clauses : 13
% 227.12/34.00 % Clause-clause subsumption calls (NU) : 49432
% 227.12/34.00 % Rec. Clause-clause subsumption calls : 47075
% 227.12/34.00 % Non-unit clause-clause subsumptions : 1609
% 227.12/34.00 % Unit Clause-clause subsumption calls : 2917
% 227.12/34.00 % Rewrite failures with RHS unbound : 0
% 227.12/34.00 % BW rewrite match attempts : 3171
% 227.12/34.00 % BW rewrite match successes : 1
% 227.12/34.00 % Condensation attempts : 0
% 227.12/34.00 % Condensation successes : 0
% 227.12/34.00 % Termbank termtop insertions : 789074
% 227.12/34.00 % Search garbage collected termcells : 245
% 227.12/34.00
% 227.12/34.00 % -------------------------------------------------
% 227.12/34.00 % User time : 31.043 s
% 227.12/34.00 % System time : 1.218 s
% 227.12/34.00 % Total time : 32.262 s
% 227.12/34.00 % Maximum resident set size: 3596 pages
% 227.12/34.00
% 227.12/34.00 % -------------------------------------------------
% 227.12/34.00 % User time : 31.047 s
% 227.12/34.00 % System time : 1.223 s
% 227.12/34.00 % Total time : 32.270 s
% 227.12/34.00 % Maximum resident set size: 4608 pages
% 227.12/34.00 % E exiting
%------------------------------------------------------------------------------