%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP496-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 : 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:14:09 AM UTC 2026
% Result : Unsatisfiable 2.71s 1.36s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 46 ( 46 unt; 10 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 62 ( 62 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : double_divide(double_divide(identity,double_divide(X0,double_divide(X1,identity))),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
! [X0] : inverse(X0) = double_divide(X0,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
fof(f4,negated_conjecture,
! [X0] : identity = double_divide(X0,inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
fof(f5,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f6,plain,
identity != multiply(inverse(a1),a1),
inference(reorient_equations,[],[f5]) ).
fof(f7,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(definition_unfolding,[],[f4,f3]) ).
fof(f8,plain,
identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
inference(definition_unfolding,[],[f6,f2,f3]) ).
fof(f9,definition,
! [X1] : sF0(X1) = double_divide(X1,identity),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f10,plain,
! [X1] : double_divide(X1,identity) = sF0(X1),
inference(reorient_equations,[],[f9]) ).
fof(f11,definition,
! [X0,X1] : sF1(X0,X1) = double_divide(X0,sF0(X1)),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f12,plain,
! [X0,X1] : double_divide(X0,sF0(X1)) = sF1(X0,X1),
inference(reorient_equations,[],[f11]) ).
fof(f13,definition,
! [X0,X1] : sF2(X0,X1) = double_divide(identity,sF1(X0,X1)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f14,plain,
! [X0,X1] : double_divide(identity,sF1(X0,X1)) = sF2(X0,X1),
inference(reorient_equations,[],[f13]) ).
fof(f15,definition,
! [X2,X0,X1] : sF3(X1,X2,X0) = double_divide(X1,double_divide(X2,X0)),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f16,plain,
! [X2,X0,X1] : double_divide(X1,double_divide(X2,X0)) = sF3(X1,X2,X0),
inference(reorient_equations,[],[f15]) ).
fof(f17,definition,
! [X2,X0,X1] : sF4(X1,X2,X0) = double_divide(sF3(X1,X2,X0),identity),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f18,plain,
! [X2,X0,X1] : double_divide(sF3(X1,X2,X0),identity) = sF4(X1,X2,X0),
inference(reorient_equations,[],[f17]) ).
fof(f19,definition,
! [X2,X0,X1] : sF5(X0,X1,X2) = double_divide(sF2(X0,X1),sF4(X1,X2,X0)),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f20,plain,
! [X2,X0,X1] : double_divide(sF2(X0,X1),sF4(X1,X2,X0)) = sF5(X0,X1,X2),
inference(reorient_equations,[],[f19]) ).
fof(f21,plain,
! [X2,X0,X1] : sF5(X0,X1,X2) = X2,
inference(definition_folding,[],[f1,f20,f18,f16,f14,f12,f10]) ).
fof(f22,definition,
! [X0] : sF6(X0) = double_divide(X0,sF0(X0)),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f23,plain,
! [X0] : double_divide(X0,sF0(X0)) = sF6(X0),
inference(reorient_equations,[],[f22]) ).
fof(f24,plain,
! [X0] : identity = sF6(X0),
inference(definition_folding,[],[f7,f23,f10]) ).
fof(f25,definition,
sF7 = double_divide(a1,identity),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f26,plain,
double_divide(a1,identity) = sF7,
inference(reorient_equations,[],[f25]) ).
fof(f27,definition,
sF8 = double_divide(a1,sF7),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f28,plain,
double_divide(a1,sF7) = sF8,
inference(reorient_equations,[],[f27]) ).
fof(f29,definition,
sF9 = double_divide(sF8,identity),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f30,plain,
double_divide(sF8,identity) = sF9,
inference(reorient_equations,[],[f29]) ).
fof(f31,plain,
identity != sF9,
inference(definition_folding,[],[f8,f30,f28,f26]) ).
fof(f32,plain,
! [X0] : identity = double_divide(X0,sF0(X0)),
inference(forward_demodulation,[],[f24,f23]) ).
fof(f33,plain,
! [X2,X0,X1] : double_divide(sF2(X0,X1),sF4(X1,X2,X0)) = X2,
inference(forward_demodulation,[],[f21,f20]) ).
fof(f34,plain,
! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
inference(forward_demodulation,[],[f32,f10]) ).
fof(f35,plain,
! [X2,X0,X1] : double_divide(sF2(X0,X1),double_divide(sF3(X1,X2,X0),identity)) = X2,
inference(forward_demodulation,[],[f33,f18]) ).
fof(f36,plain,
! [X2,X0,X1] : double_divide(sF2(X0,X1),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
inference(forward_demodulation,[],[f35,f16]) ).
fof(f37,plain,
! [X2,X0,X1] : double_divide(double_divide(identity,sF1(X0,X1)),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
inference(forward_demodulation,[],[f36,f14]) ).
fof(f38,plain,
! [X2,X0,X1] : double_divide(double_divide(identity,double_divide(X0,sF0(X1))),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
inference(forward_demodulation,[],[f37,f12]) ).
fof(f39,plain,
! [X2,X0,X1] : double_divide(double_divide(identity,double_divide(X0,double_divide(X1,identity))),double_divide(double_divide(X1,double_divide(X2,X0)),identity)) = X2,
inference(forward_demodulation,[],[f38,f10]) ).
fof(f41,plain,
identity = double_divide(a1,sF7),
inference(superposition,[],[f34,f26]) ).
fof(f42,plain,
identity = sF8,
inference(forward_demodulation,[],[f41,f28]) ).
fof(f43,plain,
sF9 = double_divide(identity,identity),
inference(superposition,[],[f30,f42]) ).
fof(f61,plain,
identity = double_divide(identity,identity),
inference(superposition,[],[f34,f39]) ).
fof(f62,plain,
identity = sF9,
inference(forward_demodulation,[],[f61,f43]) ).
fof(f70,plain,
identity != identity,
inference(superposition,[],[f31,f62]) ).
fof(f71,plain,
$false,
inference(trivial_inequality_removal,[],[f70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP496-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n010.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 10:06:18 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.71/1.36 % (723106)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.71/1.36 % (723115)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1474778262:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.71/1.36 % (723115)First to succeed.
% 2.71/1.36 % (723115)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-723106"
% 2.71/1.36 % (723113)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=3770285953:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.71/1.36 % (723112)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=2339293493:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.71/1.36 % (723116)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3720125451:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.71/1.36 % (723114)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=3524868439:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.71/1.36 % (723111)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=1962856714:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.71/1.36 % (723117)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3057817549:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.71/1.36 % (723114)Also succeeded, but the first one will report.
% 2.71/1.36 % (723117)Also succeeded, but the first one will report.
% 2.71/1.36 % (723116)Also succeeded, but the first one will report.
% 2.71/1.36 % (723115)Refutation found. Thanks to Tanya!
% 2.71/1.36 % SZS status Unsatisfiable for theBenchmark
% 2.71/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 2.71/1.36 % (723115)------------------------------
% 2.71/1.36 % (723115)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.71/1.36 % (723115)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.71/1.36 % (723115)CaDiCaL version: 2.1.3
% 2.71/1.36 % (723115)Termination reason: Refutation
% 2.71/1.36 % (723115)Time elapsed: 0.002 s
% 2.71/1.36 % (723115)Peak memory usage: 88 MB
% 2.71/1.36 % (723115)Instructions burned: 3 (million)
% 2.71/1.36 % (723115)------------------------------
% 2.71/1.36 % (723115)------------------------------
% 2.71/1.36 % (723106)Success in time 0.295 s
% 2.71/1.36 % Vampire exiting
%------------------------------------------------------------------------------