%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP613-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 : n026.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:59 AM UTC 2026
% Result : Unsatisfiable 4.11s 1.48s
% Output : Refutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 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 : 8 ( 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 : 78 ( 78 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(inverse(double_divide(X0,inverse(X1))),X2)),double_divide(X0,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,axiom,
! [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,
! [X2,X0,X1] : double_divide(multiply(X2,inverse(double_divide(X0,inverse(X1)))),double_divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f1,f2]) ).
fof(f5,plain,
! [X2,X0,X1] : double_divide(multiply(X2,multiply(inverse(X1),X0)),double_divide(X0,X2)) = X1,
inference(forward_demodulation,[],[f4,f2]) ).
fof(f7,plain,
! [X2,X3,X0,X1] : double_divide(multiply(double_divide(X1,X2),multiply(inverse(X3),multiply(X2,multiply(inverse(X0),X1)))),X0) = X3,
inference(superposition,[],[f5,f5]) ).
fof(f8,plain,
! [X2,X0,X1] : inverse(X0) = multiply(double_divide(X1,X2),multiply(X2,multiply(inverse(X0),X1))),
inference(superposition,[],[f2,f5]) ).
fof(f9,plain,
! [X2,X3,X0,X1] : inverse(X1) = multiply(X0,multiply(double_divide(X3,X2),multiply(inverse(X1),multiply(X2,multiply(inverse(X0),X3))))),
inference(superposition,[],[f8,f5]) ).
fof(f12,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(multiply(inverse(X0),X1),double_divide(X1,inverse(X2)))) = X2,
inference(superposition,[],[f5,f8]) ).
fof(f109,plain,
! [X2,X3,X0,X1] : inverse(X1) = multiply(X0,multiply(double_divide(multiply(X2,multiply(inverse(inverse(X1)),X3)),double_divide(X3,X2)),inverse(X0))),
inference(superposition,[],[f9,f9]) ).
fof(f115,plain,
! [X2,X3,X0,X1] : double_divide(multiply(double_divide(multiply(X1,multiply(inverse(inverse(X2)),X3)),double_divide(X3,X1)),inverse(X0)),X0) = X2,
inference(superposition,[],[f7,f9]) ).
fof(f126,plain,
! [X2,X0] : double_divide(multiply(inverse(X2),inverse(X0)),X0) = X2,
inference(forward_demodulation,[],[f115,f5]) ).
fof(f129,plain,
! [X0,X1] : inverse(X1) = multiply(X0,multiply(inverse(X1),inverse(X0))),
inference(forward_demodulation,[],[f109,f5]) ).
fof(f131,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X2),multiply(X0,X1)),double_divide(X1,X0)) = X2,
inference(superposition,[],[f126,f2]) ).
fof(f149,plain,
! [X0,X1] : double_divide(inverse(X0),double_divide(inverse(X1),X1)) = X0,
inference(superposition,[],[f5,f129]) ).
fof(f168,plain,
! [X2,X0,X1] : double_divide(X1,X0) = double_divide(multiply(X0,X1),double_divide(inverse(X2),X2)),
inference(superposition,[],[f149,f2]) ).
fof(f225,plain,
! [X0,X1] : double_divide(inverse(X0),double_divide(inverse(inverse(X1)),inverse(X0))) = X1,
inference(superposition,[],[f131,f129]) ).
fof(f313,plain,
! [X0,X1] : double_divide(multiply(X1,inverse(X1)),inverse(X0)) = X0,
inference(superposition,[],[f168,f131]) ).
fof(f357,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(X0),multiply(X1,inverse(X1))),
inference(superposition,[],[f2,f313]) ).
fof(f404,plain,
! [X2,X0,X1] : double_divide(inverse(X0),double_divide(inverse(X0),double_divide(multiply(X1,inverse(X1)),inverse(X2)))) = X2,
inference(superposition,[],[f12,f357]) ).
fof(f429,plain,
! [X2,X0] : double_divide(inverse(X0),double_divide(inverse(X0),X2)) = X2,
inference(forward_demodulation,[],[f404,f313]) ).
fof(f435,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(inverse(X0),X0),
inference(superposition,[],[f429,f149]) ).
fof(f437,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f429,f225]) ).
fof(f478,plain,
! [X0,X1] : double_divide(X0,double_divide(inverse(inverse(X1)),X0)) = X1,
inference(superposition,[],[f225,f437]) ).
fof(f483,plain,
! [X0,X1] : double_divide(X0,double_divide(X0,X1)) = X1,
inference(superposition,[],[f429,f437]) ).
fof(f484,plain,
! [X0,X1] : double_divide(X0,double_divide(X1,X0)) = X1,
inference(forward_demodulation,[],[f478,f437]) ).
fof(f538,plain,
! [X0,X1] : double_divide(X1,X0) = double_divide(X0,X1),
inference(superposition,[],[f483,f484]) ).
fof(f723,plain,
! [X0,X1] : multiply(X0,X1) = inverse(double_divide(X0,X1)),
inference(superposition,[],[f2,f538]) ).
fof(f1714,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
inference(superposition,[],[f723,f2]) ).
fof(f1882,plain,
multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
inference(superposition,[],[f3,f1714]) ).
fof(f1930,plain,
multiply(b1,inverse(b1)) != multiply(a1,inverse(a1)),
inference(forward_demodulation,[],[f1882,f1714]) ).
fof(f3073,plain,
! [X0,X1] : double_divide(inverse(X1),X1) = double_divide(X0,inverse(X0)),
inference(forward_demodulation,[],[f435,f538]) ).
fof(f3074,plain,
! [X0,X1] : double_divide(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(forward_demodulation,[],[f3073,f538]) ).
fof(f3358,plain,
! [X0,X1] : multiply(X0,inverse(X0)) = double_divide(X1,inverse(X1)),
inference(superposition,[],[f3074,f313]) ).
fof(f4592,plain,
! [X0] : double_divide(X0,inverse(X0)) != multiply(a1,inverse(a1)),
inference(superposition,[],[f1930,f3358]) ).
fof(f4659,plain,
$false,
inference(forward_subsumption_resolution,[],[f4592,f3358]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP613-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.15/0.40 % Computer : n026.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.40 % CPULimit : 300
% 0.15/0.40 % WCLimit : 300
% 0.15/0.40 % DateTime : Sun Sep 27 10:12:27 UTC 2026
% 0.15/0.40 % CPUTime :
% 0.15/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 4.11/1.48 % (2606686)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.11/1.48 % (2606750)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2231232289:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_3000 on theBenchmark for (3000ds/130716Mi)
% 4.11/1.48 % (2606749)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=899545636:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_3000 on theBenchmark for (3000ds/130792Mi)
% 4.11/1.48 % (2606751)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=4036925750:i=136:bd=preordered:ins=2:av=off_3000 on theBenchmark for (3000ds/136Mi)
% 4.11/1.48 % (2606752)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1176162140:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_3000 on theBenchmark for (3000ds/181Mi)
% 4.11/1.48 % (2606748)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=1514192227:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_3000 on theBenchmark for (3000ds/138329Mi)
% 4.11/1.48 % (2606753)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=3223785702:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_3000 on theBenchmark for (3000ds/257Mi)
% 4.11/1.48 % (2606754)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1547827070:i=1187:sd=4:av=off:ss=axioms:sgt=32_3000 on theBenchmark for (3000ds/1187Mi)
% 4.11/1.48 % (2606751)Instruction limit reached!
% 4.11/1.48 % (2606751)------------------------------
% 4.11/1.48 % (2606751)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.11/1.48 % (2606751)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.48 % (2606751)CaDiCaL version: 2.1.3
% 4.11/1.48 % (2606751)Termination reason: Instruction limit
% 4.11/1.48 % (2606751)Termination phase: Saturation
% 4.11/1.48 % (2606751)Time elapsed: 0.079 s
% 4.11/1.48 % (2606751)Peak memory usage: 88 MB
% 4.11/1.48 % (2606751)Instructions burned: 137 (million)
% 4.11/1.48 % (2606752)Instruction limit reached!
% 4.11/1.48 % (2606752)------------------------------
% 4.11/1.48 % (2606752)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.11/1.48 % (2606752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.48 % (2606752)CaDiCaL version: 2.1.3
% 4.11/1.48 % (2606752)Termination reason: Instruction limit
% 4.11/1.48 % (2606752)Termination phase: Saturation
% 4.11/1.48 % (2606752)Time elapsed: 0.093 s
% 4.11/1.48 % (2606752)Peak memory usage: 89 MB
% 4.11/1.48 % (2606752)Instructions burned: 183 (million)
% 4.11/1.48 % (2606754)First to succeed.
% 4.11/1.48 % (2606754)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2606686"
% 4.11/1.48 % (2606753)Also succeeded, but the first one will report.
% 4.11/1.48 % (2606762)lrs-1011_1_ncem=casc2026/models/loop8.pt:sil=32000:npcc=on:prc=on:fde=unused:lcm=predicate:bsr=on:flr=on:random_seed=902668272:i=2051:gtgl=2:fgj=on:bd=all:gtg=exists_top_2997 on theBenchmark for (2997ds/2051Mi)
% 4.11/1.48 % (2606763)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3048008801:i=4948:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/4948Mi)
% 4.11/1.48 % (2606750)Also succeeded, but the first one will report.
% 4.11/1.48 % (2606754)Refutation found. Thanks to Tanya!
% 4.11/1.48 % SZS status Unsatisfiable for theBenchmark
% 4.11/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 4.11/1.48 % (2606754)------------------------------
% 4.11/1.48 % (2606754)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.11/1.48 % (2606754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.11/1.48 % (2606754)CaDiCaL version: 2.1.3
% 4.11/1.48 % (2606754)Termination reason: Refutation
% 4.11/1.48 % (2606754)Time elapsed: 0.099 s
% 4.11/1.48 % (2606754)Peak memory usage: 90 MB
% 4.11/1.48 % (2606754)Instructions burned: 172 (million)
% 4.11/1.48 % (2606754)------------------------------
% 4.11/1.48 % (2606754)------------------------------
% 4.11/1.48 % (2606686)Success in time 0.504 s
% 4.11/1.48 % Vampire exiting
%------------------------------------------------------------------------------