TSTP Solution File: GRP185-1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n014.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 : Wed Aug 31 16:14:47 EDT 2022

% Result   : Unsatisfiable 1.42s 0.69s
% Output   : Refutation 1.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   39 (  39 unt;   0 def)
%            Number of atoms       :   39 (  38 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   20 (  20   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    7 (   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   :   36 (  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f73,plain,
    $false,
    inference(subsumption_resolution,[],[f72,f51]) ).

fof(f51,plain,
    ! [X6,X5] : least_upper_bound(X5,least_upper_bound(X5,X6)) = least_upper_bound(X5,X6),
    inference(forward_demodulation,[],[f49,f5]) ).

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

fof(f49,plain,
    ! [X6,X5] : least_upper_bound(X5,X6) = least_upper_bound(least_upper_bound(X5,X6),X5),
    inference(superposition,[],[f33,f11]) ).

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(f33,plain,
    ! [X2,X1] : least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
    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(f72,plain,
    least_upper_bound(identity,least_upper_bound(least_upper_bound(b,a),multiply(a,b))) != least_upper_bound(identity,least_upper_bound(identity,least_upper_bound(least_upper_bound(b,a),multiply(a,b)))),
    inference(forward_demodulation,[],[f71,f7]) ).

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

fof(f71,plain,
    least_upper_bound(identity,least_upper_bound(least_upper_bound(identity,least_upper_bound(b,a)),multiply(a,b))) != least_upper_bound(least_upper_bound(identity,least_upper_bound(b,a)),multiply(a,b)),
    inference(forward_demodulation,[],[f70,f5]) ).

fof(f70,plain,
    least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,a))) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,a)))),
    inference(backward_demodulation,[],[f52,f69]) ).

fof(f69,plain,
    ! [X1] : multiply(X1,identity) = X1,
    inference(forward_demodulation,[],[f64,f66]) ).

fof(f66,plain,
    ! [X6,X5] : multiply(inverse(inverse(X5)),X6) = multiply(X5,X6),
    inference(superposition,[],[f45,f45]) ).

fof(f45,plain,
    ! [X2,X3] : multiply(inverse(X2),multiply(X2,X3)) = X3,
    inference(forward_demodulation,[],[f41,f1]) ).

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

fof(f41,plain,
    ! [X2,X3] : multiply(identity,X3) = multiply(inverse(X2),multiply(X2,X3)),
    inference(superposition,[],[f3,f2]) ).

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

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(f64,plain,
    ! [X1] : multiply(inverse(inverse(X1)),identity) = X1,
    inference(superposition,[],[f45,f2]) ).

fof(f52,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,multiply(a,identity))))) != least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,multiply(a,identity)))),
    inference(backward_demodulation,[],[f31,f51]) ).

fof(f31,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,multiply(a,identity)))))) != least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,multiply(a,identity)))),
    inference(forward_demodulation,[],[f30,f7]) ).

fof(f30,plain,
    least_upper_bound(multiply(a,b),least_upper_bound(least_upper_bound(identity,b),multiply(a,identity))) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,b),least_upper_bound(least_upper_bound(identity,b),multiply(a,identity))))),
    inference(forward_demodulation,[],[f29,f7]) ).

fof(f29,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(least_upper_bound(multiply(a,b),least_upper_bound(identity,b)),multiply(a,identity)))) != least_upper_bound(least_upper_bound(multiply(a,b),least_upper_bound(identity,b)),multiply(a,identity)),
    inference(forward_demodulation,[],[f28,f5]) ).

fof(f28,plain,
    least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(identity,b))) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(identity,b))))),
    inference(forward_demodulation,[],[f27,f1]) ).

fof(f27,plain,
    least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(identity,b)))) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(identity,multiply(identity,b)))))),
    inference(forward_demodulation,[],[f26,f5]) ).

fof(f26,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(multiply(identity,b),identity))))) != least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(multiply(identity,b),identity))),
    inference(forward_demodulation,[],[f25,f1]) ).

fof(f25,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(multiply(identity,b),multiply(identity,identity)))))) != least_upper_bound(multiply(a,identity),least_upper_bound(multiply(a,b),least_upper_bound(multiply(identity,b),multiply(identity,identity)))),
    inference(forward_demodulation,[],[f24,f7]) ).

fof(f24,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(least_upper_bound(multiply(a,b),multiply(identity,b)),multiply(identity,identity))))) != least_upper_bound(multiply(a,identity),least_upper_bound(least_upper_bound(multiply(a,b),multiply(identity,b)),multiply(identity,identity))),
    inference(forward_demodulation,[],[f23,f5]) ).

fof(f23,plain,
    least_upper_bound(multiply(a,identity),least_upper_bound(multiply(identity,identity),least_upper_bound(multiply(a,b),multiply(identity,b)))) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(identity,identity),least_upper_bound(multiply(a,b),multiply(identity,b)))))),
    inference(forward_demodulation,[],[f22,f14]) ).

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(f22,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(a,identity),least_upper_bound(multiply(identity,identity),multiply(least_upper_bound(a,identity),b))))) != least_upper_bound(multiply(a,identity),least_upper_bound(multiply(identity,identity),multiply(least_upper_bound(a,identity),b))),
    inference(forward_demodulation,[],[f21,f7]) ).

fof(f21,plain,
    least_upper_bound(least_upper_bound(multiply(a,identity),multiply(identity,identity)),multiply(least_upper_bound(a,identity),b)) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(least_upper_bound(multiply(a,identity),multiply(identity,identity)),multiply(least_upper_bound(a,identity),b)))),
    inference(forward_demodulation,[],[f20,f5]) ).

fof(f20,plain,
    least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(least_upper_bound(a,identity),b),least_upper_bound(multiply(a,identity),multiply(identity,identity))))) != least_upper_bound(multiply(least_upper_bound(a,identity),b),least_upper_bound(multiply(a,identity),multiply(identity,identity))),
    inference(backward_demodulation,[],[f19,f14]) ).

fof(f19,plain,
    least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity)) != least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity)))),
    inference(backward_demodulation,[],[f18,f7]) ).

fof(f18,plain,
    least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity)) != least_upper_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity))),
    inference(backward_demodulation,[],[f17,f5]) ).

fof(f17,plain,
    least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity)) != least_upper_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(least_upper_bound(a,identity),b),multiply(least_upper_bound(a,identity),identity))),
    inference(backward_demodulation,[],[f16,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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).

fof(f16,axiom,
    multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)) != least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p22a) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34  % Computer : n014.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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   : Mon Aug 29 22:23:48 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  ipcrm: permission denied for id (741670912)
% 0.21/0.38  ipcrm: permission denied for id (741769237)
% 0.21/0.42  ipcrm: permission denied for id (741834805)
% 0.21/0.43  ipcrm: permission denied for id (741965890)
% 0.21/0.45  ipcrm: permission denied for id (742031435)
% 0.21/0.47  ipcrm: permission denied for id (742096996)
% 0.21/0.49  ipcrm: permission denied for id (742162543)
% 0.67/0.61  % (3610)lrs+10_1:1024_drc=off:i=388:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/388Mi)
% 0.67/0.64  % (3592)lrs+1004_1:734_av=off:awrs=converge:awrsf=70:br=off:ep=RSTC:erd=off:gs=on:nwc=3.0:s2a=on:s2agt=16:sp=occurrence:updr=off:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/37Mi)
% 1.17/0.65  % (3607)lrs+10_1:1_br=off:flr=on:slsq=on:slsqc=1:sp=frequency:urr=on:i=257:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/257Mi)
% 1.17/0.65  % (3599)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/46Mi)
% 1.17/0.65  % (3615)lrs+10_1:2_bd=preordered:drc=off:fd=preordered:fde=unused:sp=const_min:to=lpo:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/177Mi)
% 1.42/0.67  % (3593)lrs+10_1:1_amm=off:drc=off:sp=reverse_frequency:spb=goal_then_units:to=lpo:i=6:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/6Mi)
% 1.42/0.67  % (3603)dis+2_1:1024_abs=on:alpa=false:anc=all_dependent:avsq=on:bce=on:drc=off:newcnf=on:slsq=on:slsqc=0:slsqr=1,1:sp=reverse_arity:i=353:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/353Mi)
% 1.42/0.67  % (3601)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/48Mi)
% 1.42/0.68  % (3612)lrs+10_5:1_br=off:ep=RSTC:sos=all:urr=on:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/267Mi)
% 1.42/0.68  % (3604)lrs+10_1:128_plsq=on:plsqc=2:s2a=on:ss=axioms:st=1.5:urr=on:i=321:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/321Mi)
% 1.42/0.69  % (3602)dis+10_1:1024_anc=all:drc=off:flr=on:fsr=off:sac=on:urr=on:i=292:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/292Mi)
% 1.42/0.69  % (3616)dis+10_1:1024_av=off:bd=preordered:drc=off:nwc=3.0:rp=on:thsq=on:thsqc=64:thsqd=32:to=lpo:i=267:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/267Mi)
% 1.42/0.69  % (3595)lrs+10_1:1_br=off:ep=RSTC:sos=all:urr=on:i=20:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/20Mi)
% 1.42/0.69  % (3594)lrs+10_1:1_drc=off:fd=preordered:plsq=on:sp=occurrence:to=lpo:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/48Mi)
% 1.42/0.69  % (3591)lrs+10_1:16_awrs=converge:awrsf=40:br=off:ep=RSTC:flr=on:gsp=on:nwc=3.0:sos=on:urr=on:i=10:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/10Mi)
% 1.42/0.69  % (3593)First to succeed.
% 1.42/0.69  % (3596)lrs+10_1:1_avsq=on:avsql=on:bsr=unit_only:drc=off:fsr=off:inw=on:nwc=10.0:rnwc=on:sgt=16:slsq=on:slsqc=0:slsql=off:slsqr=211,119:sp=reverse_frequency:spb=goal_then_units:ss=included:st=2.0:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2998ds/7Mi)
% 1.42/0.69  % (3593)Refutation found. Thanks to Tanya!
% 1.42/0.69  % SZS status Unsatisfiable for theBenchmark
% 1.42/0.69  % SZS output start Proof for theBenchmark
% See solution above
% 1.42/0.69  % (3593)------------------------------
% 1.42/0.69  % (3593)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.42/0.69  % (3593)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.42/0.69  % (3593)Termination reason: Refutation
% 1.42/0.69  
% 1.42/0.69  % (3593)Memory used [KB]: 5500
% 1.42/0.69  % (3593)Time elapsed: 0.133 s
% 1.42/0.69  % (3593)Instructions burned: 4 (million)
% 1.42/0.69  % (3593)------------------------------
% 1.42/0.69  % (3593)------------------------------
% 1.42/0.69  % (3455)Success in time 0.339 s
%------------------------------------------------------------------------------