TSTP Solution File: SEU144+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU144+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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:22:44 EDT 2023
% Result : Theorem 0.19s 0.62s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 38
% Syntax : Number of formulae : 87 ( 26 unt; 25 typ; 0 def)
% Number of atoms : 145 ( 60 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 136 ( 53 ~; 57 |; 14 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 41 ( 20 >; 21 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 108 ( 4 sgn; 66 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
proper_subset: ( $i * $i ) > $o ).
tff(decl_24,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_25,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_26,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_27,type,
subset: ( $i * $i ) > $o ).
tff(decl_28,type,
singleton: $i > $i ).
tff(decl_29,type,
empty_set: $i ).
tff(decl_30,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_31,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_32,type,
empty: $i > $o ).
tff(decl_33,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk2_1: $i > $i ).
tff(decl_35,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_36,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_37,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk6_3: ( $i * $i * $i ) > $i ).
tff(decl_39,type,
esk7_3: ( $i * $i * $i ) > $i ).
tff(decl_40,type,
esk8_0: $i ).
tff(decl_41,type,
esk9_0: $i ).
tff(decl_42,type,
esk10_0: $i ).
tff(decl_43,type,
esk11_0: $i ).
tff(decl_44,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_45,type,
esk13_2: ( $i * $i ) > $i ).
tff(decl_46,type,
esk14_2: ( $i * $i ) > $i ).
fof(l2_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
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(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(l32_xboole_1,lemma,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_xboole_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(l1_zfmisc_1,lemma,
! [X1] : singleton(X1) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
inference(assume_negation,[status(cth)],[l2_zfmisc_1]) ).
fof(c_0_14,negated_conjecture,
( ( ~ subset(singleton(esk8_0),esk9_0)
| ~ in(esk8_0,esk9_0) )
& ( subset(singleton(esk8_0),esk9_0)
| in(esk8_0,esk9_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_15,lemma,
! [X147] : unordered_pair(X147,X147) = singleton(X147),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_16,lemma,
! [X91,X92] :
( ~ subset(X91,X92)
| set_union2(X91,X92) = X92 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_17,negated_conjecture,
( subset(singleton(esk8_0),esk9_0)
| in(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X11,X12] : set_union2(X11,X12) = set_union2(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_20,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| X19 = X17
| X18 != singleton(X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != singleton(X17) )
& ( ~ in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) != X21
| X22 = singleton(X21) )
& ( in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) = X21
| X22 = singleton(X21) ) ),
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_tarski])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ subset(singleton(esk8_0),esk9_0)
| ~ in(esk8_0,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( in(esk8_0,esk9_0)
| subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk8_0,esk9_0)
| ~ subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
inference(rw,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( set_union2(esk9_0,unordered_pair(esk8_0,esk8_0)) = esk9_0
| in(esk8_0,esk9_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
fof(c_0_28,plain,
! [X46,X47,X48,X49,X50] :
( ( ~ subset(X46,X47)
| ~ in(X48,X46)
| in(X48,X47) )
& ( in(esk5_2(X49,X50),X49)
| subset(X49,X50) )
& ( ~ in(esk5_2(X49,X50),X50)
| subset(X49,X50) ) ),
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])])])])])]) ).
cnf(c_0_29,plain,
( X1 = X3
| X2 != unordered_pair(X3,X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( set_union2(esk9_0,unordered_pair(esk8_0,esk8_0)) = esk9_0
| ~ subset(unordered_pair(esk8_0,esk8_0),esk9_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( in(esk5_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,lemma,
! [X151,X152] : subset(X151,set_union2(X151,X152)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_33,plain,
( X1 = X2
| ~ in(X1,unordered_pair(X2,X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( set_union2(esk9_0,unordered_pair(esk8_0,esk8_0)) = esk9_0
| in(esk5_2(unordered_pair(esk8_0,esk8_0),esk9_0),unordered_pair(esk8_0,esk8_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_35,plain,
! [X52,X53,X54,X55,X56,X57,X58,X59] :
( ( in(X55,X52)
| ~ in(X55,X54)
| X54 != set_intersection2(X52,X53) )
& ( in(X55,X53)
| ~ in(X55,X54)
| X54 != set_intersection2(X52,X53) )
& ( ~ in(X56,X52)
| ~ in(X56,X53)
| in(X56,X54)
| X54 != set_intersection2(X52,X53) )
& ( ~ in(esk6_3(X57,X58,X59),X59)
| ~ in(esk6_3(X57,X58,X59),X57)
| ~ in(esk6_3(X57,X58,X59),X58)
| X59 = set_intersection2(X57,X58) )
& ( in(esk6_3(X57,X58,X59),X57)
| in(esk6_3(X57,X58,X59),X59)
| X59 = set_intersection2(X57,X58) )
& ( in(esk6_3(X57,X58,X59),X58)
| in(esk6_3(X57,X58,X59),X59)
| X59 = set_intersection2(X57,X58) ) ),
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_xboole_0])])])])])]) ).
fof(c_0_36,lemma,
! [X133,X134] : set_difference(X133,set_difference(X133,X134)) = set_intersection2(X133,X134),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_37,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,negated_conjecture,
( set_union2(esk9_0,unordered_pair(esk8_0,esk8_0)) = esk9_0
| esk5_2(unordered_pair(esk8_0,esk8_0),esk9_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_42,lemma,
! [X84,X85] :
( ( set_difference(X84,X85) != empty_set
| subset(X84,X85) )
& ( ~ subset(X84,X85)
| set_difference(X84,X85) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])]) ).
cnf(c_0_43,lemma,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_44,negated_conjecture,
set_union2(esk9_0,unordered_pair(esk8_0,esk8_0)) = esk9_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23]),c_0_30]) ).
fof(c_0_45,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_46,lemma,
! [X81] : singleton(X81) != empty_set,
inference(variable_rename,[status(thm)],[l1_zfmisc_1]) ).
cnf(c_0_47,plain,
( in(X1,X2)
| X3 != set_difference(X4,set_difference(X4,X2))
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,lemma,
subset(unordered_pair(esk8_0,esk8_0),esk9_0),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_50,plain,
! [X121] : set_difference(X121,empty_set) = X121,
inference(variable_rename,[status(thm)],[t3_boole]) ).
fof(c_0_51,plain,
! [X24,X25,X26] :
( ( X24 != empty_set
| ~ in(X25,X24) )
& ( in(esk2_1(X26),X26)
| X26 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])])]) ).
cnf(c_0_52,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X3,set_difference(X3,X2))) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_54,lemma,
set_difference(unordered_pair(esk8_0,esk8_0),esk9_0) = empty_set,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( in(esk2_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,lemma,
unordered_pair(X1,X1) != empty_set,
inference(rw,[status(thm)],[c_0_52,c_0_18]) ).
cnf(c_0_58,lemma,
( in(X1,esk9_0)
| ~ in(X1,unordered_pair(esk8_0,esk8_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_59,plain,
esk2_1(unordered_pair(X1,X1)) = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
~ in(esk8_0,esk9_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_49])]) ).
cnf(c_0_61,lemma,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_56]),c_0_59]),c_0_60]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU144+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n029.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 17:57:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.62 % Version : CSE_E---1.5
% 0.19/0.62 % Problem : theBenchmark.p
% 0.19/0.62 % Proof found
% 0.19/0.62 % SZS status Theorem for theBenchmark.p
% 0.19/0.62 % SZS output start Proof
% See solution above
% 0.19/0.63 % Total time : 0.039000 s
% 0.19/0.63 % SZS output end Proof
% 0.19/0.63 % Total time : 0.042000 s
%------------------------------------------------------------------------------