%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : NUM843+2 : TPTP v8.1.0. Released v4.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 : n017.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 18:06:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f305,plain,
    $false,
    inference(subsumption_resolution,[],[f298,f255]) ).

fof(f255,plain,
    ! [X1] : ~ leq(X1,X1),
    inference(consistent_polarity_flipping,[],[f224]) ).

fof(f224,plain,
    ! [X1] : leq(X1,X1),
    inference(equality_resolution,[],[f174]) ).

fof(f174,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f129]) ).

fof(f129,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) )
      & ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) ) ),
    inference(flattening,[],[f128]) ).

fof(f128,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1
        | ~ leq(X0,X1) )
      & ( leq(X0,X1)
        | ( ~ less(X0,X1)
          & X0 != X1 ) ) ),
    inference(nnf_transformation,[],[f72]) ).

fof(f72,plain,
    ! [X0,X1] :
      ( ( less(X0,X1)
        | X0 = X1 )
    <=> leq(X0,X1) ),
    inference(rectify,[],[f22]) ).

fof(f22,axiom,
    ! [X37,X36] :
      ( ( less(X37,X36)
        | X36 = X37 )
    <=> leq(X37,X36) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).

fof(f298,plain,
    leq(vd390,vd390),
    inference(superposition,[],[f236,f296]) ).

fof(f296,plain,
    vd390 = vd391,
    inference(subsumption_resolution,[],[f294,f172]) ).

fof(f172,plain,
    ~ greater(vd390,vd391),
    inference(cnf_transformation,[],[f78]) ).

fof(f78,plain,
    ~ greater(vd390,vd391),
    inference(flattening,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ greater(vd390,vd391),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    greater(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(244, 394, 0)') ).

fof(f294,plain,
    ( greater(vd390,vd391)
    | vd390 = vd391 ),
    inference(resolution,[],[f288,f238]) ).

fof(f238,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | X0 = X1
      | greater(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f190]) ).

fof(f190,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | greater(X0,X1)
      | X0 = X1 ),
    inference(cnf_transformation,[],[f137]) ).

fof(f137,plain,
    ! [X0,X1] :
      ( less(X0,X1)
      | X0 = X1
      | greater(X0,X1) ),
    inference(rectify,[],[f84]) ).

fof(f84,plain,
    ! [X1,X0] :
      ( less(X1,X0)
      | X0 = X1
      | greater(X1,X0) ),
    inference(rectify,[],[f26]) ).

fof(f26,axiom,
    ! [X45,X44] :
      ( less(X44,X45)
      | X44 = X45
      | greater(X44,X45) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).

fof(f288,plain,
    less(vd390,vd391),
    inference(resolution,[],[f249,f236]) ).

fof(f249,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | less(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f175]) ).

fof(f175,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f129]) ).

fof(f236,plain,
    leq(vd390,vd391),
    inference(consistent_polarity_flipping,[],[f165]) ).

fof(f165,plain,
    ~ leq(vd390,vd391),
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ~ leq(vd390,vd391),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(243), 393, 0)') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : NUM843+2 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35  % Computer : n017.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 08:25:35 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.50  % (31777)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.50  % (31785)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.50  % (31785)First to succeed.
% 0.21/0.51  % (31792)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 (2999ds/68Mi)
% 0.21/0.52  % (31785)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  % (31785)------------------------------
% 0.21/0.52  % (31785)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (31785)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (31785)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (31785)Memory used [KB]: 1023
% 0.21/0.52  % (31785)Time elapsed: 0.092 s
% 0.21/0.52  % (31785)Instructions burned: 6 (million)
% 0.21/0.52  % (31785)------------------------------
% 0.21/0.52  % (31785)------------------------------
% 0.21/0.52  % (31765)Success in time 0.155 s
%------------------------------------------------------------------------------