TSTP Solution File: SEU168+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU168+3 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 03:25:43 EDT 2024
% Result : Theorem 1.17s 0.61s
% Output : CNFRefutation 1.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 5
% Syntax : Number of formulae : 84 ( 13 unt; 0 def)
% Number of atoms : 341 ( 7 equ)
% Maximal formula atoms : 72 ( 4 avg)
% Number of connectives : 423 ( 166 ~; 191 |; 54 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 130 ( 1 sgn 51 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_tarski,axiom,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& ! [X5] :
( subset(X5,X3)
=> in(X5,X4) ) ) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_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(t136_zfmisc_1,conjecture,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
( in(X3,X2)
=> in(powerset(X3),X2) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t136_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_5,plain,
! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4] :
~ ( in(X4,X2)
& ! [X5] :
( subset(X5,X3)
=> in(X5,X4) ) ) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[t9_tarski]) ).
fof(c_0_6,plain,
! [X8,X9,X10,X11,X12,X13] :
( ( ~ in(X10,X9)
| subset(X10,X8)
| X9 != powerset(X8) )
& ( ~ subset(X11,X8)
| in(X11,X9)
| X9 != powerset(X8) )
& ( ~ in(esk1_2(X12,X13),X13)
| ~ subset(esk1_2(X12,X13),X12)
| X13 = powerset(X12) )
& ( in(esk1_2(X12,X13),X13)
| subset(esk1_2(X12,X13),X12)
| X13 = powerset(X12) ) ),
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])])])])])])]) ).
fof(c_0_7,plain,
! [X15,X16,X17,X18,X19] :
( ( ~ subset(X15,X16)
| ~ in(X17,X15)
| in(X17,X16) )
& ( in(esk2_2(X18,X19),X18)
| subset(X18,X19) )
& ( ~ in(esk2_2(X18,X19),X19)
| subset(X18,X19) ) ),
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])])])])])])]) ).
fof(c_0_8,plain,
! [X30,X32,X33,X34,X36,X37] :
( in(X30,esk10_1(X30))
& ( ~ in(X32,esk10_1(X30))
| ~ subset(X33,X32)
| in(X33,esk10_1(X30)) )
& ( in(esk11_2(X30,X34),esk10_1(X30))
| ~ in(X34,esk10_1(X30)) )
& ( ~ subset(X36,X34)
| in(X36,esk11_2(X30,X34))
| ~ in(X34,esk10_1(X30)) )
& ( ~ subset(X37,esk10_1(X30))
| are_equipotent(X37,esk10_1(X30))
| in(X37,esk10_1(X30)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_9,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,esk11_2(X3,X2))
| ~ subset(X1,X2)
| ~ in(X2,esk10_1(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
? [X2] :
( in(X1,X2)
& ! [X3,X4] :
( ( in(X3,X2)
& subset(X4,X3) )
=> in(X4,X2) )
& ! [X3] :
( in(X3,X2)
=> in(powerset(X3),X2) )
& ! [X3] :
~ ( subset(X3,X2)
& ~ are_equipotent(X3,X2)
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t136_zfmisc_1])]) ).
cnf(c_0_15,plain,
( in(X3,esk10_1(X2))
| ~ in(X1,esk10_1(X2))
| ~ subset(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( in(esk11_2(X1,X2),esk10_1(X1))
| ~ in(X2,esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( subset(X1,esk11_2(X2,X3))
| ~ subset(esk2_2(X1,esk11_2(X2,X3)),X3)
| ~ in(X3,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
( subset(esk2_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,negated_conjecture,
! [X25] :
( ( subset(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( subset(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| in(esk6_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( subset(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( subset(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| subset(esk7_1(X25),esk6_1(X25))
| ~ in(esk5_0,X25) )
& ( subset(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| in(esk8_1(X25),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( subset(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ are_equipotent(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) )
& ( ~ in(esk9_1(X25),X25)
| ~ in(powerset(esk8_1(X25)),X25)
| ~ in(esk7_1(X25),X25)
| ~ in(esk5_0,X25) ) ),
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_14])])])])]) ).
cnf(c_0_20,plain,
( in(X1,esk10_1(X2))
| ~ subset(X1,esk11_2(X2,X3))
| ~ in(X3,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( subset(powerset(X1),esk11_2(X2,X1))
| ~ in(X1,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( subset(esk9_1(X1),X1)
| in(esk6_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(powerset(X1),esk10_1(X2))
| ~ in(X1,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( subset(esk9_1(X1),X1)
| in(esk8_1(X1),X1)
| in(esk6_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( subset(esk9_1(esk10_1(X1)),esk10_1(X1))
| in(esk6_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_26,plain,
in(X1,esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( subset(esk9_1(X1),X1)
| subset(esk7_1(X1),esk6_1(X1))
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk9_1(X1),X1)
| in(esk8_1(X1),X1)
| subset(esk7_1(X1),esk6_1(X1))
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
( subset(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( subset(esk7_1(esk10_1(X1)),esk6_1(esk10_1(X1)))
| subset(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( subset(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_32,negated_conjecture,
( subset(esk9_1(X1),X1)
| in(esk8_1(X1),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( subset(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(X1,esk10_1(esk5_0))
| ~ subset(X1,esk6_1(esk10_1(esk5_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( subset(esk7_1(esk10_1(esk5_0)),esk6_1(esk10_1(esk5_0)))
| subset(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
( subset(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk7_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( subset(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( are_equipotent(X1,esk10_1(X2))
| in(X1,esk10_1(X2))
| ~ subset(X1,esk10_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,negated_conjecture,
subset(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).
cnf(c_0_39,negated_conjecture,
( in(esk6_1(X1),X1)
| ~ are_equipotent(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_40,negated_conjecture,
( are_equipotent(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(powerset(esk8_1(esk10_1(esk5_0))),esk10_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
( ~ are_equipotent(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_43,negated_conjecture,
( in(esk8_1(X1),X1)
| in(esk6_1(X1),X1)
| ~ are_equipotent(esk9_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_45,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(powerset(esk8_1(esk10_1(esk5_0))),esk10_1(esk5_0))
| ~ in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_26])]) ).
cnf(c_0_46,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_26])]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( in(esk8_1(X1),X1)
| subset(esk7_1(X1),esk6_1(X1))
| ~ are_equipotent(esk9_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_48,negated_conjecture,
( in(esk8_1(X1),X1)
| ~ are_equipotent(esk9_1(X1),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_49,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_50,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(X1,esk10_1(esk5_0))
| ~ subset(X1,esk6_1(esk10_1(esk5_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( subset(esk7_1(esk10_1(esk5_0)),esk6_1(esk10_1(esk5_0)))
| in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_26])]) ).
cnf(c_0_52,negated_conjecture,
( in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| ~ in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_40]),c_0_26])]),c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( in(esk8_1(X1),X1)
| in(esk6_1(X1),X1)
| ~ in(esk9_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_54,negated_conjecture,
( in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_26])]) ).
cnf(c_0_56,negated_conjecture,
( in(esk8_1(X1),X1)
| subset(esk7_1(X1),esk6_1(X1))
| ~ in(esk9_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_57,negated_conjecture,
( in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(X1,esk10_1(esk5_0))
| ~ subset(X1,esk6_1(esk10_1(esk5_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( subset(esk7_1(esk10_1(esk5_0)),esk6_1(esk10_1(esk5_0)))
| in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_54]),c_0_26])]) ).
cnf(c_0_59,plain,
( in(X1,esk10_1(X2))
| ~ subset(X1,powerset(X3))
| ~ in(X3,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_60,negated_conjecture,
( in(esk8_1(X1),X1)
| ~ in(esk9_1(X1),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_61,negated_conjecture,
( in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0))
| in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( subset(powerset(powerset(X1)),X2)
| in(esk2_2(powerset(powerset(X1)),X2),esk10_1(X3))
| ~ in(X1,esk10_1(X3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_18]) ).
cnf(c_0_63,negated_conjecture,
in(esk8_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_26])]),c_0_54]) ).
cnf(c_0_64,negated_conjecture,
( subset(powerset(powerset(esk8_1(esk10_1(esk5_0)))),X1)
| in(esk2_2(powerset(powerset(esk8_1(esk10_1(esk5_0)))),X1),esk10_1(esk5_0)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_66,negated_conjecture,
subset(powerset(powerset(esk8_1(esk10_1(esk5_0)))),esk10_1(esk5_0)),
inference(spm,[status(thm)],[c_0_10,c_0_64]) ).
cnf(c_0_67,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_68,negated_conjecture,
( in(X1,esk10_1(esk5_0))
| ~ in(X1,powerset(powerset(esk8_1(esk10_1(esk5_0))))) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_67]) ).
fof(c_0_70,plain,
! [X23] : subset(X23,X23),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_71,negated_conjecture,
( in(X1,esk10_1(esk5_0))
| ~ subset(X1,powerset(esk8_1(esk10_1(esk5_0)))) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( in(esk6_1(X1),X1)
| ~ in(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_74,negated_conjecture,
in(powerset(esk8_1(esk10_1(esk5_0))),esk10_1(esk5_0)),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_75,negated_conjecture,
in(esk6_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_26])]),c_0_46]) ).
cnf(c_0_76,negated_conjecture,
( ~ in(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk7_1(X1),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_77,negated_conjecture,
( in(X1,esk10_1(esk5_0))
| ~ subset(X1,esk6_1(esk10_1(esk5_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( subset(esk7_1(X1),esk6_1(X1))
| ~ in(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_79,negated_conjecture,
~ in(esk7_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_26])]),c_0_52]) ).
cnf(c_0_80,negated_conjecture,
( subset(esk7_1(X1),esk6_1(X1))
| ~ are_equipotent(esk9_1(X1),X1)
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(esk5_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_81,negated_conjecture,
~ in(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_74]),c_0_26])]),c_0_79]) ).
cnf(c_0_82,negated_conjecture,
~ are_equipotent(esk9_1(esk10_1(esk5_0)),esk10_1(esk5_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_80]),c_0_74]),c_0_26])]),c_0_79]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_40,c_0_81]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEU168+3 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 16:28:52 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 1.17/0.61 # Version: 3.1.0
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.17/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.17/0.61 # Starting sh5l with 300s (1) cores
% 1.17/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4096 completed with status 0
% 1.17/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # No SInE strategy applied
% 1.17/0.61 # Search class: FGHSS-FFMF21-SFFFFFNN
% 1.17/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.17/0.61 # Starting new_bool_3 with 136s (1) cores
% 1.17/0.61 # Starting new_bool_1 with 136s (1) cores
% 1.17/0.61 # Starting sh5l with 136s (1) cores
% 1.17/0.61 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4101 completed with status 0
% 1.17/0.61 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.17/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.17/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.17/0.61 # No SInE strategy applied
% 1.17/0.61 # Search class: FGHSS-FFMF21-SFFFFFNN
% 1.17/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.17/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.17/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.17/0.61 # Preprocessing time : 0.001 s
% 1.17/0.61 # Presaturation interreduction done
% 1.17/0.61
% 1.17/0.61 # Proof found!
% 1.17/0.61 # SZS status Theorem
% 1.17/0.61 # SZS output start CNFRefutation
% See solution above
% 1.17/0.61 # Parsed axioms : 8
% 1.17/0.61 # Removed by relevancy pruning/SinE : 0
% 1.17/0.61 # Initial clauses : 34
% 1.17/0.61 # Removed in clause preprocessing : 0
% 1.17/0.61 # Initial clauses in saturation : 34
% 1.17/0.61 # Processed clauses : 1293
% 1.17/0.61 # ...of these trivial : 0
% 1.17/0.61 # ...subsumed : 431
% 1.17/0.61 # ...remaining for further processing : 861
% 1.17/0.61 # Other redundant clauses eliminated : 2
% 1.17/0.61 # Clauses deleted for lack of memory : 0
% 1.17/0.61 # Backward-subsumed : 77
% 1.17/0.61 # Backward-rewritten : 16
% 1.17/0.61 # Generated clauses : 3125
% 1.17/0.61 # ...of the previous two non-redundant : 3093
% 1.17/0.61 # ...aggressively subsumed : 0
% 1.17/0.61 # Contextual simplify-reflections : 11
% 1.17/0.61 # Paramodulations : 3113
% 1.17/0.61 # Factorizations : 8
% 1.17/0.61 # NegExts : 0
% 1.17/0.61 # Equation resolutions : 2
% 1.17/0.61 # Disequality decompositions : 0
% 1.17/0.61 # Total rewrite steps : 106
% 1.17/0.61 # ...of those cached : 91
% 1.17/0.61 # Propositional unsat checks : 0
% 1.17/0.61 # Propositional check models : 0
% 1.17/0.61 # Propositional check unsatisfiable : 0
% 1.17/0.61 # Propositional clauses : 0
% 1.17/0.61 # Propositional clauses after purity: 0
% 1.17/0.61 # Propositional unsat core size : 0
% 1.17/0.61 # Propositional preprocessing time : 0.000
% 1.17/0.61 # Propositional encoding time : 0.000
% 1.17/0.61 # Propositional solver time : 0.000
% 1.17/0.61 # Success case prop preproc time : 0.000
% 1.17/0.61 # Success case prop encoding time : 0.000
% 1.17/0.61 # Success case prop solver time : 0.000
% 1.17/0.61 # Current number of processed clauses : 730
% 1.17/0.61 # Positive orientable unit clauses : 19
% 1.17/0.61 # Positive unorientable unit clauses: 0
% 1.17/0.61 # Negative unit clauses : 48
% 1.17/0.61 # Non-unit-clauses : 663
% 1.17/0.61 # Current number of unprocessed clauses: 1834
% 1.17/0.61 # ...number of literals in the above : 8313
% 1.17/0.61 # Current number of archived formulas : 0
% 1.17/0.61 # Current number of archived clauses : 129
% 1.17/0.61 # Clause-clause subsumption calls (NU) : 104672
% 1.17/0.61 # Rec. Clause-clause subsumption calls : 40699
% 1.17/0.61 # Non-unit clause-clause subsumptions : 451
% 1.17/0.61 # Unit Clause-clause subsumption calls : 3146
% 1.17/0.61 # Rewrite failures with RHS unbound : 0
% 1.17/0.61 # BW rewrite match attempts : 25
% 1.17/0.61 # BW rewrite match successes : 6
% 1.17/0.61 # Condensation attempts : 0
% 1.17/0.61 # Condensation successes : 0
% 1.17/0.61 # Termbank termtop insertions : 86750
% 1.17/0.61 # Search garbage collected termcells : 486
% 1.17/0.61
% 1.17/0.61 # -------------------------------------------------
% 1.17/0.61 # User time : 0.167 s
% 1.17/0.61 # System time : 0.004 s
% 1.17/0.61 # Total time : 0.171 s
% 1.17/0.61 # Maximum resident set size: 1756 pages
% 1.17/0.61
% 1.17/0.61 # -------------------------------------------------
% 1.17/0.61 # User time : 0.839 s
% 1.17/0.61 # System time : 0.009 s
% 1.17/0.61 # Total time : 0.848 s
% 1.17/0.61 # Maximum resident set size: 1692 pages
% 1.17/0.61 % E---3.1 exiting
% 1.17/0.61 % E exiting
%------------------------------------------------------------------------------