%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GRP589-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 : 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:56 AM UTC 2026
% Result : Unsatisfiable 0.41s 1.03s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 46 ( 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : double_divide(inverse(double_divide(double_divide(X0,X1),inverse(double_divide(X0,inverse(X2))))),X1) = X2,
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(X0,inverse(X2))),double_divide(X0,X1)),X1) = X2,
inference(forward_demodulation,[],[f1,f2]) ).
fof(f5,plain,
! [X2,X0,X1] : double_divide(multiply(multiply(inverse(X2),X0),double_divide(X0,X1)),X1) = X2,
inference(forward_demodulation,[],[f4,f2]) ).
fof(f7,plain,
! [X2,X3,X0,X1] : double_divide(multiply(multiply(inverse(X1),multiply(multiply(inverse(X0),X2),double_divide(X2,X3))),X0),X3) = X1,
inference(superposition,[],[f5,f5]) ).
fof(f8,plain,
! [X2,X0,X1] : inverse(X0) = multiply(X1,multiply(multiply(inverse(X0),X2),double_divide(X2,X1))),
inference(superposition,[],[f2,f5]) ).
fof(f40,plain,
! [X0,X1] : double_divide(multiply(inverse(X0),X0),inverse(X1)) = X1,
inference(superposition,[],[f7,f8]) ).
fof(f47,plain,
! [X2,X0,X1] : double_divide(X1,X0) = double_divide(multiply(inverse(X2),X2),multiply(X0,X1)),
inference(superposition,[],[f40,f2]) ).
fof(f53,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(X0),multiply(inverse(X1),X1)),
inference(superposition,[],[f2,f40]) ).
fof(f56,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(X1),inverse(multiply(inverse(X0),X0))),
inference(superposition,[],[f53,f53]) ).
fof(f60,plain,
! [X0,X1] : double_divide(inverse(multiply(inverse(X0),X0)),inverse(X1)) = X1,
inference(superposition,[],[f40,f53]) ).
fof(f158,plain,
! [X2,X3,X0,X1] : double_divide(multiply(multiply(inverse(X2),multiply(inverse(X3),X3)),double_divide(X0,X1)),multiply(X1,X0)) = X2,
inference(superposition,[],[f5,f47]) ).
fof(f168,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X2),double_divide(X0,X1)),multiply(X1,X0)) = X2,
inference(forward_demodulation,[],[f158,f53]) ).
fof(f210,plain,
! [X2,X0,X1] : double_divide(multiply(inverse(X1),double_divide(inverse(multiply(inverse(X2),X2)),inverse(X0))),inverse(X0)) = X1,
inference(superposition,[],[f168,f56]) ).
fof(f219,plain,
! [X0,X1] : double_divide(multiply(inverse(X1),X0),inverse(X0)) = X1,
inference(forward_demodulation,[],[f210,f60]) ).
fof(f235,plain,
! [X0,X1] : double_divide(inverse(X0),inverse(multiply(inverse(X1),X1))) = X0,
inference(superposition,[],[f219,f53]) ).
fof(f282,plain,
! [X0,X1] : multiply(inverse(X0),X0) = multiply(inverse(X1),X1),
inference(superposition,[],[f235,f60]) ).
fof(f332,plain,
! [X0] : multiply(inverse(a1),a1) != multiply(inverse(X0),X0),
inference(superposition,[],[f3,f282]) ).
fof(f360,plain,
$false,
inference(forward_subsumption_resolution,[],[f332,f282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP589-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sun Sep 27 10:10:26 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.41/1.03 % (2602918)Detected a unit-equality problem, will run specialized UEQ schedule.
% 0.41/1.03 % (2602995)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1512421746:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 0.41/1.03 % (2602995)First to succeed.
% 0.41/1.03 % (2602995)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2602918"
% 0.41/1.03 % (2602992)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=431579540:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 0.41/1.03 % (2602991)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=1615172755:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 0.41/1.03 % (2602989)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=3975820669:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 0.41/1.03 % (2602990)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=231929969:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 0.41/1.03 % (2602994)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=955460379:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 0.41/1.03 % (2602994)Also succeeded, but the first one will report.
% 0.41/1.03 % (2602993)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=772107340:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 0.41/1.03 % (2602992)Also succeeded, but the first one will report.
% 0.41/1.03 % (2602993)Also succeeded, but the first one will report.
% 0.41/1.03 % (2602995)Refutation found. Thanks to Tanya!
% 0.41/1.03 % SZS status Unsatisfiable for theBenchmark
% 0.41/1.03 % SZS output start Proof for theBenchmark
% See solution above
% 0.41/1.03 % (2602995)------------------------------
% 0.41/1.03 % (2602995)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.41/1.03 % (2602995)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.41/1.03 % (2602995)CaDiCaL version: 2.1.3
% 0.41/1.03 % (2602995)Termination reason: Refutation
% 0.41/1.03 % (2602995)Time elapsed: 0.006 s
% 0.41/1.03 % (2602995)Peak memory usage: 88 MB
% 0.41/1.03 % (2602995)Instructions burned: 18 (million)
% 0.41/1.03 % (2602995)------------------------------
% 0.41/1.03 % (2602995)------------------------------
% 0.41/1.03 % (2602918)Success in time 0.285 s
% 0.41/1.03 % Vampire exiting
%------------------------------------------------------------------------------