%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP193-1 : 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 : 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:18 AM UTC 2026
% Result : Unsatisfiable 1.84s 1.30s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 36 unt; 1 def)
% Number of atoms : 36 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f5,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
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/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f10,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
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(f14,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
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/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f19,axiom,
least_upper_bound(identity,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_2) ).
fof(f20,plain,
b = least_upper_bound(identity,b),
inference(reorient_equations,[],[f19]) ).
fof(f23,axiom,
greatest_lower_bound(a,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_4) ).
fof(f24,plain,
identity = greatest_lower_bound(a,b),
inference(reorient_equations,[],[f23]) ).
fof(f25,axiom,
least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_5) ).
fof(f26,plain,
multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
inference(reorient_equations,[],[f25]) ).
fof(f27,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p8_9a) ).
fof(f28,definition,
~ sP0(greatest_lower_bound(a,multiply(b,c))),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f29,plain,
sP0(greatest_lower_bound(a,c)),
inference(inequality_splitting,[],[f27,f28]) ).
fof(f30,plain,
multiply(identity,greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))),
inference(backward_demodulation,[],[f26,f24]) ).
fof(f31,plain,
greatest_lower_bound(multiply(identity,a),multiply(identity,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(identity,a),multiply(identity,c))),
inference(forward_demodulation,[],[f30,f14]) ).
fof(f32,plain,
greatest_lower_bound(multiply(identity,a),c) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(identity,a),c)),
inference(forward_demodulation,[],[f31,f1]) ).
fof(f33,plain,
greatest_lower_bound(a,c) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
inference(forward_demodulation,[],[f32,f1]) ).
fof(f46,plain,
identity = greatest_lower_bound(identity,b),
inference(superposition,[],[f12,f20]) ).
fof(f65,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f7,f10]) ).
fof(f67,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(f80,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(f113,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
inference(superposition,[],[f12,f33]) ).
fof(f116,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c))),
inference(forward_demodulation,[],[f113,f7]) ).
fof(f302,plain,
! [X0] : multiply(identity,X0) = greatest_lower_bound(multiply(identity,X0),multiply(b,X0)),
inference(superposition,[],[f16,f46]) ).
fof(f321,plain,
! [X0] : greatest_lower_bound(X0,multiply(b,X0)) = X0,
inference(forward_demodulation,[],[f302,f1]) ).
fof(f978,plain,
! [X2,X0,X1] : greatest_lower_bound(greatest_lower_bound(X1,X0),X2) = greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(greatest_lower_bound(X1,X0),X2))),
inference(superposition,[],[f65,f67]) ).
fof(f981,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X0,X2)) = greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X1,greatest_lower_bound(X0,X2)))),
inference(forward_demodulation,[],[f978,f7]) ).
fof(f1005,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X0,X2)) = greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X2))),
inference(forward_demodulation,[],[f981,f65]) ).
fof(f1028,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c)),
inference(backward_demodulation,[],[f116,f1005]) ).
fof(f1152,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(multiply(b,X0),greatest_lower_bound(X1,X0)),
inference(superposition,[],[f80,f321]) ).
fof(f1290,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(backward_demodulation,[],[f1028,f1152]) ).
fof(f1308,plain,
~ sP0(greatest_lower_bound(a,c)),
inference(backward_demodulation,[],[f28,f1290]) ).
fof(f1316,plain,
$false,
inference(forward_subsumption_resolution,[],[f1308,f29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP193-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 09:37:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 1.84/1.29 % (700606)Detected a unit-equality problem, will run specialized UEQ schedule.
% 1.84/1.29 % (700627)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=1348679451:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 1.84/1.29 % (700632)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3016190168:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 1.84/1.29 % (700629)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4288718495:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 1.84/1.29 % (700630)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2170986818:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 1.84/1.29 % (700628)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=1106836002:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 1.84/1.29 % (700631)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=509491948:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 1.84/1.29 % (700633)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2261942192:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 1.84/1.29 % (700630)First to succeed.
% 1.84/1.29 % (700630)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-700606"
% 1.84/1.29 % (700631)Instruction limit reached!
% 1.84/1.29 % (700631)------------------------------
% 1.84/1.29 % (700631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.84/1.29 % (700631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.84/1.29 % (700631)CaDiCaL version: 2.1.3
% 1.84/1.29 % (700631)Termination reason: Instruction limit
% 1.84/1.29 % (700631)Termination phase: Saturation
% 1.84/1.30 % (700631)Time elapsed: 0.097 s
% 1.84/1.30 % (700631)Peak memory usage: 88 MB
% 1.84/1.30 % (700631)Instructions burned: 181 (million)
% 1.84/1.30 % (700632)Instruction limit reached!
% 1.84/1.30 % (700632)------------------------------
% 1.84/1.30 % (700632)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.84/1.30 % (700632)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.84/1.30 % (700632)CaDiCaL version: 2.1.3
% 1.84/1.30 % (700632)Termination reason: Instruction limit
% 1.84/1.30 % (700632)Termination phase: Saturation
% 1.84/1.30 % (700632)Time elapsed: 0.209 s
% 1.84/1.30 % (700632)Peak memory usage: 91 MB
% 1.84/1.30 % (700632)Instructions burned: 257 (million)
% 1.84/1.30 % (700642)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=1619566496:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 1.84/1.30 % (700630)Refutation found. Thanks to Tanya!
% 1.84/1.30 % SZS status Unsatisfiable for theBenchmark
% 1.84/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 1.84/1.30 % (700630)------------------------------
% 1.84/1.30 % (700630)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.84/1.30 % (700630)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.84/1.30 % (700630)CaDiCaL version: 2.1.3
% 1.84/1.30 % (700630)Termination reason: Refutation
% 1.84/1.30 % (700630)Time elapsed: 0.037 s
% 1.84/1.30 % (700630)Peak memory usage: 88 MB
% 1.84/1.30 % (700630)Instructions burned: 58 (million)
% 1.84/1.30 % (700630)------------------------------
% 1.84/1.30 % (700630)------------------------------
% 1.84/1.30 % (700606)Success in time 0.479 s
% 1.84/1.30 % Vampire exiting
%------------------------------------------------------------------------------