TSTP Solution File: FLD019-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : FLD019-1 : TPTP v8.2.0. 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 : n010.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 : Mon May 20 19:54:51 EDT 2024

% Result   : Unsatisfiable 0.50s 0.69s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   34 (   7 unt;   0 def)
%            Number of atoms       :   70 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   82 (  46   ~;  34   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f646,plain,
    $false,
    inference(avatar_sat_refutation,[],[f638,f641,f645]) ).

fof(f645,plain,
    spl0_20,
    inference(avatar_contradiction_clause,[],[f644]) ).

fof(f644,plain,
    ( $false
    | spl0_20 ),
    inference(subsumption_resolution,[],[f642,f29]) ).

fof(f29,axiom,
    equalish(additive_inverse(a),additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_equals_additive_identity_2) ).

fof(f642,plain,
    ( ~ equalish(additive_inverse(a),additive_identity)
    | spl0_20 ),
    inference(resolution,[],[f637,f22]) ).

fof(f22,axiom,
    ! [X0,X1] :
      ( equalish(X0,X1)
      | ~ equalish(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_equality) ).

fof(f637,plain,
    ( ~ equalish(additive_identity,additive_inverse(a))
    | spl0_20 ),
    inference(avatar_component_clause,[],[f635]) ).

fof(f635,plain,
    ( spl0_20
  <=> equalish(additive_identity,additive_inverse(a)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_20])]) ).

fof(f641,plain,
    spl0_19,
    inference(avatar_contradiction_clause,[],[f640]) ).

fof(f640,plain,
    ( $false
    | spl0_19 ),
    inference(subsumption_resolution,[],[f639,f28]) ).

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

fof(f639,plain,
    ( ~ defined(a)
    | spl0_19 ),
    inference(resolution,[],[f633,f12]) ).

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

fof(f633,plain,
    ( ~ defined(additive_inverse(a))
    | spl0_19 ),
    inference(avatar_component_clause,[],[f631]) ).

fof(f631,plain,
    ( spl0_19
  <=> defined(additive_inverse(a)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_19])]) ).

fof(f638,plain,
    ( ~ spl0_19
    | ~ spl0_20 ),
    inference(avatar_split_clause,[],[f629,f635,f631]) ).

fof(f629,plain,
    ( ~ equalish(additive_identity,additive_inverse(a))
    | ~ defined(additive_inverse(a)) ),
    inference(subsumption_resolution,[],[f626,f28]) ).

fof(f626,plain,
    ( ~ equalish(additive_identity,additive_inverse(a))
    | ~ defined(additive_inverse(a))
    | ~ defined(a) ),
    inference(resolution,[],[f625,f3]) ).

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

fof(f625,plain,
    ! [X0] :
      ( ~ equalish(add(a,X0),additive_identity)
      | ~ equalish(additive_identity,X0)
      | ~ defined(X0) ),
    inference(subsumption_resolution,[],[f619,f28]) ).

fof(f619,plain,
    ! [X0] :
      ( ~ equalish(additive_identity,X0)
      | ~ equalish(add(a,X0),additive_identity)
      | ~ defined(X0)
      | ~ defined(a) ),
    inference(resolution,[],[f98,f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( equalish(add(X0,X1),add(X1,X0))
      | ~ defined(X0)
      | ~ defined(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_addition) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ~ equalish(add(X0,a),X1)
      | ~ equalish(additive_identity,X0)
      | ~ equalish(X1,additive_identity) ),
    inference(resolution,[],[f56,f23]) ).

fof(f23,axiom,
    ! [X2,X0,X1] :
      ( equalish(X0,X2)
      | ~ equalish(X0,X1)
      | ~ equalish(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_equality) ).

fof(f56,plain,
    ! [X0] :
      ( ~ equalish(add(X0,a),additive_identity)
      | ~ equalish(additive_identity,X0) ),
    inference(subsumption_resolution,[],[f51,f28]) ).

fof(f51,plain,
    ! [X0] :
      ( ~ equalish(add(X0,a),additive_identity)
      | ~ defined(a)
      | ~ equalish(additive_identity,X0) ),
    inference(resolution,[],[f47,f24]) ).

fof(f24,axiom,
    ! [X2,X0,X1] :
      ( equalish(add(X0,X2),add(X1,X2))
      | ~ defined(X2)
      | ~ equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compatibility_of_equality_and_addition) ).

fof(f47,plain,
    ! [X0] :
      ( ~ equalish(add(additive_identity,a),X0)
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[],[f45,f23]) ).

fof(f45,plain,
    ~ equalish(add(additive_identity,a),additive_identity),
    inference(subsumption_resolution,[],[f44,f28]) ).

fof(f44,plain,
    ( ~ equalish(add(additive_identity,a),additive_identity)
    | ~ defined(a) ),
    inference(resolution,[],[f35,f2]) ).

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

fof(f35,plain,
    ! [X0] :
      ( ~ equalish(X0,a)
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[],[f32,f22]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ equalish(a,X0)
      | ~ equalish(X0,additive_identity) ),
    inference(resolution,[],[f30,f23]) ).

fof(f30,axiom,
    ~ equalish(a,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : FLD019-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.14/0.14  % 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.14/0.35  % Computer : n010.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   : Sat May 18 21:30:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.14/0.36  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/benchmark/theBenchmark.p
% 0.50/0.67  % (27116)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.50/0.67  % (27109)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 theBenchmark for (2996ds/34Mi)
% 0.50/0.67  % (27111)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.67  % (27113)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 theBenchmark for (2996ds/34Mi)
% 0.50/0.67  % (27110)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 theBenchmark for (2996ds/51Mi)
% 0.50/0.67  % (27114)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.50/0.67  % (27112)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.50/0.67  % (27115)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 theBenchmark for (2996ds/83Mi)
% 0.50/0.69  % (27114)First to succeed.
% 0.50/0.69  % (27116)Instruction limit reached!
% 0.50/0.69  % (27116)------------------------------
% 0.50/0.69  % (27116)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.69  % (27116)Termination reason: Unknown
% 0.50/0.69  % (27116)Termination phase: Saturation
% 0.50/0.69  
% 0.50/0.69  % (27116)Memory used [KB]: 1262
% 0.50/0.69  % (27116)Time elapsed: 0.017 s
% 0.50/0.69  % (27116)Instructions burned: 58 (million)
% 0.50/0.69  % (27116)------------------------------
% 0.50/0.69  % (27116)------------------------------
% 0.50/0.69  % (27114)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27108"
% 0.50/0.69  % (27114)Refutation found. Thanks to Tanya!
% 0.50/0.69  % SZS status Unsatisfiable for theBenchmark
% 0.50/0.69  % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.69  % (27114)------------------------------
% 0.50/0.69  % (27114)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.69  % (27114)Termination reason: Refutation
% 0.50/0.69  
% 0.50/0.69  % (27114)Memory used [KB]: 1155
% 0.50/0.69  % (27114)Time elapsed: 0.016 s
% 0.50/0.69  % (27114)Instructions burned: 25 (million)
% 0.50/0.69  % (27108)Success in time 0.316 s
% 0.50/0.69  % Vampire---4.8 exiting
%------------------------------------------------------------------------------