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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN361+1 : TPTP v8.1.0. Released v2.0.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 : n006.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 19:26:23 EDT 2022

% Result   : Theorem 0.21s 0.48s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   62 (  23   ~;  10   |;  18   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   58 (  41   !;  17   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,plain,
    $false,
    inference(unit_resulting_resolution,[],[f12,f14,f13]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ~ big_q(X1,X0)
      | ~ big_p(X1,X0) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ! [X0,X1] :
        ( ~ big_q(X1,X0)
        | ~ big_p(X1,X0) )
    & ! [X3] : big_p(X3,sK0)
    & ! [X4] : big_s(X4)
    & ! [X5] :
        ( ~ big_s(X5)
        | big_q(sK1(X5),X5) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).

fof(f7,plain,
    ( ? [X2] :
      ! [X3] : big_p(X3,X2)
   => ! [X3] : big_p(X3,sK0) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ! [X5] :
      ( ? [X6] : big_q(X6,X5)
     => big_q(sK1(X5),X5) ),
    introduced(choice_axiom,[]) ).

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

fof(f5,plain,
    ( ! [X0,X1] :
        ( ~ big_q(X1,X0)
        | ~ big_p(X1,X0) )
    & ? [X4] :
      ! [X5] : big_p(X5,X4)
    & ! [X6] : big_s(X6)
    & ! [X2] :
        ( ~ big_s(X2)
        | ? [X3] : big_q(X3,X2) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ! [X6] : big_s(X6)
    & ? [X4] :
      ! [X5] : big_p(X5,X4)
    & ! [X0,X1] :
        ( ~ big_q(X1,X0)
        | ~ big_p(X1,X0) )
    & ! [X2] :
        ( ~ big_s(X2)
        | ? [X3] : big_q(X3,X2) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ? [X4] :
          ! [X5] : big_p(X5,X4)
        & ! [X1,X0] :
            ( big_p(X1,X0)
           => ~ big_q(X1,X0) )
        & ! [X2] :
            ( big_s(X2)
           => ? [X3] : big_q(X3,X2) ) )
     => ? [X6] : ~ big_s(X6) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X2,X1] :
            ( big_p(X1,X2)
           => ~ big_q(X1,X2) )
        & ! [X1] :
            ( big_s(X1)
           => ? [X2] : big_q(X2,X1) )
        & ? [X0] :
          ! [X1] : big_p(X1,X0) )
     => ? [X3] : ~ big_s(X3) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X2,X1] :
          ( big_p(X1,X2)
         => ~ big_q(X1,X2) )
      & ! [X1] :
          ( big_s(X1)
         => ? [X2] : big_q(X2,X1) )
      & ? [X0] :
        ! [X1] : big_p(X1,X0) )
   => ? [X3] : ~ big_s(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2112) ).

fof(f14,plain,
    ! [X5] : big_q(sK1(X5),X5),
    inference(subsumption_resolution,[],[f10,f11]) ).

fof(f11,plain,
    ! [X4] : big_s(X4),
    inference(cnf_transformation,[],[f9]) ).

fof(f10,plain,
    ! [X5] :
      ( big_q(sK1(X5),X5)
      | ~ big_s(X5) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f12,plain,
    ! [X3] : big_p(X3,sK0),
    inference(cnf_transformation,[],[f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN361+1 : TPTP v8.1.0. Released v2.0.0.
% 0.13/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n006.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 21:46:54 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.47  % (16646)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.47  % (16657)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.47  % (16657)First to succeed.
% 0.21/0.48  % (16657)Refutation found. Thanks to Tanya!
% 0.21/0.48  % SZS status Theorem for theBenchmark
% 0.21/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48  % (16657)------------------------------
% 0.21/0.48  % (16657)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.48  % (16657)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.48  % (16657)Termination reason: Refutation
% 0.21/0.48  
% 0.21/0.48  % (16657)Memory used [KB]: 1407
% 0.21/0.48  % (16657)Time elapsed: 0.085 s
% 0.21/0.48  % (16657)Instructions burned: 1 (million)
% 0.21/0.48  % (16657)------------------------------
% 0.21/0.48  % (16657)------------------------------
% 0.21/0.48  % (16633)Success in time 0.121 s
%------------------------------------------------------------------------------