%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : BOO013-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n007.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:09 AM UTC 2026
% Result : Unsatisfiable 0.35s 0.45s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 50 ( 50 unt; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_add) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_multiply) ).
fof(f3,axiom,
! [X2,X0,X1] : add(X0,multiply(X1,X2)) = multiply(add(X0,X1),add(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity1) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',distributivity2) ).
fof(f5,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_id1) ).
fof(f6,axiom,
! [X0] : multiply(X0,multiplicative_identity) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_id1) ).
fof(f7,axiom,
! [X0] : add(X0,inverse(X0)) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',additive_inverse1) ).
fof(f8,plain,
! [X0] : multiplicative_identity = add(X0,inverse(X0)),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X0] : multiply(X0,inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_inverse1) ).
fof(f10,plain,
! [X0] : additive_identity = multiply(X0,inverse(X0)),
inference(reorient_equations,[],[f9]) ).
fof(f11,axiom,
add(a,b) = multiplicative_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_a_multiplicative_identity) ).
fof(f12,plain,
multiplicative_identity = add(a,b),
inference(reorient_equations,[],[f11]) ).
fof(f13,axiom,
multiply(a,b) = additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_an_additive_identity) ).
fof(f14,plain,
additive_identity = multiply(a,b),
inference(reorient_equations,[],[f13]) ).
fof(f15,negated_conjecture,
b != inverse(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_inverse_is_b) ).
fof(f19,plain,
! [X0] : add(additive_identity,X0) = X0,
inference(superposition,[],[f5,f1]) ).
fof(f29,plain,
! [X0] : multiply(multiplicative_identity,X0) = X0,
inference(superposition,[],[f6,f2]) ).
fof(f32,plain,
! [X0] : add(a,multiply(b,X0)) = multiply(multiplicative_identity,add(a,X0)),
inference(superposition,[],[f3,f12]) ).
fof(f33,plain,
! [X0,X1] : add(X0,multiply(additive_identity,X1)) = multiply(X0,add(X0,X1)),
inference(superposition,[],[f3,f5]) ).
fof(f34,plain,
! [X0,X1] : add(X0,multiply(inverse(X0),X1)) = multiply(multiplicative_identity,add(X0,X1)),
inference(superposition,[],[f3,f8]) ).
fof(f53,plain,
! [X0,X1] : add(X0,X1) = add(X0,multiply(inverse(X0),X1)),
inference(forward_demodulation,[],[f34,f29]) ).
fof(f54,plain,
! [X0] : add(a,multiply(b,X0)) = add(a,X0),
inference(forward_demodulation,[],[f32,f29]) ).
fof(f62,plain,
! [X0,X1] : add(additive_identity,multiply(X0,X1)) = multiply(X0,add(inverse(X0),X1)),
inference(superposition,[],[f4,f10]) ).
fof(f67,plain,
! [X0] : multiply(a,add(b,X0)) = add(additive_identity,multiply(a,X0)),
inference(superposition,[],[f4,f14]) ).
fof(f69,plain,
! [X0,X1] : multiply(X0,add(X1,inverse(X0))) = add(multiply(X0,X1),additive_identity),
inference(superposition,[],[f4,f10]) ).
fof(f83,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X0,add(X1,inverse(X0))),
inference(forward_demodulation,[],[f69,f5]) ).
fof(f85,plain,
! [X0] : multiply(a,add(b,X0)) = multiply(a,X0),
inference(forward_demodulation,[],[f67,f19]) ).
fof(f87,plain,
! [X0,X1] : multiply(X0,X1) = multiply(X0,add(inverse(X0),X1)),
inference(forward_demodulation,[],[f62,f19]) ).
fof(f107,plain,
add(a,additive_identity) = add(a,inverse(b)),
inference(superposition,[],[f54,f10]) ).
fof(f114,plain,
a = add(a,inverse(b)),
inference(forward_demodulation,[],[f107,f5]) ).
fof(f138,plain,
multiply(a,multiplicative_identity) = multiply(a,inverse(b)),
inference(superposition,[],[f85,f8]) ).
fof(f145,plain,
a = multiply(a,inverse(b)),
inference(forward_demodulation,[],[f138,f6]) ).
fof(f193,plain,
! [X0] : add(X0,additive_identity) = add(X0,inverse(inverse(X0))),
inference(superposition,[],[f53,f10]) ).
fof(f210,plain,
! [X0] : add(X0,inverse(inverse(X0))) = X0,
inference(forward_demodulation,[],[f193,f5]) ).
fof(f227,plain,
! [X0] : multiply(X0,inverse(X0)) = multiply(X0,additive_identity),
inference(superposition,[],[f83,f19]) ).
fof(f248,plain,
! [X0] : additive_identity = multiply(X0,additive_identity),
inference(forward_demodulation,[],[f227,f10]) ).
fof(f262,plain,
! [X0] : additive_identity = multiply(additive_identity,X0),
inference(superposition,[],[f2,f248]) ).
fof(f272,plain,
! [X0] : multiply(X0,multiplicative_identity) = multiply(X0,inverse(inverse(X0))),
inference(superposition,[],[f87,f8]) ).
fof(f289,plain,
! [X0] : multiply(X0,inverse(inverse(X0))) = X0,
inference(forward_demodulation,[],[f272,f6]) ).
fof(f305,plain,
! [X0,X1] : add(X1,multiply(additive_identity,X0)) = multiply(X1,add(X0,X1)),
inference(superposition,[],[f33,f1]) ).
fof(f349,plain,
! [X0,X1] : add(X1,additive_identity) = multiply(X1,add(X0,X1)),
inference(forward_demodulation,[],[f305,f262]) ).
fof(f367,plain,
! [X0,X1] : multiply(X1,add(X0,X1)) = X1,
inference(forward_demodulation,[],[f349,f5]) ).
fof(f1423,plain,
! [X0] : inverse(inverse(X0)) = multiply(inverse(inverse(X0)),X0),
inference(superposition,[],[f367,f210]) ).
fof(f1432,plain,
inverse(b) = multiply(inverse(b),a),
inference(superposition,[],[f367,f114]) ).
fof(f1477,plain,
inverse(b) = multiply(a,inverse(b)),
inference(forward_demodulation,[],[f1432,f2]) ).
fof(f1480,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,inverse(inverse(X0))),
inference(forward_demodulation,[],[f1423,f2]) ).
fof(f1491,plain,
a = inverse(b),
inference(forward_demodulation,[],[f1477,f145]) ).
fof(f1492,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(forward_demodulation,[],[f1480,f289]) ).
fof(f1826,plain,
b = inverse(a),
inference(superposition,[],[f1492,f1491]) ).
fof(f1839,plain,
$false,
inference(forward_subsumption_resolution,[],[f1826,f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : BOO013-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.31 % Computer : n007.cluster.edu
% 0.27/0.31 % Model : x86_64 x86_64
% 0.27/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.27/0.31 % Memory : 8046.5625MB
% 0.27/0.31 % OS : Linux 6.8.0-71-generic
% 0.27/0.31 % CPULimit : 300
% 0.27/0.31 % WCLimit : 300
% 0.27/0.31 % DateTime : Mon Sep 28 21:01:55 UTC 2026
% 0.27/0.31 % CPUTime :
% 0.27/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.37 Running first-order model finding
% 0.27/0.37 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.35/0.45 % (2821570)Will run a generic schedule for satisfiability detection.
% 0.35/0.45 % (2821579)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1890180316:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.45 % (2821576)% WARNING: option uhcvi not known.
% 0.35/0.45 % (2821581)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3891117350:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.45 % (2821575)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3698045153_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.45 % (2821580)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3840222588:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.45 % (2821577)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2995679117:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.45 % (2821576)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2656780082:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.45 % (2821578)dis+10_1_sil=32000:sp=arity:random_seed=2770519506:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.45 % TRYING [1]
% 0.35/0.45 % TRYING [2]
% 0.35/0.45 % TRYING [3]
% 0.35/0.45 % TRYING [4]
% 0.35/0.45 % (2821579) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2821570-2821579"...
% 0.35/0.45 % (2821579)...printing done.
% 0.35/0.45 % (2821579)Refutation found. Thanks to Tanya!
% 0.35/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.35/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.45 % (2821579)------------------------------
% 0.35/0.45 % (2821579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.45 % (2821579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.45 % (2821579)CaDiCaL version: 2.1.3
% 0.35/0.45 % (2821579)Termination reason: Refutation
% 0.35/0.45 % (2821579)Time elapsed: 0.030 s
% 0.35/0.45 % (2821579)Peak memory usage: 12 MB
% 0.35/0.45 % (2821579)Instructions burned: 57 (million)
% 0.35/0.45 % (2821570)Success in time 0.067 s
% 0.35/0.45 % Vampire exiting
%------------------------------------------------------------------------------