TSTP Solution File: SEU141+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU141+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 : n024.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:43 EDT 2023
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 65 ( 17 unt; 21 typ; 0 def)
% Number of atoms : 92 ( 41 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 86 ( 38 ~; 27 |; 14 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 16 >; 17 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 72 ( 5 sgn; 46 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
proper_subset: ( $i * $i ) > $o ).
tff(decl_24,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_25,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_26,type,
subset: ( $i * $i ) > $o ).
tff(decl_27,type,
empty_set: $i ).
tff(decl_28,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_29,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_30,type,
empty: $i > $o ).
tff(decl_31,type,
esk1_1: $i > $i ).
tff(decl_32,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_33,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_36,type,
esk6_0: $i ).
tff(decl_37,type,
esk7_0: $i ).
tff(decl_38,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_39,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_40,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_41,type,
esk11_0: $i ).
tff(decl_42,type,
esk12_0: $i ).
fof(t4_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_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(t83_xboole_1,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t83_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(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(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_boole) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_boole) ).
fof(c_0_10,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_11,lemma,
! [X115,X116,X118,X119,X120] :
( ( disjoint(X115,X116)
| in(esk10_2(X115,X116),set_intersection2(X115,X116)) )
& ( ~ in(X120,set_intersection2(X118,X119))
| ~ disjoint(X118,X119) ) ),
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_10])])])])]) ).
fof(c_0_12,lemma,
! [X112,X113] : set_difference(X112,set_difference(X112,X113)) = set_intersection2(X112,X113),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t83_xboole_1]) ).
cnf(c_0_14,lemma,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,negated_conjecture,
( ( ~ disjoint(esk11_0,esk12_0)
| set_difference(esk11_0,esk12_0) != esk11_0 )
& ( disjoint(esk11_0,esk12_0)
| set_difference(esk11_0,esk12_0) = esk11_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_17,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_18,lemma,
( ~ disjoint(X2,X3)
| ~ in(X1,set_difference(X2,set_difference(X2,X3))) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( disjoint(esk11_0,esk12_0)
| set_difference(esk11_0,esk12_0) = esk11_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X15,X16,X17] :
( ( X15 != empty_set
| ~ in(X16,X15) )
& ( in(esk1_1(X17),X17)
| X17 = 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_17])])])])]) ).
fof(c_0_21,lemma,
! [X63,X64] :
( ( set_difference(X63,X64) != empty_set
| subset(X63,X64) )
& ( ~ subset(X63,X64)
| set_difference(X63,X64) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l32_xboole_1])]) ).
cnf(c_0_22,negated_conjecture,
( set_difference(esk11_0,esk12_0) = esk11_0
| ~ in(X1,set_difference(esk11_0,set_difference(esk11_0,esk12_0))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( in(esk1_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_24,plain,
! [X86] : set_intersection2(X86,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
fof(c_0_25,plain,
! [X13,X14] :
( ( subset(X13,X14)
| X13 != X14 )
& ( subset(X14,X13)
| X13 != X14 )
& ( ~ subset(X13,X14)
| ~ subset(X14,X13)
| X13 = X14 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_26,lemma,
( subset(X1,X2)
| set_difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( set_difference(esk11_0,set_difference(esk11_0,esk12_0)) = empty_set
| set_difference(esk11_0,esk12_0) = esk11_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,lemma,
! [X94,X95] : subset(set_difference(X94,X95),X94),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_29,plain,
! [X52,X53] :
( ( ~ disjoint(X52,X53)
| set_intersection2(X52,X53) = empty_set )
& ( set_intersection2(X52,X53) != empty_set
| disjoint(X52,X53) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
cnf(c_0_30,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X100] : set_difference(X100,empty_set) = X100,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,lemma,
( set_difference(esk11_0,esk12_0) = esk11_0
| subset(esk11_0,set_difference(esk11_0,esk12_0)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
inference(rw,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_37,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ disjoint(esk11_0,esk12_0)
| set_difference(esk11_0,esk12_0) != esk11_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_39,lemma,
set_difference(esk11_0,esk12_0) = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( disjoint(X1,X2)
| set_difference(X1,set_difference(X1,X2)) != empty_set ),
inference(rw,[status(thm)],[c_0_35,c_0_15]) ).
cnf(c_0_41,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ disjoint(esk11_0,esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_39]),c_0_41])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU141+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 13:50:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.016000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.020000 s
%------------------------------------------------------------------------------