%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP558-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 : n011.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:51 AM UTC 2026
% Result : Unsatisfiable 3.67s 1.51s
% Output : Refutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 40 unt; 7 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 51 ( 51 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
fof(f4,plain,
a2 != multiply(multiply(inverse(b2),b2),a2),
inference(reorient_equations,[],[f3]) ).
fof(f5,plain,
a2 != divide(divide(inverse(b2),inverse(b2)),inverse(a2)),
inference(definition_unfolding,[],[f4,f2,f2]) ).
fof(f6,definition,
! [X2,X0,X1] : sF0(X1,X2,X0) = divide(divide(X1,X2),divide(X0,X2)),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f7,plain,
! [X2,X0,X1] : divide(divide(X1,X2),divide(X0,X2)) = sF0(X1,X2,X0),
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
! [X2,X0,X1] : sF1(X1,X2,X0) = inverse(sF0(X1,X2,X0)),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f9,plain,
! [X2,X0,X1] : inverse(sF0(X1,X2,X0)) = sF1(X1,X2,X0),
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
! [X2,X0,X1] : sF2(X0,X1,X2) = divide(X0,sF1(X1,X2,X0)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f11,plain,
! [X2,X0,X1] : divide(X0,sF1(X1,X2,X0)) = sF2(X0,X1,X2),
inference(reorient_equations,[],[f10]) ).
fof(f12,plain,
! [X2,X0,X1] : sF2(X0,X1,X2) = X1,
inference(definition_folding,[],[f1,f11,f9,f7]) ).
fof(f13,definition,
sF3 = inverse(b2),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f14,plain,
inverse(b2) = sF3,
inference(reorient_equations,[],[f13]) ).
fof(f15,definition,
sF4 = divide(sF3,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f16,plain,
divide(sF3,sF3) = sF4,
inference(reorient_equations,[],[f15]) ).
fof(f17,definition,
sF5 = inverse(a2),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f18,plain,
inverse(a2) = sF5,
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
sF6 = divide(sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f20,plain,
divide(sF4,sF5) = sF6,
inference(reorient_equations,[],[f19]) ).
fof(f21,plain,
a2 != sF6,
inference(definition_folding,[],[f5,f20,f18,f16,f14,f14]) ).
fof(f22,plain,
! [X2,X0,X1] : divide(X0,sF1(X1,X2,X0)) = X1,
inference(forward_demodulation,[],[f12,f11]) ).
fof(f23,plain,
! [X2,X0,X1] : divide(X0,inverse(sF0(X1,X2,X0))) = X1,
inference(forward_demodulation,[],[f22,f9]) ).
fof(f24,plain,
! [X2,X0,X1] : divide(X0,inverse(divide(divide(X1,X2),divide(X0,X2)))) = X1,
inference(forward_demodulation,[],[f23,f7]) ).
fof(f25,plain,
! [X0] : sF4 = divide(X0,inverse(divide(sF6,divide(X0,sF5)))),
inference(superposition,[],[f24,f20]) ).
fof(f27,plain,
! [X2,X3,X0,X1] : divide(X1,inverse(divide(X0,divide(X1,inverse(divide(divide(X0,X3),divide(X2,X3))))))) = X2,
inference(superposition,[],[f24,f24]) ).
fof(f31,plain,
sF4 = divide(sF4,inverse(divide(sF6,sF6))),
inference(superposition,[],[f25,f20]) ).
fof(f35,plain,
! [X0] : sF4 = divide(X0,inverse(divide(sF4,divide(X0,inverse(divide(sF6,sF6)))))),
inference(superposition,[],[f24,f31]) ).
fof(f108,plain,
! [X0,X1] : divide(X1,inverse(divide(X0,X0))) = X1,
inference(superposition,[],[f27,f24]) ).
fof(f111,plain,
! [X0] : divide(X0,inverse(sF4)) = X0,
inference(superposition,[],[f108,f16]) ).
fof(f113,plain,
! [X0,X1] : divide(X0,inverse(divide(X1,X0))) = X1,
inference(superposition,[],[f27,f108]) ).
fof(f156,plain,
! [X0] : divide(inverse(divide(sF4,divide(X0,inverse(divide(sF6,sF6))))),inverse(sF4)) = X0,
inference(superposition,[],[f113,f35]) ).
fof(f177,plain,
! [X0] : inverse(divide(sF4,divide(X0,inverse(divide(sF6,sF6))))) = X0,
inference(forward_demodulation,[],[f156,f111]) ).
fof(f182,plain,
! [X0] : inverse(divide(sF4,X0)) = X0,
inference(forward_demodulation,[],[f177,f108]) ).
fof(f210,plain,
! [X0] : divide(X0,sF4) = X0,
inference(superposition,[],[f108,f182]) ).
fof(f230,plain,
! [X0] : divide(sF4,inverse(X0)) = X0,
inference(superposition,[],[f113,f210]) ).
fof(f410,plain,
a2 = divide(sF4,sF5),
inference(superposition,[],[f230,f18]) ).
fof(f471,plain,
a2 = sF6,
inference(forward_demodulation,[],[f410,f20]) ).
fof(f476,plain,
a2 != a2,
inference(superposition,[],[f21,f471]) ).
fof(f484,plain,
$false,
inference(trivial_inequality_removal,[],[f476]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP558-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 % Computer : n011.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Sun Sep 27 10:07:45 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.45 Running first-order theorem proving
% 0.13/0.45 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.67/1.51 % (2177988)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.67/1.51 % (2178126)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=3137073790:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.67/1.51 % (2178125)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=3956286063:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.67/1.51 % (2178128)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=947844790:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.67/1.51 % (2178127)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1742924405:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.67/1.51 % (2178130)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2058054453:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.67/1.51 % (2178129)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=742647055:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.67/1.51 % (2178129)First to succeed.
% 3.67/1.51 % (2178129)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2177988"
% 3.67/1.51 % (2178130)Also succeeded, but the first one will report.
% 3.67/1.51 % (2178128)Also succeeded, but the first one will report.
% 3.67/1.51 % (2178131)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3246514330:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.67/1.51 % (2178131)Also succeeded, but the first one will report.
% 3.67/1.51 % (2178129)Refutation found. Thanks to Tanya!
% 3.67/1.51 % SZS status Unsatisfiable for theBenchmark
% 3.67/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.51 % (2178129)------------------------------
% 3.67/1.51 % (2178129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.51 % (2178129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.51 % (2178129)CaDiCaL version: 2.1.3
% 3.67/1.51 % (2178129)Termination reason: Refutation
% 3.67/1.51 % (2178129)Time elapsed: 0.014 s
% 3.67/1.51 % (2178129)Peak memory usage: 88 MB
% 3.67/1.51 % (2178129)Instructions burned: 22 (million)
% 3.67/1.51 % (2178129)------------------------------
% 3.67/1.51 % (2178129)------------------------------
% 3.67/1.51 % (2177988)Success in time 0.438 s
% 3.67/1.51 % Vampire exiting
%------------------------------------------------------------------------------