%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP593-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 : n012.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:56 AM UTC 2026
% Result : Unsatisfiable 2.16s 0.91s
% Output : Refutation 2.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 14
% Syntax : Number of formulae : 56 ( 56 unt; 11 def)
% Number of atoms : 56 ( 55 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; 8 con; 0-3 aty)
% Number of variables : 68 ( 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(definition_unfolding,[],[f3,f2,f2]) ).
fof(f5,definition,
! [X2,X1] : sF0(X2,X1) = inverse(double_divide(X2,X1)),
introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).
fof(f6,plain,
! [X2,X1] : inverse(double_divide(X2,X1)) = sF0(X2,X1),
inference(reorient_equations,[],[f5]) ).
fof(f7,definition,
! [X2,X0,X1] : sF1(X0,X2,X1) = double_divide(X0,sF0(X2,X1)),
introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).
fof(f8,plain,
! [X2,X0,X1] : double_divide(X0,sF0(X2,X1)) = sF1(X0,X2,X1),
inference(reorient_equations,[],[f7]) ).
fof(f9,definition,
! [X2,X0,X1] : sF2(X0,X2,X1) = inverse(sF1(X0,X2,X1)),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
fof(f10,plain,
! [X2,X0,X1] : inverse(sF1(X0,X2,X1)) = sF2(X0,X2,X1),
inference(reorient_equations,[],[f9]) ).
fof(f11,definition,
! [X2,X0,X1] : sF3(X0,X1,X2) = double_divide(double_divide(X0,X1),sF2(X0,X2,X1)),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
fof(f12,plain,
! [X2,X0,X1] : double_divide(double_divide(X0,X1),sF2(X0,X2,X1)) = sF3(X0,X1,X2),
inference(reorient_equations,[],[f11]) ).
fof(f13,definition,
! [X2,X0,X1] : sF4(X0,X1,X2) = inverse(sF3(X0,X1,X2)),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
fof(f14,plain,
! [X2,X0,X1] : inverse(sF3(X0,X1,X2)) = sF4(X0,X1,X2),
inference(reorient_equations,[],[f13]) ).
fof(f15,plain,
! [X2,X0,X1] : sF4(X0,X1,X2) = X2,
inference(definition_folding,[],[f1,f14,f12,f10,f8,f6]) ).
fof(f16,definition,
sF5 = inverse(a1),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
fof(f17,plain,
inverse(a1) = sF5,
inference(reorient_equations,[],[f16]) ).
fof(f18,definition,
sF6 = double_divide(a1,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
fof(f19,plain,
double_divide(a1,sF5) = sF6,
inference(reorient_equations,[],[f18]) ).
fof(f20,definition,
sF7 = inverse(sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
fof(f21,plain,
inverse(sF6) = sF7,
inference(reorient_equations,[],[f20]) ).
fof(f22,definition,
sF8 = inverse(b1),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
fof(f23,plain,
inverse(b1) = sF8,
inference(reorient_equations,[],[f22]) ).
fof(f24,definition,
sF9 = double_divide(b1,sF8),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
fof(f25,plain,
double_divide(b1,sF8) = sF9,
inference(reorient_equations,[],[f24]) ).
fof(f26,definition,
sF10 = inverse(sF9),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
fof(f27,plain,
inverse(sF9) = sF10,
inference(reorient_equations,[],[f26]) ).
fof(f28,plain,
sF7 != sF10,
inference(definition_folding,[],[f4,f27,f25,f23,f21,f19,f17]) ).
fof(f29,plain,
! [X2,X0,X1] : inverse(sF3(X0,X1,X2)) = X2,
inference(forward_demodulation,[],[f15,f14]) ).
fof(f30,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),sF2(X0,X2,X1))) = X2,
inference(forward_demodulation,[],[f29,f12]) ).
fof(f31,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(sF1(X0,X2,X1)))) = X2,
inference(forward_demodulation,[],[f30,f10]) ).
fof(f32,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,sF0(X2,X1))))) = X2,
inference(forward_demodulation,[],[f31,f8]) ).
fof(f33,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(double_divide(X2,X1)))))) = X2,
inference(forward_demodulation,[],[f32,f6]) ).
fof(f37,plain,
! [X0] : a1 = inverse(double_divide(double_divide(X0,sF5),inverse(double_divide(X0,inverse(sF6))))),
inference(superposition,[],[f33,f19]) ).
fof(f38,plain,
! [X2,X3,X0,X1] : double_divide(X2,X3) = inverse(double_divide(double_divide(X1,inverse(double_divide(X2,inverse(double_divide(X0,X3))))),inverse(double_divide(X1,X0)))),
inference(superposition,[],[f33,f33]) ).
fof(f39,plain,
! [X2,X0,X1] : inverse(double_divide(double_divide(double_divide(X1,X2),inverse(double_divide(X0,X2))),X0)) = X1,
inference(superposition,[],[f33,f33]) ).
fof(f40,plain,
! [X0] : a1 = inverse(double_divide(double_divide(X0,sF5),inverse(double_divide(X0,sF7)))),
inference(forward_demodulation,[],[f37,f21]) ).
fof(f42,plain,
a1 = inverse(double_divide(sF6,inverse(double_divide(a1,sF7)))),
inference(superposition,[],[f40,f19]) ).
fof(f45,plain,
a1 = inverse(double_divide(double_divide(sF6,sF7),a1)),
inference(superposition,[],[f33,f42]) ).
fof(f138,plain,
! [X0] : double_divide(sF6,sF7) = inverse(double_divide(double_divide(X0,a1),inverse(double_divide(X0,a1)))),
inference(superposition,[],[f38,f42]) ).
fof(f163,plain,
! [X2,X0,X1] : double_divide(inverse(double_divide(double_divide(X0,inverse(double_divide(X1,X2))),X1)),X2) = X0,
inference(superposition,[],[f38,f39]) ).
fof(f331,plain,
! [X0] : double_divide(sF6,sF7) = inverse(double_divide(X0,inverse(X0))),
inference(superposition,[],[f138,f163]) ).
fof(f382,plain,
! [X0] : a1 = inverse(double_divide(inverse(double_divide(X0,inverse(X0))),a1)),
inference(superposition,[],[f45,f331]) ).
fof(f448,plain,
a1 = inverse(double_divide(inverse(double_divide(a1,sF5)),a1)),
inference(superposition,[],[f382,f17]) ).
fof(f449,plain,
a1 = inverse(double_divide(inverse(double_divide(b1,sF8)),a1)),
inference(superposition,[],[f382,f23]) ).
fof(f462,plain,
a1 = inverse(double_divide(inverse(sF9),a1)),
inference(forward_demodulation,[],[f449,f25]) ).
fof(f463,plain,
a1 = inverse(double_divide(inverse(sF6),a1)),
inference(forward_demodulation,[],[f448,f19]) ).
fof(f464,plain,
a1 = inverse(double_divide(sF10,a1)),
inference(forward_demodulation,[],[f462,f27]) ).
fof(f465,plain,
a1 = inverse(double_divide(sF7,a1)),
inference(forward_demodulation,[],[f463,f21]) ).
fof(f470,plain,
! [X0] : sF10 = inverse(double_divide(double_divide(X0,a1),inverse(double_divide(X0,a1)))),
inference(superposition,[],[f33,f464]) ).
fof(f473,plain,
sF10 = double_divide(sF6,sF7),
inference(forward_demodulation,[],[f470,f331]) ).
fof(f498,plain,
! [X0] : sF7 = inverse(double_divide(double_divide(X0,a1),inverse(double_divide(X0,a1)))),
inference(superposition,[],[f33,f465]) ).
fof(f502,plain,
sF7 = double_divide(sF6,sF7),
inference(forward_demodulation,[],[f498,f331]) ).
fof(f503,plain,
sF7 = sF10,
inference(forward_demodulation,[],[f502,f473]) ).
fof(f504,plain,
sF7 != sF7,
inference(superposition,[],[f28,f503]) ).
fof(f518,plain,
$false,
inference(trivial_inequality_removal,[],[f504]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP593-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.05/0.31 % Computer : n012.cluster.edu
% 0.05/0.31 % Model : x86_64 x86_64
% 0.05/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.31 % Memory : 8046.5625MB
% 0.05/0.31 % OS : Linux 6.8.0-71-generic
% 0.05/0.31 % CPULimit : 300
% 0.05/0.31 % WCLimit : 300
% 0.05/0.31 % DateTime : Sun Sep 27 10:07:35 UTC 2026
% 0.05/0.31 % CPUTime :
% 0.05/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.16/0.91 % (2147285)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.16/0.91 % (2147354)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=31831807:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.16/0.91 % (2147348)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=3767400399:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.16/0.91 % (2147351)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=1283417046:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.16/0.91 % (2147350)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1298979292:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.16/0.91 % (2147347)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=2766682276:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.16/0.91 % (2147353)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=97998973:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.16/0.91 % (2147355)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2344865801:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.16/0.91 % (2147353)First to succeed.
% 2.16/0.91 % (2147353)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2147285"
% 2.16/0.91 % (2147351)Instruction limit reached!
% 2.16/0.91 % (2147351)------------------------------
% 2.16/0.91 % (2147351)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.16/0.91 % (2147351)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.16/0.91 % (2147351)CaDiCaL version: 2.1.3
% 2.16/0.91 % (2147351)Termination reason: Instruction limit
% 2.16/0.91 % (2147351)Termination phase: Saturation
% 2.16/0.91 % (2147351)Time elapsed: 0.044 s
% 2.16/0.91 % (2147351)Peak memory usage: 89 MB
% 2.16/0.91 % (2147351)Instructions burned: 138 (million)
% 2.16/0.91 % (2147355)Also succeeded, but the first one will report.
% 2.16/0.91 % (2147354)Instruction limit reached!
% 2.16/0.91 % (2147354)------------------------------
% 2.16/0.91 % (2147354)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.16/0.91 % (2147354)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.16/0.91 % (2147354)CaDiCaL version: 2.1.3
% 2.16/0.91 % (2147354)Termination reason: Instruction limit
% 2.16/0.91 % (2147354)Termination phase: Saturation
% 2.16/0.91 % (2147354)Time elapsed: 0.095 s
% 2.16/0.91 % (2147354)Peak memory usage: 91 MB
% 2.16/0.91 % (2147354)Instructions burned: 259 (million)
% 2.16/0.91 % (2147411)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=3389360615:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2998 on theBenchmark for (2998ds/2051Mi)
% 2.16/0.91 % (2147353)Refutation found. Thanks to Tanya!
% 2.16/0.91 % SZS status Unsatisfiable for theBenchmark
% 2.16/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 2.16/0.91 % (2147353)------------------------------
% 2.16/0.91 % (2147353)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.16/0.91 % (2147353)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.16/0.91 % (2147353)CaDiCaL version: 2.1.3
% 2.16/0.91 % (2147353)Termination reason: Refutation
% 2.16/0.91 % (2147353)Time elapsed: 0.011 s
% 2.16/0.91 % (2147353)Peak memory usage: 88 MB
% 2.16/0.91 % (2147353)Instructions burned: 34 (million)
% 2.16/0.91 % (2147353)------------------------------
% 2.16/0.91 % (2147353)------------------------------
% 2.16/0.91 % (2147285)Success in time 0.287 s
% 2.16/0.91 % Vampire exiting
%------------------------------------------------------------------------------