%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG015-6 : TPTP v9.3.1. Released v1.0.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 12:35:08 PM UTC 2026
% Result : Unsatisfiable 2.66s 1.35s
% Output : Refutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 29 unt; 3 def)
% Number of atoms : 61 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 16 ~; 14 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_additive_identity) ).
fof(f2,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_additive_identity) ).
fof(f5,axiom,
! [X0] : multiply(X0,additive_identity) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_multiplicative_zero) ).
fof(f6,plain,
! [X0] : additive_identity = multiply(X0,additive_identity),
inference(reorient_equations,[],[f5]) ).
fof(f7,axiom,
! [X0] : add(additive_inverse(X0),X0) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_additive_inverse) ).
fof(f8,plain,
! [X0] : additive_identity = add(additive_inverse(X0),X0),
inference(reorient_equations,[],[f7]) ).
fof(f9,axiom,
! [X0] : add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_additive_inverse) ).
fof(f10,plain,
! [X0] : additive_identity = add(X0,additive_inverse(X0)),
inference(reorient_equations,[],[f9]) ).
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distribute1) ).
fof(f14,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_for_addition) ).
fof(f15,axiom,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_for_addition) ).
fof(f20,negated_conjecture,
multiply(x,add(y,additive_inverse(z))) != add(multiply(x,y),additive_inverse(multiply(x,z))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
fof(f22,definition,
( spl0_1
<=> multiply(x,add(y,additive_inverse(z))) = add(multiply(x,y),additive_inverse(multiply(x,z))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f24,plain,
( multiply(x,add(y,additive_inverse(z))) != add(multiply(x,y),additive_inverse(multiply(x,z)))
| spl0_1 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f25,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f20,f22]) ).
fof(f26,plain,
( add(multiply(x,y),additive_inverse(multiply(x,z))) != add(multiply(x,y),multiply(x,additive_inverse(z)))
| spl0_1 ),
inference(forward_demodulation,[],[f24,f12]) ).
fof(f28,definition,
( spl0_2
<=> add(multiply(x,y),additive_inverse(multiply(x,z))) = add(multiply(x,y),multiply(x,additive_inverse(z))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f30,plain,
( add(multiply(x,y),additive_inverse(multiply(x,z))) != add(multiply(x,y),multiply(x,additive_inverse(z)))
| spl0_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f31,plain,
( ~ spl0_2
| spl0_1 ),
inference(avatar_split_clause,[],[f26,f22,f28]) ).
fof(f34,plain,
additive_identity = additive_inverse(additive_identity),
inference(superposition,[],[f2,f8]) ).
fof(f36,definition,
( spl0_3
<=> additive_identity = additive_inverse(additive_identity) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f38,plain,
( additive_identity = additive_inverse(additive_identity)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f39,plain,
spl0_3,
inference(avatar_split_clause,[],[f34,f36]) ).
fof(f64,plain,
! [X0,X1] : add(additive_identity,X1) = add(additive_inverse(X0),add(X0,X1)),
inference(superposition,[],[f15,f8]) ).
fof(f73,plain,
! [X0,X1] : add(additive_inverse(X0),add(X0,X1)) = X1,
inference(forward_demodulation,[],[f64,f1]) ).
fof(f93,plain,
! [X0,X1] : add(additive_inverse(X1),add(X0,X1)) = X0,
inference(superposition,[],[f73,f14]) ).
fof(f131,plain,
! [X0,X1] : additive_inverse(X1) = add(additive_inverse(add(X1,X0)),X0),
inference(superposition,[],[f93,f73]) ).
fof(f202,plain,
! [X0,X1] : additive_inverse(X0) = add(X1,additive_inverse(add(X0,X1))),
inference(superposition,[],[f14,f131]) ).
fof(f315,plain,
! [X0,X1] : multiply(X0,additive_identity) = add(multiply(X0,X1),multiply(X0,additive_inverse(X1))),
inference(superposition,[],[f12,f10]) ).
fof(f336,plain,
! [X0,X1] : additive_identity = add(multiply(X0,X1),multiply(X0,additive_inverse(X1))),
inference(forward_demodulation,[],[f315,f6]) ).
fof(f559,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = add(multiply(X0,additive_inverse(X1)),additive_inverse(additive_identity)),
inference(superposition,[],[f202,f336]) ).
fof(f562,plain,
( ! [X0,X1] : additive_inverse(multiply(X0,X1)) = add(multiply(X0,additive_inverse(X1)),additive_identity)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f559,f38]) ).
fof(f578,plain,
( ! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1))
| ~ spl0_3 ),
inference(forward_demodulation,[],[f562,f2]) ).
fof(f596,plain,
( add(multiply(x,y),additive_inverse(multiply(x,z))) != add(multiply(x,y),additive_inverse(multiply(x,z)))
| spl0_2
| ~ spl0_3 ),
inference(backward_demodulation,[],[f30,f578]) ).
fof(f597,plain,
( $false
| spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f596]) ).
fof(f598,plain,
( spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f597]) ).
cnf(s1,plain,
~ spl0_1,
inference(sat_conversion,[],[f25]) ).
cnf(s2,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f31]) ).
cnf(s3,plain,
spl0_3,
inference(sat_conversion,[],[f39]) ).
cnf(s5,plain,
( spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f598]) ).
cnf(s6,plain,
spl0_2,
inference(rat,[],[s5,s3]) ).
cnf(s7,plain,
spl0_1,
inference(rat,[],[s2,s6]) ).
cnf(s8,plain,
$false,
inference(rat,[],[s1,s7]) ).
fof(f624,plain,
$false,
inference(avatar_sat_refutation,[],[s8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG015-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 23:01:42 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 2.66/1.35 % (3312037)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.66/1.35 % (3312153)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1218790506:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.66/1.35 % (3312153)First to succeed.
% 2.66/1.35 % (3312153)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3312037"
% 2.66/1.35 % (3312152)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=1671157572:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.66/1.35 % (3312148)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2364331267:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.66/1.35 % (3312145)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=66424728:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.66/1.35 % (3312150)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=176429473:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.66/1.35 % (3312147)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=3397697:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.66/1.35 % (3312152)Refutation not found, incomplete strategy
% 2.66/1.35 % (3312152)------------------------------
% 2.66/1.35 % (3312152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.35 % (3312152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.35 % (3312152)CaDiCaL version: 2.1.3
% 2.66/1.35 % (3312152)Termination reason: Refutation not found, incomplete strategy
% 2.66/1.35 % (3312152)Time elapsed: 0.001 s
% 2.66/1.35 % (3312152)Peak memory usage: 87 MB
% 2.66/1.35 % (3312152)Instructions burned: 1 (million)
% 2.66/1.35 % (3312155)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2393444305:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.66/1.35 % (3312150)Also succeeded, but the first one will report.
% 2.66/1.35 % (3312153)Refutation found. Thanks to Tanya!
% 2.66/1.35 % SZS status Unsatisfiable for theBenchmark
% 2.66/1.35 % SZS output start Proof for theBenchmark
% See solution above
% 2.66/1.35 % (3312153)------------------------------
% 2.66/1.35 % (3312153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.66/1.35 % (3312153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.66/1.35 % (3312153)CaDiCaL version: 2.1.3
% 2.66/1.35 % (3312153)Termination reason: Refutation
% 2.66/1.35 % (3312153)Time elapsed: 0.009 s
% 2.66/1.35 % (3312153)Peak memory usage: 89 MB
% 2.66/1.35 % (3312153)Instructions burned: 22 (million)
% 2.66/1.35 % (3312153)------------------------------
% 2.66/1.35 % (3312153)------------------------------
% 2.66/1.35 % (3312037)Success in time 0.293 s
% 2.66/1.35 % Vampire exiting
%------------------------------------------------------------------------------