%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : BOO034-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:13 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.31s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 43 ( 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X3,X0,X1,X4] : multiply(multiply(X0,X1,X2),X3,multiply(X0,X1,X4)) = multiply(X0,X1,multiply(X2,X3,X4)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',associativity) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_1) ).
fof(f3,axiom,
! [X0,X1] : multiply(X0,X0,X1) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_2) ).
fof(f5,axiom,
! [X0,X1] : multiply(X0,X1,inverse(X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',right_inverse) ).
fof(f6,negated_conjecture,
multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_single_axiom) ).
fof(f7,plain,
b != multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)),
inference(reorient_equations,[],[f6]) ).
fof(f8,plain,
! [X2,X3,X0,X1] : multiply(X1,X0,multiply(X0,X2,X3)) = multiply(X0,X2,multiply(X1,X0,X3)),
inference(superposition,[],[f1,f2]) ).
fof(f11,plain,
! [X2,X3,X0,X1] : multiply(X0,X1,multiply(inverse(X1),X2,X3)) = multiply(X0,X2,multiply(X0,X1,X3)),
inference(superposition,[],[f1,f5]) ).
fof(f20,plain,
b != multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)),
inference(superposition,[],[f7,f1]) ).
fof(f34,plain,
! [X2,X0,X1] : multiply(X1,X2,X0) = multiply(X2,X0,multiply(X1,X2,X0)),
inference(superposition,[],[f8,f2]) ).
fof(f180,plain,
! [X0,X1] : multiply(X1,inverse(X1),X0) = X0,
inference(superposition,[],[f34,f5]) ).
fof(f264,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f5,f180]) ).
fof(f268,plain,
b != multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)),
inference(superposition,[],[f20,f180]) ).
fof(f328,plain,
! [X0,X1] : multiply(X0,X0,multiply(X0,X1,X1)) = multiply(inverse(X1),X0,X1),
inference(superposition,[],[f34,f11]) ).
fof(f360,plain,
! [X0,X1] : multiply(inverse(X1),X0,X1) = X0,
inference(forward_demodulation,[],[f328,f3]) ).
fof(f748,plain,
! [X0,X1] : multiply(X0,X1,inverse(X0)) = X1,
inference(superposition,[],[f360,f264]) ).
fof(f752,plain,
! [X2,X0,X1] : multiply(X1,X2,X0) = multiply(X1,X0,multiply(X1,X2,X2)),
inference(superposition,[],[f11,f360]) ).
fof(f778,plain,
! [X2,X0,X1] : multiply(X1,X0,X2) = multiply(X1,X2,X0),
inference(forward_demodulation,[],[f752,f2]) ).
fof(f1135,plain,
! [X2,X0,X1] : multiply(X1,X2,X0) = multiply(X2,X0,multiply(X1,X2,inverse(X2))),
inference(superposition,[],[f8,f748]) ).
fof(f1155,plain,
! [X2,X0,X1] : multiply(X1,X2,X0) = multiply(X2,X0,X1),
inference(forward_demodulation,[],[f1135,f5]) ).
fof(f1362,plain,
b != multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,e,f),c)),
inference(superposition,[],[f268,f778]) ).
fof(f1367,plain,
b != multiply(b,multiply(d,multiply(g,e,f),c),inverse(multiply(c,d,multiply(e,f,g)))),
inference(forward_demodulation,[],[f1362,f778]) ).
fof(f1405,plain,
b != multiply(b,multiply(d,c,multiply(g,e,f)),inverse(multiply(c,d,multiply(e,f,g)))),
inference(forward_demodulation,[],[f1367,f778]) ).
fof(f1427,plain,
b != multiply(b,multiply(c,multiply(g,e,f),d),inverse(multiply(c,d,multiply(e,f,g)))),
inference(forward_demodulation,[],[f1405,f1155]) ).
fof(f1449,plain,
b != multiply(b,multiply(c,d,multiply(g,e,f)),inverse(multiply(c,d,multiply(e,f,g)))),
inference(forward_demodulation,[],[f1427,f778]) ).
fof(f1471,plain,
b != multiply(b,multiply(c,d,multiply(e,f,g)),inverse(multiply(c,d,multiply(e,f,g)))),
inference(forward_demodulation,[],[f1449,f1155]) ).
fof(f1493,plain,
$false,
inference(forward_subsumption_resolution,[],[f1471,f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO034-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n004.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 21:04:37 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.20/0.31 % (775716)Will run a generic schedule for satisfiability detection.
% 0.20/0.31 % (775721)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2857208439_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.31 % TRYING [1]
% 0.20/0.31 % TRYING [2]
% 0.20/0.31 % TRYING [3]
% 0.20/0.31 % (775722)% WARNING: option uhcvi not known.
% 0.20/0.31 % TRYING [4]
% 0.20/0.31 % (775722)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2493932132:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.31 % (775723)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1793438268:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.31 % (775724)dis+10_1_sil=32000:sp=arity:random_seed=3157015188:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.31 % (775725)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3119198509:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.31 % (775727)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4106487193:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.31 % (775726)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2413635850:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.31 % (775725) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-775716-775725"...
% 0.20/0.31 % (775725)...printing done.
% 0.20/0.31 % (775725)Refutation found. Thanks to Tanya!
% 0.20/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.31 % (775725)------------------------------
% 0.20/0.31 % (775725)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (775725)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (775725)CaDiCaL version: 2.1.3
% 0.20/0.31 % (775725)Termination reason: Refutation
% 0.20/0.31 % (775725)Time elapsed: 0.050 s
% 0.20/0.31 % (775725)Peak memory usage: 12 MB
% 0.20/0.31 % (775725)Instructions burned: 81 (million)
% 0.20/0.31 % (775716)Success in time 0.083 s
% 0.20/0.31 % Vampire exiting
%------------------------------------------------------------------------------