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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN951+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 : 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:46:11 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   3 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   76 (  27   ~;  24   |;  11   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   7 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   16 (   7   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f28,plain,
    $false,
    inference(avatar_sat_refutation,[],[f22,f23,f24,f25,f27]) ).

fof(f27,plain,
    ~ spl1_1,
    inference(avatar_contradiction_clause,[],[f26]) ).

fof(f26,plain,
    ( $false
    | ~ spl1_1 ),
    inference(resolution,[],[f13,f10]) ).

fof(f10,plain,
    p(sK0),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ( ( ( b
        & ~ b )
      | ! [X1] : ~ p(X1)
      | ( q
        & ~ q ) )
    & ? [X0] : p(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f4,plain,
    ~ ( ? [X0] : p(X0)
     => ( ( ~ b
          | b )
        & ( q
         => q )
        & ? [X1] : p(X1) ) ),
    inference(pure_predicate_removal,[],[f3]) ).

fof(f3,plain,
    ~ ( ? [X0] : p(X0)
     => ( ( a
         => ( ( ~ b
              | b )
            & ( q
             => q ) ) )
        & ? [X1] : p(X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ? [X0] : p(X0)
     => ( ( a
         => ( ( ~ b
              | b )
            & ( q
             => q ) ) )
        & ? [X0] : p(X0) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ? [X0] : p(X0)
   => ( ( a
       => ( ( ~ b
            | b )
          & ( q
           => q ) ) )
      & ? [X0] : p(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f13,plain,
    ( ! [X1] : ~ p(X1)
    | ~ spl1_1 ),
    inference(avatar_component_clause,[],[f12]) ).

fof(f12,plain,
    ( spl1_1
  <=> ! [X1] : ~ p(X1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).

fof(f25,plain,
    ( ~ spl1_2
    | spl1_1
    | spl1_3 ),
    inference(avatar_split_clause,[],[f6,f19,f12,f15]) ).

fof(f15,plain,
    ( spl1_2
  <=> b ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).

fof(f19,plain,
    ( spl1_3
  <=> q ),
    introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).

fof(f6,plain,
    ! [X1] :
      ( q
      | ~ p(X1)
      | ~ b ),
    inference(cnf_transformation,[],[f5]) ).

fof(f24,plain,
    ( spl1_1
    | ~ spl1_3
    | spl1_2 ),
    inference(avatar_split_clause,[],[f9,f15,f19,f12]) ).

fof(f9,plain,
    ! [X1] :
      ( b
      | ~ q
      | ~ p(X1) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f23,plain,
    ( ~ spl1_2
    | spl1_1
    | ~ spl1_3 ),
    inference(avatar_split_clause,[],[f8,f19,f12,f15]) ).

fof(f8,plain,
    ! [X1] :
      ( ~ q
      | ~ p(X1)
      | ~ b ),
    inference(cnf_transformation,[],[f5]) ).

fof(f22,plain,
    ( spl1_1
    | spl1_2
    | spl1_3 ),
    inference(avatar_split_clause,[],[f7,f19,f15,f12]) ).

fof(f7,plain,
    ! [X1] :
      ( q
      | b
      | ~ p(X1) ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN951+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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.34  % Computer : n006.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 22:31:39 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (20184)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.53  % (20203)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.53  % (20184)First to succeed.
% 0.20/0.53  % (20184)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (20184)------------------------------
% 0.20/0.53  % (20184)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (20184)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (20184)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (20184)Memory used [KB]: 5373
% 0.20/0.53  % (20184)Time elapsed: 0.100 s
% 0.20/0.53  % (20184)Instructions burned: 1 (million)
% 0.20/0.53  % (20184)------------------------------
% 0.20/0.53  % (20184)------------------------------
% 0.20/0.53  % (20180)Success in time 0.178 s
%------------------------------------------------------------------------------