%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP533-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:14:48 AM UTC 2026
% Result : Unsatisfiable 2.58s 1.36s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 41 unt; 7 def)
% Number of atoms : 41 ( 40 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 : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-3 aty)
% Number of variables : 41 ( 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,negated_conjecture,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
! [X0] : identity = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f13,definition,
! [X2] : sF3(X2) = divide(X2,X2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f14,plain,
! [X2] : divide(X2,X2) = sF3(X2),
inference(reorient_equations,[],[f13]) ).
fof(f15,definition,
! [X2,X1] : sF4(X2,X1) = divide(sF3(X2),X1),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f16,plain,
! [X2,X1] : divide(sF3(X2),X1) = sF4(X2,X1),
inference(reorient_equations,[],[f15]) ).
fof(f17,definition,
! [X2,X0,X1] : sF5(X0,X2,X1) = divide(X0,sF4(X2,X1)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f18,plain,
! [X2,X0,X1] : divide(X0,sF4(X2,X1)) = sF5(X0,X2,X1),
inference(reorient_equations,[],[f17]) ).
fof(f19,plain,
! [X2,X0,X1] : multiply(X0,X1) = sF5(X0,X2,X1),
inference(definition_folding,[],[f2,f18,f16,f14]) ).
fof(f20,plain,
! [X0,X1] : inverse(X0) = sF4(X1,X0),
inference(definition_folding,[],[f3,f16,f14]) ).
fof(f21,plain,
! [X0] : identity = sF3(X0),
inference(definition_folding,[],[f4,f14]) ).
fof(f22,definition,
sF6 = inverse(a1),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f23,plain,
inverse(a1) = sF6,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF7 = multiply(sF6,a1),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f25,plain,
multiply(sF6,a1) = sF7,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF8 = inverse(b1),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f27,plain,
inverse(b1) = sF8,
inference(reorient_equations,[],[f26]) ).
fof(f28,definition,
sF9 = multiply(sF8,b1),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f29,plain,
multiply(sF8,b1) = sF9,
inference(reorient_equations,[],[f28]) ).
fof(f30,plain,
sF7 != sF9,
inference(definition_folding,[],[f5,f29,f27,f25,f23]) ).
fof(f31,plain,
! [X0] : identity = divide(X0,X0),
inference(forward_demodulation,[],[f21,f14]) ).
fof(f32,plain,
! [X0,X1] : inverse(X0) = divide(sF3(X1),X0),
inference(forward_demodulation,[],[f20,f16]) ).
fof(f33,plain,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,sF4(X2,X1)),
inference(forward_demodulation,[],[f19,f18]) ).
fof(f35,plain,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
inference(forward_demodulation,[],[f32,f14]) ).
fof(f36,plain,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(sF3(X2),X1)),
inference(forward_demodulation,[],[f33,f16]) ).
fof(f38,plain,
! [X2,X0,X1] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
inference(forward_demodulation,[],[f36,f14]) ).
fof(f40,plain,
! [X0] : inverse(X0) = divide(identity,X0),
inference(forward_demodulation,[],[f35,f31]) ).
fof(f41,plain,
sF8 = divide(identity,b1),
inference(superposition,[],[f40,f27]) ).
fof(f42,plain,
sF6 = divide(identity,a1),
inference(superposition,[],[f40,f23]) ).
fof(f45,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,divide(identity,X1)),
inference(forward_demodulation,[],[f38,f31]) ).
fof(f48,plain,
sF9 = divide(sF8,divide(identity,b1)),
inference(superposition,[],[f29,f45]) ).
fof(f49,plain,
sF7 = divide(sF6,divide(identity,a1)),
inference(superposition,[],[f25,f45]) ).
fof(f50,plain,
sF7 = divide(sF6,sF6),
inference(forward_demodulation,[],[f49,f42]) ).
fof(f51,plain,
sF9 = divide(sF8,sF8),
inference(forward_demodulation,[],[f48,f41]) ).
fof(f54,plain,
identity = sF7,
inference(forward_demodulation,[],[f50,f31]) ).
fof(f55,plain,
identity = sF9,
inference(forward_demodulation,[],[f51,f31]) ).
fof(f60,plain,
sF7 = sF9,
inference(forward_demodulation,[],[f55,f54]) ).
fof(f62,plain,
sF7 != sF7,
inference(superposition,[],[f30,f60]) ).
fof(f63,plain,
$false,
inference(trivial_inequality_removal,[],[f62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP533-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.35 % Computer : n013.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Sun Sep 27 10:06:07 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 2.58/1.36 % (4177275)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.58/1.36 % (4177352)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1148301428:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_3000 on theBenchmark for (3000ds/181Mi)
% 2.58/1.36 % (4177352)First to succeed.
% 2.58/1.36 % (4177352)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4177275"
% 2.58/1.36 % (4177351)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2194990256:i=136:bd=preordered:ins=2:av=off_3000 on theBenchmark for (3000ds/136Mi)
% 2.58/1.36 % (4177350)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=523222210:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_3000 on theBenchmark for (3000ds/130716Mi)
% 2.58/1.36 % (4177349)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=2285502098:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_3000 on theBenchmark for (3000ds/130792Mi)
% 2.58/1.36 % (4177357)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2972984648:i=1187:sd=4:av=off:ss=axioms:sgt=32_3000 on theBenchmark for (3000ds/1187Mi)
% 2.58/1.36 % (4177348)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=55737984:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_3000 on theBenchmark for (3000ds/138329Mi)
% 2.58/1.36 % (4177355)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=982030135:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_3000 on theBenchmark for (3000ds/257Mi)
% 2.58/1.36 % (4177351)Also succeeded, but the first one will report.
% 2.58/1.36 % (4177355)Also succeeded, but the first one will report.
% 2.58/1.36 % (4177357)Also succeeded, but the first one will report.
% 2.58/1.36 % (4177352)Refutation found. Thanks to Tanya!
% 2.58/1.36 % SZS status Unsatisfiable for theBenchmark
% 2.58/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/1.36 % (4177352)------------------------------
% 2.58/1.36 % (4177352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.36 % (4177352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.36 % (4177352)CaDiCaL version: 2.1.3
% 2.58/1.36 % (4177352)Termination reason: Refutation
% 2.58/1.36 % (4177352)Time elapsed: 0.002 s
% 2.58/1.36 % (4177352)Peak memory usage: 88 MB
% 2.58/1.36 % (4177352)Instructions burned: 2 (million)
% 2.58/1.36 % (4177352)------------------------------
% 2.58/1.36 % (4177352)------------------------------
% 2.58/1.36 % (4177275)Success in time 0.268 s
% 2.58/1.36 % Vampire exiting
%------------------------------------------------------------------------------