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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : GRP191-2 : 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 : n012.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 : Tue Apr 30 11:52:08 EDT 2024

% Result   : Unsatisfiable 16.58s 2.78s
% Output   : Refutation 16.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   33 (  33 unt;   0 def)
%            Number of atoms       :   33 (  32 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    1 (   1   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    5 (   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   :   50 (  50   !;   0   ?)

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

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

fof(f78317,plain,
    inverse(b) = least_upper_bound(inverse(a),inverse(b)),
    inference(superposition,[],[f845,f78173]) ).

fof(f78173,plain,
    inverse(a) = greatest_lower_bound(inverse(a),inverse(b)),
    inference(forward_demodulation,[],[f77884,f320]) ).

fof(f320,plain,
    ! [X0] : multiply(X0,identity) = X0,
    inference(superposition,[],[f57,f55]) ).

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

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

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

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

fof(f35,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/sandbox2/benchmark/theBenchmark.p',associativity) ).

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

fof(f77884,plain,
    inverse(a) = greatest_lower_bound(inverse(a),multiply(inverse(b),identity)),
    inference(superposition,[],[f12153,f27126]) ).

fof(f27126,plain,
    identity = least_upper_bound(multiply(b,inverse(a)),identity),
    inference(superposition,[],[f281,f27027]) ).

fof(f27027,plain,
    identity = least_upper_bound(identity,multiply(b,inverse(a))),
    inference(superposition,[],[f19748,f319]) ).

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

fof(f19748,plain,
    ! [X0] : multiply(a,X0) = least_upper_bound(multiply(a,X0),multiply(b,X0)),
    inference(superposition,[],[f1058,f16]) ).

fof(f16,axiom,
    b = greatest_lower_bound(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39d_1) ).

fof(f1058,plain,
    ! [X2,X0,X1] : multiply(X0,X1) = least_upper_bound(multiply(X0,X1),multiply(greatest_lower_bound(X0,X2),X1)),
    inference(superposition,[],[f10,f15]) ).

fof(f15,axiom,
    ! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).

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

fof(f281,plain,
    ! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
    inference(superposition,[],[f247,f5]) ).

fof(f5,axiom,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).

fof(f247,plain,
    ! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
    inference(superposition,[],[f7,f8]) ).

fof(f8,axiom,
    ! [X0] : least_upper_bound(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_lub) ).

fof(f7,axiom,
    ! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).

fof(f12153,plain,
    ! [X2,X0,X1] : greatest_lower_bound(X1,multiply(inverse(X0),least_upper_bound(multiply(X0,X1),X2))) = X1,
    inference(superposition,[],[f412,f37]) ).

fof(f412,plain,
    ! [X2,X0,X1] : multiply(X0,X1) = greatest_lower_bound(multiply(X0,X1),multiply(X0,least_upper_bound(X1,X2))),
    inference(superposition,[],[f11,f12]) ).

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/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).

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

fof(f845,plain,
    ! [X0,X1] : least_upper_bound(greatest_lower_bound(X1,X0),X0) = X0,
    inference(superposition,[],[f281,f20]) ).

fof(f20,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/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP191-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n012.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   : Tue Apr 30 04:22:42 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (2700)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (2707)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.37  % (2701)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  % (2706)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.38  % (2703)WARNING: value z3 for option sas not known
% 0.14/0.38  % (2703)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.38  TRYING [1]
% 0.14/0.38  % (2704)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (2702)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  % (2705)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.38  TRYING [2]
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.39  TRYING [3]
% 0.22/0.41  TRYING [4]
% 0.22/0.41  TRYING [3]
% 0.22/0.46  TRYING [5]
% 0.22/0.49  TRYING [4]
% 2.04/0.63  TRYING [6]
% 2.04/0.65  TRYING [5]
% 5.82/1.18  TRYING [7]
% 6.26/1.27  TRYING [6]
% 7.85/1.48  TRYING [1]
% 7.85/1.48  TRYING [2]
% 7.85/1.48  TRYING [3]
% 8.10/1.50  TRYING [4]
% 8.33/1.59  TRYING [5]
% 10.41/1.87  TRYING [6]
% 16.58/2.78  % (2703)First to succeed.
% 16.58/2.78  % (2703)Refutation found. Thanks to Tanya!
% 16.58/2.78  % SZS status Unsatisfiable for theBenchmark
% 16.58/2.78  % SZS output start Proof for theBenchmark
% See solution above
% 16.58/2.78  % (2703)------------------------------
% 16.58/2.78  % (2703)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 16.58/2.78  % (2703)Termination reason: Refutation
% 16.58/2.78  
% 16.58/2.78  % (2703)Memory used [KB]: 26278
% 16.58/2.78  % (2703)Time elapsed: 2.402 s
% 16.58/2.78  % (2703)Instructions burned: 6562 (million)
% 16.58/2.78  % (2703)------------------------------
% 16.58/2.78  % (2703)------------------------------
% 16.58/2.78  % (2700)Success in time 2.427 s
%------------------------------------------------------------------------------