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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET874+1 : TPTP v8.1.0. Released v3.2.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 : n011.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:25:59 EDT 2022

% Result   : Theorem 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (  10 unt;   0 def)
%            Number of atoms       :  103 (  72 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  126 (  48   ~;  46   |;  24   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-3 aty)
%            Number of variables   :   62 (  52   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f93,plain,
    $false,
    inference(trivial_inequality_removal,[],[f90]) ).

fof(f90,plain,
    unordered_pair(sK4,sK3) != unordered_pair(sK4,sK3),
    inference(superposition,[],[f49,f75]) ).

fof(f75,plain,
    ! [X2,X3] : set_union2(singleton(X2),unordered_pair(X2,X3)) = unordered_pair(X2,X3),
    inference(resolution,[],[f38,f56]) ).

fof(f56,plain,
    ! [X2,X4] : in(X4,unordered_pair(X4,X2)),
    inference(equality_resolution,[],[f55]) ).

fof(f55,plain,
    ! [X2,X0,X4] :
      ( in(X4,X0)
      | unordered_pair(X4,X2) != X0 ),
    inference(equality_resolution,[],[f40]) ).

fof(f40,plain,
    ! [X2,X0,X1,X4] :
      ( in(X4,X0)
      | X1 != X4
      | unordered_pair(X1,X2) != X0 ),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X1,X2) = X0
        | ( ( ( sK0(X0,X1,X2) != X2
              & sK0(X0,X1,X2) != X1 )
            | ~ in(sK0(X0,X1,X2),X0) )
          & ( sK0(X0,X1,X2) = X2
            | sK0(X0,X1,X2) = X1
            | in(sK0(X0,X1,X2),X0) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X0)
              | ( X2 != X4
                & X1 != X4 ) )
            & ( X2 = X4
              | X1 = X4
              | ~ in(X4,X0) ) )
        | unordered_pair(X1,X2) != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f26,f27]) ).

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

fof(f26,plain,
    ! [X0,X1,X2] :
      ( ( unordered_pair(X1,X2) = X0
        | ? [X3] :
            ( ( ( X2 != X3
                & X1 != X3 )
              | ~ in(X3,X0) )
            & ( X2 = X3
              | X1 = X3
              | in(X3,X0) ) ) )
      & ( ! [X4] :
            ( ( in(X4,X0)
              | ( X2 != X4
                & X1 != X4 ) )
            & ( X2 = X4
              | X1 = X4
              | ~ in(X4,X0) ) )
        | unordered_pair(X1,X2) != X0 ) ),
    inference(rectify,[],[f25]) ).

fof(f25,plain,
    ! [X2,X1,X0] :
      ( ( unordered_pair(X1,X0) = X2
        | ? [X3] :
            ( ( ( X0 != X3
                & X1 != X3 )
              | ~ in(X3,X2) )
            & ( X0 = X3
              | X1 = X3
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( X0 = X3
              | X1 = X3
              | ~ in(X3,X2) ) )
        | unordered_pair(X1,X0) != X2 ) ),
    inference(flattening,[],[f24]) ).

fof(f24,plain,
    ! [X2,X1,X0] :
      ( ( unordered_pair(X1,X0) = X2
        | ? [X3] :
            ( ( ( X0 != X3
                & X1 != X3 )
              | ~ in(X3,X2) )
            & ( X0 = X3
              | X1 = X3
              | in(X3,X2) ) ) )
      & ( ! [X3] :
            ( ( in(X3,X2)
              | ( X0 != X3
                & X1 != X3 ) )
            & ( X0 = X3
              | X1 = X3
              | ~ in(X3,X2) ) )
        | unordered_pair(X1,X0) != X2 ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X2,X1,X0] :
      ( unordered_pair(X1,X0) = X2
    <=> ! [X3] :
          ( in(X3,X2)
        <=> ( X0 = X3
            | X1 = X3 ) ) ),
    inference(rectify,[],[f4]) ).

fof(f4,axiom,
    ! [X1,X0,X2] :
      ( unordered_pair(X0,X1) = X2
    <=> ! [X3] :
          ( ( X0 = X3
            | X1 = X3 )
        <=> in(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | set_union2(singleton(X0),X1) = X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( set_union2(singleton(X0),X1) = X1
      | ~ in(X0,X1) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ! [X1,X0] :
      ( set_union2(singleton(X1),X0) = X0
      | ~ in(X1,X0) ),
    inference(ennf_transformation,[],[f14]) ).

fof(f14,plain,
    ! [X1,X0] :
      ( in(X1,X0)
     => set_union2(singleton(X1),X0) = X0 ),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X1,X0] :
      ( in(X0,X1)
     => set_union2(singleton(X0),X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).

fof(f49,plain,
    unordered_pair(sK4,sK3) != set_union2(singleton(sK4),unordered_pair(sK4,sK3)),
    inference(cnf_transformation,[],[f35]) ).

fof(f35,plain,
    unordered_pair(sK4,sK3) != set_union2(singleton(sK4),unordered_pair(sK4,sK3)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f33,f34]) ).

fof(f34,plain,
    ( ? [X0,X1] : unordered_pair(X1,X0) != set_union2(singleton(X1),unordered_pair(X1,X0))
   => unordered_pair(sK4,sK3) != set_union2(singleton(sK4),unordered_pair(sK4,sK3)) ),
    introduced(choice_axiom,[]) ).

fof(f33,plain,
    ? [X0,X1] : unordered_pair(X1,X0) != set_union2(singleton(X1),unordered_pair(X1,X0)),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ? [X1,X0] : unordered_pair(X0,X1) != set_union2(singleton(X0),unordered_pair(X0,X1)),
    inference(ennf_transformation,[],[f12]) ).

fof(f12,negated_conjecture,
    ~ ! [X1,X0] : unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)),
    inference(negated_conjecture,[],[f11]) ).

fof(f11,conjecture,
    ! [X1,X0] : unordered_pair(X0,X1) = set_union2(singleton(X0),unordered_pair(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET874+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 14:25:10 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.55  % (26486)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.56  % (26484)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.57  % (26506)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.57  % (26486)First to succeed.
% 0.20/0.57  TRYING [1]
% 0.20/0.57  % (26486)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Theorem for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (26486)------------------------------
% 0.20/0.57  % (26486)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57  % (26486)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57  % (26486)Termination reason: Refutation
% 0.20/0.57  
% 0.20/0.57  % (26486)Memory used [KB]: 895
% 0.20/0.57  % (26486)Time elapsed: 0.140 s
% 0.20/0.57  % (26486)Instructions burned: 3 (million)
% 0.20/0.57  % (26486)------------------------------
% 0.20/0.57  % (26486)------------------------------
% 0.20/0.57  % (26483)Success in time 0.216 s
%------------------------------------------------------------------------------