TSTP Solution File: SEU168+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU168+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n009.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 : Thu Aug 31 16:23:01 EDT 2023
% Result : Theorem 1.24s 1.29s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 83 ( 3 unt; 16 typ; 0 def)
% Number of atoms : 326 ( 6 equ)
% Maximal formula atoms : 72 ( 4 avg)
% Number of connectives : 446 ( 187 ~; 193 |; 54 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 13 >; 6 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-2 aty)
% Number of variables : 135 ( 1 sgn; 48 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
powerset: $i > $i ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
empty: $i > $o ).
tff(decl_26,type,
are_equipotent: ( $i * $i ) > $o ).
tff(decl_27,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_28,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_29,type,
esk3_0: $i ).
tff(decl_30,type,
esk4_0: $i ).
tff(decl_31,type,
esk5_0: $i ).
tff(decl_32,type,
esk6_1: $i > $i ).
tff(decl_33,type,
esk7_1: $i > $i ).
tff(decl_34,type,
esk8_1: $i > $i ).
tff(decl_35,type,
esk9_1: $i > $i ).
tff(decl_36,type,
esk10_1: $i > $i ).
tff(decl_37,type,
esk11_2: ( $i * $i ) > $i ).
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(c_0_4,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_5,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(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_6,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(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_7,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(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_8,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,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_10,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
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_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_14,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
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_7]) ).
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_7]) ).
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]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,plain,
( are_equipotent(X1,esk10_1(X2))
| in(X1,esk10_1(X2))
| ~ subset(X1,esk10_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,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_14]) ).
cnf(c_0_22,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_14]) ).
cnf(c_0_23,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_24,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_25,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_14]) ).
cnf(c_0_26,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_14]) ).
cnf(c_0_27,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_14]) ).
cnf(c_0_28,negated_conjecture,
( in(esk6_1(esk10_1(X1)),esk10_1(X1))
| ~ in(powerset(esk8_1(esk10_1(X1))),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_29,plain,
( in(powerset(X1),esk10_1(X2))
| ~ in(X1,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( in(esk8_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(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]),c_0_27]) ).
cnf(c_0_31,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_14]) ).
cnf(c_0_32,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_14]) ).
cnf(c_0_33,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_14]) ).
cnf(c_0_34,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_14]) ).
cnf(c_0_35,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_14]) ).
cnf(c_0_36,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_14]) ).
cnf(c_0_37,negated_conjecture,
( 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_28,c_0_29]),c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( ~ in(powerset(esk8_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(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( in(esk8_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(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_20]),c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
( in(X1,esk10_1(X2))
| ~ subset(X1,esk6_1(esk10_1(X2)))
| ~ in(esk5_0,esk10_1(X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_37]) ).
cnf(c_0_41,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_14]) ).
cnf(c_0_42,negated_conjecture,
( ~ 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_38,c_0_29]),c_0_39]) ).
cnf(c_0_43,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_14]) ).
cnf(c_0_44,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_14]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(powerset(esk8_1(esk10_1(X1))),esk10_1(X1))
| ~ in(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_46,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_47,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_14]) ).
cnf(c_0_48,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_14]) ).
cnf(c_0_49,negated_conjecture,
( subset(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(powerset(esk8_1(esk10_1(X1))),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( subset(esk9_1(esk10_1(X1)),esk10_1(X1))
| in(esk8_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_44]),c_0_42]) ).
cnf(c_0_51,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_14]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk8_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_53,negated_conjecture,
( in(X1,esk6_1(X2))
| ~ are_equipotent(esk9_1(X2),X2)
| ~ in(powerset(esk8_1(X2)),X2)
| ~ in(X1,esk7_1(X2))
| ~ in(esk5_0,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( subset(esk9_1(X1),X1)
| in(X2,esk6_1(X1))
| ~ in(powerset(esk8_1(X1)),X1)
| ~ in(X2,esk7_1(X1))
| ~ in(esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_55,negated_conjecture,
( in(X1,esk6_1(X2))
| ~ in(powerset(esk8_1(X2)),X2)
| ~ in(X1,esk7_1(X2))
| ~ in(esk9_1(X2),X2)
| ~ in(esk5_0,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_41]) ).
cnf(c_0_56,negated_conjecture,
( in(esk8_1(esk10_1(X1)),esk10_1(X1))
| ~ are_equipotent(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_48]),c_0_42]) ).
cnf(c_0_57,negated_conjecture,
( 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_49,c_0_29]),c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( ~ in(esk9_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_51]),c_0_52]),c_0_42]) ).
cnf(c_0_59,negated_conjecture,
( in(X1,esk6_1(esk10_1(X2)))
| ~ in(powerset(esk8_1(esk10_1(X2))),esk10_1(X2))
| ~ in(X1,esk7_1(esk10_1(X2)))
| ~ in(esk5_0,esk10_1(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_20]),c_0_54]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( in(esk8_1(esk10_1(X1)),esk10_1(X1))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_20]),c_0_57]),c_0_58]) ).
cnf(c_0_61,negated_conjecture,
( in(X1,esk6_1(esk10_1(X2)))
| ~ in(X1,esk7_1(esk10_1(X2)))
| ~ in(esk5_0,esk10_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_29]),c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( subset(esk7_1(esk10_1(X1)),X2)
| in(esk2_2(esk7_1(esk10_1(X1)),X2),esk6_1(esk10_1(X1)))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_13]) ).
cnf(c_0_63,negated_conjecture,
( subset(esk7_1(esk10_1(X1)),esk6_1(esk10_1(X1)))
| ~ in(esk5_0,esk10_1(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
~ in(esk5_0,esk10_1(X1)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_63]),c_0_42]) ).
cnf(c_0_65,plain,
in(X1,esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_64,c_0_65]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU168+3 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Aug 23 16:14:51 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.53 start to proof: theBenchmark
% 1.24/1.29 % Version : CSE_E---1.5
% 1.24/1.29 % Problem : theBenchmark.p
% 1.24/1.29 % Proof found
% 1.24/1.29 % SZS status Theorem for theBenchmark.p
% 1.24/1.29 % SZS output start Proof
% See solution above
% 1.24/1.30 % Total time : 0.752000 s
% 1.24/1.30 % SZS output end Proof
% 1.24/1.30 % Total time : 0.755000 s
%------------------------------------------------------------------------------