TSTP Solution File: SET909+1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : SET909+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n023.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 : 600s
% DateTime : Tue Jul 19 03:38:16 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 64 ( 30 unt; 0 def)
% Number of atoms : 158 ( 86 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 168 ( 74 ~; 68 |; 11 &)
% ( 15 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 137 ( 15 sgn 59 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commutativity_k2_xboole_0,axiom,
! [A,B] : set_union2(A,B) = set_union2(B,A) ).
fof(d1_xboole_0,axiom,
! [A] :
( A = empty_set
<=> ! [B] : ~ in(B,A) ) ).
fof(d2_tarski,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = A
| D = B ) ) ) ).
fof(d2_xboole_0,axiom,
! [A,B,C] :
( C = set_union2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ) ).
fof(t50_zfmisc_1,conjecture,
! [A,B,C] : set_union2(unordered_pair(A,B),C) != empty_set ).
fof(subgoal_0,plain,
! [A,B,C] : set_union2(unordered_pair(A,B),C) != empty_set,
inference(strip,[],[t50_zfmisc_1]) ).
fof(negate_0_0,plain,
~ ! [A,B,C] : set_union2(unordered_pair(A,B),C) != empty_set,
inference(negate,[],[subgoal_0]) ).
fof(normalize_0_0,plain,
! [A,B,C] :
( C != unordered_pair(A,B)
<=> ? [D] :
( ~ in(D,C)
<=> ( D = A
| D = B ) ) ),
inference(canonicalize,[],[d2_tarski]) ).
fof(normalize_0_1,plain,
! [A,B,C] :
( C != unordered_pair(A,B)
<=> ? [D] :
( ~ in(D,C)
<=> ( D = A
| D = B ) ) ),
inference(specialize,[],[normalize_0_0]) ).
fof(normalize_0_2,plain,
! [A,B,C,D] :
( ( C != unordered_pair(A,B)
| D != A
| in(D,C) )
& ( C != unordered_pair(A,B)
| D != B
| in(D,C) )
& ( skolemFOFtoCNF_D(A,B,C) != A
| ~ in(skolemFOFtoCNF_D(A,B,C),C)
| C = unordered_pair(A,B) )
& ( skolemFOFtoCNF_D(A,B,C) != B
| ~ in(skolemFOFtoCNF_D(A,B,C),C)
| C = unordered_pair(A,B) )
& ( C != unordered_pair(A,B)
| ~ in(D,C)
| D = A
| D = B )
& ( C = unordered_pair(A,B)
| skolemFOFtoCNF_D(A,B,C) = A
| skolemFOFtoCNF_D(A,B,C) = B
| in(skolemFOFtoCNF_D(A,B,C),C) ) ),
inference(clausify,[],[normalize_0_1]) ).
fof(normalize_0_3,plain,
! [A,B,C,D] :
( C != unordered_pair(A,B)
| D != A
| in(D,C) ),
inference(conjunct,[],[normalize_0_2]) ).
fof(normalize_0_4,plain,
! [A,B,C] :
( C != set_union2(A,B)
<=> ? [D] :
( ~ in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
inference(canonicalize,[],[d2_xboole_0]) ).
fof(normalize_0_5,plain,
! [A,B,C] :
( C != set_union2(A,B)
<=> ? [D] :
( ~ in(D,C)
<=> ( in(D,A)
| in(D,B) ) ) ),
inference(specialize,[],[normalize_0_4]) ).
fof(normalize_0_6,plain,
! [A,B,C,D] :
( ( C != set_union2(A,B)
| ~ in(D,A)
| in(D,C) )
& ( C != set_union2(A,B)
| ~ in(D,B)
| in(D,C) )
& ( ~ in(skolemFOFtoCNF_D_1(A,B,C),A)
| ~ in(skolemFOFtoCNF_D_1(A,B,C),C)
| C = set_union2(A,B) )
& ( ~ in(skolemFOFtoCNF_D_1(A,B,C),B)
| ~ in(skolemFOFtoCNF_D_1(A,B,C),C)
| C = set_union2(A,B) )
& ( C != set_union2(A,B)
| ~ in(D,C)
| in(D,A)
| in(D,B) )
& ( C = set_union2(A,B)
| in(skolemFOFtoCNF_D_1(A,B,C),A)
| in(skolemFOFtoCNF_D_1(A,B,C),B)
| in(skolemFOFtoCNF_D_1(A,B,C),C) ) ),
inference(clausify,[],[normalize_0_5]) ).
fof(normalize_0_7,plain,
! [A,B,C,D] :
( C != set_union2(A,B)
| ~ in(D,A)
| in(D,C) ),
inference(conjunct,[],[normalize_0_6]) ).
fof(normalize_0_8,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(canonicalize,[],[commutativity_k2_xboole_0]) ).
fof(normalize_0_9,plain,
! [A,B] : set_union2(A,B) = set_union2(B,A),
inference(specialize,[],[normalize_0_8]) ).
fof(normalize_0_10,plain,
? [A,B,C] : set_union2(unordered_pair(A,B),C) = empty_set,
inference(canonicalize,[],[negate_0_0]) ).
fof(normalize_0_11,plain,
set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) = empty_set,
inference(skolemize,[],[normalize_0_10]) ).
fof(normalize_0_12,plain,
! [A] :
( A != empty_set
<=> ? [B] : in(B,A) ),
inference(canonicalize,[],[d1_xboole_0]) ).
fof(normalize_0_13,plain,
! [A] :
( A != empty_set
<=> ? [B] : in(B,A) ),
inference(specialize,[],[normalize_0_12]) ).
fof(normalize_0_14,plain,
! [A,B] :
( ( A != empty_set
| ~ in(B,A) )
& ( A = empty_set
| in(skolemFOFtoCNF_B(A),A) ) ),
inference(clausify,[],[normalize_0_13]) ).
fof(normalize_0_15,plain,
! [A,B] :
( A != empty_set
| ~ in(B,A) ),
inference(conjunct,[],[normalize_0_14]) ).
cnf(refute_0_0,plain,
( C != unordered_pair(A,B)
| D != A
| in(D,C) ),
inference(canonicalize,[],[normalize_0_3]) ).
cnf(refute_0_1,plain,
( A != A
| unordered_pair(A,B) != unordered_pair(A,B)
| in(A,unordered_pair(A,B)) ),
inference(subst,[],[refute_0_0:[bind(C,$fot(unordered_pair(A,B))),bind(D,$fot(A))]]) ).
cnf(refute_0_2,plain,
A = A,
introduced(tautology,[refl,[$fot(A)]]) ).
cnf(refute_0_3,plain,
( unordered_pair(A,B) != unordered_pair(A,B)
| in(A,unordered_pair(A,B)) ),
inference(resolve,[$cnf( $equal(A,A) )],[refute_0_2,refute_0_1]) ).
cnf(refute_0_4,plain,
unordered_pair(A,B) = unordered_pair(A,B),
introduced(tautology,[refl,[$fot(unordered_pair(A,B))]]) ).
cnf(refute_0_5,plain,
in(A,unordered_pair(A,B)),
inference(resolve,[$cnf( $equal(unordered_pair(A,B),unordered_pair(A,B)) )],[refute_0_4,refute_0_3]) ).
cnf(refute_0_6,plain,
in(X_23,unordered_pair(X_23,B)),
inference(subst,[],[refute_0_5:[bind(A,$fot(X_23))]]) ).
cnf(refute_0_7,plain,
( C != set_union2(A,B)
| ~ in(D,A)
| in(D,C) ),
inference(canonicalize,[],[normalize_0_7]) ).
cnf(refute_0_8,plain,
( set_union2(A,B) != set_union2(A,B)
| ~ in(D,A)
| in(D,set_union2(A,B)) ),
inference(subst,[],[refute_0_7:[bind(C,$fot(set_union2(A,B)))]]) ).
cnf(refute_0_9,plain,
set_union2(A,B) = set_union2(A,B),
introduced(tautology,[refl,[$fot(set_union2(A,B))]]) ).
cnf(refute_0_10,plain,
( ~ in(D,A)
| in(D,set_union2(A,B)) ),
inference(resolve,[$cnf( $equal(set_union2(A,B),set_union2(A,B)) )],[refute_0_9,refute_0_8]) ).
cnf(refute_0_11,plain,
( ~ in(X_23,unordered_pair(X_23,B))
| in(X_23,set_union2(unordered_pair(X_23,B),X_22)) ),
inference(subst,[],[refute_0_10:[bind(A,$fot(unordered_pair(X_23,B))),bind(B,$fot(X_22)),bind(D,$fot(X_23))]]) ).
cnf(refute_0_12,plain,
in(X_23,set_union2(unordered_pair(X_23,B),X_22)),
inference(resolve,[$cnf( in(X_23,unordered_pair(X_23,B)) )],[refute_0_6,refute_0_11]) ).
cnf(refute_0_13,plain,
in(X_29,set_union2(unordered_pair(X_29,X_27),X_28)),
inference(subst,[],[refute_0_12:[bind(B,$fot(X_27)),bind(X_22,$fot(X_28)),bind(X_23,$fot(X_29))]]) ).
cnf(refute_0_14,plain,
set_union2(A,B) = set_union2(B,A),
inference(canonicalize,[],[normalize_0_9]) ).
cnf(refute_0_15,plain,
set_union2(X_28,unordered_pair(X_29,X_27)) = set_union2(unordered_pair(X_29,X_27),X_28),
inference(subst,[],[refute_0_14:[bind(A,$fot(X_28)),bind(B,$fot(unordered_pair(X_29,X_27)))]]) ).
cnf(refute_0_16,plain,
X = X,
introduced(tautology,[refl,[$fot(X)]]) ).
cnf(refute_0_17,plain,
( X != X
| X != Y
| Y = X ),
introduced(tautology,[equality,[$cnf( $equal(X,X) ),[0],$fot(Y)]]) ).
cnf(refute_0_18,plain,
( X != Y
| Y = X ),
inference(resolve,[$cnf( $equal(X,X) )],[refute_0_16,refute_0_17]) ).
cnf(refute_0_19,plain,
( set_union2(X_28,unordered_pair(X_29,X_27)) != set_union2(unordered_pair(X_29,X_27),X_28)
| set_union2(unordered_pair(X_29,X_27),X_28) = set_union2(X_28,unordered_pair(X_29,X_27)) ),
inference(subst,[],[refute_0_18:[bind(X,$fot(set_union2(X_28,unordered_pair(X_29,X_27)))),bind(Y,$fot(set_union2(unordered_pair(X_29,X_27),X_28)))]]) ).
cnf(refute_0_20,plain,
set_union2(unordered_pair(X_29,X_27),X_28) = set_union2(X_28,unordered_pair(X_29,X_27)),
inference(resolve,[$cnf( $equal(set_union2(X_28,unordered_pair(X_29,X_27)),set_union2(unordered_pair(X_29,X_27),X_28)) )],[refute_0_15,refute_0_19]) ).
cnf(refute_0_21,plain,
( set_union2(unordered_pair(X_29,X_27),X_28) != set_union2(X_28,unordered_pair(X_29,X_27))
| ~ in(X_29,set_union2(unordered_pair(X_29,X_27),X_28))
| in(X_29,set_union2(X_28,unordered_pair(X_29,X_27))) ),
introduced(tautology,[equality,[$cnf( in(X_29,set_union2(unordered_pair(X_29,X_27),X_28)) ),[1],$fot(set_union2(X_28,unordered_pair(X_29,X_27)))]]) ).
cnf(refute_0_22,plain,
( ~ in(X_29,set_union2(unordered_pair(X_29,X_27),X_28))
| in(X_29,set_union2(X_28,unordered_pair(X_29,X_27))) ),
inference(resolve,[$cnf( $equal(set_union2(unordered_pair(X_29,X_27),X_28),set_union2(X_28,unordered_pair(X_29,X_27))) )],[refute_0_20,refute_0_21]) ).
cnf(refute_0_23,plain,
in(X_29,set_union2(X_28,unordered_pair(X_29,X_27))),
inference(resolve,[$cnf( in(X_29,set_union2(unordered_pair(X_29,X_27),X_28)) )],[refute_0_13,refute_0_22]) ).
cnf(refute_0_24,plain,
in(skolemFOFtoCNF_A_2,set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1))),
inference(subst,[],[refute_0_23:[bind(X_27,$fot(skolemFOFtoCNF_B_1)),bind(X_28,$fot(skolemFOFtoCNF_C)),bind(X_29,$fot(skolemFOFtoCNF_A_2))]]) ).
cnf(refute_0_25,plain,
set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) = empty_set,
inference(canonicalize,[],[normalize_0_11]) ).
cnf(refute_0_26,plain,
( set_union2(A,B) != set_union2(B,A)
| set_union2(B,A) = set_union2(A,B) ),
inference(subst,[],[refute_0_18:[bind(X,$fot(set_union2(A,B))),bind(Y,$fot(set_union2(B,A)))]]) ).
cnf(refute_0_27,plain,
set_union2(B,A) = set_union2(A,B),
inference(resolve,[$cnf( $equal(set_union2(A,B),set_union2(B,A)) )],[refute_0_14,refute_0_26]) ).
cnf(refute_0_28,plain,
set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) = set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)),
inference(subst,[],[refute_0_27:[bind(A,$fot(skolemFOFtoCNF_C)),bind(B,$fot(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)))]]) ).
cnf(refute_0_29,plain,
( set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) != empty_set
| set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) != set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1))
| set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)) = empty_set ),
introduced(tautology,[equality,[$cnf( $equal(set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C),empty_set) ),[0],$fot(set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)))]]) ).
cnf(refute_0_30,plain,
( set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C) != empty_set
| set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)) = empty_set ),
inference(resolve,[$cnf( $equal(set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C),set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1))) )],[refute_0_28,refute_0_29]) ).
cnf(refute_0_31,plain,
set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)) = empty_set,
inference(resolve,[$cnf( $equal(set_union2(unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1),skolemFOFtoCNF_C),empty_set) )],[refute_0_25,refute_0_30]) ).
cnf(refute_0_32,plain,
( set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)) != empty_set
| ~ in(skolemFOFtoCNF_A_2,set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)))
| in(skolemFOFtoCNF_A_2,empty_set) ),
introduced(tautology,[equality,[$cnf( in(skolemFOFtoCNF_A_2,set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1))) ),[1],$fot(empty_set)]]) ).
cnf(refute_0_33,plain,
( ~ in(skolemFOFtoCNF_A_2,set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)))
| in(skolemFOFtoCNF_A_2,empty_set) ),
inference(resolve,[$cnf( $equal(set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1)),empty_set) )],[refute_0_31,refute_0_32]) ).
cnf(refute_0_34,plain,
in(skolemFOFtoCNF_A_2,empty_set),
inference(resolve,[$cnf( in(skolemFOFtoCNF_A_2,set_union2(skolemFOFtoCNF_C,unordered_pair(skolemFOFtoCNF_A_2,skolemFOFtoCNF_B_1))) )],[refute_0_24,refute_0_33]) ).
cnf(refute_0_35,plain,
( A != empty_set
| ~ in(B,A) ),
inference(canonicalize,[],[normalize_0_15]) ).
cnf(refute_0_36,plain,
( empty_set != empty_set
| ~ in(B,empty_set) ),
inference(subst,[],[refute_0_35:[bind(A,$fot(empty_set))]]) ).
cnf(refute_0_37,plain,
empty_set = empty_set,
introduced(tautology,[refl,[$fot(empty_set)]]) ).
cnf(refute_0_38,plain,
~ in(B,empty_set),
inference(resolve,[$cnf( $equal(empty_set,empty_set) )],[refute_0_37,refute_0_36]) ).
cnf(refute_0_39,plain,
~ in(skolemFOFtoCNF_A_2,empty_set),
inference(subst,[],[refute_0_38:[bind(B,$fot(skolemFOFtoCNF_A_2))]]) ).
cnf(refute_0_40,plain,
$false,
inference(resolve,[$cnf( in(skolemFOFtoCNF_A_2,empty_set) )],[refute_0_34,refute_0_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET909+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : metis --show proof --show saturation %s
% 0.12/0.34 % Computer : n023.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 : 600
% 0.12/0.34 % DateTime : Sun Jul 10 16:58:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.12/0.37
%------------------------------------------------------------------------------