%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : BOO006-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:35:49 AM UTC 2026
% Result : Unsatisfiable 3.40s 1.15s
% Output : Refutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 24 unt; 1 def)
% Number of atoms : 24 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_add) ).
fof(f2,axiom,
! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_multiply) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity2) ).
fof(f5,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_id1) ).
fof(f6,axiom,
! [X0] : multiply(X0,multiplicative_identity) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_id1) ).
fof(f9,axiom,
! [X0] : multiply(X0,inverse(X0)) = additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_inverse1) ).
fof(f10,plain,
! [X0] : additive_identity = multiply(X0,inverse(X0)),
inference(reorient_equations,[],[f9]) ).
fof(f11,negated_conjecture,
multiply(a,additive_identity) != additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_right_identity) ).
fof(f12,plain,
additive_identity != multiply(a,additive_identity),
inference(reorient_equations,[],[f11]) ).
fof(f13,definition,
~ sP0(multiply(a,additive_identity)),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f14,plain,
sP0(additive_identity),
inference(inequality_splitting,[],[f12,f13]) ).
fof(f19,plain,
! [X0] : add(additive_identity,X0) = X0,
inference(superposition,[],[f5,f1]) ).
fof(f23,plain,
! [X0] : multiply(multiplicative_identity,X0) = X0,
inference(superposition,[],[f6,f2]) ).
fof(f30,plain,
! [X0,X1] : multiply(X1,X0) = add(multiply(X1,X0),multiply(X1,additive_identity)),
inference(superposition,[],[f4,f5]) ).
fof(f92,plain,
additive_identity = inverse(multiplicative_identity),
inference(superposition,[],[f10,f23]) ).
fof(f94,plain,
! [X0] : multiply(X0,inverse(X0)) = inverse(multiplicative_identity),
inference(backward_demodulation,[],[f10,f92]) ).
fof(f95,plain,
~ sP0(multiply(a,inverse(multiplicative_identity))),
inference(backward_demodulation,[],[f13,f92]) ).
fof(f96,plain,
sP0(inverse(multiplicative_identity)),
inference(backward_demodulation,[],[f14,f92]) ).
fof(f97,plain,
! [X0] : add(inverse(multiplicative_identity),X0) = X0,
inference(backward_demodulation,[],[f19,f92]) ).
fof(f99,plain,
! [X0,X1] : multiply(X1,X0) = add(multiply(X1,X0),multiply(X1,inverse(multiplicative_identity))),
inference(backward_demodulation,[],[f30,f92]) ).
fof(f215,plain,
! [X0] : inverse(multiplicative_identity) = add(inverse(multiplicative_identity),multiply(X0,inverse(multiplicative_identity))),
inference(superposition,[],[f99,f94]) ).
fof(f232,plain,
! [X0] : inverse(multiplicative_identity) = multiply(X0,inverse(multiplicative_identity)),
inference(forward_demodulation,[],[f215,f97]) ).
fof(f240,plain,
~ sP0(inverse(multiplicative_identity)),
inference(backward_demodulation,[],[f95,f232]) ).
fof(f242,plain,
$false,
inference(forward_subsumption_resolution,[],[f240,f96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO006-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n010.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 21:03:48 UTC 2026
% 0.10/0.21 % CPUTime :
% 0.10/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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
% 3.40/1.15 % (2333564)Detected a unit-equality problem, will run specialized UEQ schedule.
% 3.40/1.15 % (2333677)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=518497179:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 3.40/1.15 % (2333679)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=273869948:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 3.40/1.15 % (2333675)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=2383862230:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 3.40/1.15 % (2333678)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2197382575:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 3.40/1.15 % (2333680)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=3201855912:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 3.40/1.15 % (2333682)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=4212559991:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 3.40/1.15 % (2333681)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=4075832092:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 3.40/1.15 % (2333679)First to succeed.
% 3.40/1.15 % (2333679)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2333564"
% 3.40/1.15 % (2333680)Also succeeded, but the first one will report.
% 3.40/1.15 % (2333682)Also succeeded, but the first one will report.
% 3.40/1.15 % (2333681)Also succeeded, but the first one will report.
% 3.40/1.15 % (2333679)Refutation found. Thanks to Tanya!
% 3.40/1.15 % SZS status Unsatisfiable for theBenchmark
% 3.40/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 3.40/1.15 % (2333679)------------------------------
% 3.40/1.15 % (2333679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.40/1.15 % (2333679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.40/1.15 % (2333679)CaDiCaL version: 2.1.3
% 3.40/1.15 % (2333679)Termination reason: Refutation
% 3.40/1.15 % (2333679)Time elapsed: 0.009 s
% 3.40/1.15 % (2333679)Peak memory usage: 88 MB
% 3.40/1.15 % (2333679)Instructions burned: 12 (million)
% 3.40/1.15 % (2333679)------------------------------
% 3.40/1.15 % (2333679)------------------------------
% 3.40/1.15 % (2333564)Success in time 0.394 s
% 3.40/1.15 % Vampire exiting
%------------------------------------------------------------------------------