%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP563-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:52 AM UTC 2026
% Result : Unsatisfiable 3.87s 1.43s
% Output : Refutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 50 ( 50 unt; 10 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 16 ( 16 usr; 10 con; 0-3 aty)
% Number of variables : 60 ( 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,plain,
! [X0,X1] : divide(X0,inverse(X1)) = multiply(X0,X1),
inference(reorient_equations,[],[f2]) ).
fof(f4,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
fof(f5,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(definition_unfolding,[],[f4,f3,f3,f3,f3]) ).
fof(f6,definition,
! [X0,X1] : sF0(X0,X1) = divide(X0,inverse(X1)),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f7,plain,
! [X0,X1] : divide(X0,inverse(X1)) = sF0(X0,X1),
inference(reorient_equations,[],[f6]) ).
fof(f8,definition,
! [X2,X0,X1] : sF1(X0,X1,X2) = divide(sF0(X0,X1),X2),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f9,plain,
! [X2,X0,X1] : divide(sF0(X0,X1),X2) = sF1(X0,X1,X2),
inference(reorient_equations,[],[f8]) ).
fof(f10,definition,
! [X2,X0,X1] : sF2(X0,X1,X2) = divide(sF1(X0,X1,X2),divide(X0,X2)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f11,plain,
! [X2,X0,X1] : divide(sF1(X0,X1,X2),divide(X0,X2)) = 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(b3),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f14,plain,
inverse(b3) = sF3,
inference(reorient_equations,[],[f13]) ).
fof(f15,definition,
sF4 = divide(a3,sF3),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f16,plain,
divide(a3,sF3) = sF4,
inference(reorient_equations,[],[f15]) ).
fof(f17,definition,
sF5 = inverse(c3),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f18,plain,
inverse(c3) = 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,definition,
sF7 = divide(b3,sF5),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f22,plain,
divide(b3,sF5) = sF7,
inference(reorient_equations,[],[f21]) ).
fof(f23,definition,
sF8 = inverse(sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f24,plain,
inverse(sF7) = sF8,
inference(reorient_equations,[],[f23]) ).
fof(f25,definition,
sF9 = divide(a3,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f26,plain,
divide(a3,sF8) = sF9,
inference(reorient_equations,[],[f25]) ).
fof(f27,plain,
sF6 != sF9,
inference(definition_folding,[],[f5,f26,f24,f22,f18,f20,f18,f16,f14]) ).
fof(f28,plain,
! [X2,X0,X1] : divide(sF1(X0,X1,X2),divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f12,f11]) ).
fof(f29,plain,
! [X2,X0,X1] : divide(divide(sF0(X0,X1),X2),divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f28,f9]) ).
fof(f30,plain,
! [X2,X0,X1] : divide(divide(divide(X0,inverse(X1)),X2),divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f29,f7]) ).
fof(f31,plain,
! [X0,X1] : sF7 = divide(divide(divide(X0,sF8),X1),divide(X0,X1)),
inference(superposition,[],[f30,f24]) ).
fof(f34,plain,
! [X2,X0,X1] : divide(X0,divide(divide(X1,inverse(X0)),divide(X1,inverse(X2)))) = X2,
inference(superposition,[],[f30,f30]) ).
fof(f35,plain,
! [X2,X3,X0,X1] : divide(divide(divide(divide(divide(X1,inverse(X0)),X2),inverse(X3)),divide(X1,X2)),X0) = X3,
inference(superposition,[],[f30,f30]) ).
fof(f36,plain,
! [X0] : divide(divide(divide(a3,inverse(X0)),sF8),sF9) = X0,
inference(superposition,[],[f30,f26]) ).
fof(f42,plain,
b3 = divide(divide(divide(a3,sF3),sF8),sF9),
inference(superposition,[],[f36,f14]) ).
fof(f44,plain,
b3 = divide(divide(sF4,sF8),sF9),
inference(forward_demodulation,[],[f42,f16]) ).
fof(f77,plain,
sF7 = divide(b3,divide(sF4,sF9)),
inference(superposition,[],[f31,f44]) ).
fof(f498,plain,
! [X2,X3,X0,X1] : divide(divide(X0,divide(divide(divide(X1,inverse(inverse(X2))),X3),divide(X1,X3))),X0) = X2,
inference(superposition,[],[f35,f35]) ).
fof(f568,plain,
! [X2,X0] : divide(divide(X0,inverse(X2)),X0) = X2,
inference(forward_demodulation,[],[f498,f30]) ).
fof(f575,plain,
! [X0,X1] : divide(X0,divide(X1,X1)) = X0,
inference(superposition,[],[f30,f568]) ).
fof(f676,plain,
! [X0,X1] : divide(divide(X1,X1),inverse(X0)) = X0,
inference(superposition,[],[f575,f568]) ).
fof(f1010,plain,
! [X2,X0,X1] : divide(X0,divide(X0,divide(divide(X1,X1),inverse(X2)))) = X2,
inference(superposition,[],[f34,f676]) ).
fof(f1022,plain,
! [X2,X0] : divide(X0,divide(X0,X2)) = X2,
inference(forward_demodulation,[],[f1010,f676]) ).
fof(f1069,plain,
sF5 = divide(b3,sF7),
inference(superposition,[],[f1022,f22]) ).
fof(f1074,plain,
divide(sF4,sF9) = divide(b3,sF7),
inference(superposition,[],[f1022,f77]) ).
fof(f1739,plain,
sF5 = divide(sF4,sF9),
inference(forward_demodulation,[],[f1074,f1069]) ).
fof(f1744,plain,
divide(sF4,sF5) = sF9,
inference(superposition,[],[f1022,f1739]) ).
fof(f1752,plain,
sF6 = sF9,
inference(forward_demodulation,[],[f1744,f20]) ).
fof(f1754,plain,
sF6 != sF6,
inference(superposition,[],[f27,f1752]) ).
fof(f1776,plain,
$false,
inference(trivial_inequality_removal,[],[f1754]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP563-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n018.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 10:09:38 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.42 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
% 3.87/1.43 % (2103768)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.87/1.43 % (2103810)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=2337041733:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.87/1.43 % (2103813)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=302954937:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.87/1.43 % (2103816)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=962015171:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.87/1.43 % (2103815)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=248477918:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.87/1.43 % (2103814)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=4195017306:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.87/1.43 % (2103811)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=3222172848:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.87/1.43 % (2103812)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3989245712:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.87/1.43 % (2103814)First to succeed.
% 3.87/1.43 % (2103814)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2103768"
% 3.87/1.43 % (2103813)Instruction limit reached!
% 3.87/1.43 % (2103813)------------------------------
% 3.87/1.43 % (2103813)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.87/1.43 % (2103813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.87/1.43 % (2103813)CaDiCaL version: 2.1.3
% 3.87/1.43 % (2103813)Termination reason: Instruction limit
% 3.87/1.43 % (2103813)Termination phase: Saturation
% 3.87/1.43 % (2103813)Time elapsed: 0.084 s
% 3.87/1.43 % (2103813)Peak memory usage: 88 MB
% 3.87/1.43 % (2103813)Instructions burned: 136 (million)
% 3.87/1.43 % (2103815)Also succeeded, but the first one will report.
% 3.87/1.43 % (2103867)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=2406674787:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 3.87/1.43 % (2103814)Refutation found. Thanks to Tanya!
% 3.87/1.43 % SZS status Unsatisfiable for theBenchmark
% 3.87/1.43 % SZS output start Proof for theBenchmark
% See solution above
% 3.87/1.43 % (2103814)------------------------------
% 3.87/1.43 % (2103814)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.87/1.43 % (2103814)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.87/1.43 % (2103814)CaDiCaL version: 2.1.3
% 3.87/1.43 % (2103814)Termination reason: Refutation
% 3.87/1.43 % (2103814)Time elapsed: 0.048 s
% 3.87/1.43 % (2103814)Peak memory usage: 89 MB
% 3.87/1.43 % (2103814)Instructions burned: 81 (million)
% 3.87/1.43 % (2103814)------------------------------
% 3.87/1.43 % (2103814)------------------------------
% 3.87/1.43 % (2103768)Success in time 0.472 s
% 3.87/1.43 % Vampire exiting
%------------------------------------------------------------------------------