%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP190-2 : 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 : n010.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:17 AM UTC 2026
% Result : Unsatisfiable 3.85s 1.64s
% Output : Refutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of formulae : 58 ( 58 unt; 6 def)
% Number of atoms : 58 ( 57 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 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(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(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(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,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39c_1) ).
fof(f18,plain,
a = least_upper_bound(a,b),
inference(reorient_equations,[],[f17]) ).
fof(f19,negated_conjecture,
greatest_lower_bound(inverse(a),inverse(b)) != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39c) ).
fof(f20,plain,
inverse(a) != greatest_lower_bound(inverse(a),inverse(b)),
inference(reorient_equations,[],[f19]) ).
fof(f21,definition,
! [X0] : sF0(X0) = multiply(identity,X0),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f22,plain,
! [X0] : multiply(identity,X0) = sF0(X0),
inference(reorient_equations,[],[f21]) ).
fof(f23,plain,
! [X0] : sF0(X0) = X0,
inference(definition_folding,[],[f1,f22]) ).
fof(f24,definition,
! [X0] : sF1(X0) = multiply(inverse(X0),X0),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f25,plain,
! [X0] : multiply(inverse(X0),X0) = sF1(X0),
inference(reorient_equations,[],[f24]) ).
fof(f26,plain,
! [X0] : identity = sF1(X0),
inference(definition_folding,[],[f3,f25]) ).
fof(f27,definition,
sF2 = least_upper_bound(a,b),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f28,plain,
least_upper_bound(a,b) = sF2,
inference(reorient_equations,[],[f27]) ).
fof(f29,plain,
a = sF2,
inference(definition_folding,[],[f18,f28]) ).
fof(f30,definition,
sF3 = inverse(a),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f31,plain,
inverse(a) = sF3,
inference(reorient_equations,[],[f30]) ).
fof(f32,definition,
sF4 = inverse(b),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f33,plain,
inverse(b) = sF4,
inference(reorient_equations,[],[f32]) ).
fof(f34,definition,
sF5 = greatest_lower_bound(sF3,sF4),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f35,plain,
greatest_lower_bound(sF3,sF4) = sF5,
inference(reorient_equations,[],[f34]) ).
fof(f36,plain,
sF3 != sF5,
inference(definition_folding,[],[f20,f35,f33,f31,f31]) ).
fof(f37,plain,
! [X0] : identity = multiply(inverse(X0),X0),
inference(forward_demodulation,[],[f26,f25]) ).
fof(f38,plain,
! [X0] : multiply(identity,X0) = X0,
inference(forward_demodulation,[],[f23,f22]) ).
fof(f47,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f16,f38]) ).
fof(f55,plain,
identity = multiply(sF3,a),
inference(superposition,[],[f37,f31]) ).
fof(f56,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f4,f37]) ).
fof(f57,plain,
! [X0,X1] : multiply(inverse(X0),least_upper_bound(X0,X1)) = least_upper_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f37]) ).
fof(f69,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f56,f38]) ).
fof(f126,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f69,f37]) ).
fof(f128,plain,
a = multiply(inverse(sF3),identity),
inference(superposition,[],[f69,f55]) ).
fof(f171,plain,
identity = multiply(inverse(inverse(sF3)),a),
inference(superposition,[],[f69,f128]) ).
fof(f203,plain,
! [X0] : identity = multiply(inverse(inverse(inverse(X0))),X0),
inference(superposition,[],[f69,f126]) ).
fof(f301,plain,
a = multiply(inverse(inverse(inverse(sF3))),identity),
inference(superposition,[],[f69,f171]) ).
fof(f302,plain,
a = inverse(sF3),
inference(forward_demodulation,[],[f301,f126]) ).
fof(f312,plain,
identity = multiply(a,sF3),
inference(superposition,[],[f37,f302]) ).
fof(f576,plain,
! [X0] : multiply(inverse(inverse(inverse(inverse(X0)))),identity) = X0,
inference(superposition,[],[f69,f203]) ).
fof(f577,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f576,f126]) ).
fof(f591,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f126,f577]) ).
fof(f1791,plain,
! [X0,X1] : identity = greatest_lower_bound(identity,multiply(inverse(X0),least_upper_bound(X0,X1))),
inference(superposition,[],[f12,f57]) ).
fof(f3050,plain,
! [X0] : identity = greatest_lower_bound(identity,multiply(sF4,least_upper_bound(b,X0))),
inference(superposition,[],[f1791,f33]) ).
fof(f3289,plain,
! [X0] : identity = greatest_lower_bound(identity,multiply(sF4,least_upper_bound(X0,b))),
inference(superposition,[],[f3050,f6]) ).
fof(f3341,plain,
identity = greatest_lower_bound(identity,multiply(sF4,sF2)),
inference(superposition,[],[f3289,f28]) ).
fof(f3354,plain,
identity = greatest_lower_bound(identity,multiply(sF4,a)),
inference(forward_demodulation,[],[f3341,f29]) ).
fof(f3362,plain,
! [X0] : multiply(identity,X0) = greatest_lower_bound(X0,multiply(multiply(sF4,a),X0)),
inference(superposition,[],[f47,f3354]) ).
fof(f3365,plain,
! [X0] : multiply(identity,X0) = greatest_lower_bound(X0,multiply(sF4,multiply(a,X0))),
inference(forward_demodulation,[],[f3362,f4]) ).
fof(f3369,plain,
! [X0] : greatest_lower_bound(X0,multiply(sF4,multiply(a,X0))) = X0,
inference(forward_demodulation,[],[f3365,f38]) ).
fof(f3504,plain,
sF3 = greatest_lower_bound(sF3,multiply(sF4,identity)),
inference(superposition,[],[f3369,f312]) ).
fof(f3539,plain,
sF3 = greatest_lower_bound(sF3,sF4),
inference(forward_demodulation,[],[f3504,f591]) ).
fof(f3546,plain,
sF3 = sF5,
inference(forward_demodulation,[],[f3539,f35]) ).
fof(f3556,plain,
sF3 != sF3,
inference(superposition,[],[f36,f3546]) ).
fof(f3580,plain,
$false,
inference(trivial_inequality_removal,[],[f3556]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP190-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n010.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 09:37:16 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 3.85/1.64 % (700559)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.85/1.64 % (700615)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3333022886:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.85/1.64 % (700616)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1201229158:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.85/1.64 % (700614)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=193370688:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.85/1.64 % (700613)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=87100826:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.85/1.64 % (700611)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=3237561007:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.85/1.64 % (700612)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=3577742165:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.85/1.64 % (700617)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=543925089:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.85/1.64 % (700615)First to succeed.
% 3.85/1.64 % (700615)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-700559"
% 3.85/1.64 % (700614)Instruction limit reached!
% 3.85/1.64 % (700614)------------------------------
% 3.85/1.64 % (700614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.64 % (700614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.64 % (700614)CaDiCaL version: 2.1.3
% 3.85/1.64 % (700614)Termination reason: Instruction limit
% 3.85/1.64 % (700614)Termination phase: Saturation
% 3.85/1.64 % (700614)Time elapsed: 0.083 s
% 3.85/1.64 % (700614)Peak memory usage: 88 MB
% 3.85/1.64 % (700614)Instructions burned: 136 (million)
% 3.85/1.64 % (700616)Instruction limit reached!
% 3.85/1.64 % (700616)------------------------------
% 3.85/1.64 % (700616)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.64 % (700616)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.64 % (700616)CaDiCaL version: 2.1.3
% 3.85/1.64 % (700616)Termination reason: Instruction limit
% 3.85/1.64 % (700616)Termination phase: Saturation
% 3.85/1.64 % (700616)Time elapsed: 0.184 s
% 3.85/1.64 % (700616)Peak memory usage: 91 MB
% 3.85/1.64 % (700616)Instructions burned: 258 (million)
% 3.85/1.64 % (700615)Refutation found. Thanks to Tanya!
% 3.85/1.64 % SZS status Unsatisfiable for theBenchmark
% 3.85/1.64 % SZS output start Proof for theBenchmark
% See solution above
% 3.85/1.64 % (700615)------------------------------
% 3.85/1.64 % (700615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.85/1.64 % (700615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.85/1.64 % (700615)CaDiCaL version: 2.1.3
% 3.85/1.64 % (700615)Termination reason: Refutation
% 3.85/1.64 % (700615)Time elapsed: 0.061 s
% 3.85/1.64 % (700615)Peak memory usage: 89 MB
% 3.85/1.64 % (700615)Instructions burned: 120 (million)
% 3.85/1.64 % (700615)------------------------------
% 3.85/1.64 % (700615)------------------------------
% 3.85/1.64 % (700559)Success in time 0.44 s
% 3.85/1.64 % Vampire exiting
%------------------------------------------------------------------------------