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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYN372+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 : 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 19:26:25 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   4 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   41 (  15   ~;   7   |;   8   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   21 (   9   !;  12   ?)

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

fof(f8,plain,
    ! [X2] : big_p(X2),
    inference(cnf_transformation,[],[f7]) ).

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

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

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

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

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

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

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

fof(f11,plain,
    ~ big_p(sK1),
    inference(subsumption_resolution,[],[f10,f9]) ).

fof(f9,plain,
    ! [X2] : ~ big_q(X2),
    inference(cnf_transformation,[],[f7]) ).

fof(f10,plain,
    ( big_q(sK0)
    | ~ big_p(sK1) ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN372+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.13/0.34  % Computer : n011.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 21:46:25 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.51  % (27964)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52  % (27952)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52  % (27952)First to succeed.
% 0.21/0.52  % (27952)Refutation found. Thanks to Tanya!
% 0.21/0.52  % SZS status Theorem for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52  % (27952)------------------------------
% 0.21/0.52  % (27952)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (27952)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (27952)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (27952)Memory used [KB]: 5884
% 0.21/0.52  % (27952)Time elapsed: 0.108 s
% 0.21/0.52  % (27952)------------------------------
% 0.21/0.52  % (27952)------------------------------
% 0.21/0.52  % (27949)Success in time 0.165 s
%------------------------------------------------------------------------------