TSTP Solution File: SEU143+1 by Metis---2.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n014.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 12:38:42 EDT 2022

% Result   : Theorem 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   32 (  15 unt;   0 def)
%            Number of atoms       :   68 (  39 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   73 (  37   ~;  23   |;   4   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   41 (   3 sgn  24   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ) ).

fof(d1_xboole_0,axiom,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ) ).

fof(l1_zfmisc_1,conjecture,
    ! [A] : singleton(A) != empty_set ).

fof(subgoal_0,plain,
    ! [A] : singleton(A) != empty_set,
    inference(strip,[],[l1_zfmisc_1]) ).

fof(negate_0_0,plain,
    ~ ! [A] : singleton(A) != empty_set,
    inference(negate,[],[subgoal_0]) ).

fof(normalize_0_0,plain,
    ! [A,B] :
      ( B != singleton(A)
    <=> ? [C] :
          ( C != A
        <=> in(C,B) ) ),
    inference(canonicalize,[],[d1_tarski]) ).

fof(normalize_0_1,plain,
    ! [A,B] :
      ( B != singleton(A)
    <=> ? [C] :
          ( C != A
        <=> in(C,B) ) ),
    inference(specialize,[],[normalize_0_0]) ).

fof(normalize_0_2,plain,
    ! [A,B,C] :
      ( ( B != singleton(A)
        | C != A
        | in(C,B) )
      & ( B != singleton(A)
        | ~ in(C,B)
        | C = A )
      & ( skolemFOFtoCNF_C(A,B) != A
        | ~ in(skolemFOFtoCNF_C(A,B),B)
        | B = singleton(A) )
      & ( B = singleton(A)
        | skolemFOFtoCNF_C(A,B) = A
        | in(skolemFOFtoCNF_C(A,B),B) ) ),
    inference(clausify,[],[normalize_0_1]) ).

fof(normalize_0_3,plain,
    ! [A,B,C] :
      ( B != singleton(A)
      | C != A
      | in(C,B) ),
    inference(conjunct,[],[normalize_0_2]) ).

fof(normalize_0_4,plain,
    ? [A] : singleton(A) = empty_set,
    inference(canonicalize,[],[negate_0_0]) ).

fof(normalize_0_5,plain,
    singleton(skolemFOFtoCNF_A_2) = empty_set,
    inference(skolemize,[],[normalize_0_4]) ).

fof(normalize_0_6,plain,
    ! [A] :
      ( A != empty_set
    <=> ? [B] : in(B,A) ),
    inference(canonicalize,[],[d1_xboole_0]) ).

fof(normalize_0_7,plain,
    ! [A] :
      ( A != empty_set
    <=> ? [B] : in(B,A) ),
    inference(specialize,[],[normalize_0_6]) ).

fof(normalize_0_8,plain,
    ! [A,B] :
      ( ( A != empty_set
        | ~ in(B,A) )
      & ( A = empty_set
        | in(skolemFOFtoCNF_B(A),A) ) ),
    inference(clausify,[],[normalize_0_7]) ).

fof(normalize_0_9,plain,
    ! [A,B] :
      ( A != empty_set
      | ~ in(B,A) ),
    inference(conjunct,[],[normalize_0_8]) ).

cnf(refute_0_0,plain,
    ( B != singleton(A)
    | C != A
    | in(C,B) ),
    inference(canonicalize,[],[normalize_0_3]) ).

cnf(refute_0_1,plain,
    ( A != A
    | singleton(A) != singleton(A)
    | in(A,singleton(A)) ),
    inference(subst,[],[refute_0_0:[bind(B,$fot(singleton(A))),bind(C,$fot(A))]]) ).

cnf(refute_0_2,plain,
    A = A,
    introduced(tautology,[refl,[$fot(A)]]) ).

cnf(refute_0_3,plain,
    ( singleton(A) != singleton(A)
    | in(A,singleton(A)) ),
    inference(resolve,[$cnf( $equal(A,A) )],[refute_0_2,refute_0_1]) ).

cnf(refute_0_4,plain,
    singleton(A) = singleton(A),
    introduced(tautology,[refl,[$fot(singleton(A))]]) ).

cnf(refute_0_5,plain,
    in(A,singleton(A)),
    inference(resolve,[$cnf( $equal(singleton(A),singleton(A)) )],[refute_0_4,refute_0_3]) ).

cnf(refute_0_6,plain,
    in(skolemFOFtoCNF_A_2,singleton(skolemFOFtoCNF_A_2)),
    inference(subst,[],[refute_0_5:[bind(A,$fot(skolemFOFtoCNF_A_2))]]) ).

cnf(refute_0_7,plain,
    singleton(skolemFOFtoCNF_A_2) = empty_set,
    inference(canonicalize,[],[normalize_0_5]) ).

cnf(refute_0_8,plain,
    ( singleton(skolemFOFtoCNF_A_2) != empty_set
    | ~ in(skolemFOFtoCNF_A_2,singleton(skolemFOFtoCNF_A_2))
    | in(skolemFOFtoCNF_A_2,empty_set) ),
    introduced(tautology,[equality,[$cnf( in(skolemFOFtoCNF_A_2,singleton(skolemFOFtoCNF_A_2)) ),[1],$fot(empty_set)]]) ).

cnf(refute_0_9,plain,
    ( ~ in(skolemFOFtoCNF_A_2,singleton(skolemFOFtoCNF_A_2))
    | in(skolemFOFtoCNF_A_2,empty_set) ),
    inference(resolve,[$cnf( $equal(singleton(skolemFOFtoCNF_A_2),empty_set) )],[refute_0_7,refute_0_8]) ).

cnf(refute_0_10,plain,
    in(skolemFOFtoCNF_A_2,empty_set),
    inference(resolve,[$cnf( in(skolemFOFtoCNF_A_2,singleton(skolemFOFtoCNF_A_2)) )],[refute_0_6,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( A != empty_set
    | ~ in(B,A) ),
    inference(canonicalize,[],[normalize_0_9]) ).

cnf(refute_0_12,plain,
    ( empty_set != empty_set
    | ~ in(B,empty_set) ),
    inference(subst,[],[refute_0_11:[bind(A,$fot(empty_set))]]) ).

cnf(refute_0_13,plain,
    empty_set = empty_set,
    introduced(tautology,[refl,[$fot(empty_set)]]) ).

cnf(refute_0_14,plain,
    ~ in(B,empty_set),
    inference(resolve,[$cnf( $equal(empty_set,empty_set) )],[refute_0_13,refute_0_12]) ).

cnf(refute_0_15,plain,
    ~ in(skolemFOFtoCNF_A_2,empty_set),
    inference(subst,[],[refute_0_14:[bind(B,$fot(skolemFOFtoCNF_A_2))]]) ).

cnf(refute_0_16,plain,
    $false,
    inference(resolve,[$cnf( in(skolemFOFtoCNF_A_2,empty_set) )],[refute_0_10,refute_0_15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : metis --show proof --show saturation %s
% 0.12/0.34  % Computer : n014.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 : Mon Jun 20 09:35:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.35  
% 0.12/0.35  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.12/0.35  
%------------------------------------------------------------------------------