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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN355+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 : n020.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:22 EDT 2022

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   55 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   64 (  24   ~;  13   |;  17   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   23 (  19   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,plain,
    $false,
    inference(subsumption_resolution,[],[f14,f10]) ).

fof(f10,plain,
    ~ big_p(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X0] :
        ( big_r(X0)
        | big_q(X0) )
    & ~ big_q(sK0)
    & ~ big_p(sK0)
    & ! [X2] :
        ( big_p(X2)
        | ~ big_r(X2) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).

fof(f7,plain,
    ( ? [X1] :
        ( ~ big_q(X1)
        & ~ big_p(X1) )
   => ( ~ big_q(sK0)
      & ~ big_p(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    ( ! [X0] :
        ( big_r(X0)
        | big_q(X0) )
    & ? [X1] :
        ( ~ big_q(X1)
        & ~ big_p(X1) )
    & ! [X2] :
        ( big_p(X2)
        | ~ big_r(X2) ) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ( ! [X0] :
        ( big_r(X0)
        | big_q(X0) )
    & ? [X2] :
        ( ~ big_q(X2)
        & ~ big_p(X2) )
    & ! [X1] :
        ( big_p(X1)
        | ~ big_r(X1) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ( ? [X2] :
        ( ~ big_q(X2)
        & ~ big_p(X2) )
    & ! [X1] :
        ( big_p(X1)
        | ~ big_r(X1) )
    & ! [X0] :
        ( big_r(X0)
        | big_q(X0) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ( ( ! [X1] :
            ( big_r(X1)
           => big_p(X1) )
        & ! [X0] :
            ( ~ big_q(X0)
           => big_r(X0) ) )
     => ! [X2] :
          ( big_p(X2)
          | big_q(X2) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ! [X0] :
            ( ~ big_q(X0)
           => big_r(X0) )
        & ! [X0] :
            ( big_r(X0)
           => big_p(X0) ) )
     => ! [X0] :
          ( big_p(X0)
          | big_q(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ! [X0] :
          ( ~ big_q(X0)
         => big_r(X0) )
      & ! [X0] :
          ( big_r(X0)
         => big_p(X0) ) )
   => ! [X0] :
        ( big_p(X0)
        | big_q(X0) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2106) ).

fof(f14,plain,
    big_p(sK0),
    inference(resolution,[],[f13,f9]) ).

fof(f9,plain,
    ! [X2] :
      ( ~ big_r(X2)
      | big_p(X2) ),
    inference(cnf_transformation,[],[f8]) ).

fof(f13,plain,
    big_r(sK0),
    inference(resolution,[],[f12,f11]) ).

fof(f11,plain,
    ~ big_q(sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f12,plain,
    ! [X0] :
      ( big_q(X0)
      | big_r(X0) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN355+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/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.15/0.34  % Computer : n020.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Tue Aug 30 21:49:30 EDT 2022
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  % (10385)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.21/0.49  % (10385)First to succeed.
% 0.21/0.50  % (10401)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.21/0.50  % (10385)Refutation found. Thanks to Tanya!
% 0.21/0.50  % SZS status Theorem for theBenchmark
% 0.21/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50  % (10385)------------------------------
% 0.21/0.50  % (10385)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (10385)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (10385)Termination reason: Refutation
% 0.21/0.50  
% 0.21/0.50  % (10385)Memory used [KB]: 5884
% 0.21/0.50  % (10385)Time elapsed: 0.087 s
% 0.21/0.50  % (10385)Instructions burned: 1 (million)
% 0.21/0.50  % (10385)------------------------------
% 0.21/0.50  % (10385)------------------------------
% 0.21/0.50  % (10378)Success in time 0.147 s
%------------------------------------------------------------------------------