TSTP Solution File: SEU144+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU144+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %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 : Wed Aug 31 18:32:07 EDT 2022

% Result   : Theorem 0.18s 0.48s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   43 (   8 unt;   0 def)
%            Number of atoms       :  140 (  37 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  155 (  58   ~;  61   |;  23   &)
%                                         (   8 <=>;   4  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   71 (  59   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f82,plain,
    $false,
    inference(subsumption_resolution,[],[f80,f59]) ).

fof(f59,plain,
    in(sK2,sK3),
    inference(duplicate_literal_removal,[],[f58]) ).

fof(f58,plain,
    ( in(sK2,sK3)
    | in(sK2,sK3) ),
    inference(resolution,[],[f52,f43]) ).

fof(f43,plain,
    in(sK2,sF4),
    inference(superposition,[],[f37,f39]) ).

fof(f39,plain,
    singleton(sK2) = sF4,
    introduced(function_definition,[]) ).

fof(f37,plain,
    ! [X2] : in(X2,singleton(X2)),
    inference(equality_resolution,[],[f36]) ).

fof(f36,plain,
    ! [X2,X0] :
      ( in(X2,X0)
      | singleton(X2) != X0 ),
    inference(equality_resolution,[],[f31]) ).

fof(f31,plain,
    ! [X2,X0,X1] :
      ( in(X2,X0)
      | X1 != X2
      | singleton(X1) != X0 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | X1 != X2 )
            & ( X1 = X2
              | ~ in(X2,X0) ) )
        | singleton(X1) != X0 )
      & ( singleton(X1) = X0
        | ( ( sK1(X0,X1) != X1
            | ~ in(sK1(X0,X1),X0) )
          & ( sK1(X0,X1) = X1
            | in(sK1(X0,X1),X0) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f18,f19]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( ( X1 != X3
            | ~ in(X3,X0) )
          & ( X1 = X3
            | in(X3,X0) ) )
     => ( ( sK1(X0,X1) != X1
          | ~ in(sK1(X0,X1),X0) )
        & ( sK1(X0,X1) = X1
          | in(sK1(X0,X1),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | X1 != X2 )
            & ( X1 = X2
              | ~ in(X2,X0) ) )
        | singleton(X1) != X0 )
      & ( singleton(X1) = X0
        | ? [X3] :
            ( ( X1 != X3
              | ~ in(X3,X0) )
            & ( X1 = X3
              | in(X3,X0) ) ) ) ),
    inference(rectify,[],[f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ( in(X2,X0)
              | X1 != X2 )
            & ( X1 = X2
              | ~ in(X2,X0) ) )
        | singleton(X1) != X0 )
      & ( singleton(X1) = X0
        | ? [X2] :
            ( ( X1 != X2
              | ~ in(X2,X0) )
            & ( X1 = X2
              | in(X2,X0) ) ) ) ),
    inference(nnf_transformation,[],[f8]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( in(X2,X0)
        <=> X1 = X2 )
    <=> singleton(X1) = X0 ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ! [X1,X0] :
      ( ! [X2] :
          ( in(X2,X1)
        <=> X0 = X2 )
    <=> singleton(X0) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(f52,plain,
    ! [X0] :
      ( ~ in(X0,sF4)
      | in(sK2,sK3)
      | in(X0,sK3) ),
    inference(resolution,[],[f27,f41]) ).

fof(f41,plain,
    ( subset(sF4,sK3)
    | in(sK2,sK3) ),
    inference(definition_folding,[],[f33,f39]) ).

fof(f33,plain,
    ( in(sK2,sK3)
    | subset(singleton(sK2),sK3) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ( ( ~ in(sK2,sK3)
      | ~ subset(singleton(sK2),sK3) )
    & ( in(sK2,sK3)
      | subset(singleton(sK2),sK3) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f21,f22]) ).

fof(f22,plain,
    ( ? [X0,X1] :
        ( ( ~ in(X0,X1)
          | ~ subset(singleton(X0),X1) )
        & ( in(X0,X1)
          | subset(singleton(X0),X1) ) )
   => ( ( ~ in(sK2,sK3)
        | ~ subset(singleton(sK2),sK3) )
      & ( in(sK2,sK3)
        | subset(singleton(sK2),sK3) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ? [X0,X1] :
      ( ( ~ in(X0,X1)
        | ~ subset(singleton(X0),X1) )
      & ( in(X0,X1)
        | subset(singleton(X0),X1) ) ),
    inference(nnf_transformation,[],[f10]) ).

fof(f10,plain,
    ? [X0,X1] :
      ( subset(singleton(X0),X1)
    <~> in(X0,X1) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f6,negated_conjecture,
    ~ ! [X0,X1] :
        ( in(X0,X1)
      <=> subset(singleton(X0),X1) ),
    inference(negated_conjecture,[],[f5]) ).

fof(f5,conjecture,
    ! [X0,X1] :
      ( in(X0,X1)
    <=> subset(singleton(X0),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(f27,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | in(X2,X1)
      | ~ in(X2,X0) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X0)
            | in(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ( in(sK0(X0,X1),X0)
          & ~ in(sK0(X0,X1),X1) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ? [X3] :
          ( in(X3,X0)
          & ~ in(X3,X1) )
     => ( in(sK0(X0,X1),X0)
        & ~ in(sK0(X0,X1),X1) ) ),
    introduced(choice_axiom,[]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X0)
            | in(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ? [X3] :
            ( in(X3,X0)
            & ~ in(X3,X1) ) ) ),
    inference(rectify,[],[f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ( ! [X2] :
            ( ~ in(X2,X0)
            | in(X2,X1) )
        | ~ subset(X0,X1) )
      & ( subset(X0,X1)
        | ? [X2] :
            ( in(X2,X0)
            & ~ in(X2,X1) ) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ! [X2] :
          ( ~ in(X2,X0)
          | in(X2,X1) )
    <=> subset(X0,X1) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
    <=> ! [X2] :
          ( in(X2,X0)
         => in(X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

fof(f80,plain,
    ~ in(sK2,sK3),
    inference(resolution,[],[f79,f40]) ).

fof(f40,plain,
    ( ~ subset(sF4,sK3)
    | ~ in(sK2,sK3) ),
    inference(definition_folding,[],[f34,f39]) ).

fof(f34,plain,
    ( ~ in(sK2,sK3)
    | ~ subset(singleton(sK2),sK3) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f79,plain,
    subset(sF4,sK3),
    inference(subsumption_resolution,[],[f77,f59]) ).

fof(f77,plain,
    ( subset(sF4,sK3)
    | ~ in(sK2,sK3) ),
    inference(superposition,[],[f25,f71]) ).

fof(f71,plain,
    sK0(sF4,sK3) = sK2,
    inference(subsumption_resolution,[],[f69,f59]) ).

fof(f69,plain,
    ( ~ in(sK2,sK3)
    | sK0(sF4,sK3) = sK2 ),
    inference(resolution,[],[f65,f40]) ).

fof(f65,plain,
    ! [X0] :
      ( subset(sF4,X0)
      | sK0(sF4,X0) = sK2 ),
    inference(resolution,[],[f47,f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( in(sK0(X0,X1),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f47,plain,
    ! [X0] :
      ( ~ in(X0,sF4)
      | sK2 = X0 ),
    inference(superposition,[],[f38,f39]) ).

fof(f38,plain,
    ! [X2,X1] :
      ( ~ in(X2,singleton(X1))
      | X1 = X2 ),
    inference(equality_resolution,[],[f30]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( X1 = X2
      | ~ in(X2,X0)
      | singleton(X1) != X0 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ in(sK0(X0,X1),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : SEU144+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 14:41:20 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.47  % (2399)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.18/0.47  % (2407)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.18/0.48  % (2407)First to succeed.
% 0.18/0.48  % (2407)Refutation found. Thanks to Tanya!
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48  % (2407)------------------------------
% 0.18/0.48  % (2407)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48  % (2407)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48  % (2407)Termination reason: Refutation
% 0.18/0.48  
% 0.18/0.48  % (2407)Memory used [KB]: 895
% 0.18/0.48  % (2407)Time elapsed: 0.107 s
% 0.18/0.48  % (2407)Instructions burned: 2 (million)
% 0.18/0.48  % (2407)------------------------------
% 0.18/0.48  % (2407)------------------------------
% 0.18/0.48  % (2391)Success in time 0.14 s
%------------------------------------------------------------------------------