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

View Problem - Process Solution

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

% Computer : n010.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:37:44 EDT 2022

% Result   : Theorem 0.16s 0.48s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   4 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  14   ~;  12   |;   8   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   40 (  28   !;  12   ?)

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

fof(f11,plain,
    ! [X1] : ~ big_p(X1,sK0),
    inference(cnf_transformation,[],[f8]) ).

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

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

fof(f7,plain,
    ! [X2] :
      ( ? [X3] :
          ( ! [X4] : big_p(X3,X4)
          | big_q(X3,X2) )
     => ( ! [X4] : big_p(sK1(X2),X4)
        | big_q(sK1(X2),X2) ) ),
    introduced(choice_axiom,[]) ).

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

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

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

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

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

fof(f12,plain,
    ! [X0] : big_p(sK1(sK0),X0),
    inference(resolution,[],[f9,f10]) ).

fof(f10,plain,
    ! [X1] : ~ big_q(X1,sK0),
    inference(cnf_transformation,[],[f8]) ).

fof(f9,plain,
    ! [X2,X4] :
      ( big_q(sK1(X2),X2)
      | big_p(sK1(X2),X4) ),
    inference(cnf_transformation,[],[f8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SYN382+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Aug 30 21:42:43 EDT 2022
% 0.11/0.32  % CPUTime    : 
% 0.16/0.47  % (13006)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/48Mi)
% 0.16/0.47  % (13006)First to succeed.
% 0.16/0.48  % (13015)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.16/0.48  % (13006)Refutation found. Thanks to Tanya!
% 0.16/0.48  % SZS status Theorem for theBenchmark
% 0.16/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48  % (13006)------------------------------
% 0.16/0.48  % (13006)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48  % (13006)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48  % (13006)Termination reason: Refutation
% 0.16/0.48  
% 0.16/0.48  % (13006)Memory used [KB]: 5373
% 0.16/0.48  % (13006)Time elapsed: 0.096 s
% 0.16/0.48  % (13006)Instructions burned: 2 (million)
% 0.16/0.48  % (13006)------------------------------
% 0.16/0.48  % (13006)------------------------------
% 0.16/0.48  % (13000)Success in time 0.157 s
%------------------------------------------------------------------------------