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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN940+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_sat --cores 0 -t %d %s

% Computer : n005.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:46:09 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   4 unt;   0 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :   87 (  28   ~;  28   |;  21   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   48 (  38   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,plain,
    $false,
    inference(resolution,[],[f18,f11]) ).

fof(f11,plain,
    ! [X2] : ~ q(f(X2)),
    inference(consistent_polarity_flipping,[],[f10]) ).

fof(f10,plain,
    ! [X2] : q(f(X2)),
    inference(cnf_transformation,[],[f6]) ).

fof(f6,plain,
    ( ! [X2] : q(f(X2))
    & ! [X3,X4] :
        ( ~ q(X3)
        | ( p(f(X4))
          & ( ~ p(X3)
            | ( r(X4)
              & ( ~ r(sK1)
                | ~ r(sK0) ) ) ) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f4,f5]) ).

fof(f5,plain,
    ( ? [X0,X1] :
        ( ! [X2] : q(f(X2))
        & ! [X3,X4] :
            ( ~ q(X3)
            | ( p(f(X4))
              & ( ~ p(X3)
                | ( r(X4)
                  & ( ~ r(X1)
                    | ~ r(X0) ) ) ) ) ) )
   => ( ! [X2] : q(f(X2))
      & ! [X4,X3] :
          ( ~ q(X3)
          | ( p(f(X4))
            & ( ~ p(X3)
              | ( r(X4)
                & ( ~ r(sK1)
                  | ~ r(sK0) ) ) ) ) ) ) ),
    introduced(choice_axiom,[]) ).

fof(f4,plain,
    ? [X0,X1] :
      ( ! [X2] : q(f(X2))
      & ! [X3,X4] :
          ( ~ q(X3)
          | ( p(f(X4))
            & ( ~ p(X3)
              | ( r(X4)
                & ( ~ r(X1)
                  | ~ r(X0) ) ) ) ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ! [X0,X1] :
        ( ! [X2] : q(f(X2))
       => ? [X3,X4] :
            ( ( p(f(X4))
             => ( ( r(X4)
                 => ( r(X1)
                    & r(X0) ) )
                & p(X3) ) )
            & q(X3) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ! [X1,X0] :
        ( ! [X2] : q(f(X2))
       => ? [X3,X4] :
            ( q(X3)
            & ( p(f(X4))
             => ( p(X3)
                & ( r(X4)
                 => ( r(X1)
                    & r(X0) ) ) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ! [X1,X0] :
      ( ! [X2] : q(f(X2))
     => ? [X3,X4] :
          ( q(X3)
          & ( p(f(X4))
           => ( p(X3)
              & ( r(X4)
               => ( r(X1)
                  & r(X0) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f18,plain,
    ! [X0] : q(X0),
    inference(subsumption_resolution,[],[f17,f11]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( q(X0)
      | q(f(X1)) ),
    inference(resolution,[],[f12,f16]) ).

fof(f16,plain,
    ! [X3] :
      ( p(X3)
      | q(X3) ),
    inference(subsumption_resolution,[],[f15,f14]) ).

fof(f14,plain,
    ! [X3,X4] :
      ( ~ r(X4)
      | p(X3)
      | q(X3) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f8,plain,
    ! [X3,X4] :
      ( ~ p(X3)
      | ~ q(X3)
      | r(X4) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f15,plain,
    ! [X3] :
      ( p(X3)
      | q(X3)
      | r(sK0) ),
    inference(subsumption_resolution,[],[f13,f14]) ).

fof(f13,plain,
    ! [X3] :
      ( r(sK1)
      | p(X3)
      | r(sK0)
      | q(X3) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f7,plain,
    ! [X3] :
      ( ~ r(sK0)
      | ~ r(sK1)
      | ~ p(X3)
      | ~ q(X3) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f12,plain,
    ! [X3,X4] :
      ( ~ p(f(X4))
      | q(X3) ),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f9,plain,
    ! [X3,X4] :
      ( ~ q(X3)
      | p(f(X4)) ),
    inference(cnf_transformation,[],[f6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN940+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % 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.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 23:10:03 EDT 2022
% 0.13/0.33  % CPUTime    : 
% 0.20/0.49  % (20514)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.49  % (20523)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.49  % (20525)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.20/0.50  % (20523)First to succeed.
% 0.20/0.50  % (20531)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/177Mi)
% 0.20/0.50  % (20523)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Theorem for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (20523)------------------------------
% 0.20/0.50  % (20523)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (20523)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (20523)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (20523)Memory used [KB]: 895
% 0.20/0.50  % (20523)Time elapsed: 0.110 s
% 0.20/0.50  % (20523)Instructions burned: 1 (million)
% 0.20/0.50  % (20523)------------------------------
% 0.20/0.50  % (20523)------------------------------
% 0.20/0.50  % (20500)Success in time 0.157 s
%------------------------------------------------------------------------------