%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL460+1 : TPTP v8.1.0. Released v3.3.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 : n022.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 17:48:25 EDT 2022

% Result   : Theorem 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   29 (  10 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   34 (  15   ~;  10   |;   0   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (  20   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f293,plain,
    $false,
    inference(avatar_sat_refutation,[],[f261,f283,f292]) ).

fof(f292,plain,
    spl2_19,
    inference(avatar_contradiction_clause,[],[f291]) ).

fof(f291,plain,
    ( $false
    | spl2_19 ),
    inference(subsumption_resolution,[],[f256,f280]) ).

fof(f280,plain,
    ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)),
    inference(subsumption_resolution,[],[f166,f147]) ).

fof(f147,plain,
    and_1,
    inference(cnf_transformation,[],[f40]) ).

fof(f40,axiom,
    and_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).

fof(f166,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(and(X0,X1),X0))
      | ~ and_1 ),
    inference(cnf_transformation,[],[f131]) ).

fof(f131,plain,
    ( ~ and_1
    | ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
    inference(rectify,[],[f102]) ).

fof(f102,plain,
    ( ~ and_1
    | ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
    inference(ennf_transformation,[],[f88]) ).

fof(f88,plain,
    ( and_1
   => ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
    inference(unused_predicate_definition_removal,[],[f70]) ).

fof(f70,plain,
    ( and_1
  <=> ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ( ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0))
  <=> and_1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).

fof(f256,plain,
    ( ~ is_a_theorem(implies(and(sK1,sK0),sK1))
    | spl2_19 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f254,plain,
    ( spl2_19
  <=> is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_19])]) ).

fof(f283,plain,
    ~ spl2_20,
    inference(avatar_split_clause,[],[f167,f258]) ).

fof(f258,plain,
    ( spl2_20
  <=> kn2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_20])]) ).

fof(f167,plain,
    ~ kn2,
    inference(cnf_transformation,[],[f71]) ).

fof(f71,plain,
    ~ kn2,
    inference(flattening,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ kn2,
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    kn2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).

fof(f261,plain,
    ( ~ spl2_19
    | spl2_20 ),
    inference(avatar_split_clause,[],[f158,f258,f254]) ).

fof(f158,plain,
    ( kn2
    | ~ is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    inference(cnf_transformation,[],[f127]) ).

fof(f127,plain,
    ( ~ is_a_theorem(implies(and(sK1,sK0),sK1))
    | kn2 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f125,f126]) ).

fof(f126,plain,
    ( ? [X0,X1] : ~ is_a_theorem(implies(and(X1,X0),X1))
   => ~ is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    introduced(choice_axiom,[]) ).

fof(f125,plain,
    ( ? [X0,X1] : ~ is_a_theorem(implies(and(X1,X0),X1))
    | kn2 ),
    inference(rectify,[],[f116]) ).

fof(f116,plain,
    ( ? [X1,X0] : ~ is_a_theorem(implies(and(X0,X1),X0))
    | kn2 ),
    inference(ennf_transformation,[],[f79]) ).

fof(f79,plain,
    ( ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0))
   => kn2 ),
    inference(unused_predicate_definition_removal,[],[f68]) ).

fof(f68,plain,
    ( kn2
  <=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0)) ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ( kn2
  <=> ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL460+1 : TPTP v8.1.0. Released v3.3.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 : n022.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 02:03:56 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.51  % (7525)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51  % (7535)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.51  % (7527)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  % (7527)First to succeed.
% 0.20/0.52  % (7538)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.52  % (7528)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 (2999ds/48Mi)
% 0.20/0.52  % (7551)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.52  % (7528)Also succeeded, but the first one will report.
% 0.20/0.52  % (7527)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Theorem for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (7527)------------------------------
% 0.20/0.52  % (7527)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (7527)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (7527)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (7527)Memory used [KB]: 5500
% 0.20/0.52  % (7527)Time elapsed: 0.004 s
% 0.20/0.52  % (7527)Instructions burned: 3 (million)
% 0.20/0.52  % (7527)------------------------------
% 0.20/0.52  % (7527)------------------------------
% 0.20/0.52  % (7522)Success in time 0.175 s
%------------------------------------------------------------------------------