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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : FLD019-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Mon May 20 19:56:21 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f46535,plain,
    $false,
    inference(avatar_sat_refutation,[],[f26677,f46524]) ).

fof(f46524,plain,
    spl0_1647,
    inference(avatar_contradiction_clause,[],[f46523]) ).

fof(f46523,plain,
    ( $false
    | spl0_1647 ),
    inference(subsumption_resolution,[],[f46495,f15289]) ).

fof(f15289,plain,
    ( ~ equalish(additive_identity,a)
    | spl0_1647 ),
    inference(avatar_component_clause,[],[f15287]) ).

fof(f15287,plain,
    ( spl0_1647
  <=> equalish(additive_identity,a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1647])]) ).

fof(f46495,plain,
    equalish(additive_identity,a),
    inference(resolution,[],[f25645,f933]) ).

fof(f933,plain,
    ! [X0] :
      ( ~ equalish(add(a,additive_inverse(a)),X0)
      | equalish(additive_identity,X0) ),
    inference(resolution,[],[f53,f28]) ).

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

fof(f53,plain,
    ! [X0,X1] :
      ( ~ defined(X0)
      | equalish(additive_identity,X1)
      | ~ equalish(add(X0,additive_inverse(X0)),X1) ),
    inference(resolution,[],[f23,f36]) ).

fof(f36,plain,
    ! [X0] :
      ( equalish(additive_identity,add(X0,additive_inverse(X0)))
      | ~ defined(X0) ),
    inference(resolution,[],[f3,f22]) ).

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

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

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

fof(f25645,plain,
    equalish(add(a,additive_inverse(a)),a),
    inference(subsumption_resolution,[],[f25644,f29]) ).

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

fof(f25644,plain,
    ( equalish(add(a,additive_inverse(a)),a)
    | ~ equalish(additive_inverse(a),additive_identity) ),
    inference(subsumption_resolution,[],[f25607,f28]) ).

fof(f25607,plain,
    ( equalish(add(a,additive_inverse(a)),a)
    | ~ defined(a)
    | ~ equalish(additive_inverse(a),additive_identity) ),
    inference(resolution,[],[f1773,f1152]) ).

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

fof(f1138,plain,
    ! [X0] :
      ( ~ equalish(X0,additive_identity)
      | equalish(add(X0,a),a)
      | ~ defined(a) ),
    inference(resolution,[],[f463,f2]) ).

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

fof(f463,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(add(X1,a),X2)
      | ~ equalish(X0,X1)
      | equalish(add(X0,a),X2) ),
    inference(resolution,[],[f115,f28]) ).

fof(f115,plain,
    ! [X2,X3,X0,X1] :
      ( ~ defined(X2)
      | ~ equalish(X0,X1)
      | ~ equalish(add(X1,X2),X3)
      | equalish(add(X0,X2),X3) ),
    inference(resolution,[],[f24,f23]) ).

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

fof(f1773,plain,
    ! [X0,X1] :
      ( ~ equalish(add(additive_inverse(a),X0),X1)
      | equalish(add(X0,additive_inverse(a)),X1)
      | ~ defined(X0) ),
    inference(resolution,[],[f386,f28]) ).

fof(f386,plain,
    ! [X2,X0,X1] :
      ( ~ defined(X1)
      | ~ equalish(add(additive_inverse(X1),X0),X2)
      | equalish(add(X0,additive_inverse(X1)),X2)
      | ~ defined(X0) ),
    inference(resolution,[],[f97,f12]) ).

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

fof(f97,plain,
    ! [X2,X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | ~ equalish(add(X1,X0),X2)
      | equalish(add(X0,X1),X2) ),
    inference(resolution,[],[f4,f23]) ).

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

fof(f26677,plain,
    ~ spl0_1647,
    inference(avatar_contradiction_clause,[],[f26676]) ).

fof(f26676,plain,
    ( $false
    | ~ spl0_1647 ),
    inference(subsumption_resolution,[],[f26662,f30]) ).

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

fof(f26662,plain,
    ( equalish(a,additive_identity)
    | ~ spl0_1647 ),
    inference(resolution,[],[f15288,f22]) ).

fof(f15288,plain,
    ( equalish(additive_identity,a)
    | ~ spl0_1647 ),
    inference(avatar_component_clause,[],[f15287]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11  % Problem    : FLD019-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -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   : Sat May 18 21:30:38 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.12/0.33  % (21567)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.35  % (21570)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.18/0.35  % (21571)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.18/0.35  % (21574)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.18/0.35  % (21569)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.18/0.35  % (21573)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.18/0.35  % (21572)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.18/0.35  % (21568)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.18/0.35  TRYING [1]
% 0.18/0.35  TRYING [2]
% 0.18/0.35  TRYING [1]
% 0.18/0.35  TRYING [2]
% 0.18/0.35  TRYING [1]
% 0.18/0.35  TRYING [1]
% 0.18/0.35  TRYING [2]
% 0.18/0.35  TRYING [2]
% 0.18/0.35  TRYING [3]
% 0.18/0.35  TRYING [3]
% 0.18/0.35  TRYING [3]
% 0.18/0.35  TRYING [3]
% 0.18/0.36  TRYING [4]
% 0.18/0.37  TRYING [4]
% 0.18/0.37  TRYING [4]
% 0.18/0.37  TRYING [4]
% 0.18/0.39  TRYING [5]
% 0.18/0.40  TRYING [5]
% 0.18/0.40  TRYING [5]
% 0.18/0.41  TRYING [5]
% 0.18/0.48  TRYING [6]
% 0.18/0.49  TRYING [6]
% 0.18/0.49  TRYING [6]
% 0.18/0.51  TRYING [6]
% 2.22/0.69  TRYING [7]
% 2.65/0.70  TRYING [7]
% 2.65/0.70  TRYING [7]
% 3.08/0.80  TRYING [7]
% 5.28/1.13  TRYING [8]
% 5.98/1.18  TRYING [8]
% 5.98/1.19  TRYING [8]
% 8.50/1.53  TRYING [8]
% 8.50/1.57  % (21573)First to succeed.
% 8.50/1.58  % (21573)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21567"
% 8.50/1.58  % (21573)Refutation found. Thanks to Tanya!
% 8.50/1.58  % SZS status Unsatisfiable for theBenchmark
% 8.50/1.58  % SZS output start Proof for theBenchmark
% See solution above
% 8.50/1.58  % (21573)------------------------------
% 8.50/1.58  % (21573)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.50/1.58  % (21573)Termination reason: Refutation
% 8.50/1.58  
% 8.50/1.58  % (21573)Memory used [KB]: 16429
% 8.50/1.58  % (21573)Time elapsed: 1.229 s
% 8.50/1.58  % (21573)Instructions burned: 2437 (million)
% 8.50/1.58  % (21567)Success in time 1.226 s
%------------------------------------------------------------------------------