%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:24:04 PM UTC 2026
% Result : Theorem 88.96s 13.57s
% Output : CNFRefutation 88.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 131 ( 30 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 136 ( 49 ~; 67 |; 12 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 100 ( 1 sgn 38 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& in(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(t99_zfmisc_1,conjecture,
! [X1] : union(powerset(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t99_zfmisc_1) ).
fof(c_0_6,plain,
! [X27,X28,X29,X31,X32,X33,X34,X36] :
( ( X34 = union(X33)
| in(esk5_2(X33,X34),X34)
| in(esk6_2(X33,X34),X33) )
& ( X34 = union(X33)
| in(esk5_2(X33,X34),X34)
| in(esk5_2(X33,X34),esk6_2(X33,X34)) )
& ( X34 = union(X33)
| ~ in(X36,X33)
| ~ in(esk5_2(X33,X34),X36)
| ~ in(esk5_2(X33,X34),X34) )
& ( X28 != union(X27)
| in(X31,X28)
| ~ in(X32,X27)
| ~ in(X31,X32) )
& ( X28 != union(X27)
| ~ in(X29,X28)
| in(esk4_3(X27,X28,X29),X27) )
& ( X28 != union(X27)
| ~ in(X29,X28)
| in(X29,esk4_3(X27,X28,X29)) ) ),
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)],[d4_tarski])])])])])])]) ).
fof(c_0_7,plain,
! [X14,X15,X16,X17,X18,X19] :
( ( X19 = powerset(X18)
| subset(esk2_2(X18,X19),X18)
| in(esk2_2(X18,X19),X19) )
& ( X19 = powerset(X18)
| ~ subset(esk2_2(X18,X19),X18)
| ~ in(esk2_2(X18,X19),X19) )
& ( X15 != powerset(X14)
| in(X17,X15)
| ~ subset(X17,X14) )
& ( X15 != powerset(X14)
| subset(X16,X14)
| ~ in(X16,X15) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
cnf(c_0_8,plain,
( X2 != union(X1)
| ~ in(X3,X2)
| in(esk4_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X21,X22,X23,X24,X25] :
( ( subset(X24,X25)
| ~ in(esk3_2(X24,X25),X25) )
& ( subset(X24,X25)
| in(esk3_2(X24,X25),X24) )
& ( in(X23,X22)
| ~ in(X23,X21)
| ~ subset(X21,X22) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_10,plain,
( X2 != powerset(X3)
| ~ in(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X2,union(X1))
| in(esk4_3(X1,union(X1),X2),X1) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ in(X1,powerset(X2))
| subset(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(esk4_3(X1,union(X1),esk3_2(union(X1),X2)),X1)
| subset(union(X1),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( X3 != union(X2)
| ~ in(X1,X3)
| in(X1,esk4_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( X3 != powerset(X2)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_17,plain,
! [X42] : subset(X42,X42),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_18,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( subset(union(powerset(X1)),X2)
| subset(esk4_3(powerset(X1),union(powerset(X1)),esk3_2(union(powerset(X1)),X2)),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ in(X1,union(X2))
| in(X1,esk4_3(X2,union(X2),X1)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( X4 != union(X3)
| ~ in(X2,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( ~ subset(X1,X2)
| in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ in(X3,esk4_3(powerset(X1),union(powerset(X1)),esk3_2(union(powerset(X1)),X2)))
| in(X3,X1)
| subset(union(powerset(X1)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( in(esk3_2(union(X1),X2),esk4_3(X1,union(X1),esk3_2(union(X1),X2)))
| subset(union(X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_26,plain,
( ~ in(X1,X3)
| ~ in(X3,X2)
| in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
in(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X43,X44] :
( ( X43 = X44
| in(esk9_2(X43,X44),X44)
| in(esk9_2(X43,X44),X43) )
& ( X43 = X44
| ~ in(esk9_2(X43,X44),X44)
| ~ in(esk9_2(X43,X44),X43) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])])]) ).
cnf(c_0_29,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( in(esk3_2(union(powerset(X1)),X2),X1)
| subset(union(powerset(X1)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ in(X1,X2)
| in(X1,union(powerset(X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( X1 = X2
| in(esk9_2(X1,X2),X2)
| in(esk9_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
subset(union(powerset(X1)),X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( in(esk9_2(X1,X2),X1)
| in(esk9_2(X1,X2),union(powerset(X2)))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_35,negated_conjecture,
~ ! [X1] : union(powerset(X1)) = X1,
inference(assume_negation,[status(cth)],[t99_zfmisc_1]) ).
cnf(c_0_36,plain,
( ~ in(X1,union(powerset(X2)))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_37,plain,
( in(esk9_2(union(powerset(X1)),X1),union(powerset(X1)))
| union(powerset(X1)) = X1 ),
inference(ef,[status(thm)],[c_0_34]) ).
fof(c_0_38,negated_conjecture,
union(powerset(esk10_0)) != esk10_0,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])]) ).
cnf(c_0_39,plain,
( ~ in(esk9_2(X1,X2),X2)
| ~ in(esk9_2(X1,X2),X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
( in(esk9_2(union(powerset(X1)),X1),X1)
| union(powerset(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
union(powerset(esk10_0)) != esk10_0,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
union(powerset(X1)) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:53:48 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 88.96/13.57 % Version: 3.5.1
% 88.96/13.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 88.96/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.96/13.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 88.96/13.57 % Starting new_bool_3 with 300s (1) cores
% 88.96/13.57 % Starting new_bool_1 with 300s (1) cores
% 88.96/13.57 % Starting sh5l with 300s (1) cores
% 88.96/13.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2698323 completed with status 0
% 88.96/13.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 88.96/13.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 88.96/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.96/13.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 88.96/13.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.96/13.57 % No SInE strategy applied
% 88.96/13.57 % Search class: FGHSF-FFMF31-SFFFFFNN
% 88.96/13.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 88.96/13.57 % Starting SubtermCWHack with 136s (1) cores
% 88.96/13.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 88.96/13.57 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 166s (1) cores
% 88.96/13.57 % Starting new_bool_3 with 162s (1) cores
% 88.96/13.57 % Starting new_bool_1 with 158s (1) cores
% 88.96/13.57 % new_bool_1 with pid 2698334 completed with status 0
% 88.96/13.57 % Result found by new_bool_1
% 88.96/13.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 88.96/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.96/13.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 88.96/13.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.96/13.57 % No SInE strategy applied
% 88.96/13.57 % Search class: FGHSF-FFMF31-SFFFFFNN
% 88.96/13.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 88.96/13.57 % Starting SubtermCWHack with 136s (1) cores
% 88.96/13.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 88.96/13.57 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 166s (1) cores
% 88.96/13.57 % Starting new_bool_3 with 162s (1) cores
% 88.96/13.57 % Starting new_bool_1 with 158s (1) cores
% 88.96/13.57 % Preprocessing time : 0.001 s
% 88.96/13.57 % Presaturation interreduction done
% 88.96/13.57
% 88.96/13.57 % Proof found!
% 88.96/13.57 % SZS status Theorem
% 88.96/13.57 % SZS output start CNFRefutation
% See solution above
% 88.96/13.57 % Parsed axioms : 11
% 88.96/13.57 % Removed by relevancy pruning/SinE : 0
% 88.96/13.57 % Initial clauses : 26
% 88.96/13.57 % Removed in clause preprocessing : 0
% 88.96/13.57 % Initial clauses in saturation : 26
% 88.96/13.57 % Processed clauses : 7566
% 88.96/13.57 % ...of these trivial : 2013
% 88.96/13.57 % ...subsumed : 1054
% 88.96/13.57 % ...remaining for further processing : 4499
% 88.96/13.57 % Other redundant clauses eliminated : 11
% 88.96/13.57 % Clauses deleted for lack of memory : 0
% 88.96/13.57 % Backward-subsumed : 21
% 88.96/13.57 % Backward-rewritten : 1283
% 88.96/13.57 % Generated clauses : 814483
% 88.96/13.57 % ...of the previous two non-redundant : 800567
% 88.96/13.57 % ...aggressively subsumed : 0
% 88.96/13.57 % Contextual simplify-reflections : 3
% 88.96/13.57 % Paramodulations : 814405
% 88.96/13.57 % Factorizations : 68
% 88.96/13.57 % NegExts : 0
% 88.96/13.57 % Equation resolutions : 11
% 88.96/13.57 % Disequality decompositions : 0
% 88.96/13.57 % Total rewrite steps : 95370
% 88.96/13.57 % ...of those cached : 81507
% 88.96/13.57 % Propositional unsat checks : 0
% 88.96/13.57 % Propositional check models : 0
% 88.96/13.57 % Propositional check unsatisfiable : 0
% 88.96/13.57 % Propositional clauses : 0
% 88.96/13.57 % Propositional clauses after purity: 0
% 88.96/13.57 % Propositional unsat core size : 0
% 88.96/13.57 % Propositional preprocessing time : 0.000
% 88.96/13.57 % Propositional encoding time : 0.000
% 88.96/13.57 % Propositional solver time : 0.000
% 88.96/13.57 % Success case prop preproc time : 0.000
% 88.96/13.57 % Success case prop encoding time : 0.000
% 88.96/13.57 % Success case prop solver time : 0.000
% 88.96/13.57 % Current number of processed clauses : 3162
% 88.96/13.57 % Positive orientable unit clauses : 1123
% 88.96/13.57 % Positive unorientable unit clauses: 0
% 88.96/13.57 % Negative unit clauses : 911
% 88.96/13.57 % Non-unit-clauses : 1128
% 88.96/13.57 % Current number of unprocessed clauses: 792049
% 88.96/13.57 % ...number of literals in the above : 1169069
% 88.96/13.57 % Current number of archived formulas : 0
% 88.96/13.57 % Current number of archived clauses : 1330
% 88.96/13.57 % Clause-clause subsumption calls (NU) : 1175676
% 88.96/13.57 % Rec. Clause-clause subsumption calls : 695357
% 88.96/13.57 % Non-unit clause-clause subsumptions : 762
% 88.96/13.57 % Unit Clause-clause subsumption calls : 2321590
% 88.96/13.57 % Rewrite failures with RHS unbound : 0
% 88.96/13.57 % BW rewrite match attempts : 336755
% 88.96/13.57 % BW rewrite match successes : 650
% 88.96/13.57 % Condensation attempts : 0
% 88.96/13.57 % Condensation successes : 0
% 88.96/13.57 % Termbank termtop insertions : 21286583
% 88.96/13.57 % Search garbage collected termcells : 584
% 88.96/13.57
% 88.96/13.57 % -------------------------------------------------
% 88.96/13.57 % User time : 12.194 s
% 88.96/13.57 % System time : 0.528 s
% 88.96/13.57 % Total time : 12.723 s
% 88.96/13.57 % Maximum resident set size: 3636 pages
% 88.96/13.57
% 88.96/13.57 % -------------------------------------------------
% 88.96/13.57 % User time : 60.488 s
% 88.96/13.57 % System time : 2.525 s
% 88.96/13.57 % Total time : 63.013 s
% 88.96/13.57 % Maximum resident set size: 4864 pages
% 88.96/13.57 % E exiting
%------------------------------------------------------------------------------