%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP187-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:13:16 AM UTC 2026
% Result : Unsatisfiable 60.24s 16.21s
% Output : Refutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 58
% Number of leaves : 24
% Syntax : Number of formulae : 465 ( 465 unt; 7 def)
% Number of atoms : 465 ( 464 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 437 ( 437 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f3,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(reorient_equations,[],[f2]) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f6,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f8,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(f9,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_lub) ).
fof(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_gld) ).
fof(f11,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f13,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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X0,X1),X2) = least_upper_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f17,axiom,
greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p33_1) ).
fof(f18,plain,
identity = greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p33) ).
fof(f20,definition,
sF0 = inverse(a),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f21,plain,
inverse(a) = sF0,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF1 = least_upper_bound(a,sF0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f23,plain,
least_upper_bound(a,sF0) = sF1,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF2 = inverse(b),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f25,plain,
inverse(b) = sF2,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF3 = least_upper_bound(b,sF2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f27,plain,
least_upper_bound(b,sF2) = sF3,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF4 = greatest_lower_bound(sF1,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f29,plain,
greatest_lower_bound(sF1,sF3) = sF4,
inference(reorient_equations,[],[f28]) ).
fof(f30,plain,
identity = sF4,
inference(definition_folding,[],[f18,f29,f27,f25,f23,f21]) ).
fof(f31,definition,
sF5 = multiply(a,b),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f32,plain,
multiply(a,b) = sF5,
inference(reorient_equations,[],[f31]) ).
fof(f33,definition,
sF6 = multiply(b,a),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f34,plain,
multiply(b,a) = sF6,
inference(reorient_equations,[],[f33]) ).
fof(f35,plain,
sF5 != sF6,
inference(definition_folding,[],[f19,f34,f32]) ).
fof(f36,plain,
sF1 = least_upper_bound(sF0,a),
inference(forward_demodulation,[],[f23,f6]) ).
fof(f37,plain,
sF3 = least_upper_bound(sF2,b),
inference(forward_demodulation,[],[f27,f6]) ).
fof(f38,plain,
identity = greatest_lower_bound(sF1,sF3),
inference(forward_demodulation,[],[f29,f30]) ).
fof(f39,plain,
sF1 = least_upper_bound(sF1,identity),
inference(superposition,[],[f11,f38]) ).
fof(f40,plain,
sF2 = greatest_lower_bound(sF2,sF3),
inference(superposition,[],[f12,f37]) ).
fof(f41,plain,
sF0 = greatest_lower_bound(sF0,sF1),
inference(superposition,[],[f12,f36]) ).
fof(f45,plain,
! [X0,X1] : greatest_lower_bound(X1,least_upper_bound(X0,X1)) = X1,
inference(superposition,[],[f12,f6]) ).
fof(f59,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(X0,X1)) = X1,
inference(superposition,[],[f11,f5]) ).
fof(f60,plain,
sF3 = least_upper_bound(sF3,identity),
inference(superposition,[],[f59,f38]) ).
fof(f66,plain,
! [X0] : multiply(a,greatest_lower_bound(b,X0)) = greatest_lower_bound(sF5,multiply(a,X0)),
inference(superposition,[],[f14,f32]) ).
fof(f67,plain,
! [X0] : multiply(b,greatest_lower_bound(a,X0)) = greatest_lower_bound(sF6,multiply(b,X0)),
inference(superposition,[],[f14,f34]) ).
fof(f69,plain,
! [X0] : multiply(b,greatest_lower_bound(X0,a)) = greatest_lower_bound(multiply(b,X0),sF6),
inference(superposition,[],[f14,f34]) ).
fof(f74,plain,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X2),multiply(X0,X1)),
inference(superposition,[],[f5,f14]) ).
fof(f78,plain,
! [X0] : greatest_lower_bound(sF6,multiply(b,X0)) = multiply(b,greatest_lower_bound(X0,a)),
inference(forward_demodulation,[],[f69,f5]) ).
fof(f88,plain,
identity = multiply(sF0,a),
inference(superposition,[],[f3,f21]) ).
fof(f89,plain,
identity = multiply(sF2,b),
inference(superposition,[],[f3,f25]) ).
fof(f90,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f14,f3]) ).
fof(f91,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f14,f3]) ).
fof(f92,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(multiply(inverse(X0),X1),identity),
inference(superposition,[],[f13,f3]) ).
fof(f94,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X1,X0)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[],[f92,f6]) ).
fof(f95,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(forward_demodulation,[],[f90,f5]) ).
fof(f96,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
fof(f97,plain,
! [X0,X1] : multiply(least_upper_bound(inverse(X0),X1),X0) = least_upper_bound(identity,multiply(X1,X0)),
inference(superposition,[],[f15,f3]) ).
fof(f98,plain,
! [X0] : multiply(least_upper_bound(a,X0),b) = least_upper_bound(sF5,multiply(X0,b)),
inference(superposition,[],[f15,f32]) ).
fof(f120,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f3]) ).
fof(f121,plain,
! [X0] : multiply(a,multiply(b,X0)) = multiply(sF5,X0),
inference(superposition,[],[f4,f32]) ).
fof(f122,plain,
! [X0] : multiply(b,multiply(a,X0)) = multiply(sF6,X0),
inference(superposition,[],[f4,f34]) ).
fof(f133,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f120,f1]) ).
fof(f144,plain,
! [X0] : multiply(sF0,multiply(a,X0)) = X0,
inference(superposition,[],[f133,f21]) ).
fof(f145,plain,
! [X0] : multiply(sF2,multiply(b,X0)) = X0,
inference(superposition,[],[f133,f25]) ).
fof(f147,plain,
! [X2,X0,X1] : multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(X1,X2))) = X2,
inference(superposition,[],[f133,f4]) ).
fof(f148,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f133,f3]) ).
fof(f149,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f133,f133]) ).
fof(f150,plain,
b = multiply(inverse(a),sF5),
inference(superposition,[],[f133,f32]) ).
fof(f151,plain,
a = multiply(inverse(b),sF6),
inference(superposition,[],[f133,f34]) ).
fof(f155,plain,
! [X2,X0,X1] : multiply(inverse(X1),greatest_lower_bound(multiply(X1,X0),X2)) = greatest_lower_bound(X0,multiply(inverse(X1),X2)),
inference(superposition,[],[f14,f133]) ).
fof(f156,plain,
! [X2,X0,X1] : multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X0))) = greatest_lower_bound(multiply(inverse(X1),X2),X0),
inference(superposition,[],[f14,f133]) ).
fof(f161,plain,
a = multiply(sF2,sF6),
inference(forward_demodulation,[],[f151,f25]) ).
fof(f162,plain,
b = multiply(sF0,sF5),
inference(forward_demodulation,[],[f150,f21]) ).
fof(f163,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f148,f149]) ).
fof(f164,plain,
! [X0] : multiply(b,X0) = multiply(sF0,multiply(sF5,X0)),
inference(superposition,[],[f4,f162]) ).
fof(f167,plain,
! [X0] : multiply(sF0,greatest_lower_bound(sF5,X0)) = greatest_lower_bound(b,multiply(sF0,X0)),
inference(superposition,[],[f14,f162]) ).
fof(f178,plain,
! [X0] : multiply(sF2,greatest_lower_bound(sF6,X0)) = greatest_lower_bound(a,multiply(sF2,X0)),
inference(superposition,[],[f14,f161]) ).
fof(f186,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(greatest_lower_bound(X0,X1),X0),
inference(superposition,[],[f45,f11]) ).
fof(f192,plain,
a = greatest_lower_bound(a,sF1),
inference(superposition,[],[f45,f36]) ).
fof(f193,plain,
b = greatest_lower_bound(b,sF3),
inference(superposition,[],[f45,f37]) ).
fof(f197,plain,
b = greatest_lower_bound(sF3,b),
inference(forward_demodulation,[],[f193,f5]) ).
fof(f198,plain,
a = greatest_lower_bound(sF1,a),
inference(forward_demodulation,[],[f192,f5]) ).
fof(f202,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f186,f7]) ).
fof(f203,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f1]) ).
fof(f207,plain,
! [X0] : multiply(greatest_lower_bound(a,X0),b) = greatest_lower_bound(sF5,multiply(X0,b)),
inference(superposition,[],[f16,f32]) ).
fof(f208,plain,
! [X0] : multiply(greatest_lower_bound(b,X0),a) = greatest_lower_bound(sF6,multiply(X0,a)),
inference(superposition,[],[f16,f34]) ).
fof(f209,plain,
! [X0] : multiply(greatest_lower_bound(sF0,X0),sF5) = greatest_lower_bound(b,multiply(X0,sF5)),
inference(superposition,[],[f16,f162]) ).
fof(f210,plain,
! [X0] : multiply(greatest_lower_bound(sF2,X0),sF6) = greatest_lower_bound(a,multiply(X0,sF6)),
inference(superposition,[],[f16,f161]) ).
fof(f211,plain,
! [X0,X1] : multiply(greatest_lower_bound(X1,identity),X0) = greatest_lower_bound(multiply(X1,X0),X0),
inference(superposition,[],[f16,f1]) ).
fof(f215,plain,
! [X0] : multiply(greatest_lower_bound(X0,a),b) = greatest_lower_bound(multiply(X0,b),sF5),
inference(superposition,[],[f16,f32]) ).
fof(f218,plain,
! [X0] : multiply(greatest_lower_bound(X0,sF2),sF6) = greatest_lower_bound(multiply(X0,sF6),a),
inference(superposition,[],[f16,f161]) ).
fof(f231,plain,
! [X0] : greatest_lower_bound(a,multiply(X0,sF6)) = multiply(greatest_lower_bound(X0,sF2),sF6),
inference(forward_demodulation,[],[f218,f5]) ).
fof(f234,plain,
! [X0] : greatest_lower_bound(sF5,multiply(X0,b)) = multiply(greatest_lower_bound(X0,a),b),
inference(forward_demodulation,[],[f215,f5]) ).
fof(f237,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(greatest_lower_bound(X1,identity),X0),
inference(forward_demodulation,[],[f211,f5]) ).
fof(f241,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f163]) ).
fof(f243,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f14,f163]) ).
fof(f244,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,identity)) = greatest_lower_bound(multiply(X0,X1),X0),
inference(superposition,[],[f14,f163]) ).
fof(f257,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(X1,identity)),
inference(forward_demodulation,[],[f244,f5]) ).
fof(f259,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f8,f11]) ).
fof(f263,plain,
! [X2,X3,X0,X1] : least_upper_bound(multiply(X0,X1),least_upper_bound(multiply(X0,X2),X3)) = least_upper_bound(multiply(X0,least_upper_bound(X1,X2)),X3),
inference(superposition,[],[f8,f13]) ).
fof(f266,plain,
! [X0] : least_upper_bound(sF0,least_upper_bound(a,X0)) = least_upper_bound(sF1,X0),
inference(superposition,[],[f8,f36]) ).
fof(f267,plain,
! [X0] : least_upper_bound(sF2,least_upper_bound(b,X0)) = least_upper_bound(sF3,X0),
inference(superposition,[],[f8,f37]) ).
fof(f320,plain,
least_upper_bound(sF0,a) = least_upper_bound(sF1,a),
inference(superposition,[],[f266,f9]) ).
fof(f326,plain,
sF1 = least_upper_bound(sF1,a),
inference(forward_demodulation,[],[f320,f36]) ).
fof(f330,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X2) = greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X1),X2)),
inference(superposition,[],[f7,f12]) ).
fof(f331,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X2) = greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X1,X0),X2)),
inference(superposition,[],[f7,f45]) ).
fof(f333,plain,
! [X2,X0,X1] : greatest_lower_bound(greatest_lower_bound(X0,X1),X2) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[],[f7,f5]) ).
fof(f334,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X1),greatest_lower_bound(multiply(X0,X2),X3)) = greatest_lower_bound(multiply(X0,greatest_lower_bound(X1,X2)),X3),
inference(superposition,[],[f7,f14]) ).
fof(f337,plain,
! [X0] : greatest_lower_bound(sF0,X0) = greatest_lower_bound(sF0,greatest_lower_bound(sF1,X0)),
inference(superposition,[],[f7,f41]) ).
fof(f338,plain,
! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(sF1,greatest_lower_bound(sF3,X0)),
inference(superposition,[],[f7,f38]) ).
fof(f345,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f5,f7]) ).
fof(f355,plain,
least_upper_bound(sF2,b) = least_upper_bound(sF3,b),
inference(superposition,[],[f267,f9]) ).
fof(f361,plain,
sF3 = least_upper_bound(sF3,b),
inference(forward_demodulation,[],[f355,f37]) ).
fof(f370,plain,
! [X0] : least_upper_bound(identity,multiply(X0,b)) = multiply(least_upper_bound(sF2,X0),b),
inference(superposition,[],[f97,f25]) ).
fof(f443,plain,
! [X0] : multiply(sF0,greatest_lower_bound(a,X0)) = greatest_lower_bound(identity,multiply(sF0,X0)),
inference(superposition,[],[f14,f88]) ).
fof(f444,plain,
! [X0] : multiply(sF0,greatest_lower_bound(X0,a)) = greatest_lower_bound(multiply(sF0,X0),identity),
inference(superposition,[],[f14,f88]) ).
fof(f448,plain,
! [X0] : multiply(greatest_lower_bound(sF0,X0),a) = greatest_lower_bound(identity,multiply(X0,a)),
inference(superposition,[],[f16,f88]) ).
fof(f449,plain,
a = multiply(inverse(sF0),identity),
inference(superposition,[],[f133,f88]) ).
fof(f450,plain,
a = inverse(sF0),
inference(forward_demodulation,[],[f449,f163]) ).
fof(f453,plain,
! [X0] : greatest_lower_bound(identity,multiply(sF0,X0)) = multiply(sF0,greatest_lower_bound(X0,a)),
inference(forward_demodulation,[],[f444,f5]) ).
fof(f460,plain,
! [X0] : multiply(a,multiply(sF0,X0)) = X0,
inference(superposition,[],[f133,f450]) ).
fof(f461,plain,
identity = multiply(a,sF0),
inference(superposition,[],[f3,f450]) ).
fof(f484,plain,
! [X0] : multiply(sF2,greatest_lower_bound(b,X0)) = greatest_lower_bound(identity,multiply(sF2,X0)),
inference(superposition,[],[f14,f89]) ).
fof(f485,plain,
! [X0] : multiply(sF2,greatest_lower_bound(X0,b)) = greatest_lower_bound(multiply(sF2,X0),identity),
inference(superposition,[],[f14,f89]) ).
fof(f489,plain,
! [X0] : multiply(greatest_lower_bound(sF2,X0),b) = greatest_lower_bound(identity,multiply(X0,b)),
inference(superposition,[],[f16,f89]) ).
fof(f490,plain,
b = multiply(inverse(sF2),identity),
inference(superposition,[],[f133,f89]) ).
fof(f491,plain,
b = inverse(sF2),
inference(forward_demodulation,[],[f490,f163]) ).
fof(f494,plain,
! [X0] : greatest_lower_bound(identity,multiply(sF2,X0)) = multiply(sF2,greatest_lower_bound(X0,b)),
inference(forward_demodulation,[],[f485,f5]) ).
fof(f499,plain,
! [X0] : multiply(b,multiply(sF2,X0)) = X0,
inference(superposition,[],[f133,f491]) ).
fof(f500,plain,
identity = multiply(b,sF2),
inference(superposition,[],[f3,f491]) ).
fof(f523,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f624,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(sF5,identity),
inference(superposition,[],[f66,f461]) ).
fof(f634,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(identity,sF5),
inference(forward_demodulation,[],[f624,f5]) ).
fof(f637,plain,
greatest_lower_bound(identity,sF5) = multiply(a,greatest_lower_bound(sF0,b)),
inference(forward_demodulation,[],[f634,f5]) ).
fof(f737,plain,
multiply(b,greatest_lower_bound(a,sF2)) = greatest_lower_bound(sF6,identity),
inference(superposition,[],[f67,f500]) ).
fof(f739,plain,
multiply(b,greatest_lower_bound(a,identity)) = greatest_lower_bound(sF6,b),
inference(superposition,[],[f67,f163]) ).
fof(f745,plain,
multiply(b,greatest_lower_bound(a,identity)) = greatest_lower_bound(b,sF6),
inference(forward_demodulation,[],[f739,f5]) ).
fof(f747,plain,
multiply(b,greatest_lower_bound(a,sF2)) = greatest_lower_bound(identity,sF6),
inference(forward_demodulation,[],[f737,f5]) ).
fof(f750,plain,
greatest_lower_bound(identity,sF6) = multiply(b,greatest_lower_bound(sF2,a)),
inference(forward_demodulation,[],[f747,f5]) ).
fof(f873,plain,
multiply(a,identity) = multiply(sF5,sF2),
inference(superposition,[],[f121,f500]) ).
fof(f900,plain,
a = multiply(sF5,sF2),
inference(forward_demodulation,[],[f873,f163]) ).
fof(f941,plain,
! [X0,X1] : multiply(b,greatest_lower_bound(X1,multiply(a,X0))) = greatest_lower_bound(multiply(b,X1),multiply(sF6,X0)),
inference(superposition,[],[f14,f122]) ).
fof(f993,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f3,f149]) ).
fof(f994,plain,
! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
inference(superposition,[],[f133,f149]) ).
fof(f1006,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f163,f149]) ).
fof(f1011,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f1006,f163]) ).
fof(f1049,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(multiply(inverse(X1),X0),X2)),
inference(superposition,[],[f14,f994]) ).
fof(f1050,plain,
! [X2,X0,X1] : multiply(X1,greatest_lower_bound(X2,multiply(inverse(X1),X0))) = greatest_lower_bound(multiply(X1,X2),X0),
inference(superposition,[],[f14,f994]) ).
fof(f1135,plain,
! [X2,X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = least_upper_bound(X0,greatest_lower_bound(X2,greatest_lower_bound(X0,X1))),
inference(superposition,[],[f259,f59]) ).
fof(f1154,plain,
! [X2,X0,X1] : least_upper_bound(X0,greatest_lower_bound(X2,greatest_lower_bound(X0,X1))) = X0,
inference(forward_demodulation,[],[f1135,f11]) ).
fof(f1188,plain,
! [X2,X0,X1] : multiply(inverse(X2),X0) = multiply(inverse(multiply(X1,X2)),multiply(X1,X0)),
inference(superposition,[],[f147,f994]) ).
fof(f1489,plain,
greatest_lower_bound(sF6,identity) = multiply(greatest_lower_bound(b,sF0),a),
inference(superposition,[],[f208,f88]) ).
fof(f1500,plain,
greatest_lower_bound(sF6,identity) = multiply(greatest_lower_bound(sF0,b),a),
inference(forward_demodulation,[],[f1489,f5]) ).
fof(f1508,plain,
greatest_lower_bound(identity,sF6) = multiply(greatest_lower_bound(sF0,b),a),
inference(forward_demodulation,[],[f1500,f5]) ).
fof(f1528,plain,
multiply(greatest_lower_bound(identity,a),b) = greatest_lower_bound(b,sF5),
inference(superposition,[],[f203,f32]) ).
fof(f1540,plain,
greatest_lower_bound(b,identity) = multiply(greatest_lower_bound(identity,sF2),b),
inference(superposition,[],[f203,f89]) ).
fof(f1567,plain,
greatest_lower_bound(b,identity) = multiply(greatest_lower_bound(sF2,identity),b),
inference(forward_demodulation,[],[f1540,f5]) ).
fof(f1579,plain,
greatest_lower_bound(b,sF5) = multiply(greatest_lower_bound(a,identity),b),
inference(forward_demodulation,[],[f1528,f5]) ).
fof(f1619,plain,
greatest_lower_bound(sF5,identity) = multiply(greatest_lower_bound(a,sF2),b),
inference(superposition,[],[f207,f89]) ).
fof(f1630,plain,
greatest_lower_bound(sF5,identity) = multiply(greatest_lower_bound(sF2,a),b),
inference(forward_demodulation,[],[f1619,f5]) ).
fof(f1637,plain,
greatest_lower_bound(identity,sF5) = multiply(greatest_lower_bound(sF2,a),b),
inference(forward_demodulation,[],[f1630,f5]) ).
fof(f1797,plain,
! [X0,X1] : least_upper_bound(identity,multiply(inverse(multiply(inverse(X0),X1)),identity)) = multiply(inverse(multiply(inverse(X0),X1)),multiply(inverse(X0),least_upper_bound(X1,X0))),
inference(superposition,[],[f94,f94]) ).
fof(f1870,plain,
! [X0,X1] : multiply(inverse(X1),least_upper_bound(X1,X0)) = least_upper_bound(identity,multiply(inverse(multiply(inverse(X0),X1)),identity)),
inference(forward_demodulation,[],[f1797,f1188]) ).
fof(f1887,plain,
! [X0,X1] : multiply(inverse(X1),least_upper_bound(X1,X0)) = multiply(least_upper_bound(identity,inverse(multiply(inverse(X0),X1))),identity),
inference(forward_demodulation,[],[f1870,f96]) ).
fof(f1894,plain,
! [X0,X1] : multiply(inverse(X1),least_upper_bound(X1,X0)) = least_upper_bound(identity,inverse(multiply(inverse(X0),X1))),
inference(forward_demodulation,[],[f1887,f163]) ).
fof(f1953,plain,
! [X0,X1] : identity = multiply(X0,multiply(X1,inverse(multiply(X0,X1)))),
inference(superposition,[],[f4,f993]) ).
fof(f2008,plain,
identity = greatest_lower_bound(identity,sF3),
inference(superposition,[],[f45,f60]) ).
fof(f2013,plain,
identity = greatest_lower_bound(sF3,identity),
inference(forward_demodulation,[],[f2008,f5]) ).
fof(f2072,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X1,X0)) = multiply(inverse(X0),greatest_lower_bound(X0,X1)),
inference(superposition,[],[f91,f95]) ).
fof(f2410,plain,
greatest_lower_bound(identity,b) = greatest_lower_bound(sF1,b),
inference(superposition,[],[f338,f197]) ).
fof(f2413,plain,
! [X0] : greatest_lower_bound(identity,X0) = greatest_lower_bound(sF1,greatest_lower_bound(X0,sF3)),
inference(superposition,[],[f338,f5]) ).
fof(f2429,plain,
greatest_lower_bound(b,identity) = greatest_lower_bound(sF1,b),
inference(forward_demodulation,[],[f2410,f5]) ).
fof(f2436,plain,
multiply(greatest_lower_bound(sF2,identity),b) = greatest_lower_bound(sF1,b),
inference(backward_demodulation,[],[f1567,f2429]) ).
fof(f2488,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X3,X2)) = greatest_lower_bound(X3,greatest_lower_bound(X0,greatest_lower_bound(X1,X2))),
inference(superposition,[],[f345,f345]) ).
fof(f2517,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(multiply(X0,X1),X2)) = greatest_lower_bound(X2,multiply(greatest_lower_bound(identity,X0),X1)),
inference(superposition,[],[f345,f203]) ).
fof(f2526,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X2),greatest_lower_bound(multiply(X1,X2),X3)) = greatest_lower_bound(X3,multiply(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f345,f16]) ).
fof(f2535,plain,
! [X0,X1] : greatest_lower_bound(sF5,greatest_lower_bound(multiply(X0,b),X1)) = greatest_lower_bound(X1,multiply(greatest_lower_bound(a,X0),b)),
inference(superposition,[],[f345,f207]) ).
fof(f2554,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,greatest_lower_bound(X1,X2))),
inference(superposition,[],[f523,f345]) ).
fof(f2558,plain,
! [X0,X1] : greatest_lower_bound(identity,greatest_lower_bound(X1,X0)) = greatest_lower_bound(sF1,greatest_lower_bound(X0,greatest_lower_bound(sF3,X1))),
inference(superposition,[],[f338,f345]) ).
fof(f2571,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X2,X3))) = greatest_lower_bound(X2,greatest_lower_bound(X3,greatest_lower_bound(X0,X1))),
inference(superposition,[],[f7,f345]) ).
fof(f2606,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X3,greatest_lower_bound(X0,greatest_lower_bound(X1,X2))) = greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X3,X2))),
inference(forward_demodulation,[],[f2488,f7]) ).
fof(f3091,plain,
! [X2,X3,X0,X1] : least_upper_bound(multiply(X0,least_upper_bound(X3,X2)),multiply(X1,X2)) = least_upper_bound(multiply(X0,X3),multiply(least_upper_bound(X0,X1),X2)),
inference(superposition,[],[f263,f15]) ).
fof(f3236,plain,
! [X0,X1] : least_upper_bound(multiply(X0,sF0),multiply(least_upper_bound(X0,X1),a)) = least_upper_bound(multiply(X0,sF1),multiply(X1,a)),
inference(superposition,[],[f3091,f36]) ).
fof(f3243,plain,
! [X0,X1] : least_upper_bound(multiply(X0,sF2),multiply(least_upper_bound(X0,X1),b)) = least_upper_bound(multiply(X0,sF3),multiply(X1,b)),
inference(superposition,[],[f3091,f37]) ).
fof(f3522,plain,
! [X0] : multiply(greatest_lower_bound(X0,greatest_lower_bound(a,identity)),b) = greatest_lower_bound(multiply(X0,b),greatest_lower_bound(b,sF5)),
inference(superposition,[],[f16,f1579]) ).
fof(f3536,plain,
! [X0] : multiply(greatest_lower_bound(X0,greatest_lower_bound(a,identity)),b) = greatest_lower_bound(sF5,greatest_lower_bound(multiply(X0,b),b)),
inference(forward_demodulation,[],[f3522,f345]) ).
fof(f3545,plain,
! [X0] : multiply(greatest_lower_bound(X0,greatest_lower_bound(a,identity)),b) = greatest_lower_bound(b,multiply(greatest_lower_bound(a,X0),b)),
inference(forward_demodulation,[],[f3536,f2535]) ).
fof(f3551,plain,
! [X0] : multiply(greatest_lower_bound(X0,greatest_lower_bound(a,identity)),b) = multiply(greatest_lower_bound(identity,greatest_lower_bound(a,X0)),b),
inference(forward_demodulation,[],[f3545,f203]) ).
fof(f3554,plain,
! [X0] : multiply(greatest_lower_bound(X0,greatest_lower_bound(a,identity)),b) = multiply(greatest_lower_bound(a,greatest_lower_bound(X0,identity)),b),
inference(forward_demodulation,[],[f3551,f345]) ).
fof(f3769,plain,
multiply(greatest_lower_bound(a,greatest_lower_bound(sF2,identity)),b) = greatest_lower_bound(sF5,greatest_lower_bound(sF1,b)),
inference(superposition,[],[f207,f2436]) ).
fof(f3796,plain,
multiply(greatest_lower_bound(a,greatest_lower_bound(sF2,identity)),b) = greatest_lower_bound(b,greatest_lower_bound(sF5,sF1)),
inference(forward_demodulation,[],[f3769,f345]) ).
fof(f3803,plain,
multiply(greatest_lower_bound(a,greatest_lower_bound(sF2,identity)),b) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f3796,f345]) ).
fof(f3808,plain,
greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)) = multiply(greatest_lower_bound(sF2,greatest_lower_bound(a,identity)),b),
inference(forward_demodulation,[],[f3803,f3554]) ).
fof(f3819,plain,
! [X0] : multiply(sF0,greatest_lower_bound(a,X0)) = multiply(sF0,greatest_lower_bound(X0,a)),
inference(superposition,[],[f2072,f21]) ).
fof(f3820,plain,
! [X0] : multiply(sF2,greatest_lower_bound(b,X0)) = multiply(sF2,greatest_lower_bound(X0,b)),
inference(superposition,[],[f2072,f25]) ).
fof(f3821,plain,
! [X0] : multiply(a,greatest_lower_bound(sF0,X0)) = multiply(a,greatest_lower_bound(X0,sF0)),
inference(superposition,[],[f2072,f450]) ).
fof(f3822,plain,
! [X0] : multiply(b,greatest_lower_bound(sF2,X0)) = multiply(b,greatest_lower_bound(X0,sF2)),
inference(superposition,[],[f2072,f491]) ).
fof(f4014,plain,
! [X0] : greatest_lower_bound(X0,greatest_lower_bound(sF1,b)) = greatest_lower_bound(b,greatest_lower_bound(identity,X0)),
inference(superposition,[],[f345,f2429]) ).
fof(f4231,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(sF1,b),X0) = greatest_lower_bound(identity,greatest_lower_bound(b,X0)),
inference(superposition,[],[f333,f2429]) ).
fof(f4235,plain,
! [X0] : greatest_lower_bound(a,X0) = greatest_lower_bound(a,greatest_lower_bound(sF1,X0)),
inference(superposition,[],[f333,f198]) ).
fof(f4238,plain,
! [X0] : greatest_lower_bound(b,X0) = greatest_lower_bound(b,greatest_lower_bound(sF3,X0)),
inference(superposition,[],[f333,f197]) ).
fof(f4295,plain,
! [X0] : greatest_lower_bound(b,X0) = greatest_lower_bound(sF3,greatest_lower_bound(X0,b)),
inference(forward_demodulation,[],[f4238,f345]) ).
fof(f4298,plain,
! [X0] : greatest_lower_bound(a,X0) = greatest_lower_bound(sF1,greatest_lower_bound(X0,a)),
inference(forward_demodulation,[],[f4235,f345]) ).
fof(f4302,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(sF1,b),X0) = greatest_lower_bound(b,greatest_lower_bound(X0,identity)),
inference(forward_demodulation,[],[f4231,f345]) ).
fof(f4319,plain,
! [X0] : greatest_lower_bound(b,greatest_lower_bound(X0,identity)) = greatest_lower_bound(sF1,greatest_lower_bound(b,X0)),
inference(forward_demodulation,[],[f4302,f7]) ).
fof(f4334,plain,
greatest_lower_bound(sF0,identity) = greatest_lower_bound(sF0,sF3),
inference(superposition,[],[f337,f38]) ).
fof(f5074,plain,
multiply(greatest_lower_bound(identity,greatest_lower_bound(sF0,b)),a) = greatest_lower_bound(a,greatest_lower_bound(identity,sF6)),
inference(superposition,[],[f203,f1508]) ).
fof(f5081,plain,
greatest_lower_bound(a,greatest_lower_bound(identity,sF6)) = multiply(greatest_lower_bound(b,greatest_lower_bound(identity,sF0)),a),
inference(forward_demodulation,[],[f5074,f345]) ).
fof(f5093,plain,
greatest_lower_bound(a,greatest_lower_bound(identity,sF6)) = multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF1,b)),a),
inference(forward_demodulation,[],[f5081,f4014]) ).
fof(f5102,plain,
multiply(greatest_lower_bound(sF0,b),a) = greatest_lower_bound(a,greatest_lower_bound(identity,sF6)),
inference(forward_demodulation,[],[f5093,f337]) ).
fof(f5108,plain,
greatest_lower_bound(identity,sF6) = greatest_lower_bound(a,greatest_lower_bound(identity,sF6)),
inference(forward_demodulation,[],[f5102,f1508]) ).
fof(f5179,plain,
! [X0] : multiply(greatest_lower_bound(a,X0),b) = multiply(greatest_lower_bound(X0,a),b),
inference(superposition,[],[f207,f234]) ).
fof(f5342,plain,
least_upper_bound(multiply(sF3,sF0),multiply(sF3,a)) = least_upper_bound(multiply(sF3,sF1),multiply(b,a)),
inference(superposition,[],[f3236,f361]) ).
fof(f5387,plain,
least_upper_bound(multiply(sF3,sF0),multiply(sF3,a)) = least_upper_bound(multiply(sF3,sF1),sF6),
inference(forward_demodulation,[],[f5342,f34]) ).
fof(f5437,plain,
least_upper_bound(multiply(sF3,sF0),multiply(sF3,a)) = least_upper_bound(sF6,multiply(sF3,sF1)),
inference(forward_demodulation,[],[f5387,f6]) ).
fof(f5474,plain,
multiply(sF3,least_upper_bound(sF0,a)) = least_upper_bound(sF6,multiply(sF3,sF1)),
inference(forward_demodulation,[],[f5437,f13]) ).
fof(f5501,plain,
multiply(sF3,sF1) = least_upper_bound(sF6,multiply(sF3,sF1)),
inference(forward_demodulation,[],[f5474,f36]) ).
fof(f5899,plain,
! [X0] : greatest_lower_bound(sF6,X0) = greatest_lower_bound(sF6,greatest_lower_bound(multiply(sF3,sF1),X0)),
inference(superposition,[],[f330,f5501]) ).
fof(f6971,plain,
! [X0] : least_upper_bound(multiply(sF5,sF3),multiply(X0,b)) = least_upper_bound(a,multiply(least_upper_bound(sF5,X0),b)),
inference(superposition,[],[f3243,f900]) ).
fof(f6978,plain,
! [X0,X1] : least_upper_bound(multiply(X0,sF2),multiply(X0,b)) = least_upper_bound(multiply(X0,sF3),multiply(greatest_lower_bound(X0,X1),b)),
inference(superposition,[],[f3243,f11]) ).
fof(f7011,plain,
least_upper_bound(multiply(sF1,sF3),multiply(identity,b)) = least_upper_bound(multiply(sF1,sF2),multiply(sF1,b)),
inference(superposition,[],[f3243,f39]) ).
fof(f7012,plain,
least_upper_bound(multiply(sF1,sF2),multiply(sF1,b)) = least_upper_bound(multiply(sF1,sF3),multiply(a,b)),
inference(superposition,[],[f3243,f326]) ).
fof(f7075,plain,
least_upper_bound(multiply(sF1,sF2),multiply(sF1,b)) = least_upper_bound(multiply(sF1,sF3),sF5),
inference(forward_demodulation,[],[f7012,f32]) ).
fof(f7076,plain,
least_upper_bound(multiply(sF1,sF3),multiply(identity,b)) = multiply(sF1,least_upper_bound(sF2,b)),
inference(forward_demodulation,[],[f7011,f13]) ).
fof(f7106,plain,
! [X0,X1] : multiply(X0,least_upper_bound(sF2,b)) = least_upper_bound(multiply(X0,sF3),multiply(greatest_lower_bound(X0,X1),b)),
inference(forward_demodulation,[],[f6978,f13]) ).
fof(f7138,plain,
least_upper_bound(multiply(sF1,sF2),multiply(sF1,b)) = least_upper_bound(sF5,multiply(sF1,sF3)),
inference(forward_demodulation,[],[f7075,f6]) ).
fof(f7139,plain,
multiply(sF1,sF3) = least_upper_bound(multiply(sF1,sF3),multiply(identity,b)),
inference(forward_demodulation,[],[f7076,f37]) ).
fof(f7158,plain,
! [X0,X1] : multiply(X0,sF3) = least_upper_bound(multiply(X0,sF3),multiply(greatest_lower_bound(X0,X1),b)),
inference(forward_demodulation,[],[f7106,f37]) ).
fof(f7183,plain,
multiply(sF1,least_upper_bound(sF2,b)) = least_upper_bound(sF5,multiply(sF1,sF3)),
inference(forward_demodulation,[],[f7138,f13]) ).
fof(f7184,plain,
multiply(sF1,sF3) = least_upper_bound(multiply(sF1,sF3),b),
inference(forward_demodulation,[],[f7139,f1]) ).
fof(f7219,plain,
multiply(sF1,sF3) = least_upper_bound(sF5,multiply(sF1,sF3)),
inference(forward_demodulation,[],[f7183,f37]) ).
fof(f7220,plain,
multiply(sF1,sF3) = least_upper_bound(b,multiply(sF1,sF3)),
inference(forward_demodulation,[],[f7184,f6]) ).
fof(f7270,plain,
b = greatest_lower_bound(b,multiply(sF1,sF3)),
inference(superposition,[],[f12,f7220]) ).
fof(f7381,plain,
! [X0] : multiply(sF5,sF3) = least_upper_bound(multiply(sF5,sF3),multiply(multiply(greatest_lower_bound(a,X0),b),b)),
inference(superposition,[],[f7158,f207]) ).
fof(f7418,plain,
! [X0] : multiply(sF5,sF3) = least_upper_bound(a,multiply(least_upper_bound(sF5,multiply(greatest_lower_bound(a,X0),b)),b)),
inference(forward_demodulation,[],[f7381,f6971]) ).
fof(f7448,plain,
! [X0] : multiply(sF5,sF3) = least_upper_bound(a,multiply(multiply(least_upper_bound(a,greatest_lower_bound(a,X0)),b),b)),
inference(forward_demodulation,[],[f7418,f98]) ).
fof(f7462,plain,
! [X0] : multiply(sF5,sF3) = least_upper_bound(a,multiply(least_upper_bound(a,greatest_lower_bound(a,X0)),multiply(b,b))),
inference(forward_demodulation,[],[f7448,f4]) ).
fof(f7468,plain,
multiply(sF5,sF3) = least_upper_bound(a,multiply(a,multiply(b,b))),
inference(forward_demodulation,[],[f7462,f11]) ).
fof(f7473,plain,
multiply(sF5,sF3) = multiply(a,least_upper_bound(identity,multiply(b,b))),
inference(forward_demodulation,[],[f7468,f241]) ).
fof(f7477,plain,
multiply(sF5,sF3) = multiply(a,multiply(least_upper_bound(sF2,b),b)),
inference(forward_demodulation,[],[f7473,f370]) ).
fof(f7480,plain,
multiply(sF5,sF3) = multiply(a,multiply(sF3,b)),
inference(forward_demodulation,[],[f7477,f37]) ).
fof(f7485,plain,
multiply(sF3,b) = multiply(sF0,multiply(sF5,sF3)),
inference(superposition,[],[f144,f7480]) ).
fof(f7520,plain,
multiply(b,sF3) = multiply(sF3,b),
inference(forward_demodulation,[],[f7485,f164]) ).
fof(f7704,plain,
! [X0] : greatest_lower_bound(sF5,X0) = greatest_lower_bound(sF5,greatest_lower_bound(multiply(sF1,sF3),X0)),
inference(superposition,[],[f330,f7219]) ).
fof(f7956,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,greatest_lower_bound(X3,X2)),multiply(X1,X2)) = greatest_lower_bound(multiply(X0,X3),multiply(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f334,f16]) ).
fof(f8418,plain,
! [X0] : multiply(b,greatest_lower_bound(a,X0)) = multiply(b,greatest_lower_bound(X0,a)),
inference(superposition,[],[f67,f78]) ).
fof(f8516,plain,
greatest_lower_bound(identity,sF2) = greatest_lower_bound(sF1,sF2),
inference(superposition,[],[f2413,f40]) ).
fof(f8524,plain,
! [X0,X1] : greatest_lower_bound(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(sF1,greatest_lower_bound(greatest_lower_bound(X0,sF3),X1)),
inference(superposition,[],[f7,f2413]) ).
fof(f8539,plain,
! [X0,X1] : greatest_lower_bound(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(sF1,greatest_lower_bound(X0,greatest_lower_bound(sF3,X1))),
inference(forward_demodulation,[],[f8524,f7]) ).
fof(f8546,plain,
greatest_lower_bound(sF2,identity) = greatest_lower_bound(sF1,sF2),
inference(forward_demodulation,[],[f8516,f5]) ).
fof(f8550,plain,
! [X0,X1] : greatest_lower_bound(greatest_lower_bound(identity,X0),X1) = greatest_lower_bound(identity,greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f8539,f2558]) ).
fof(f8581,plain,
! [X0,X1] : greatest_lower_bound(identity,greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f8550,f7]) ).
fof(f8644,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(sF1,sF2),X0) = greatest_lower_bound(identity,greatest_lower_bound(sF2,X0)),
inference(superposition,[],[f333,f8546]) ).
fof(f8651,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(sF1,sF2),X0) = greatest_lower_bound(sF2,greatest_lower_bound(X0,identity)),
inference(forward_demodulation,[],[f8644,f345]) ).
fof(f8654,plain,
! [X0] : greatest_lower_bound(sF1,greatest_lower_bound(sF2,X0)) = greatest_lower_bound(sF2,greatest_lower_bound(X0,identity)),
inference(forward_demodulation,[],[f8651,f7]) ).
fof(f8657,plain,
greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)) = multiply(greatest_lower_bound(sF1,greatest_lower_bound(sF2,a)),b),
inference(backward_demodulation,[],[f3808,f8654]) ).
fof(f8658,plain,
multiply(greatest_lower_bound(a,sF2),b) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f8657,f4298]) ).
fof(f8659,plain,
multiply(greatest_lower_bound(sF2,a),b) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f8658,f5179]) ).
fof(f8660,plain,
greatest_lower_bound(identity,sF5) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f8659,f1637]) ).
fof(f9028,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,sF1),multiply(greatest_lower_bound(X0,X1),sF3)) = greatest_lower_bound(multiply(X0,identity),multiply(X1,sF3)),
inference(superposition,[],[f7956,f38]) ).
fof(f9335,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,sF1),multiply(greatest_lower_bound(X0,X1),sF3)) = greatest_lower_bound(X0,multiply(X1,sF3)),
inference(forward_demodulation,[],[f9028,f163]) ).
fof(f9448,plain,
! [X0,X1] : greatest_lower_bound(X1,multiply(X0,sF3)) = greatest_lower_bound(multiply(X1,sF1),multiply(greatest_lower_bound(X0,X1),sF3)),
inference(superposition,[],[f9335,f5]) ).
fof(f9456,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,sF1),multiply(X0,sF3)) = greatest_lower_bound(X0,multiply(least_upper_bound(X1,X0),sF3)),
inference(superposition,[],[f9335,f45]) ).
fof(f9552,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(sF1,sF3)) = greatest_lower_bound(X0,multiply(least_upper_bound(X1,X0),sF3)),
inference(forward_demodulation,[],[f9456,f14]) ).
fof(f9593,plain,
! [X0,X1] : multiply(X0,identity) = greatest_lower_bound(X0,multiply(least_upper_bound(X1,X0),sF3)),
inference(forward_demodulation,[],[f9552,f38]) ).
fof(f9624,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(X1,X0),sF3)) = X0,
inference(forward_demodulation,[],[f9593,f163]) ).
fof(f11608,plain,
greatest_lower_bound(a,identity) = multiply(a,greatest_lower_bound(identity,sF0)),
inference(superposition,[],[f243,f461]) ).
fof(f11614,plain,
greatest_lower_bound(b,identity) = multiply(b,greatest_lower_bound(identity,sF2)),
inference(superposition,[],[f243,f500]) ).
fof(f11620,plain,
greatest_lower_bound(sF0,b) = multiply(sF0,greatest_lower_bound(identity,sF5)),
inference(superposition,[],[f243,f162]) ).
fof(f11625,plain,
greatest_lower_bound(sF2,a) = multiply(sF2,greatest_lower_bound(identity,sF6)),
inference(superposition,[],[f243,f161]) ).
fof(f11719,plain,
greatest_lower_bound(b,identity) = multiply(b,greatest_lower_bound(sF2,identity)),
inference(forward_demodulation,[],[f11614,f3822]) ).
fof(f11725,plain,
greatest_lower_bound(a,identity) = multiply(a,greatest_lower_bound(sF0,identity)),
inference(forward_demodulation,[],[f11608,f3821]) ).
fof(f11791,plain,
greatest_lower_bound(b,identity) = multiply(b,greatest_lower_bound(sF1,sF2)),
inference(forward_demodulation,[],[f11719,f8546]) ).
fof(f11795,plain,
greatest_lower_bound(a,identity) = multiply(a,greatest_lower_bound(sF0,sF3)),
inference(forward_demodulation,[],[f11725,f4334]) ).
fof(f11836,plain,
greatest_lower_bound(sF1,b) = multiply(b,greatest_lower_bound(sF1,sF2)),
inference(forward_demodulation,[],[f11791,f2429]) ).
fof(f12045,plain,
greatest_lower_bound(sF6,greatest_lower_bound(sF1,b)) = multiply(b,greatest_lower_bound(a,greatest_lower_bound(sF1,sF2))),
inference(superposition,[],[f67,f11836]) ).
fof(f12087,plain,
greatest_lower_bound(sF6,greatest_lower_bound(sF1,b)) = multiply(b,greatest_lower_bound(sF2,greatest_lower_bound(a,sF1))),
inference(forward_demodulation,[],[f12045,f345]) ).
fof(f12102,plain,
greatest_lower_bound(sF6,greatest_lower_bound(sF1,b)) = multiply(b,greatest_lower_bound(sF1,greatest_lower_bound(sF2,a))),
inference(forward_demodulation,[],[f12087,f345]) ).
fof(f12110,plain,
multiply(b,greatest_lower_bound(a,sF2)) = greatest_lower_bound(sF6,greatest_lower_bound(sF1,b)),
inference(forward_demodulation,[],[f12102,f4298]) ).
fof(f12115,plain,
multiply(b,greatest_lower_bound(a,sF2)) = greatest_lower_bound(b,greatest_lower_bound(sF6,sF1)),
inference(forward_demodulation,[],[f12110,f345]) ).
fof(f12118,plain,
multiply(b,greatest_lower_bound(a,sF2)) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF6)),
inference(forward_demodulation,[],[f12115,f345]) ).
fof(f12120,plain,
multiply(b,greatest_lower_bound(sF2,a)) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF6)),
inference(forward_demodulation,[],[f12118,f3822]) ).
fof(f12122,plain,
greatest_lower_bound(identity,sF6) = greatest_lower_bound(sF1,greatest_lower_bound(b,sF6)),
inference(forward_demodulation,[],[f12120,f750]) ).
fof(f12605,plain,
! [X0] : greatest_lower_bound(b,X0) = greatest_lower_bound(multiply(sF1,sF3),greatest_lower_bound(b,X0)),
inference(superposition,[],[f333,f7270]) ).
fof(f12619,plain,
! [X0] : greatest_lower_bound(b,X0) = greatest_lower_bound(b,greatest_lower_bound(X0,multiply(sF1,sF3))),
inference(forward_demodulation,[],[f12605,f345]) ).
fof(f12700,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,sF1),multiply(greatest_lower_bound(X0,X1),sF3)) = greatest_lower_bound(X0,multiply(greatest_lower_bound(X1,X0),sF3)),
inference(superposition,[],[f9335,f202]) ).
fof(f12726,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X1,sF3)) = greatest_lower_bound(X0,multiply(greatest_lower_bound(X1,X0),sF3)),
inference(forward_demodulation,[],[f12700,f9335]) ).
fof(f13433,plain,
greatest_lower_bound(a,identity) = multiply(sF2,greatest_lower_bound(b,sF6)),
inference(superposition,[],[f145,f745]) ).
fof(f15468,plain,
multiply(greatest_lower_bound(sF0,identity),b) = multiply(sF0,greatest_lower_bound(sF5,b)),
inference(superposition,[],[f237,f167]) ).
fof(f15500,plain,
multiply(greatest_lower_bound(sF0,identity),b) = multiply(sF0,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f15468,f5]) ).
fof(f15521,plain,
multiply(greatest_lower_bound(sF0,sF3),b) = multiply(sF0,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f15500,f4334]) ).
fof(f16984,plain,
multiply(greatest_lower_bound(sF2,identity),a) = multiply(sF2,greatest_lower_bound(sF6,a)),
inference(superposition,[],[f237,f178]) ).
fof(f17018,plain,
multiply(greatest_lower_bound(sF2,identity),a) = multiply(sF2,greatest_lower_bound(a,sF6)),
inference(forward_demodulation,[],[f16984,f5]) ).
fof(f17041,plain,
multiply(greatest_lower_bound(sF1,sF2),a) = multiply(sF2,greatest_lower_bound(a,sF6)),
inference(forward_demodulation,[],[f17018,f8546]) ).
fof(f17540,plain,
! [X2,X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(greatest_lower_bound(identity,multiply(inverse(X0),X1)),X2)) = greatest_lower_bound(greatest_lower_bound(X1,X0),multiply(inverse(inverse(X0)),X2)),
inference(superposition,[],[f155,f95]) ).
fof(f17796,plain,
! [X2,X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(greatest_lower_bound(identity,multiply(inverse(X0),X1)),X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,multiply(inverse(inverse(X0)),X2))),
inference(forward_demodulation,[],[f17540,f7]) ).
fof(f17855,plain,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(greatest_lower_bound(identity,multiply(inverse(X0),X1)),X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,multiply(X0,X2))),
inference(forward_demodulation,[],[f17796,f1011]) ).
fof(f17887,plain,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(greatest_lower_bound(identity,multiply(inverse(X0),X1)),X2)) = greatest_lower_bound(X1,multiply(X0,greatest_lower_bound(identity,X2))),
inference(forward_demodulation,[],[f17855,f243]) ).
fof(f17905,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,multiply(X0,greatest_lower_bound(identity,X2))) = multiply(X0,greatest_lower_bound(identity,greatest_lower_bound(multiply(inverse(X0),X1),X2))),
inference(forward_demodulation,[],[f17887,f7]) ).
fof(f21562,plain,
! [X0] : multiply(greatest_lower_bound(sF2,X0),sF6) = multiply(greatest_lower_bound(X0,sF2),sF6),
inference(superposition,[],[f210,f231]) ).
fof(f21792,plain,
! [X0,X1] : multiply(sF0,greatest_lower_bound(a,greatest_lower_bound(X0,X1))) = multiply(sF0,greatest_lower_bound(X0,greatest_lower_bound(X1,a))),
inference(superposition,[],[f3819,f7]) ).
fof(f21835,plain,
! [X0,X1] : multiply(multiply(sF0,greatest_lower_bound(a,X0)),X1) = multiply(sF0,multiply(greatest_lower_bound(X0,a),X1)),
inference(superposition,[],[f4,f3819]) ).
fof(f21839,plain,
! [X0,X1] : greatest_lower_bound(multiply(sF0,X1),multiply(sF0,greatest_lower_bound(a,X0))) = multiply(sF0,greatest_lower_bound(X1,greatest_lower_bound(X0,a))),
inference(superposition,[],[f14,f3819]) ).
fof(f21882,plain,
! [X0,X1] : multiply(sF0,greatest_lower_bound(X1,greatest_lower_bound(a,X0))) = multiply(sF0,greatest_lower_bound(X1,greatest_lower_bound(X0,a))),
inference(forward_demodulation,[],[f21839,f14]) ).
fof(f21886,plain,
! [X0,X1] : multiply(sF0,multiply(greatest_lower_bound(a,X0),X1)) = multiply(sF0,multiply(greatest_lower_bound(X0,a),X1)),
inference(forward_demodulation,[],[f21835,f4]) ).
fof(f22077,plain,
! [X0,X1] : inverse(multiply(inverse(X1),X0)) = greatest_lower_bound(inverse(multiply(inverse(X1),X0)),multiply(multiply(inverse(X0),least_upper_bound(X0,X1)),sF3)),
inference(superposition,[],[f9624,f1894]) ).
fof(f22088,plain,
! [X0,X1] : inverse(multiply(inverse(X1),X0)) = greatest_lower_bound(inverse(multiply(inverse(X1),X0)),multiply(inverse(X0),multiply(least_upper_bound(X0,X1),sF3))),
inference(forward_demodulation,[],[f22077,f4]) ).
fof(f22801,plain,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = multiply(X0,greatest_lower_bound(X2,X1)),
inference(superposition,[],[f14,f74]) ).
fof(f22804,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X3),multiply(X0,greatest_lower_bound(X1,X2))) = greatest_lower_bound(multiply(X0,greatest_lower_bound(X3,X2)),multiply(X0,X1)),
inference(superposition,[],[f334,f74]) ).
fof(f22861,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X3),multiply(X0,greatest_lower_bound(X1,X2))) = multiply(X0,greatest_lower_bound(greatest_lower_bound(X3,X2),X1)),
inference(forward_demodulation,[],[f22804,f14]) ).
fof(f23037,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X0,X3),multiply(X0,greatest_lower_bound(X1,X2))) = multiply(X0,greatest_lower_bound(X3,greatest_lower_bound(X2,X1))),
inference(forward_demodulation,[],[f22861,f7]) ).
fof(f23129,plain,
! [X2,X3,X0,X1] : multiply(X0,greatest_lower_bound(X3,greatest_lower_bound(X1,X2))) = multiply(X0,greatest_lower_bound(X3,greatest_lower_bound(X2,X1))),
inference(forward_demodulation,[],[f23037,f14]) ).
fof(f26742,plain,
! [X0,X1] : multiply(sF2,greatest_lower_bound(b,greatest_lower_bound(X0,X1))) = multiply(sF2,greatest_lower_bound(X0,greatest_lower_bound(X1,b))),
inference(superposition,[],[f3820,f7]) ).
fof(f29131,plain,
multiply(greatest_lower_bound(sF2,sF0),b) = multiply(sF0,greatest_lower_bound(b,a)),
inference(superposition,[],[f489,f453]) ).
fof(f29177,plain,
multiply(greatest_lower_bound(sF2,sF0),b) = multiply(sF0,greatest_lower_bound(a,b)),
inference(forward_demodulation,[],[f29131,f3819]) ).
fof(f29212,plain,
multiply(sF0,greatest_lower_bound(a,b)) = multiply(greatest_lower_bound(sF0,sF2),b),
inference(forward_demodulation,[],[f29177,f5]) ).
fof(f29639,plain,
! [X0,X1] : multiply(inverse(X0),identity) = multiply(X1,inverse(multiply(X0,X1))),
inference(superposition,[],[f133,f1953]) ).
fof(f29770,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f29639,f163]) ).
fof(f30217,plain,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
inference(superposition,[],[f133,f29770]) ).
fof(f30220,plain,
! [X2,X0,X1] : greatest_lower_bound(inverse(multiply(X0,X1)),multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(inverse(X0),X2)),
inference(superposition,[],[f155,f29770]) ).
fof(f30436,plain,
! [X0,X1] : inverse(multiply(inverse(X1),X0)) = multiply(inverse(X0),greatest_lower_bound(inverse(inverse(X1)),multiply(least_upper_bound(X0,X1),sF3))),
inference(backward_demodulation,[],[f22088,f30220]) ).
fof(f30701,plain,
! [X0,X1] : inverse(multiply(inverse(X1),X0)) = multiply(inverse(X0),greatest_lower_bound(X1,multiply(least_upper_bound(X0,X1),sF3))),
inference(forward_demodulation,[],[f30436,f1011]) ).
fof(f30893,plain,
! [X0,X1] : multiply(inverse(X0),X1) = inverse(multiply(inverse(X1),X0)),
inference(forward_demodulation,[],[f30701,f9624]) ).
fof(f32856,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(multiply(X1,X0)),X1),
inference(superposition,[],[f30893,f133]) ).
fof(f33067,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = multiply(inverse(greatest_lower_bound(identity,multiply(inverse(X0),X1))),inverse(X0)),
inference(superposition,[],[f32856,f95]) ).
fof(f33423,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = inverse(multiply(X0,greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
inference(forward_demodulation,[],[f33067,f30217]) ).
fof(f33527,plain,
! [X0,X1] : inverse(greatest_lower_bound(X1,X0)) = inverse(greatest_lower_bound(multiply(X0,identity),X1)),
inference(forward_demodulation,[],[f33423,f1050]) ).
fof(f33581,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = inverse(greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f33527,f163]) ).
fof(f33778,plain,
! [X2,X0,X1] : multiply(inverse(greatest_lower_bound(X0,X1)),multiply(greatest_lower_bound(X1,X0),X2)) = X2,
inference(superposition,[],[f133,f33581]) ).
fof(f34950,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = multiply(greatest_lower_bound(X2,X1),X0),
inference(superposition,[],[f994,f33778]) ).
fof(f35920,plain,
! [X2,X3,X0,X1] : multiply(greatest_lower_bound(X0,greatest_lower_bound(X1,X2)),X3) = multiply(greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),X3),
inference(superposition,[],[f34950,f7]) ).
fof(f36033,plain,
! [X2,X3,X0,X1] : multiply(greatest_lower_bound(X3,greatest_lower_bound(X1,X0)),X2) = greatest_lower_bound(multiply(X3,X2),multiply(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f16,f34950]) ).
fof(f36151,plain,
! [X2,X3,X0,X1] : multiply(greatest_lower_bound(X3,greatest_lower_bound(X1,X0)),X2) = multiply(greatest_lower_bound(X3,greatest_lower_bound(X0,X1)),X2),
inference(forward_demodulation,[],[f36033,f16]) ).
fof(f37195,plain,
multiply(greatest_lower_bound(sF0,sF2),a) = multiply(sF2,greatest_lower_bound(a,b)),
inference(superposition,[],[f448,f494]) ).
fof(f40334,plain,
greatest_lower_bound(sF5,greatest_lower_bound(a,identity)) = multiply(a,greatest_lower_bound(b,greatest_lower_bound(sF0,sF3))),
inference(superposition,[],[f66,f11795]) ).
fof(f40402,plain,
greatest_lower_bound(sF5,greatest_lower_bound(a,identity)) = multiply(a,greatest_lower_bound(sF3,greatest_lower_bound(b,sF0))),
inference(forward_demodulation,[],[f40334,f345]) ).
fof(f40421,plain,
greatest_lower_bound(sF5,greatest_lower_bound(a,identity)) = multiply(a,greatest_lower_bound(sF3,greatest_lower_bound(sF0,b))),
inference(forward_demodulation,[],[f40402,f23129]) ).
fof(f40434,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(sF5,greatest_lower_bound(a,identity)),
inference(forward_demodulation,[],[f40421,f4295]) ).
fof(f40442,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(identity,greatest_lower_bound(sF5,a)),
inference(forward_demodulation,[],[f40434,f345]) ).
fof(f40448,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(identity,greatest_lower_bound(a,sF5)),
inference(forward_demodulation,[],[f40442,f8581]) ).
fof(f40453,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(a,greatest_lower_bound(sF5,identity)),
inference(forward_demodulation,[],[f40448,f345]) ).
fof(f40457,plain,
multiply(a,greatest_lower_bound(b,sF0)) = greatest_lower_bound(a,greatest_lower_bound(identity,sF5)),
inference(forward_demodulation,[],[f40453,f5]) ).
fof(f40460,plain,
multiply(a,greatest_lower_bound(sF0,b)) = greatest_lower_bound(a,greatest_lower_bound(identity,sF5)),
inference(forward_demodulation,[],[f40457,f3821]) ).
fof(f40462,plain,
greatest_lower_bound(identity,sF5) = greatest_lower_bound(a,greatest_lower_bound(identity,sF5)),
inference(forward_demodulation,[],[f40460,f637]) ).
fof(f40979,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(a,X0),b)) = greatest_lower_bound(multiply(inverse(X0),sF5),b),
inference(superposition,[],[f156,f207]) ).
fof(f40986,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(b,X0),a)) = greatest_lower_bound(multiply(inverse(X0),sF6),a),
inference(superposition,[],[f156,f208]) ).
fof(f41070,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(b,X0),a)) = greatest_lower_bound(a,multiply(inverse(X0),sF6)),
inference(forward_demodulation,[],[f40986,f5]) ).
fof(f41077,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(a,X0),b)) = greatest_lower_bound(b,multiply(inverse(X0),sF5)),
inference(forward_demodulation,[],[f40979,f5]) ).
fof(f41277,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(b,X0),a)) = multiply(greatest_lower_bound(sF2,inverse(X0)),sF6),
inference(forward_demodulation,[],[f41070,f210]) ).
fof(f41281,plain,
! [X0] : multiply(inverse(X0),multiply(greatest_lower_bound(a,X0),b)) = multiply(greatest_lower_bound(sF0,inverse(X0)),sF5),
inference(forward_demodulation,[],[f41077,f209]) ).
fof(f74992,plain,
multiply(sF2,multiply(greatest_lower_bound(a,b),b)) = multiply(greatest_lower_bound(sF0,sF2),sF5),
inference(superposition,[],[f41281,f25]) ).
fof(f77293,plain,
multiply(sF0,multiply(greatest_lower_bound(b,a),a)) = multiply(greatest_lower_bound(sF2,sF0),sF6),
inference(superposition,[],[f41277,f21]) ).
fof(f77477,plain,
multiply(sF0,multiply(greatest_lower_bound(b,a),a)) = multiply(greatest_lower_bound(sF0,sF2),sF6),
inference(forward_demodulation,[],[f77293,f21562]) ).
fof(f77542,plain,
multiply(greatest_lower_bound(sF0,sF2),sF6) = multiply(sF0,multiply(greatest_lower_bound(a,b),a)),
inference(forward_demodulation,[],[f77477,f21886]) ).
fof(f82997,plain,
greatest_lower_bound(greatest_lower_bound(b,sF6),multiply(sF1,sF3)) = greatest_lower_bound(multiply(greatest_lower_bound(b,sF6),sF1),multiply(greatest_lower_bound(identity,sF6),sF3)),
inference(superposition,[],[f9448,f12122]) ).
fof(f83128,plain,
greatest_lower_bound(greatest_lower_bound(b,sF6),multiply(sF1,sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(multiply(sF6,sF3),multiply(greatest_lower_bound(b,sF6),sF1))),
inference(forward_demodulation,[],[f82997,f2517]) ).
fof(f83268,plain,
greatest_lower_bound(sF3,greatest_lower_bound(multiply(sF6,sF3),multiply(greatest_lower_bound(b,sF6),sF1))) = greatest_lower_bound(b,greatest_lower_bound(sF6,multiply(sF1,sF3))),
inference(forward_demodulation,[],[f83128,f7]) ).
fof(f83390,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,greatest_lower_bound(multiply(sF6,sF3),multiply(greatest_lower_bound(b,sF6),sF1))),
inference(forward_demodulation,[],[f83268,f12619]) ).
fof(f88031,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(identity,sF5),X0) = greatest_lower_bound(greatest_lower_bound(identity,sF5),greatest_lower_bound(a,X0)),
inference(superposition,[],[f333,f40462]) ).
fof(f88074,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(identity,sF5),X0) = greatest_lower_bound(identity,greatest_lower_bound(sF5,greatest_lower_bound(a,X0))),
inference(forward_demodulation,[],[f88031,f7]) ).
fof(f88089,plain,
! [X0] : greatest_lower_bound(greatest_lower_bound(identity,sF5),X0) = greatest_lower_bound(a,greatest_lower_bound(X0,greatest_lower_bound(identity,sF5))),
inference(forward_demodulation,[],[f88074,f2571]) ).
fof(f88100,plain,
! [X0] : greatest_lower_bound(identity,greatest_lower_bound(sF5,X0)) = greatest_lower_bound(a,greatest_lower_bound(X0,greatest_lower_bound(identity,sF5))),
inference(forward_demodulation,[],[f88089,f7]) ).
fof(f102405,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),X3) = greatest_lower_bound(greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),greatest_lower_bound(X0,X3)),
inference(superposition,[],[f331,f1154]) ).
fof(f102559,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),X3) = greatest_lower_bound(X1,greatest_lower_bound(greatest_lower_bound(X0,X2),greatest_lower_bound(X0,X3))),
inference(forward_demodulation,[],[f102405,f7]) ).
fof(f102607,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),X3) = greatest_lower_bound(X1,greatest_lower_bound(X0,greatest_lower_bound(X2,greatest_lower_bound(X0,X3)))),
inference(forward_demodulation,[],[f102559,f7]) ).
fof(f102616,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,X3))) = greatest_lower_bound(greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),X3),
inference(forward_demodulation,[],[f102607,f2554]) ).
fof(f102625,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,X3))) = greatest_lower_bound(X1,greatest_lower_bound(greatest_lower_bound(X0,X2),X3)),
inference(forward_demodulation,[],[f102616,f7]) ).
fof(f102630,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X0,X3))) = greatest_lower_bound(X1,greatest_lower_bound(X0,greatest_lower_bound(X2,X3))),
inference(forward_demodulation,[],[f102625,f7]) ).
fof(f120065,plain,
! [X2,X3,X0,X1] : multiply(X3,greatest_lower_bound(X2,greatest_lower_bound(X0,X1))) = multiply(X3,greatest_lower_bound(X0,greatest_lower_bound(X1,X2))),
inference(superposition,[],[f22801,f7]) ).
fof(f129133,plain,
! [X0] : greatest_lower_bound(sF5,multiply(X0,sF3)) = greatest_lower_bound(sF5,multiply(greatest_lower_bound(sF1,X0),sF3)),
inference(superposition,[],[f7704,f16]) ).
fof(f129284,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF5,multiply(greatest_lower_bound(identity,sF5),sF3)),
inference(superposition,[],[f129133,f8660]) ).
fof(f129394,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(multiply(sF5,sF3),sF5)),
inference(forward_demodulation,[],[f129284,f2517]) ).
fof(f129421,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(sF5,multiply(sF5,sF3))),
inference(forward_demodulation,[],[f129394,f5]) ).
fof(f129432,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF3,multiply(sF5,greatest_lower_bound(identity,sF3))),
inference(forward_demodulation,[],[f129421,f243]) ).
fof(f129437,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF3,multiply(sF5,greatest_lower_bound(sF3,identity))),
inference(forward_demodulation,[],[f129432,f22801]) ).
fof(f129439,plain,
greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)) = greatest_lower_bound(sF3,multiply(sF5,identity)),
inference(forward_demodulation,[],[f129437,f2013]) ).
fof(f129440,plain,
greatest_lower_bound(sF3,sF5) = greatest_lower_bound(sF5,multiply(greatest_lower_bound(b,sF5),sF3)),
inference(forward_demodulation,[],[f129439,f163]) ).
fof(f129441,plain,
greatest_lower_bound(sF3,sF5) = greatest_lower_bound(sF5,multiply(b,sF3)),
inference(forward_demodulation,[],[f129440,f12726]) ).
fof(f129442,plain,
greatest_lower_bound(sF3,sF5) = greatest_lower_bound(sF5,multiply(sF3,b)),
inference(forward_demodulation,[],[f129441,f7520]) ).
fof(f129443,plain,
greatest_lower_bound(sF3,sF5) = multiply(greatest_lower_bound(a,sF3),b),
inference(forward_demodulation,[],[f129442,f207]) ).
fof(f129444,plain,
greatest_lower_bound(sF3,sF5) = multiply(greatest_lower_bound(sF3,a),b),
inference(forward_demodulation,[],[f129443,f5179]) ).
fof(f129718,plain,
multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(identity,b)) = greatest_lower_bound(greatest_lower_bound(sF3,a),greatest_lower_bound(sF3,sF5)),
inference(superposition,[],[f243,f129444]) ).
fof(f129778,plain,
multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(identity,b)) = greatest_lower_bound(sF3,greatest_lower_bound(a,greatest_lower_bound(sF3,sF5))),
inference(forward_demodulation,[],[f129718,f7]) ).
fof(f129817,plain,
multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(identity,b)) = greatest_lower_bound(sF3,greatest_lower_bound(sF3,greatest_lower_bound(a,sF5))),
inference(forward_demodulation,[],[f129778,f2606]) ).
fof(f129841,plain,
multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(identity,b)) = greatest_lower_bound(sF3,greatest_lower_bound(a,sF5)),
inference(forward_demodulation,[],[f129817,f523]) ).
fof(f129857,plain,
greatest_lower_bound(sF3,greatest_lower_bound(a,sF5)) = multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(b,identity)),
inference(forward_demodulation,[],[f129841,f22801]) ).
fof(f129867,plain,
greatest_lower_bound(sF3,greatest_lower_bound(a,sF5)) = multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(sF1,b)),
inference(forward_demodulation,[],[f129857,f2429]) ).
fof(f139477,plain,
! [X0] : greatest_lower_bound(sF6,multiply(greatest_lower_bound(sF3,X0),sF3)) = greatest_lower_bound(sF6,greatest_lower_bound(sF3,multiply(X0,sF3))),
inference(superposition,[],[f5899,f9335]) ).
fof(f139614,plain,
! [X0] : greatest_lower_bound(sF6,multiply(greatest_lower_bound(sF3,X0),sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(multiply(X0,sF3),sF6)),
inference(forward_demodulation,[],[f139477,f345]) ).
fof(f139630,plain,
! [X0] : greatest_lower_bound(sF6,multiply(greatest_lower_bound(sF3,X0),sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(sF6,multiply(X0,sF3))),
inference(forward_demodulation,[],[f139614,f5]) ).
fof(f151330,plain,
greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,sF5)) = multiply(greatest_lower_bound(a,identity),greatest_lower_bound(b,identity)),
inference(superposition,[],[f257,f1579]) ).
fof(f151894,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f151330,f2429]) ).
fof(f152177,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(a,greatest_lower_bound(identity,greatest_lower_bound(b,sF5))),
inference(forward_demodulation,[],[f151894,f7]) ).
fof(f152364,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(a,greatest_lower_bound(b,greatest_lower_bound(identity,sF5))),
inference(forward_demodulation,[],[f152177,f102630]) ).
fof(f152476,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(identity,greatest_lower_bound(sF5,b)),
inference(forward_demodulation,[],[f152364,f88100]) ).
fof(f152550,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(identity,greatest_lower_bound(b,sF5)),
inference(forward_demodulation,[],[f152476,f8581]) ).
fof(f152584,plain,
multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)) = greatest_lower_bound(b,greatest_lower_bound(sF5,identity)),
inference(forward_demodulation,[],[f152550,f345]) ).
fof(f152602,plain,
greatest_lower_bound(sF1,greatest_lower_bound(b,sF5)) = multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)),
inference(forward_demodulation,[],[f152584,f4319]) ).
fof(f152616,plain,
greatest_lower_bound(identity,sF5) = multiply(greatest_lower_bound(a,identity),greatest_lower_bound(sF1,b)),
inference(forward_demodulation,[],[f152602,f8660]) ).
fof(f164715,plain,
multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF1,sF2)),a) = greatest_lower_bound(identity,multiply(sF2,greatest_lower_bound(a,sF6))),
inference(superposition,[],[f448,f17041]) ).
fof(f164839,plain,
multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF1,sF2)),a) = multiply(sF2,greatest_lower_bound(b,greatest_lower_bound(a,sF6))),
inference(forward_demodulation,[],[f164715,f484]) ).
fof(f164885,plain,
multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF1,sF2)),a) = multiply(sF2,greatest_lower_bound(a,greatest_lower_bound(sF6,b))),
inference(forward_demodulation,[],[f164839,f26742]) ).
fof(f164924,plain,
multiply(sF2,greatest_lower_bound(a,greatest_lower_bound(b,sF6))) = multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF1,sF2)),a),
inference(forward_demodulation,[],[f164885,f23129]) ).
fof(f164954,plain,
multiply(greatest_lower_bound(sF0,sF2),a) = multiply(sF2,greatest_lower_bound(a,greatest_lower_bound(b,sF6))),
inference(forward_demodulation,[],[f164924,f337]) ).
fof(f164973,plain,
multiply(sF2,greatest_lower_bound(a,b)) = multiply(sF2,greatest_lower_bound(a,greatest_lower_bound(b,sF6))),
inference(forward_demodulation,[],[f164954,f37195]) ).
fof(f173072,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(X2,multiply(X1,greatest_lower_bound(X3,X0))) = multiply(X1,greatest_lower_bound(X0,greatest_lower_bound(multiply(inverse(X1),X2),X3))),
inference(superposition,[],[f1049,f345]) ).
fof(f173378,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,multiply(X0,greatest_lower_bound(identity,X2))) = greatest_lower_bound(X1,multiply(X0,greatest_lower_bound(X2,identity))),
inference(backward_demodulation,[],[f17905,f173072]) ).
fof(f196947,plain,
! [X2,X3,X0,X1] : greatest_lower_bound(multiply(X3,X1),multiply(X0,greatest_lower_bound(X1,X2))) = greatest_lower_bound(multiply(X0,X2),multiply(greatest_lower_bound(X3,X0),X1)),
inference(superposition,[],[f2526,f14]) ).
fof(f197213,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,greatest_lower_bound(multiply(b,sF1),multiply(sF6,greatest_lower_bound(sF1,sF3)))),
inference(backward_demodulation,[],[f83390,f196947]) ).
fof(f197607,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,multiply(b,greatest_lower_bound(sF1,multiply(a,greatest_lower_bound(sF1,sF3))))),
inference(forward_demodulation,[],[f197213,f941]) ).
fof(f197782,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,multiply(b,greatest_lower_bound(sF1,multiply(a,identity)))),
inference(forward_demodulation,[],[f197607,f38]) ).
fof(f197858,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,multiply(b,greatest_lower_bound(sF1,a))),
inference(forward_demodulation,[],[f197782,f163]) ).
fof(f197886,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,multiply(b,a)),
inference(forward_demodulation,[],[f197858,f198]) ).
fof(f197898,plain,
greatest_lower_bound(b,sF6) = greatest_lower_bound(sF3,sF6),
inference(forward_demodulation,[],[f197886,f34]) ).
fof(f197912,plain,
greatest_lower_bound(a,identity) = multiply(sF2,greatest_lower_bound(sF3,sF6)),
inference(backward_demodulation,[],[f13433,f197898]) ).
fof(f198107,plain,
multiply(sF2,greatest_lower_bound(a,b)) = multiply(sF2,greatest_lower_bound(a,greatest_lower_bound(sF3,sF6))),
inference(backward_demodulation,[],[f164973,f197898]) ).
fof(f198134,plain,
multiply(sF2,greatest_lower_bound(a,b)) = multiply(sF2,greatest_lower_bound(sF3,greatest_lower_bound(sF6,a))),
inference(forward_demodulation,[],[f198107,f120065]) ).
fof(f198142,plain,
multiply(sF2,greatest_lower_bound(a,b)) = multiply(sF2,greatest_lower_bound(sF3,greatest_lower_bound(a,sF6))),
inference(forward_demodulation,[],[f198134,f23129]) ).
fof(f198185,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF6,multiply(greatest_lower_bound(sF3,sF6),sF3)),
inference(superposition,[],[f12726,f197898]) ).
fof(f198211,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF3,greatest_lower_bound(sF6,multiply(sF6,sF3))),
inference(forward_demodulation,[],[f198185,f139630]) ).
fof(f198233,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF3,multiply(sF6,greatest_lower_bound(identity,sF3))),
inference(forward_demodulation,[],[f198211,f243]) ).
fof(f198270,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF3,multiply(sF6,greatest_lower_bound(sF3,identity))),
inference(forward_demodulation,[],[f198233,f173378]) ).
fof(f198278,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF3,multiply(sF6,identity)),
inference(forward_demodulation,[],[f198270,f2013]) ).
fof(f198281,plain,
greatest_lower_bound(sF6,multiply(b,sF3)) = greatest_lower_bound(sF3,sF6),
inference(forward_demodulation,[],[f198278,f163]) ).
fof(f198284,plain,
multiply(b,greatest_lower_bound(a,sF3)) = greatest_lower_bound(sF3,sF6),
inference(forward_demodulation,[],[f198281,f67]) ).
fof(f198286,plain,
multiply(b,greatest_lower_bound(sF3,a)) = greatest_lower_bound(sF3,sF6),
inference(forward_demodulation,[],[f198284,f8418]) ).
fof(f198652,plain,
greatest_lower_bound(sF3,a) = multiply(sF2,greatest_lower_bound(sF3,sF6)),
inference(superposition,[],[f145,f198286]) ).
fof(f198789,plain,
greatest_lower_bound(a,identity) = greatest_lower_bound(sF3,a),
inference(backward_demodulation,[],[f197912,f198652]) ).
fof(f198887,plain,
greatest_lower_bound(b,sF5) = multiply(greatest_lower_bound(sF3,a),b),
inference(backward_demodulation,[],[f1579,f198789]) ).
fof(f199281,plain,
greatest_lower_bound(identity,sF5) = multiply(greatest_lower_bound(sF3,a),greatest_lower_bound(sF1,b)),
inference(backward_demodulation,[],[f152616,f198789]) ).
fof(f199511,plain,
greatest_lower_bound(identity,sF5) = greatest_lower_bound(sF3,greatest_lower_bound(a,sF5)),
inference(backward_demodulation,[],[f129867,f199281]) ).
fof(f199529,plain,
greatest_lower_bound(b,sF5) = greatest_lower_bound(sF3,sF5),
inference(forward_demodulation,[],[f198887,f129444]) ).
fof(f199766,plain,
multiply(greatest_lower_bound(sF0,sF3),b) = multiply(sF0,greatest_lower_bound(sF3,sF5)),
inference(backward_demodulation,[],[f15521,f199529]) ).
fof(f200344,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(identity,X0)) = greatest_lower_bound(greatest_lower_bound(sF3,a),X0),
inference(superposition,[],[f7,f198789]) ).
fof(f200418,plain,
! [X0] : greatest_lower_bound(a,greatest_lower_bound(identity,X0)) = greatest_lower_bound(sF3,greatest_lower_bound(a,X0)),
inference(forward_demodulation,[],[f200344,f7]) ).
fof(f200506,plain,
greatest_lower_bound(identity,sF6) = greatest_lower_bound(sF3,greatest_lower_bound(a,sF6)),
inference(backward_demodulation,[],[f5108,f200418]) ).
fof(f200524,plain,
multiply(sF2,greatest_lower_bound(identity,sF6)) = multiply(sF2,greatest_lower_bound(a,b)),
inference(backward_demodulation,[],[f198142,f200506]) ).
fof(f200539,plain,
greatest_lower_bound(sF2,a) = multiply(sF2,greatest_lower_bound(a,b)),
inference(forward_demodulation,[],[f200524,f11625]) ).
fof(f201249,plain,
multiply(b,greatest_lower_bound(sF2,a)) = greatest_lower_bound(a,b),
inference(superposition,[],[f499,f200539]) ).
fof(f201253,plain,
! [X0] : multiply(greatest_lower_bound(sF2,a),X0) = multiply(sF2,multiply(greatest_lower_bound(a,b),X0)),
inference(superposition,[],[f4,f200539]) ).
fof(f201377,plain,
multiply(greatest_lower_bound(sF2,a),b) = multiply(greatest_lower_bound(sF0,sF2),sF5),
inference(backward_demodulation,[],[f74992,f201253]) ).
fof(f201380,plain,
greatest_lower_bound(identity,sF6) = greatest_lower_bound(a,b),
inference(backward_demodulation,[],[f750,f201249]) ).
fof(f201443,plain,
greatest_lower_bound(identity,sF5) = multiply(greatest_lower_bound(sF0,sF2),sF5),
inference(forward_demodulation,[],[f201377,f1637]) ).
fof(f201450,plain,
multiply(greatest_lower_bound(sF0,b),a) = greatest_lower_bound(a,b),
inference(backward_demodulation,[],[f1508,f201380]) ).
fof(f201976,plain,
sF5 = multiply(inverse(greatest_lower_bound(sF0,sF2)),greatest_lower_bound(identity,sF5)),
inference(superposition,[],[f133,f201443]) ).
fof(f252156,plain,
multiply(greatest_lower_bound(sF2,greatest_lower_bound(sF0,sF3)),b) = greatest_lower_bound(identity,multiply(sF0,greatest_lower_bound(sF3,sF5))),
inference(superposition,[],[f489,f199766]) ).
fof(f252306,plain,
multiply(greatest_lower_bound(sF2,greatest_lower_bound(sF0,sF3)),b) = multiply(sF0,greatest_lower_bound(a,greatest_lower_bound(sF3,sF5))),
inference(forward_demodulation,[],[f252156,f443]) ).
fof(f252360,plain,
multiply(sF0,greatest_lower_bound(sF3,greatest_lower_bound(sF5,a))) = multiply(greatest_lower_bound(sF2,greatest_lower_bound(sF0,sF3)),b),
inference(forward_demodulation,[],[f252306,f21792]) ).
fof(f252403,plain,
multiply(sF0,greatest_lower_bound(sF3,greatest_lower_bound(sF5,a))) = multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF3,sF2)),b),
inference(forward_demodulation,[],[f252360,f35920]) ).
fof(f252431,plain,
multiply(sF0,greatest_lower_bound(sF3,greatest_lower_bound(sF5,a))) = multiply(greatest_lower_bound(sF0,greatest_lower_bound(sF2,sF3)),b),
inference(forward_demodulation,[],[f252403,f36151]) ).
fof(f252447,plain,
multiply(greatest_lower_bound(sF0,sF2),b) = multiply(sF0,greatest_lower_bound(sF3,greatest_lower_bound(sF5,a))),
inference(forward_demodulation,[],[f252431,f40]) ).
fof(f252459,plain,
multiply(greatest_lower_bound(sF0,sF2),b) = multiply(sF0,greatest_lower_bound(sF3,greatest_lower_bound(a,sF5))),
inference(forward_demodulation,[],[f252447,f21882]) ).
fof(f252469,plain,
multiply(sF0,greatest_lower_bound(identity,sF5)) = multiply(greatest_lower_bound(sF0,sF2),b),
inference(forward_demodulation,[],[f252459,f199511]) ).
fof(f252478,plain,
multiply(sF0,greatest_lower_bound(identity,sF5)) = multiply(sF0,greatest_lower_bound(a,b)),
inference(forward_demodulation,[],[f252469,f29212]) ).
fof(f252486,plain,
greatest_lower_bound(sF0,b) = multiply(sF0,greatest_lower_bound(a,b)),
inference(forward_demodulation,[],[f252478,f11620]) ).
fof(f252515,plain,
multiply(a,greatest_lower_bound(sF0,b)) = greatest_lower_bound(a,b),
inference(superposition,[],[f460,f252486]) ).
fof(f252520,plain,
! [X0] : multiply(greatest_lower_bound(sF0,b),X0) = multiply(sF0,multiply(greatest_lower_bound(a,b),X0)),
inference(superposition,[],[f4,f252486]) ).
fof(f252654,plain,
multiply(greatest_lower_bound(sF0,b),a) = multiply(greatest_lower_bound(sF0,sF2),sF6),
inference(backward_demodulation,[],[f77542,f252520]) ).
fof(f252660,plain,
greatest_lower_bound(identity,sF5) = greatest_lower_bound(a,b),
inference(backward_demodulation,[],[f637,f252515]) ).
fof(f252765,plain,
greatest_lower_bound(a,b) = multiply(greatest_lower_bound(sF0,sF2),sF6),
inference(forward_demodulation,[],[f252654,f201450]) ).
fof(f253068,plain,
sF5 = multiply(inverse(greatest_lower_bound(sF0,sF2)),greatest_lower_bound(a,b)),
inference(backward_demodulation,[],[f201976,f252660]) ).
fof(f253768,plain,
sF6 = multiply(inverse(greatest_lower_bound(sF0,sF2)),greatest_lower_bound(a,b)),
inference(superposition,[],[f133,f252765]) ).
fof(f253875,plain,
sF5 = sF6,
inference(forward_demodulation,[],[f253768,f253068]) ).
fof(f254845,plain,
$false,
inference(forward_subsumption_resolution,[],[f253875,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP187-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.49 % Computer : n004.cluster.edu
% 0.22/0.49 % Model : x86_64 x86_64
% 0.22/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.49 % Memory : 8046.5625MB
% 0.22/0.49 % OS : Linux 6.8.0-71-generic
% 0.22/0.49 % CPULimit : 300
% 0.22/0.49 % WCLimit : 300
% 0.22/0.49 % DateTime : Sun Sep 27 09:36:52 UTC 2026
% 0.22/0.50 % CPUTime :
% 0.22/0.50 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.55 Running first-order theorem proving
% 0.27/0.55 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 93.28/14.49 % (3252984)Detected a unit-equality problem, will run specialized UEQ schedule.
% 93.28/14.49 % (3252991)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2800218815:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 93.28/14.49 % (3252989)lrs+1002_1_ncem=casc2026/models/loop7.pt:sil=128000:tgt=ground:npcc=on:drc=off:sp=reverse_frequency:spb=goal:acc=on:s2agt=16:kmz=on:sac=on:random_seed=2643789449:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 93.28/14.49 % (3252994)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=202364864:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 93.28/14.49 % (3252992)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=4007117222:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 93.28/14.49 % (3252995)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1431073332:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 93.28/14.49 % (3252990)lrs+11_1_ncem=casc2026/models/loop6.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2787364585:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 93.28/14.49 % (3252993)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3090875976:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 93.28/14.49 % (3252992)Instruction limit reached!
% 93.28/14.49 % (3252992)------------------------------
% 93.28/14.49 % (3252992)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 93.28/14.49 % (3252992)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 93.28/14.49 % (3252992)CaDiCaL version: 2.1.3
% 93.28/14.49 % (3252992)Termination reason: Instruction limit
% 93.28/14.49 % (3252992)Termination phase: Saturation
% 93.28/14.49 % (3252992)Time elapsed: 0.136 s
% 93.28/14.49 % (3252992)Peak memory usage: 88 MB
% 93.28/14.49 % (3252992)Instructions burned: 136 (million)
% 93.28/14.49 % (3252993)Instruction limit reached!
% 93.28/14.49 % (3252993)------------------------------
% 93.28/14.49 % (3252993)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 93.28/14.49 % (3252993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 93.28/14.49 % (3252993)CaDiCaL version: 2.1.3
% 93.28/14.49 % (3252993)Termination reason: Instruction limit
% 93.28/14.49 % (3252993)Termination phase: Saturation
% 93.28/14.49 % (3252993)Time elapsed: 0.179 s
% 93.28/14.49 % (3252993)Peak memory usage: 89 MB
% 93.28/14.49 % (3252993)Instructions burned: 181 (million)
% 93.28/14.49 % (3252994)Instruction limit reached!
% 93.28/14.49 % (3252994)------------------------------
% 93.28/14.49 % (3252994)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 93.28/14.49 % (3252994)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 93.28/14.49 % (3252994)CaDiCaL version: 2.1.3
% 93.28/14.49 % (3252994)Termination reason: Instruction limit
% 93.28/14.49 % (3252994)Termination phase: Saturation
% 93.28/14.49 % (3252994)Time elapsed: 0.275 s
% 93.28/14.49 % (3252994)Peak memory usage: 91 MB
% 93.28/14.49 % (3252994)Instructions burned: 257 (million)
% 93.28/14.49 % (3253003)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3105965405:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2995 on theBenchmark for (2995ds/2051Mi)
% 93.28/14.49 % (3253004)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2213329732:i=4948:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/4948Mi)
% 93.28/14.49 % (3253005)lrs+10_5:1_sil=8000:sos=all:urr=on:br=off:flr=on:random_seed=1694983263:i=215:ep=RSTC_2994 on theBenchmark for (2994ds/215Mi)
% 93.28/14.49 % (3253005)Instruction limit reached!
% 93.28/14.49 % (3253005)------------------------------
% 93.28/14.49 % (3253005)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 93.28/14.49 % (3253005)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 93.28/14.49 % (3253005)CaDiCaL version: 2.1.3
% 93.28/14.49 % (3253005)Termination reason: Instruction limit
% 93.28/14.49 % (3253005)Termination phase: Saturation
% 93.28/14.49 % (3253005)Time elapsed: 0.195 s
% 60.24/16.21 % (3253005)Peak memory usage: 92 MB
% 60.24/16.21 % (3253005)Instructions burned: 215 (million)
% 60.24/16.21 % (3253009)lrs+11_1_sil=16000:tgt=full:fde=none:sp=reverse_frequency:lma=off:fs=off:acc=on:bsr=unit_only:rp=on:random_seed=1536206715:avsq=on:i=317:avsqr=1,16:kws=arity_squared:add=off:fgj=on:ins=10:fsr=off:gtg=exists_sym_2989 on theBenchmark for (2989ds/317Mi)
% 60.24/16.21 % (3252995)Instruction limit reached!
% 60.24/16.21 % (3252995)------------------------------
% 60.24/16.21 % (3252995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3252995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3252995)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3252995)Termination reason: Instruction limit
% 60.24/16.21 % (3252995)Termination phase: Saturation
% 60.24/16.21 % (3252995)Time elapsed: 1.086 s
% 60.24/16.21 % (3252995)Peak memory usage: 99 MB
% 60.24/16.21 % (3252995)Instructions burned: 1187 (million)
% 60.24/16.21 % (3253020)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=64000:tgt=full:npcc=on:sp=arity:lcm=predicate:urr=on:s2agt=16:br=off:random_seed=252118997:i=12125:sd=2:fgj=on:ss=axioms:sgt=64_2986 on theBenchmark for (2986ds/12125Mi)
% 60.24/16.21 % (3253009)Instruction limit reached!
% 60.24/16.21 % (3253009)------------------------------
% 60.24/16.21 % (3253009)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253009)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253009)Termination reason: Instruction limit
% 60.24/16.21 % (3253009)Termination phase: Saturation
% 60.24/16.21 % (3253009)Time elapsed: 0.331 s
% 60.24/16.21 % (3253009)Peak memory usage: 92 MB
% 60.24/16.21 % (3253009)Instructions burned: 317 (million)
% 60.24/16.21 % (3253022)lrs+10_32_sil=8000:tgt=ground:prc=on:sp=reverse_arity:spb=non_intro:random_seed=1567281683:i=2836:kws=inv_precedence:fgj=on:bd=preordered:ins=10_2982 on theBenchmark for (2982ds/2836Mi)
% 60.24/16.21 % (3253003)Instruction limit reached!
% 60.24/16.21 % (3253003)------------------------------
% 60.24/16.21 % (3253003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253003)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253003)Termination reason: Instruction limit
% 60.24/16.21 % (3253003)Termination phase: Saturation
% 60.24/16.21 % (3253003)Time elapsed: 1.912 s
% 60.24/16.21 % (3253003)Peak memory usage: 141 MB
% 60.24/16.21 % (3253003)Instructions burned: 2051 (million)
% 60.24/16.21 % (3253099)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:lma=off:kmz=on:random_seed=759275963:i=14534:kws=arity:fgj=on:bd=preordered:ins=6:ss=axioms:sgt=30_2973 on theBenchmark for (2973ds/14534Mi)
% 60.24/16.21 % (3253022)Instruction limit reached!
% 60.24/16.21 % (3253022)------------------------------
% 60.24/16.21 % (3253022)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253022)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253022)Termination reason: Instruction limit
% 60.24/16.21 % (3253022)Termination phase: Saturation
% 60.24/16.21 % (3253022)Time elapsed: 1.960 s
% 60.24/16.21 % (3253022)Peak memory usage: 138 MB
% 60.24/16.21 % (3253022)Instructions burned: 2837 (million)
% 60.24/16.21 % (3253180)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:sas=cadical:sp=reverse_frequency:bsr=on:alpa=false:sac=on:random_seed=3756759310:i=11832:s2at=3:bs=on:bd=preordered:fsd=on_2960 on theBenchmark for (2960ds/11832Mi)
% 60.24/16.21 % (3253004)Instruction limit reached!
% 60.24/16.21 % (3253004)------------------------------
% 60.24/16.21 % (3253004)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253004)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253004)Termination reason: Instruction limit
% 60.24/16.21 % (3253004)Termination phase: Saturation
% 60.24/16.21 % (3253004)Time elapsed: 3.477 s
% 60.24/16.21 % (3253004)Peak memory usage: 169 MB
% 60.24/16.21 % (3253004)Instructions burned: 4949 (million)
% 60.24/16.21 % (3253182)lrs+10_1_to=lpo:ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:drc=off:fde=unused:sp=const_min:spb=goal:fd=preordered:random_seed=4097644889:i=2279:fgj=on:bd=all_2957 on theBenchmark for (2957ds/2279Mi)
% 60.24/16.21 % (3253182)Instruction limit reached!
% 60.24/16.21 % (3253182)------------------------------
% 60.24/16.21 % (3253182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253182)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253182)Termination reason: Instruction limit
% 60.24/16.21 % (3253182)Termination phase: Saturation
% 60.24/16.21 % (3253182)Time elapsed: 1.385 s
% 60.24/16.21 % (3253182)Peak memory usage: 141 MB
% 60.24/16.21 % (3253182)Instructions burned: 2279 (million)
% 60.24/16.21 % (3253184)lrs-1010_1_to=lpo:ncem=casc2026/models/loop8.pt:sil=32000:tgt=ground:npcc=on:drc=off:fde=none:sp=reverse_arity:urr=ec_only:gs=on:s2agt=16:random_seed=2449444973:st=3:i=6225:bd=all:gtg=exists_all:ss=included:er=filter:sgt=10_2941 on theBenchmark for (2941ds/6225Mi)
% 60.24/16.21 % (3253020)Instruction limit reached!
% 60.24/16.21 % (3253020)------------------------------
% 60.24/16.21 % (3253020)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253020)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253020)Termination reason: Instruction limit
% 60.24/16.21 % (3253020)Termination phase: Saturation
% 60.24/16.21 % (3253020)Time elapsed: 7.326 s
% 60.24/16.21 % (3253020)Peak memory usage: 244 MB
% 60.24/16.21 % (3253020)Instructions burned: 12126 (million)
% 60.24/16.21 % (3253186)lrs-1010_1_sil=32000:tgt=ground:etr=on:sp=const_frequency:spb=goal_then_units:rnwc=on:lwlo=on:random_seed=3367270134:lrd=on:i=21755:kws=frequency:fgj=on:bd=preordered:nm=4:ins=20:av=off_2909 on theBenchmark for (2909ds/21755Mi)
% 60.24/16.21 % (3253184)Instruction limit reached!
% 60.24/16.21 % (3253184)------------------------------
% 60.24/16.21 % (3253184)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253184)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253184)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253184)Termination reason: Instruction limit
% 60.24/16.21 % (3253184)Termination phase: Saturation
% 60.24/16.21 % (3253184)Time elapsed: 3.697 s
% 60.24/16.21 % (3253184)Peak memory usage: 172 MB
% 60.24/16.21 % (3253184)Instructions burned: 6225 (million)
% 60.24/16.21 % (3253188)lrs+1010_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:drc=off:flr=on:random_seed=4037900668:s2pl=no:i=16427:s2at=1.5:bd=all:fsr=off_2902 on theBenchmark for (2902ds/16427Mi)
% 60.24/16.21 % (3253180)Instruction limit reached!
% 60.24/16.21 % (3253180)------------------------------
% 60.24/16.21 % (3253180)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253180)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253180)Termination reason: Instruction limit
% 60.24/16.21 % (3253180)Termination phase: Saturation
% 60.24/16.21 % (3253180)Time elapsed: 7.496 s
% 60.24/16.21 % (3253180)Peak memory usage: 231 MB
% 60.24/16.21 % (3253180)Instructions burned: 11833 (million)
% 60.24/16.21 % (3253099)Instruction limit reached!
% 60.24/16.21 % (3253099)------------------------------
% 60.24/16.21 % (3253099)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253099)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253099)Termination reason: Instruction limit
% 60.24/16.21 % (3253099)Termination phase: Saturation
% 60.24/16.21 % (3253099)Time elapsed: 8.966 s
% 60.24/16.21 % (3253099)Peak memory usage: 254 MB
% 60.24/16.21 % (3253099)Instructions burned: 14534 (million)
% 60.24/16.21 % (3253190)lrs+1011_1_to=lpo:ncem=casc2026/models/loop7.pt:sil=32000:npcc=on:drc=off:fde=none:sp=const_frequency:spb=goal:fd=preordered:random_seed=863425743:i=9356:fgj=on:bd=preordered:av=off_2883 on theBenchmark for (2883ds/9356Mi)
% 60.24/16.21 % (3253191)dis+10_6_sil=8000:tgt=ground:prc=on:drc=ordering:spb=non_intro:fd=preordered:foolp=on:slsqc=1:slsq=on:random_seed=2623111108:i=2070:kws=inv_precedence:slsql=off:bd=all_2881 on theBenchmark for (2881ds/2070Mi)
% 60.24/16.21 % (3253191)Instruction limit reached!
% 60.24/16.21 % (3253191)------------------------------
% 60.24/16.21 % (3253191)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 60.24/16.21 % (3253191)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 60.24/16.21 % (3253191)CaDiCaL version: 2.1.3
% 60.24/16.21 % (3253191)Termination reason: Instruction limit
% 60.24/16.21 % (3253191)Termination phase: Saturation
% 60.24/16.21 % (3253191)Time elapsed: 1.247 s
% 60.24/16.21 % (3253191)Peak memory usage: 132 MB
% 60.24/16.21 % (3253191)Instructions burned: 2072 (million)
% 60.24/16.21 % (3253240)lrs+1002_1_to=lpo:ncem=casc2026/models/loop4.pt:sil=8000:tgt=ground:npcc=on:fde=unused:sp=const_min:urr=ec_only:s2agt=32:random_seed=1748951780:st=3:i=6461:fgj=on:bd=preordered:av=off:ss=axioms_2867 on theBenchmark for (2867ds/6461Mi)
% 60.24/16.21 % (3252991)First to succeed.
% 60.24/16.21 % (3252991)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3252984"
% 60.24/16.21 % (3252991)Refutation found. Thanks to Tanya!
% 60.24/16.21 % SZS status Unsatisfiable for theBenchmark
% 60.24/16.21 % SZS output start Proof for theBenchmark
% See solution above
% 0.30/16.41 % (3252991)------------------------------
% 0.30/16.41 % (3252991)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.30/16.41 % (3252991)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.30/16.41 % (3252991)CaDiCaL version: 2.1.3
% 0.30/16.41 % (3252991)Termination reason: Refutation
% 0.30/16.41 % (3252991)Time elapsed: 14.503 s
% 0.30/16.41 % (3252991)Peak memory usage: 446 MB
% 0.30/16.41 % (3252991)Instructions burned: 38129 (million)
% 0.30/16.41 % (3252991)------------------------------
% 0.30/16.41 % (3252991)------------------------------
% 0.30/16.41 % (3252984)Success in time 14.947 s
% 0.30/16.41 % Vampire exiting
%------------------------------------------------------------------------------