TSTP Solution File: FLD064-3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : FLD064-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n013.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 May  1 02:20:15 EDT 2024

% Result   : Unsatisfiable 0.65s 0.83s
% Output   : Refutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   18 (  10 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   29 (  16   ~;  12   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   23 (  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f258,plain,
    $false,
    inference(subsumption_resolution,[],[f256,f57]) ).

fof(f57,plain,
    sum(additive_identity,additive_inverse(a),additive_inverse(a)),
    inference(unit_resulting_resolution,[],[f49,f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( sum(additive_identity,X0,X0)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',existence_of_identity_addition) ).

fof(f49,plain,
    defined(additive_inverse(a)),
    inference(unit_resulting_resolution,[],[f27,f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( defined(additive_inverse(X0))
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',well_definedness_of_additive_inverse) ).

fof(f27,axiom,
    defined(a),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',a_is_defined) ).

fof(f256,plain,
    ~ sum(additive_identity,additive_inverse(a),additive_inverse(a)),
    inference(unit_resulting_resolution,[],[f29,f240,f31]) ).

fof(f31,plain,
    ! [X0,X1,X4,X5] :
      ( ~ sP0(X0,X5,X1)
      | less_or_equal(X4,X1)
      | ~ sum(X0,X5,X4) ),
    inference(general_splitting,[],[f24,f30_D]) ).

fof(f30,plain,
    ! [X3,X0,X1,X5] :
      ( ~ sum(X3,X5,X1)
      | ~ less_or_equal(X0,X3)
      | sP0(X0,X5,X1) ),
    inference(cnf_transformation,[],[f30_D]) ).

fof(f30_D,plain,
    ! [X1,X5,X0] :
      ( ! [X3] :
          ( ~ sum(X3,X5,X1)
          | ~ less_or_equal(X0,X3) )
    <=> ~ sP0(X0,X5,X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).

fof(f24,axiom,
    ! [X3,X0,X1,X4,X5] :
      ( ~ sum(X3,X5,X1)
      | ~ sum(X0,X5,X4)
      | ~ less_or_equal(X0,X3)
      | less_or_equal(X4,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',compatibility_of_order_relation_and_addition) ).

fof(f240,plain,
    sP0(additive_identity,additive_inverse(a),additive_identity),
    inference(unit_resulting_resolution,[],[f28,f71,f30]) ).

fof(f71,plain,
    sum(a,additive_inverse(a),additive_identity),
    inference(unit_resulting_resolution,[],[f48,f5]) ).

fof(f5,axiom,
    ! [X3,X0,X5] :
      ( ~ sum(X0,X3,X5)
      | sum(X3,X0,X5) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',commutativity_addition) ).

fof(f48,plain,
    sum(additive_inverse(a),a,additive_identity),
    inference(unit_resulting_resolution,[],[f27,f4]) ).

fof(f4,axiom,
    ! [X0] :
      ( sum(additive_inverse(X0),X0,additive_identity)
      | ~ defined(X0) ),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',existence_of_inverse_addition) ).

fof(f28,axiom,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',less_or_equal_2) ).

fof(f29,axiom,
    ~ less_or_equal(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752',not_less_or_equal_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : FLD064-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33  % Computer : n013.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 Apr 30 17:57:49 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.12/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.ZEJl4y6ZXm/Vampire---4.8_32752
% 0.65/0.82  % (396)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.82  % (400)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.65/0.82  % (399)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.65/0.82  % (398)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.65/0.82  % (397)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.65/0.82  % (401)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.65/0.82  % (402)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.65/0.82  % (403)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.65/0.83  % (402)First to succeed.
% 0.65/0.83  % (398)Also succeeded, but the first one will report.
% 0.65/0.83  % (402)Refutation found. Thanks to Tanya!
% 0.65/0.83  % SZS status Unsatisfiable for Vampire---4
% 0.65/0.83  % SZS output start Proof for Vampire---4
% See solution above
% 0.65/0.83  % (402)------------------------------
% 0.65/0.83  % (402)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.65/0.83  % (402)Termination reason: Refutation
% 0.65/0.83  
% 0.65/0.83  % (402)Memory used [KB]: 1086
% 0.65/0.83  % (402)Time elapsed: 0.006 s
% 0.65/0.83  % (402)Instructions burned: 9 (million)
% 0.65/0.83  % (402)------------------------------
% 0.65/0.83  % (402)------------------------------
% 0.65/0.83  % (393)Success in time 0.487 s
% 0.65/0.83  % Vampire---4.8 exiting
%------------------------------------------------------------------------------