%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL173-3 : TPTP v8.1.0. Released v2.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 : n001.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:47:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f17,plain,
    $false,
    inference(unit_resulting_resolution,[],[f15,f11,f7]) ).

fof(f7,axiom,
    ! [X3] :
      ( ~ axiom(X3)
      | theorem(X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f11,plain,
    ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    inference(definition_unfolding,[],[f9,f6,f6,f6,f6,f6]) ).

fof(f6,axiom,
    ! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f9,axiom,
    ~ theorem(implies(implies(q,r),implies(implies(p,q),implies(p,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f15,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : LCL173-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n001.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 30 02:01:46 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.44  % (5400)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.46  % (5393)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.46  % (5393)First to succeed.
% 0.18/0.46  % (5393)Refutation found. Thanks to Tanya!
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46  % (5393)------------------------------
% 0.18/0.46  % (5393)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.46  % (5393)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.46  % (5393)Termination reason: Refutation
% 0.18/0.46  
% 0.18/0.46  % (5393)Memory used [KB]: 5373
% 0.18/0.46  % (5393)Time elapsed: 0.094 s
% 0.18/0.46  % (5393)Instructions burned: 1 (million)
% 0.18/0.46  % (5393)------------------------------
% 0.18/0.46  % (5393)------------------------------
% 0.18/0.46  % (5391)Success in time 0.121 s
%------------------------------------------------------------------------------