TSTP Solution File: FLD064-3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : FLD064-3 : TPTP v8.1.0. Bugfixed v2.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 : 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 16:06:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f140,plain,
    $false,
    inference(subsumption_resolution,[],[f139,f31]) ).

fof(f31,plain,
    ~ less_or_equal(sF0,additive_identity),
    inference(definition_folding,[],[f29,f30]) ).

fof(f30,plain,
    additive_inverse(a) = sF0,
    introduced(function_definition,[]) ).

fof(f29,axiom,
    ~ less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_3) ).

fof(f139,plain,
    less_or_equal(sF0,additive_identity),
    inference(subsumption_resolution,[],[f134,f33]) ).

fof(f33,plain,
    defined(sF0),
    inference(subsumption_resolution,[],[f32,f27]) ).

fof(f27,axiom,
    defined(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).

fof(f32,plain,
    ( defined(sF0)
    | ~ defined(a) ),
    inference(superposition,[],[f15,f30]) ).

fof(f15,axiom,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',well_definedness_of_additive_inverse) ).

fof(f134,plain,
    ( ~ defined(sF0)
    | less_or_equal(sF0,additive_identity) ),
    inference(resolution,[],[f106,f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( sum(additive_identity,X0,X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_identity_addition) ).

fof(f106,plain,
    ! [X5] :
      ( ~ sum(additive_identity,sF0,X5)
      | less_or_equal(X5,additive_identity) ),
    inference(resolution,[],[f60,f38]) ).

fof(f38,plain,
    sum(a,sF0,additive_identity),
    inference(resolution,[],[f5,f35]) ).

fof(f35,plain,
    sum(sF0,a,additive_identity),
    inference(subsumption_resolution,[],[f34,f27]) ).

fof(f34,plain,
    ( ~ defined(a)
    | sum(sF0,a,additive_identity) ),
    inference(superposition,[],[f4,f30]) ).

fof(f4,axiom,
    ! [X0] :
      ( sum(additive_inverse(X0),X0,additive_identity)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_inverse_addition) ).

fof(f5,axiom,
    ! [X3,X0,X5] :
      ( ~ sum(X0,X3,X5)
      | sum(X3,X0,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_addition) ).

fof(f60,plain,
    ! [X2,X0,X1] :
      ( ~ sum(a,X0,X1)
      | less_or_equal(X2,X1)
      | ~ sum(additive_identity,X0,X2) ),
    inference(resolution,[],[f24,f28]) ).

fof(f28,axiom,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_2) ).

fof(f24,axiom,
    ! [X3,X0,X1,X4,X5] :
      ( ~ less_or_equal(X0,X3)
      | ~ sum(X3,X5,X1)
      | less_or_equal(X4,X1)
      | ~ sum(X0,X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatibility_of_order_relation_and_addition) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : FLD064-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/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 : n022.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   : Mon Aug 29 20:45:11 EDT 2022
% 0.12/0.33  % CPUTime    : 
% 0.18/0.48  % (2501)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.18/0.48  % (2509)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.18/0.49  % (2501)First to succeed.
% 0.18/0.51  % (2501)Refutation found. Thanks to Tanya!
% 0.18/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.51  % (2501)------------------------------
% 0.18/0.51  % (2501)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51  % (2501)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51  % (2501)Termination reason: Refutation
% 0.18/0.51  
% 0.18/0.51  % (2501)Memory used [KB]: 1023
% 0.18/0.51  % (2501)Time elapsed: 0.080 s
% 0.18/0.51  % (2501)Instructions burned: 10 (million)
% 0.18/0.51  % (2501)------------------------------
% 0.18/0.51  % (2501)------------------------------
% 0.18/0.51  % (2485)Success in time 0.162 s
%------------------------------------------------------------------------------