%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:10 AM UTC 2026
% Result : Unsatisfiable 0.17s 1.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 27 ( 27 unt; 1 def)
% Number of atoms : 27 ( 23 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 : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f2,axiom,
! [X0] : multiply(inverse(X0),X0) = identity,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',associativity) ).
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/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f12,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f17,axiom,
least_upper_bound(identity,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_1) ).
fof(f18,plain,
a = least_upper_bound(identity,a),
inference(reorient_equations,[],[f17]) ).
fof(f19,axiom,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p04c_2) ).
fof(f20,plain,
b = least_upper_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f21,negated_conjecture,
greatest_lower_bound(identity,multiply(a,b)) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p04c) ).
fof(f22,plain,
identity != greatest_lower_bound(identity,multiply(a,b)),
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
~ sP0(greatest_lower_bound(identity,multiply(a,b))),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f24,plain,
sP0(identity),
inference(inequality_splitting,[],[f22,f23]) ).
fof(f51,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f4,f3]) ).
fof(f54,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f51,f1]) ).
fof(f85,plain,
! [X0] : least_upper_bound(a,X0) = least_upper_bound(identity,least_upper_bound(a,X0)),
inference(superposition,[],[f8,f18]) ).
fof(f108,plain,
! [X0] : multiply(X0,b) = least_upper_bound(multiply(X0,identity),multiply(X0,b)),
inference(superposition,[],[f13,f20]) ).
fof(f253,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f54,f3]) ).
fof(f256,plain,
! [X0,X1] : multiply(X1,X0) = multiply(inverse(inverse(X1)),X0),
inference(superposition,[],[f54,f54]) ).
fof(f264,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f253,f256]) ).
fof(f268,plain,
! [X0] : multiply(X0,b) = least_upper_bound(X0,multiply(X0,b)),
inference(backward_demodulation,[],[f108,f264]) ).
fof(f350,plain,
! [X0] : identity = greatest_lower_bound(identity,least_upper_bound(a,X0)),
inference(superposition,[],[f12,f85]) ).
fof(f601,plain,
identity = greatest_lower_bound(identity,multiply(a,b)),
inference(superposition,[],[f350,f268]) ).
fof(f618,plain,
~ sP0(identity),
inference(backward_demodulation,[],[f23,f601]) ).
fof(f621,plain,
$false,
inference(forward_subsumption_resolution,[],[f618,f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP171-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 09:36:24 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/1.50 % (977300)Detected a unit-equality problem, will run specialized UEQ schedule.
% 0.17/1.50 % (977411)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3905378544:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 0.17/1.50 % (977406)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=3571063351:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 0.17/1.50 % (977410)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4020642765:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 0.17/1.50 % (977407)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=3640965925:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 0.17/1.50 % (977408)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=23004584:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 0.17/1.50 % (977409)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3089948552:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 0.17/1.50 % (977412)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1559531654:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 0.17/1.50 % (977409)First to succeed.
% 0.17/1.50 % (977409)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-977300"
% 0.17/1.50 % (977411)Instruction limit reached!
% 0.17/1.50 % (977411)------------------------------
% 0.17/1.50 % (977411)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50 % (977411)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50 % (977411)CaDiCaL version: 2.1.3
% 0.17/1.50 % (977411)Termination reason: Instruction limit
% 0.17/1.50 % (977411)Termination phase: Saturation
% 0.17/1.50 % (977411)Time elapsed: 0.088 s
% 0.17/1.50 % (977411)Peak memory usage: 91 MB
% 0.17/1.50 % (977411)Instructions burned: 259 (million)
% 0.17/1.50 % (977412)Also succeeded, but the first one will report.
% 0.17/1.50 % (977410)Also succeeded, but the first one will report.
% 0.17/1.50 % (977424)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=4138484313:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 0.17/1.50 % (977409)Refutation found. Thanks to Tanya!
% 0.17/1.50 % SZS status Unsatisfiable for theBenchmark
% 0.17/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.51 % (977409)------------------------------
% 0.17/1.51 % (977409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.51 % (977409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.51 % (977409)CaDiCaL version: 2.1.3
% 0.17/1.51 % (977409)Termination reason: Refutation
% 0.17/1.51 % (977409)Time elapsed: 0.019 s
% 0.17/1.51 % (977409)Peak memory usage: 88 MB
% 0.17/1.51 % (977409)Instructions burned: 27 (million)
% 0.17/1.51 % (977409)------------------------------
% 0.17/1.51 % (977409)------------------------------
% 0.17/1.51 % (977300)Success in time 0.454 s
% 0.17/1.51 % Vampire exiting
%------------------------------------------------------------------------------