%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG017-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 : n013.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.48s 1.12s
% Output : Refutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 61 ( 38 unt; 4 def)
% Number of atoms : 89 ( 45 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 26 ~; 24 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 52 !; 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(f3,axiom,
! [X0] : multiply(additive_identity,X0) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_multiplicative_zero) ).
fof(f4,plain,
! [X0] : additive_identity = multiply(additive_identity,X0),
inference(reorient_equations,[],[f3]) ).
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(f11,axiom,
! [X0] : additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_additive_inverse) ).
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(f13,axiom,
! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distribute2) ).
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(additive_inverse(x),add(y,z)) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
fof(f22,definition,
( spl0_1
<=> multiply(additive_inverse(x),add(y,z)) = add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f24,plain,
( multiply(additive_inverse(x),add(y,z)) != add(additive_inverse(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(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) != add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z))
| spl0_1 ),
inference(forward_demodulation,[],[f24,f12]) ).
fof(f28,definition,
( spl0_2
<=> add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) = add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f30,plain,
( add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) != add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),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(f59,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(additive_inverse(X0),X1)),
inference(superposition,[],[f15,f10]) ).
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(f77,plain,
! [X0,X1] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f59,f1]) ).
fof(f93,plain,
! [X0,X1] : add(additive_inverse(X1),add(X0,X1)) = X0,
inference(superposition,[],[f73,f14]) ).
fof(f107,plain,
! [X0,X1] : add(X1,add(X0,additive_inverse(X1))) = X0,
inference(superposition,[],[f77,f14]) ).
fof(f131,plain,
! [X0,X1] : additive_inverse(X1) = add(additive_inverse(add(X1,X0)),X0),
inference(superposition,[],[f93,f73]) ).
fof(f132,plain,
! [X0,X1] : additive_inverse(X1) = add(additive_inverse(add(X0,X1)),X0),
inference(superposition,[],[f93,f93]) ).
fof(f202,plain,
! [X0,X1] : additive_inverse(X0) = add(X1,additive_inverse(add(X0,X1))),
inference(superposition,[],[f14,f131]) ).
fof(f220,plain,
! [X0,X1] : add(additive_inverse(X0),X1) = additive_inverse(add(X0,additive_inverse(X1))),
inference(superposition,[],[f132,f107]) ).
fof(f237,plain,
! [X0,X1] : additive_inverse(add(X1,X0)) = add(additive_inverse(X1),additive_inverse(X0)),
inference(superposition,[],[f93,f132]) ).
fof(f242,plain,
( add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z)) != additive_inverse(add(multiply(x,y),multiply(x,z)))
| spl0_2 ),
inference(backward_demodulation,[],[f30,f237]) ).
fof(f274,definition,
( spl0_4
<=> add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z)) = additive_inverse(add(multiply(x,y),multiply(x,z))) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f276,plain,
( add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z)) != additive_inverse(add(multiply(x,y),multiply(x,z)))
| spl0_4 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f277,plain,
( ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f242,f28,f274]) ).
fof(f496,plain,
! [X0,X1] : multiply(additive_identity,X1) = add(multiply(X0,X1),multiply(additive_inverse(X0),X1)),
inference(superposition,[],[f13,f10]) ).
fof(f515,plain,
! [X0,X1] : additive_identity = add(multiply(X0,X1),multiply(additive_inverse(X0),X1)),
inference(forward_demodulation,[],[f496,f4]) ).
fof(f689,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = add(multiply(additive_inverse(X0),X1),additive_inverse(additive_identity)),
inference(superposition,[],[f202,f515]) ).
fof(f692,plain,
( ! [X0,X1] : additive_inverse(multiply(X0,X1)) = add(multiply(additive_inverse(X0),X1),additive_identity)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f689,f38]) ).
fof(f708,plain,
( ! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1)
| ~ spl0_3 ),
inference(forward_demodulation,[],[f692,f2]) ).
fof(f731,plain,
( additive_inverse(add(multiply(x,y),multiply(x,z))) != add(multiply(additive_inverse(x),y),additive_inverse(multiply(x,z)))
| ~ spl0_3
| spl0_4 ),
inference(backward_demodulation,[],[f276,f708]) ).
fof(f741,plain,
( add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) != additive_inverse(add(multiply(x,y),multiply(x,z)))
| ~ spl0_3
| spl0_4 ),
inference(forward_demodulation,[],[f731,f708]) ).
fof(f759,plain,
( additive_inverse(add(multiply(x,y),multiply(x,z))) != additive_inverse(add(multiply(x,y),additive_inverse(additive_inverse(multiply(x,z)))))
| ~ spl0_3
| spl0_4 ),
inference(forward_demodulation,[],[f741,f220]) ).
fof(f773,plain,
( additive_inverse(add(multiply(x,y),multiply(x,z))) != additive_inverse(add(multiply(x,y),multiply(x,z)))
| ~ spl0_3
| spl0_4 ),
inference(forward_demodulation,[],[f759,f11]) ).
fof(f774,plain,
( $false
| ~ spl0_3
| spl0_4 ),
inference(trivial_inequality_removal,[],[f773]) ).
fof(f775,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_contradiction_clause,[],[f774]) ).
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_4 ),
inference(sat_conversion,[],[f277]) ).
cnf(s6,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f775]) ).
cnf(s7,plain,
spl0_4,
inference(rat,[],[s6,s3]) ).
cnf(s8,plain,
spl0_2,
inference(rat,[],[s5,s7]) ).
cnf(s9,plain,
spl0_1,
inference(rat,[],[s2,s8]) ).
cnf(s10,plain,
$false,
inference(rat,[],[s1,s9]) ).
fof(f781,plain,
$false,
inference(avatar_sat_refutation,[],[s10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG017-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 : n013.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 22:58:07 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 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.48/1.12 % (646395)Detected a unit-equality problem, will run specialized UEQ schedule.
% 2.48/1.12 % (646405)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=419090916:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 2.48/1.12 % (646405)First to succeed.
% 2.48/1.12 % (646405)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-646395"
% 2.48/1.12 % (646406)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=2355493967:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 2.48/1.12 % (646402)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=2535934126:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 2.48/1.12 % (646403)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2762761607:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 2.48/1.12 % (646400)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=196823118:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 2.48/1.12 % (646401)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=153507640:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 2.48/1.12 % (646404)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=511457509:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 2.48/1.12 % (646404)Refutation not found, incomplete strategy
% 2.48/1.12 % (646404)------------------------------
% 2.48/1.12 % (646404)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.12 % (646404)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.12 % (646404)CaDiCaL version: 2.1.3
% 2.48/1.12 % (646404)Termination reason: Refutation not found, incomplete strategy
% 2.48/1.12 % (646404)Time elapsed: 0.001 s
% 2.48/1.12 % (646404)Peak memory usage: 87 MB
% 2.48/1.12 % (646404)Instructions burned: 1 (million)
% 2.48/1.12 % (646403)Also succeeded, but the first one will report.
% 2.48/1.12 % (646405)Refutation found. Thanks to Tanya!
% 2.48/1.12 % SZS status Unsatisfiable for theBenchmark
% 2.48/1.12 % SZS output start Proof for theBenchmark
% See solution above
% 2.48/1.12 % (646405)------------------------------
% 2.48/1.12 % (646405)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.48/1.12 % (646405)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.48/1.12 % (646405)CaDiCaL version: 2.1.3
% 2.48/1.12 % (646405)Termination reason: Refutation
% 2.48/1.12 % (646405)Time elapsed: 0.010 s
% 2.48/1.12 % (646405)Peak memory usage: 89 MB
% 2.48/1.12 % (646405)Instructions burned: 27 (million)
% 2.48/1.12 % (646405)------------------------------
% 2.48/1.12 % (646405)------------------------------
% 2.48/1.12 % (646395)Success in time 0.302 s
% 2.48/1.12 % Vampire exiting
%------------------------------------------------------------------------------