TSTP Solution File: FLD060-2 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : FLD060-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n024.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 : Sun May  5 05:08:07 EDT 2024

% Result   : Unsatisfiable 59.32s 8.80s
% Output   : Refutation 59.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   53 (  28 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   66 (  31   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   33 (  33   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f788090,plain,
    $false,
    inference(subsumption_resolution,[],[f788087,f35]) ).

fof(f35,axiom,
    ~ less_or_equal(u,v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_8) ).

fof(f788087,plain,
    less_or_equal(u,v),
    inference(resolution,[],[f11666,f35949]) ).

fof(f35949,plain,
    equalish(v,u),
    inference(resolution,[],[f35939,f22]) ).

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

fof(f35939,plain,
    equalish(u,v),
    inference(resolution,[],[f35811,f35767]) ).

fof(f35767,plain,
    equalish(u,add(b,a)),
    inference(subsumption_resolution,[],[f35766,f4644]) ).

fof(f4644,plain,
    less_or_equal(u,add(b,a)),
    inference(resolution,[],[f4602,f32]) ).

fof(f32,axiom,
    equalish(add(a,a),u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_u_5) ).

fof(f4602,plain,
    ! [X0] :
      ( ~ equalish(add(a,a),X0)
      | less_or_equal(X0,add(b,a)) ),
    inference(resolution,[],[f4589,f26]) ).

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

fof(f4589,plain,
    less_or_equal(add(a,a),add(b,a)),
    inference(resolution,[],[f4398,f28]) ).

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

fof(f4398,plain,
    ! [X0] :
      ( ~ defined(X0)
      | less_or_equal(add(a,X0),add(b,X0)) ),
    inference(resolution,[],[f19,f34]) ).

fof(f34,axiom,
    less_or_equal(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_7) ).

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

fof(f35766,plain,
    ( ~ less_or_equal(u,add(b,a))
    | equalish(u,add(b,a)) ),
    inference(resolution,[],[f35754,f16]) ).

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

fof(f35754,plain,
    less_or_equal(add(b,a),u),
    inference(resolution,[],[f13210,f11387]) ).

fof(f11387,plain,
    ! [X0] :
      ( ~ equalish(add(a,b),X0)
      | less_or_equal(X0,u) ),
    inference(resolution,[],[f11384,f26]) ).

fof(f11384,plain,
    less_or_equal(add(a,b),u),
    inference(resolution,[],[f11349,f4590]) ).

fof(f4590,plain,
    less_or_equal(add(a,b),add(b,b)),
    inference(resolution,[],[f4398,f29]) ).

fof(f29,axiom,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).

fof(f11349,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,add(b,b))
      | less_or_equal(X0,u) ),
    inference(resolution,[],[f11341,f17]) ).

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

fof(f11341,plain,
    less_or_equal(add(b,b),u),
    inference(resolution,[],[f11329,f85]) ).

fof(f85,plain,
    equalish(v,add(b,b)),
    inference(resolution,[],[f22,f33]) ).

fof(f33,axiom,
    equalish(add(b,b),v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_v_6) ).

fof(f11329,plain,
    ! [X0] :
      ( ~ equalish(v,X0)
      | less_or_equal(X0,u) ),
    inference(resolution,[],[f11326,f26]) ).

fof(f11326,plain,
    less_or_equal(v,u),
    inference(subsumption_resolution,[],[f11324,f35]) ).

fof(f11324,plain,
    ( less_or_equal(u,v)
    | less_or_equal(v,u) ),
    inference(resolution,[],[f2294,f31]) ).

fof(f31,axiom,
    defined(v),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).

fof(f2294,plain,
    ! [X0] :
      ( ~ defined(X0)
      | less_or_equal(u,X0)
      | less_or_equal(X0,u) ),
    inference(resolution,[],[f18,f30]) ).

fof(f30,axiom,
    defined(u),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).

fof(f18,axiom,
    ! [X0,X1] :
      ( ~ defined(X1)
      | ~ defined(X0)
      | less_or_equal(X1,X0)
      | less_or_equal(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality_of_order_relation) ).

fof(f13210,plain,
    equalish(add(a,b),add(b,a)),
    inference(resolution,[],[f2627,f28]) ).

fof(f2627,plain,
    ! [X0] :
      ( ~ defined(X0)
      | equalish(add(X0,b),add(b,X0)) ),
    inference(resolution,[],[f4,f29]) ).

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

fof(f35811,plain,
    ! [X0] :
      ( ~ equalish(X0,add(b,a))
      | equalish(X0,v) ),
    inference(resolution,[],[f35801,f23]) ).

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

fof(f35801,plain,
    equalish(add(b,a),v),
    inference(resolution,[],[f35797,f1831]) ).

fof(f1831,plain,
    ! [X0] :
      ( ~ equalish(X0,add(b,b))
      | equalish(X0,v) ),
    inference(resolution,[],[f23,f33]) ).

fof(f35797,plain,
    equalish(add(b,a),add(b,b)),
    inference(resolution,[],[f35789,f22]) ).

fof(f35789,plain,
    equalish(add(b,b),add(b,a)),
    inference(subsumption_resolution,[],[f35788,f11346]) ).

fof(f11346,plain,
    less_or_equal(add(b,b),add(b,a)),
    inference(resolution,[],[f11341,f4647]) ).

fof(f4647,plain,
    ! [X0] :
      ( ~ less_or_equal(X0,u)
      | less_or_equal(X0,add(b,a)) ),
    inference(resolution,[],[f4644,f17]) ).

fof(f35788,plain,
    ( ~ less_or_equal(add(b,b),add(b,a))
    | equalish(add(b,b),add(b,a)) ),
    inference(resolution,[],[f35755,f16]) ).

fof(f35755,plain,
    less_or_equal(add(b,a),add(b,b)),
    inference(resolution,[],[f13210,f4606]) ).

fof(f4606,plain,
    ! [X0] :
      ( ~ equalish(add(a,b),X0)
      | less_or_equal(X0,add(b,b)) ),
    inference(resolution,[],[f4590,f26]) ).

fof(f11666,plain,
    ! [X0] :
      ( ~ equalish(v,X0)
      | less_or_equal(X0,v) ),
    inference(resolution,[],[f11663,f26]) ).

fof(f11663,plain,
    less_or_equal(v,v),
    inference(duplicate_literal_removal,[],[f11662]) ).

fof(f11662,plain,
    ( less_or_equal(v,v)
    | less_or_equal(v,v) ),
    inference(resolution,[],[f2295,f31]) ).

fof(f2295,plain,
    ! [X0] :
      ( ~ defined(X0)
      | less_or_equal(v,X0)
      | less_or_equal(X0,v) ),
    inference(resolution,[],[f18,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : FLD060-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n024.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 19:49:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (24001)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.38  % (24002)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.23/0.39  TRYING [1]
% 0.23/0.39  TRYING [2]
% 0.23/0.39  TRYING [3]
% 0.23/0.40  % (24007)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.23/0.40  % (24003)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.23/0.40  % (24006)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.23/0.40  % (24005)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.23/0.40  % (24008)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.23/0.40  % (24004)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.23/0.40  TRYING [1]
% 0.23/0.40  TRYING [1]
% 0.23/0.40  TRYING [2]
% 0.23/0.40  TRYING [1]
% 0.23/0.40  TRYING [2]
% 0.23/0.40  TRYING [2]
% 0.23/0.40  TRYING [3]
% 0.23/0.40  TRYING [3]
% 0.23/0.40  TRYING [3]
% 0.23/0.41  TRYING [4]
% 0.23/0.42  TRYING [4]
% 0.23/0.42  TRYING [4]
% 0.23/0.42  TRYING [4]
% 0.23/0.44  TRYING [5]
% 0.23/0.46  TRYING [5]
% 0.23/0.46  TRYING [5]
% 0.23/0.48  TRYING [5]
% 0.23/0.55  TRYING [6]
% 0.23/0.57  TRYING [6]
% 0.23/0.58  TRYING [6]
% 0.23/0.62  TRYING [6]
% 3.14/0.81  TRYING [7]
% 3.41/0.83  TRYING [7]
% 3.41/0.87  TRYING [7]
% 5.51/1.17  TRYING [7]
% 6.51/1.35  TRYING [8]
% 7.18/1.39  TRYING [8]
% 7.64/1.44  TRYING [8]
% 11.57/2.07  TRYING [9]
% 12.13/2.09  TRYING [9]
% 12.13/2.12  TRYING [9]
% 15.91/2.64  TRYING [8]
% 22.79/3.65  TRYING [10]
% 22.79/3.69  TRYING [10]
% 23.52/3.70  TRYING [10]
% 33.46/5.16  TRYING [9]
% 34.60/5.36  TRYING [11]
% 34.60/5.39  TRYING [11]
% 36.24/5.52  TRYING [11]
% 53.13/7.93  TRYING [10]
% 58.62/8.78  % (24006)First to succeed.
% 58.62/8.78  % (24006)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24001"
% 59.32/8.80  % (24006)Refutation found. Thanks to Tanya!
% 59.32/8.80  % SZS status Unsatisfiable for theBenchmark
% 59.32/8.80  % SZS output start Proof for theBenchmark
% See solution above
% 59.32/8.80  % (24006)------------------------------
% 59.32/8.80  % (24006)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 59.32/8.80  % (24006)Termination reason: Refutation
% 59.32/8.80  
% 59.32/8.80  % (24006)Memory used [KB]: 255665
% 59.32/8.80  % (24006)Time elapsed: 8.385 s
% 59.32/8.80  % (24006)Instructions burned: 26506 (million)
% 59.32/8.80  % (24001)Success in time 8.349 s
%------------------------------------------------------------------------------