%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN045+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 : 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:36:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f31,plain,
    $false,
    inference(sat_instgen_refutation,[],[f11,f18,f30,f17,f12,f10,f19,f16]) ).

fof(f16,plain,
    ( sP0
    | q
    | p ),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,plain,
    ( ( ( ~ p
        & ( ~ r
          | ~ q ) )
      | ~ sP0 )
    & ( p
      | ( r
        & q )
      | sP0 ) ),
    inference(flattening,[],[f8]) ).

fof(f8,plain,
    ( ( ( ~ p
        & ( ~ r
          | ~ q ) )
      | ~ sP0 )
    & ( p
      | ( r
        & q )
      | sP0 ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f5,plain,
    ( sP0
  <~> ( p
      | ( r
        & q ) ) ),
    inference(definition_folding,[],[f3,f4]) ).

fof(f4,plain,
    ( sP0
  <=> ( ( p
        | q )
      & ( p
        | r ) ) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f3,plain,
    ( ( ( p
        | q )
      & ( p
        | r ) )
  <~> ( p
      | ( r
        & q ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( ( ( p
          | q )
        & ( p
          | r ) )
    <=> ( p
        | ( r
          & q ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ( ( ( p
        | q )
      & ( p
        | r ) )
  <=> ( p
      | ( r
        & q ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel13) ).

fof(f19,plain,
    ( ~ p
    | ~ sP0 ),
    inference(cnf_transformation,[],[f9]) ).

fof(f10,plain,
    ( p
    | r
    | ~ sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ( ( sP0
      | ( ~ p
        & ~ q )
      | ( ~ p
        & ~ r ) )
    & ( ( ( p
          | q )
        & ( p
          | r ) )
      | ~ sP0 ) ),
    inference(flattening,[],[f6]) ).

fof(f6,plain,
    ( ( sP0
      | ( ~ p
        & ~ q )
      | ( ~ p
        & ~ r ) )
    & ( ( ( p
          | q )
        & ( p
          | r ) )
      | ~ sP0 ) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f12,plain,
    ( ~ r
    | ~ q
    | sP0 ),
    inference(cnf_transformation,[],[f7]) ).

fof(f17,plain,
    ( p
    | r
    | sP0 ),
    inference(cnf_transformation,[],[f9]) ).

fof(f30,plain,
    ( sP0
    | ~ p ),
    inference(duplicate_literal_removal,[],[f15]) ).

fof(f15,plain,
    ( ~ p
    | sP0
    | ~ p ),
    inference(cnf_transformation,[],[f7]) ).

fof(f18,plain,
    ( ~ r
    | ~ q
    | ~ sP0 ),
    inference(cnf_transformation,[],[f9]) ).

fof(f11,plain,
    ( ~ sP0
    | p
    | q ),
    inference(cnf_transformation,[],[f7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN045+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/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 : n020.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:26:00 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.48  % (6155)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.19/0.49  % (6147)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.19/0.50  % (6155)First to succeed.
% 0.19/0.50  % (6155)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (6155)------------------------------
% 0.19/0.50  % (6155)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (6155)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (6155)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (6155)Memory used [KB]: 5628
% 0.19/0.50  % (6155)Time elapsed: 0.004 s
% 0.19/0.50  % (6155)Instructions burned: 3 (million)
% 0.19/0.50  % (6155)------------------------------
% 0.19/0.50  % (6155)------------------------------
% 0.19/0.50  % (6138)Success in time 0.144 s
%------------------------------------------------------------------------------