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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : GRP169-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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:53:51 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f9848,plain,
    $false,
    inference(subsumption_resolution,[],[f9847,f17]) ).

fof(f17,axiom,
    a != least_upper_bound(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p02a) ).

fof(f9847,plain,
    a = least_upper_bound(a,b),
    inference(forward_demodulation,[],[f9824,f162]) ).

fof(f162,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(superposition,[],[f129,f127]) ).

fof(f127,plain,
    ! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[],[f123,f2]) ).

fof(f2,axiom,
    ! [X0] : identity = multiply(inverse(X0),X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).

fof(f123,plain,
    ! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(forward_demodulation,[],[f121,f1]) ).

fof(f1,axiom,
    ! [X0] : multiply(identity,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).

fof(f121,plain,
    ! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
    inference(superposition,[],[f3,f2]) ).

fof(f3,axiom,
    ! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).

fof(f129,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
    inference(superposition,[],[f123,f123]) ).

fof(f9824,plain,
    least_upper_bound(a,b) = multiply(a,identity),
    inference(superposition,[],[f163,f9622]) ).

fof(f9622,plain,
    identity = multiply(inverse(a),least_upper_bound(a,b)),
    inference(superposition,[],[f489,f5426]) ).

fof(f5426,plain,
    identity = least_upper_bound(identity,multiply(inverse(a),b)),
    inference(forward_demodulation,[],[f5377,f2]) ).

fof(f5377,plain,
    least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(b),b),
    inference(superposition,[],[f709,f40]) ).

fof(f40,plain,
    inverse(b) = least_upper_bound(inverse(b),inverse(a)),
    inference(superposition,[],[f19,f39]) ).

fof(f39,plain,
    inverse(a) = greatest_lower_bound(inverse(a),inverse(b)),
    inference(superposition,[],[f11,f16]) ).

fof(f16,axiom,
    inverse(b) = least_upper_bound(inverse(a),inverse(b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p02a_1) ).

fof(f11,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).

fof(f19,plain,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
    inference(superposition,[],[f10,f4]) ).

fof(f4,axiom,
    ! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).

fof(f10,axiom,
    ! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).

fof(f709,plain,
    ! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
    inference(superposition,[],[f14,f2]) ).

fof(f14,axiom,
    ! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).

fof(f489,plain,
    ! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
    inference(superposition,[],[f12,f2]) ).

fof(f12,axiom,
    ! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).

fof(f163,plain,
    ! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
    inference(superposition,[],[f129,f123]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP169-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n024.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   : Fri May  3 20:42:52 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  % (16033)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (16039)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.37  % (16036)WARNING: value z3 for option sas not known
% 0.14/0.37  % (16037)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37  % (16038)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.37  % (16036)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37  % (16035)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37  % (16040)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (16034)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  TRYING [3]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.40  TRYING [4]
% 0.14/0.40  TRYING [3]
% 0.20/0.44  TRYING [4]
% 0.20/0.45  TRYING [5]
% 0.20/0.50  TRYING [1]
% 0.20/0.51  TRYING [2]
% 0.20/0.51  TRYING [3]
% 0.20/0.52  TRYING [4]
% 1.58/0.59  TRYING [5]
% 1.58/0.59  TRYING [5]
% 1.58/0.61  % (16036)First to succeed.
% 1.58/0.61  % (16036)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16033"
% 1.58/0.61  % (16036)Refutation found. Thanks to Tanya!
% 1.58/0.61  % SZS status Unsatisfiable for theBenchmark
% 1.58/0.61  % SZS output start Proof for theBenchmark
% See solution above
% 1.58/0.61  % (16036)------------------------------
% 1.58/0.61  % (16036)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.58/0.61  % (16036)Termination reason: Refutation
% 1.58/0.61  
% 1.58/0.61  % (16036)Memory used [KB]: 4104
% 1.58/0.61  % (16036)Time elapsed: 0.238 s
% 1.58/0.61  % (16036)Instructions burned: 539 (million)
% 1.58/0.61  % (16033)Success in time 0.246 s
%------------------------------------------------------------------------------