TSTP Solution File: ARI015_1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : ARI015_1 : TPTP v8.1.0. Released v5.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 : n027.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 15:47:10 EDT 2022

% Result   : Theorem 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    6 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number arithmetic     :   15 (   5 atm;   0 fun;  10 num;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   0 usr;   2 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(f18,plain,
    $false,
    inference(evaluation,[],[f17]) ).

tff(f17,plain,
    $less(3,2),
    inference(cnf_transformation,[],[f16]) ).

tff(f16,plain,
    $less(3,2),
    inference(flattening,[],[f3]) ).

tff(f3,plain,
    ~ ~ $less(3,2),
    inference(theory_normalization,[],[f2]) ).

tff(f2,negated_conjecture,
    ~ $lesseq(2,3),
    inference(negated_conjecture,[],[f1]) ).

tff(f1,conjecture,
    $lesseq(2,3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_2_lesseq_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ARI015=1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/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 : n027.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   : Mon Aug 29 15:32:45 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.21/0.51  % (7677)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/138Mi)
% 0.21/0.52  % (7669)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.21/0.52  % (7677)First to succeed.
% 0.21/0.52  % (7677)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  % (7677)------------------------------
% 0.21/0.52  % (7677)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (7677)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52  % (7677)Termination reason: Refutation
% 0.21/0.52  
% 0.21/0.52  % (7677)Memory used [KB]: 5373
% 0.21/0.52  % (7677)Time elapsed: 0.004 s
% 0.21/0.52  % (7677)Instructions burned: 2 (million)
% 0.21/0.52  % (7677)------------------------------
% 0.21/0.52  % (7677)------------------------------
% 0.21/0.52  % (7655)Success in time 0.172 s
%------------------------------------------------------------------------------