%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP605-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 : n003.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:58 AM UTC 2026
% Result : Unsatisfiable 0.17s 1.50s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(X0,inverse(double_divide(inverse(X1),double_divide(X0,X2))))),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
fof(f3,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
fof(f4,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(double_divide(inverse(X1),double_divide(X0,X2))),X0),X2) = X1,
inference(forward_demodulation,[],[f1,f2]) ).
fof(f5,plain,
! [X2,X0,X1] : double_divide(multiply(multiply(double_divide(X0,X2),inverse(X1)),X0),X2) = X1,
inference(forward_demodulation,[],[f4,f2]) ).
fof(f6,plain,
! [X2,X3,X0,X1] : double_divide(multiply(multiply(X0,inverse(X3)),multiply(multiply(double_divide(X1,X2),inverse(X0)),X1)),X2) = X3,
inference(superposition,[],[f5,f5]) ).
fof(f8,plain,
! [X2,X0,X1] : inverse(X0) = multiply(X1,multiply(multiply(double_divide(X2,X1),inverse(X0)),X2)),
inference(superposition,[],[f2,f5]) ).
fof(f34,plain,
! [X0,X1] : double_divide(inverse(X0),multiply(X0,inverse(X1))) = X1,
inference(superposition,[],[f6,f8]) ).
fof(f40,plain,
! [X2,X0,X1] : double_divide(multiply(X0,X1),multiply(double_divide(X1,X0),inverse(X2))) = X2,
inference(superposition,[],[f34,f2]) ).
fof(f47,plain,
! [X0,X1] : inverse(X0) = multiply(multiply(X1,inverse(X0)),inverse(X1)),
inference(superposition,[],[f2,f34]) ).
fof(f48,plain,
! [X2,X0,X1] : multiply(X0,X1) = multiply(multiply(X2,multiply(X0,X1)),inverse(X2)),
inference(superposition,[],[f47,f2]) ).
fof(f51,plain,
! [X0,X1] : double_divide(inverse(multiply(X1,inverse(X0))),inverse(X0)) = X1,
inference(superposition,[],[f34,f47]) ).
fof(f56,plain,
! [X0,X1] : multiply(X1,inverse(X0)) = double_divide(inverse(inverse(X0)),inverse(X1)),
inference(superposition,[],[f51,f47]) ).
fof(f160,plain,
! [X2,X0,X1] : multiply(X2,multiply(X0,X1)) = double_divide(inverse(multiply(X0,X1)),inverse(X2)),
inference(superposition,[],[f51,f48]) ).
fof(f329,plain,
! [X0,X1] : multiply(X1,multiply(X0,inverse(X1))) = X0,
inference(superposition,[],[f160,f51]) ).
fof(f345,plain,
! [X0,X1] : inverse(X0) = multiply(double_divide(inverse(X1),X1),inverse(X0)),
inference(superposition,[],[f329,f8]) ).
fof(f355,plain,
! [X2,X0] : multiply(multiply(X2,X0),inverse(X2)) = X0,
inference(superposition,[],[f48,f329]) ).
fof(f359,plain,
! [X0,X1] : multiply(X1,X0) = double_divide(inverse(X0),inverse(X1)),
inference(superposition,[],[f160,f329]) ).
fof(f639,plain,
! [X0,X1] : double_divide(multiply(X1,inverse(X1)),inverse(X0)) = X0,
inference(superposition,[],[f40,f345]) ).
fof(f644,plain,
! [X0,X1] : double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X0)) = X0,
inference(superposition,[],[f34,f345]) ).
fof(f648,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = multiply(X0,inverse(X0)),
inference(superposition,[],[f329,f345]) ).
fof(f674,plain,
! [X0,X1] : multiply(X0,double_divide(inverse(X1),X1)) = X0,
inference(forward_demodulation,[],[f644,f359]) ).
fof(f681,plain,
! [X0,X1] : multiply(X1,multiply(X0,inverse(X0))) = X1,
inference(superposition,[],[f674,f56]) ).
fof(f770,plain,
! [X2,X0,X1] : double_divide(multiply(multiply(X0,inverse(X2)),multiply(X1,inverse(X1))),inverse(X0)) = X2,
inference(superposition,[],[f5,f639]) ).
fof(f793,plain,
! [X2,X0] : double_divide(multiply(X0,inverse(X2)),inverse(X0)) = X2,
inference(forward_demodulation,[],[f770,f681]) ).
fof(f929,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(multiply(X1,inverse(X0)))) = X1,
inference(superposition,[],[f793,f47]) ).
fof(f950,plain,
! [X0,X1] : multiply(multiply(X1,inverse(X0)),X0) = X1,
inference(forward_demodulation,[],[f929,f359]) ).
fof(f1208,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f950,f355]) ).
fof(f1388,plain,
multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
inference(superposition,[],[f3,f1208]) ).
fof(f1443,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(forward_demodulation,[],[f1388,f1208]) ).
fof(f1491,plain,
! [X0] : double_divide(inverse(X0),X0) != multiply(a1,inverse(a1)),
inference(superposition,[],[f1443,f648]) ).
fof(f1492,plain,
$false,
inference(forward_subsumption_resolution,[],[f1491,f648]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP605-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.10/0.39 % Computer : n003.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sun Sep 27 10:11:41 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 0.17/1.50 % (282341)Detected a unit-equality problem, will run specialized UEQ schedule.
% 0.17/1.50 % (282346)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=2574450392:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 0.17/1.50 % (282352)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=3285370930:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 0.17/1.50 % (282347)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=1601789312:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 0.17/1.50 % (282349)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2414465586:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 0.17/1.50 % (282350)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3434497625:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 0.17/1.50 % (282348)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2976449540:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 0.17/1.50 % (282351)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=2646227969:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 0.17/1.50 % (282352)First to succeed.
% 0.17/1.50 % (282352)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-282341"
% 0.17/1.50 % (282349)Also succeeded, but the first one will report.
% 0.17/1.50 % (282350)Instruction limit reached!
% 0.17/1.50 % (282350)------------------------------
% 0.17/1.50 % (282350)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50 % (282350)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50 % (282350)CaDiCaL version: 2.1.3
% 0.17/1.50 % (282350)Termination reason: Instruction limit
% 0.17/1.50 % (282350)Termination phase: Saturation
% 0.17/1.50 % (282350)Time elapsed: 0.097 s
% 0.17/1.50 % (282350)Peak memory usage: 90 MB
% 0.17/1.50 % (282350)Instructions burned: 181 (million)
% 0.17/1.50 % (282351)Also succeeded, but the first one will report.
% 0.17/1.50 % (282360)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=879020853:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 0.17/1.50 % (282352)Refutation found. Thanks to Tanya!
% 0.17/1.50 % SZS status Unsatisfiable for theBenchmark
% 0.17/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.50 % (282352)------------------------------
% 0.17/1.50 % (282352)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.50 % (282352)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.50 % (282352)CaDiCaL version: 2.1.3
% 0.17/1.50 % (282352)Termination reason: Refutation
% 0.17/1.50 % (282352)Time elapsed: 0.040 s
% 0.17/1.50 % (282352)Peak memory usage: 88 MB
% 0.17/1.50 % (282352)Instructions burned: 66 (million)
% 0.17/1.50 % (282352)------------------------------
% 0.17/1.50 % (282352)------------------------------
% 0.17/1.50 % (282341)Success in time 0.439 s
% 0.17/1.50 % Vampire exiting
%------------------------------------------------------------------------------