TSTP Solution File: SET788+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n021.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:22:16 EDT 2022

% Result   : Theorem 0.14s 0.46s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (   1 unt;   0 def)
%            Number of atoms       :  141 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  166 (  59   ~;  68   |;  20   &)
%                                         (  13 <=>;   5  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   64 (  53   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f74,plain,
    $false,
    inference(avatar_sat_refutation,[],[f24,f25,f71,f73]) ).

fof(f73,plain,
    ( spl3_2
    | ~ spl3_1 ),
    inference(avatar_split_clause,[],[f72,f17,f21]) ).

fof(f21,plain,
    ( spl3_2
  <=> equalish(sK2,sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).

fof(f17,plain,
    ( spl3_1
  <=> equalish(sK1,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).

fof(f72,plain,
    ( equalish(sK2,sK1)
    | ~ spl3_1 ),
    inference(resolution,[],[f19,f62]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | equalish(X1,X0) ),
    inference(subsumption_resolution,[],[f61,f52]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( a_member_of(sK0(X0,X1),X0)
      | ~ equalish(X0,X1)
      | equalish(X1,X0) ),
    inference(factoring,[],[f27]) ).

fof(f27,plain,
    ! [X3,X4,X5] :
      ( a_member_of(sK0(X4,X3),X5)
      | equalish(X3,X4)
      | a_member_of(sK0(X4,X3),X4)
      | ~ equalish(X5,X3) ),
    inference(resolution,[],[f14,f12]) ).

fof(f12,plain,
    ! [X3,X0,X1] :
      ( ~ a_member_of(X3,X0)
      | ~ equalish(X1,X0)
      | a_member_of(X3,X1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X0,X1] :
        ( ( equalish(X1,X0)
          | ( ( ~ a_member_of(sK0(X0,X1),X1)
              | ~ a_member_of(sK0(X0,X1),X0) )
            & ( a_member_of(sK0(X0,X1),X1)
              | a_member_of(sK0(X0,X1),X0) ) ) )
        & ( ! [X3] :
              ( ( a_member_of(X3,X0)
                | ~ a_member_of(X3,X1) )
              & ( a_member_of(X3,X1)
                | ~ a_member_of(X3,X0) ) )
          | ~ equalish(X1,X0) ) )
    & ( ~ equalish(sK1,sK2)
      | ~ equalish(sK2,sK1) )
    & ( equalish(sK1,sK2)
      | equalish(sK2,sK1) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ? [X2] :
          ( ( ~ a_member_of(X2,X1)
            | ~ a_member_of(X2,X0) )
          & ( a_member_of(X2,X1)
            | a_member_of(X2,X0) ) )
     => ( ( ~ a_member_of(sK0(X0,X1),X1)
          | ~ a_member_of(sK0(X0,X1),X0) )
        & ( a_member_of(sK0(X0,X1),X1)
          | a_member_of(sK0(X0,X1),X0) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ( ? [X4,X5] :
        ( ( ~ equalish(X4,X5)
          | ~ equalish(X5,X4) )
        & ( equalish(X4,X5)
          | equalish(X5,X4) ) )
   => ( ( ~ equalish(sK1,sK2)
        | ~ equalish(sK2,sK1) )
      & ( equalish(sK1,sK2)
        | equalish(sK2,sK1) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0,X1] :
        ( ( equalish(X1,X0)
          | ? [X2] :
              ( ( ~ a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) )
              & ( a_member_of(X2,X1)
                | a_member_of(X2,X0) ) ) )
        & ( ! [X3] :
              ( ( a_member_of(X3,X0)
                | ~ a_member_of(X3,X1) )
              & ( a_member_of(X3,X1)
                | ~ a_member_of(X3,X0) ) )
          | ~ equalish(X1,X0) ) )
    & ? [X4,X5] :
        ( ( ~ equalish(X4,X5)
          | ~ equalish(X5,X4) )
        & ( equalish(X4,X5)
          | equalish(X5,X4) ) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X1,X0] :
        ( ( equalish(X0,X1)
          | ? [X2] :
              ( ( ~ a_member_of(X2,X0)
                | ~ a_member_of(X2,X1) )
              & ( a_member_of(X2,X0)
                | a_member_of(X2,X1) ) ) )
        & ( ! [X2] :
              ( ( a_member_of(X2,X1)
                | ~ a_member_of(X2,X0) )
              & ( a_member_of(X2,X0)
                | ~ a_member_of(X2,X1) ) )
          | ~ equalish(X0,X1) ) )
    & ? [X3,X4] :
        ( ( ~ equalish(X3,X4)
          | ~ equalish(X4,X3) )
        & ( equalish(X3,X4)
          | equalish(X4,X3) ) ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ( ! [X1,X0] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X1)
          <=> a_member_of(X2,X0) ) )
    & ? [X3,X4] :
        ( equalish(X4,X3)
      <~> equalish(X3,X4) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ! [X1,X0] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X1)
            <=> a_member_of(X2,X0) ) )
     => ! [X3,X4] :
          ( equalish(X4,X3)
        <=> equalish(X3,X4) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ! [X1,X0] :
          ( equalish(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X1)
            <=> a_member_of(X2,X0) ) )
     => ! [X0,X1] :
          ( equalish(X1,X0)
        <=> equalish(X0,X1) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ! [X1,X0] :
        ( equalish(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X1)
          <=> a_member_of(X2,X0) ) )
   => ! [X0,X1] :
        ( equalish(X1,X0)
      <=> equalish(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f14,plain,
    ! [X0,X1] :
      ( a_member_of(sK0(X0,X1),X1)
      | equalish(X1,X0)
      | a_member_of(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f61,plain,
    ! [X0,X1] :
      ( equalish(X1,X0)
      | ~ a_member_of(sK0(X0,X1),X0)
      | ~ equalish(X0,X1) ),
    inference(duplicate_literal_removal,[],[f58]) ).

fof(f58,plain,
    ! [X0,X1] :
      ( ~ equalish(X0,X1)
      | equalish(X1,X0)
      | equalish(X1,X0)
      | ~ a_member_of(sK0(X0,X1),X0)
      | ~ equalish(X0,X1) ),
    inference(resolution,[],[f55,f15]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ a_member_of(sK0(X0,X1),X1)
      | equalish(X1,X0)
      | ~ a_member_of(sK0(X0,X1),X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f55,plain,
    ! [X2,X3,X1] :
      ( a_member_of(sK0(X1,X2),X3)
      | ~ equalish(X1,X3)
      | equalish(X2,X1)
      | ~ equalish(X1,X2) ),
    inference(resolution,[],[f52,f13]) ).

fof(f13,plain,
    ! [X3,X0,X1] :
      ( ~ a_member_of(X3,X1)
      | a_member_of(X3,X0)
      | ~ equalish(X1,X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f19,plain,
    ( equalish(sK1,sK2)
    | ~ spl3_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f71,plain,
    ( spl3_1
    | ~ spl3_2 ),
    inference(avatar_contradiction_clause,[],[f70]) ).

fof(f70,plain,
    ( $false
    | spl3_1
    | ~ spl3_2 ),
    inference(subsumption_resolution,[],[f68,f18]) ).

fof(f18,plain,
    ( ~ equalish(sK1,sK2)
    | spl3_1 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f68,plain,
    ( equalish(sK1,sK2)
    | ~ spl3_2 ),
    inference(resolution,[],[f62,f23]) ).

fof(f23,plain,
    ( equalish(sK2,sK1)
    | ~ spl3_2 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f25,plain,
    ( ~ spl3_2
    | ~ spl3_1 ),
    inference(avatar_split_clause,[],[f11,f17,f21]) ).

fof(f11,plain,
    ( ~ equalish(sK1,sK2)
    | ~ equalish(sK2,sK1) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f24,plain,
    ( spl3_1
    | spl3_2 ),
    inference(avatar_split_clause,[],[f10,f21,f17]) ).

fof(f10,plain,
    ( equalish(sK2,sK1)
    | equalish(sK1,sK2) ),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SET788+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.10  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.30  % Computer : n021.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Tue Aug 30 14:16:41 EDT 2022
% 0.09/0.30  % CPUTime    : 
% 0.14/0.45  % (29532)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.14/0.45  % (29542)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.14/0.45  % (29548)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.14/0.45  % (29533)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.14/0.46  % (29540)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.14/0.46  % (29541)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.14/0.46  % (29534)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.14/0.46  % (29532)First to succeed.
% 0.14/0.46  % (29540)Instruction limit reached!
% 0.14/0.46  % (29540)------------------------------
% 0.14/0.46  % (29540)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.46  % (29532)Refutation found. Thanks to Tanya!
% 0.14/0.46  % SZS status Theorem for theBenchmark
% 0.14/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.46  % (29532)------------------------------
% 0.14/0.46  % (29532)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.46  % (29532)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.46  % (29532)Termination reason: Refutation
% 0.14/0.46  
% 0.14/0.46  % (29532)Memory used [KB]: 6012
% 0.14/0.46  % (29532)Time elapsed: 0.097 s
% 0.14/0.46  % (29532)Instructions burned: 3 (million)
% 0.14/0.46  % (29532)------------------------------
% 0.14/0.46  % (29532)------------------------------
% 0.14/0.46  % (29525)Success in time 0.156 s
%------------------------------------------------------------------------------