%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : BOO068-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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 09:36:17 AM UTC 2026
% Result : Unsatisfiable 0.19s 0.31s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 103 ( 103 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X6,X4,X5] : multiply(multiply(X0,inverse(X0),X1),inverse(multiply(multiply(X2,X3,X4),X5,multiply(X2,X3,X6))),multiply(X3,multiply(X6,X5,X4),X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
fof(f2,negated_conjecture,
multiply(b,a,a) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_tba_axioms_2) ).
fof(f3,plain,
a != multiply(b,a,a),
inference(reorient_equations,[],[f2]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : multiply(X1,multiply(X2,inverse(multiply(X0,X1,X3)),X3),X0) = multiply(multiply(X0,X1,X2),inverse(multiply(multiply(X4,X5,X6),X7,multiply(X4,X5,X8))),multiply(X5,multiply(X8,X7,X6),X4)),
inference(superposition,[],[f1,f1]) ).
fof(f27,plain,
! [X2,X0,X1] : multiply(inverse(X1),multiply(X0,inverse(multiply(X1,inverse(X1),X2)),X2),X1) = X0,
inference(superposition,[],[f4,f1]) ).
fof(f43,plain,
! [X2,X3,X0,X1,X6,X4,X5] : multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(multiply(X3,X1,X2),inverse(multiply(multiply(X5,inverse(X5),X6),inverse(multiply(X5,inverse(X5),X6)),multiply(X5,inverse(X5),X0))),X0),
inference(superposition,[],[f4,f27]) ).
fof(f44,plain,
! [X2,X3,X0,X1,X4] : multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,inverse(X3),X4),inverse(multiply(X3,inverse(X3),X4)),multiply(X3,inverse(X3),X0))),X0) = X2,
inference(superposition,[],[f1,f27]) ).
fof(f48,plain,
! [X2,X3,X0,X1,X6,X4,X5] : multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),multiply(X0,inverse(multiply(X5,inverse(X5),X6)),X6),multiply(X3,X4,inverse(X5)))),multiply(X4,X0,X3)) = X2,
inference(superposition,[],[f1,f27]) ).
fof(f190,plain,
! [X2,X3,X0,X1,X6,X4,X5] : multiply(multiply(X1,inverse(X1),X2),inverse(X0),multiply(inverse(X3),multiply(X4,inverse(multiply(multiply(X4,X3,X5),multiply(inverse(X3),inverse(multiply(X5,inverse(X5),X6)),X6),multiply(X4,X3,inverse(X5)))),X0),X3)) = X2,
inference(superposition,[],[f1,f48]) ).
fof(f573,plain,
! [X2,X3,X0,X1,X4] : multiply(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(X4,inverse(X4),X0))),multiply(inverse(X3),X0,X3)) = X2,
inference(superposition,[],[f190,f48]) ).
fof(f660,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] : multiply(multiply(X0,inverse(X0),X1),inverse(X3),multiply(inverse(X4),multiply(X5,inverse(multiply(multiply(X5,X4,X6),multiply(inverse(X4),inverse(multiply(X6,inverse(X6),X7)),X7),multiply(X5,X4,inverse(X6)))),X3),X4)) = multiply(inverse(X2),X1,X2),
inference(superposition,[],[f190,f573]) ).
fof(f683,plain,
! [X2,X1] : multiply(inverse(X2),X1,X2) = X1,
inference(forward_demodulation,[],[f660,f190]) ).
fof(f729,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(X0),inverse(multiply(X0,inverse(X0),X1)),X0),
inference(superposition,[],[f27,f683]) ).
fof(f777,plain,
! [X0,X1] : inverse(X1) = inverse(multiply(X0,inverse(X0),X1)),
inference(forward_demodulation,[],[f729,f683]) ).
fof(f805,plain,
! [X2,X0,X1] : multiply(inverse(X1),multiply(X2,inverse(X0),X0),X1) = X2,
inference(superposition,[],[f27,f777]) ).
fof(f866,plain,
! [X2,X0] : multiply(X2,inverse(X0),X0) = X2,
inference(forward_demodulation,[],[f805,f683]) ).
fof(f978,plain,
! [X2,X3,X0,X1] : multiply(multiply(X2,inverse(X2),X3),inverse(multiply(X0,inverse(X0),X1)),X1) = X3,
inference(superposition,[],[f44,f866]) ).
fof(f981,plain,
! [X2,X3,X1] : multiply(multiply(X2,inverse(X2),X3),inverse(X1),X1) = X3,
inference(forward_demodulation,[],[f978,f777]) ).
fof(f1016,plain,
! [X2,X3] : multiply(X2,inverse(X2),X3) = X3,
inference(forward_demodulation,[],[f981,f866]) ).
fof(f1073,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f1016,f683]) ).
fof(f1094,plain,
! [X2,X3,X0,X1,X4,X5] : multiply(X1,X0,X2) = multiply(multiply(X2,X1,multiply(X2,X1,X0)),inverse(multiply(multiply(X3,inverse(X3),X4),inverse(multiply(X3,inverse(X3),X4)),multiply(X3,inverse(X3),X5))),X5),
inference(superposition,[],[f43,f1016]) ).
fof(f1178,plain,
! [X2,X3,X0,X1,X5] : multiply(X1,X0,X2) = multiply(multiply(X2,X1,multiply(X2,X1,X0)),inverse(multiply(X3,inverse(X3),X5)),X5),
inference(forward_demodulation,[],[f1094,f777]) ).
fof(f1232,plain,
! [X2,X0,X1,X5] : multiply(X1,X0,X2) = multiply(multiply(X2,X1,multiply(X2,X1,X0)),inverse(X5),X5),
inference(forward_demodulation,[],[f1178,f777]) ).
fof(f1264,plain,
! [X2,X0,X1] : multiply(X1,X0,X2) = multiply(X2,X1,multiply(X2,X1,X0)),
inference(forward_demodulation,[],[f1232,f866]) ).
fof(f1306,plain,
! [X0,X1] : multiply(X0,X1,inverse(X0)) = X1,
inference(superposition,[],[f683,f1073]) ).
fof(f1927,plain,
! [X0,X1] : multiply(X0,inverse(X1),X1) = multiply(X1,X0,X0),
inference(superposition,[],[f1264,f1306]) ).
fof(f2025,plain,
! [X0,X1] : multiply(X1,X0,X0) = X0,
inference(forward_demodulation,[],[f1927,f866]) ).
fof(f2412,plain,
a != a,
inference(superposition,[],[f3,f2025]) ).
fof(f2413,plain,
$false,
inference(trivial_inequality_removal,[],[f2412]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO068-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n020.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 21:08:53 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.31 % (562716)Will run a generic schedule for satisfiability detection.
% 0.19/0.31 % (562723)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=453407068:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.31 % (562722)% WARNING: option uhcvi not known.
% 0.19/0.31 % (562722)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1033904832:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.31 % (562724)dis+10_1_sil=32000:sp=arity:random_seed=240614813:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.31 % (562721)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3571668237_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.31 % (562725)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4182868467:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.31 % (562726)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2962188939:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.31 % (562727)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2654958671:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.31 % TRYING [1]
% 0.19/0.31 % TRYING [2]
% 0.19/0.31 % TRYING [3]
% 0.19/0.31 % (562723) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-562716-562723"...
% 0.19/0.31 % (562723)...printing done.
% 0.19/0.31 % TRYING [4]
% 0.19/0.31 % (562723)Refutation found. Thanks to Tanya!
% 0.19/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.19/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.31 % (562723)------------------------------
% 0.19/0.31 % (562723)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.31 % (562723)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.31 % (562723)CaDiCaL version: 2.1.3
% 0.19/0.31 % (562723)Termination reason: Refutation
% 0.19/0.31 % (562723)Time elapsed: 0.047 s
% 0.19/0.31 % (562723)Peak memory usage: 13 MB
% 0.19/0.31 % (562723)Instructions burned: 165 (million)
% 0.19/0.31 % (562716)Success in time 0.075 s
% 0.19/0.31 % Vampire exiting
%------------------------------------------------------------------------------