%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : RNG020-7 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 4.46s 2.03s
% Output : Refutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 37 unt; 1 def)
% Number of atoms : 37 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 11 ( 11 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 36 ( 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_additive_identity) ).
fof(f7,axiom,
! [X0] : add(additive_inverse(X0),X0) = additive_identity,
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',distribute2) ).
fof(f14,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',associativity_for_addition) ).
fof(f18,axiom,
! [X2,X0,X1] : associator(X0,X1,X2) = add(multiply(multiply(X0,X1),X2),additive_inverse(multiply(X0,multiply(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associator) ).
fof(f30,negated_conjecture,
associator(x,add(u,v),y) != add(associator(x,u,y),associator(x,v,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_linearised_form2) ).
fof(f31,plain,
add(multiply(multiply(x,add(u,v)),y),additive_inverse(multiply(x,multiply(add(u,v),y)))) != add(add(multiply(multiply(x,u),y),additive_inverse(multiply(x,multiply(u,y)))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y))))),
inference(definition_unfolding,[],[f30,f18,f18,f18]) ).
fof(f32,definition,
~ sP0(add(multiply(multiply(x,add(u,v)),y),additive_inverse(multiply(x,multiply(add(u,v),y))))),
introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).
fof(f33,plain,
sP0(add(add(multiply(multiply(x,u),y),additive_inverse(multiply(x,multiply(u,y)))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y)))))),
inference(inequality_splitting,[],[f31,f32]) ).
fof(f37,plain,
sP0(add(multiply(multiply(x,u),y),add(additive_inverse(multiply(x,multiply(u,y))),add(multiply(multiply(x,v),y),additive_inverse(multiply(x,multiply(v,y))))))),
inference(backward_demodulation,[],[f33,f15]) ).
fof(f38,plain,
~ sP0(add(multiply(multiply(x,add(u,v)),y),additive_inverse(multiply(x,add(multiply(u,y),multiply(v,y)))))),
inference(backward_demodulation,[],[f32,f13]) ).
fof(f44,plain,
~ sP0(add(multiply(multiply(x,add(u,v)),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))),
inference(forward_demodulation,[],[f38,f12]) ).
fof(f45,plain,
~ sP0(add(multiply(add(multiply(x,u),multiply(x,v)),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))),
inference(forward_demodulation,[],[f44,f12]) ).
fof(f46,plain,
~ sP0(add(add(multiply(multiply(x,u),y),multiply(multiply(x,v),y)),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))))),
inference(forward_demodulation,[],[f45,f13]) ).
fof(f47,plain,
~ sP0(add(multiply(multiply(x,u),y),add(multiply(multiply(x,v),y),additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y))))))),
inference(forward_demodulation,[],[f46,f15]) ).
fof(f70,plain,
~ sP0(add(multiply(multiply(x,u),y),add(additive_inverse(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y)))),multiply(multiply(x,v),y)))),
inference(superposition,[],[f47,f14]) ).
fof(f71,plain,
sP0(add(multiply(multiply(x,u),y),add(additive_inverse(multiply(x,multiply(u,y))),add(additive_inverse(multiply(x,multiply(v,y))),multiply(multiply(x,v),y))))),
inference(superposition,[],[f37,f14]) ).
fof(f98,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(additive_inverse(X0),X1)),
inference(superposition,[],[f15,f10]) ).
fof(f103,plain,
! [X0,X1] : add(additive_identity,X1) = add(additive_inverse(X0),add(X0,X1)),
inference(superposition,[],[f15,f8]) ).
fof(f112,plain,
! [X0,X1] : add(additive_inverse(X0),add(X0,X1)) = X1,
inference(forward_demodulation,[],[f103,f1]) ).
fof(f114,plain,
! [X0,X1] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f98,f1]) ).
fof(f121,plain,
! [X0,X1] : add(additive_inverse(X1),add(X0,X1)) = X0,
inference(superposition,[],[f112,f14]) ).
fof(f174,plain,
! [X0,X1] : add(X1,add(X0,additive_inverse(X1))) = X0,
inference(superposition,[],[f114,f14]) ).
fof(f236,plain,
! [X0,X1] : additive_inverse(X1) = add(additive_inverse(add(X0,X1)),X0),
inference(superposition,[],[f121,f121]) ).
fof(f568,plain,
! [X0,X1] : add(additive_inverse(X0),X1) = additive_inverse(add(X0,additive_inverse(X1))),
inference(superposition,[],[f236,f174]) ).
fof(f617,plain,
sP0(add(multiply(multiply(x,u),y),additive_inverse(add(multiply(x,multiply(u,y)),additive_inverse(add(additive_inverse(multiply(x,multiply(v,y))),multiply(multiply(x,v),y))))))),
inference(backward_demodulation,[],[f71,f568]) ).
fof(f622,plain,
~ sP0(add(multiply(multiply(x,u),y),additive_inverse(add(add(multiply(x,multiply(u,y)),multiply(x,multiply(v,y))),additive_inverse(multiply(multiply(x,v),y)))))),
inference(backward_demodulation,[],[f70,f568]) ).
fof(f641,plain,
~ sP0(add(multiply(multiply(x,u),y),additive_inverse(add(multiply(x,multiply(u,y)),add(multiply(x,multiply(v,y)),additive_inverse(multiply(multiply(x,v),y))))))),
inference(forward_demodulation,[],[f622,f15]) ).
fof(f644,plain,
sP0(add(multiply(multiply(x,u),y),additive_inverse(add(multiply(x,multiply(u,y)),additive_inverse(additive_inverse(add(multiply(x,multiply(v,y)),additive_inverse(multiply(multiply(x,v),y))))))))),
inference(forward_demodulation,[],[f617,f568]) ).
fof(f667,plain,
sP0(add(multiply(multiply(x,u),y),additive_inverse(add(multiply(x,multiply(u,y)),add(multiply(x,multiply(v,y)),additive_inverse(multiply(multiply(x,v),y))))))),
inference(forward_demodulation,[],[f644,f11]) ).
fof(f681,plain,
$false,
inference(forward_subsumption_resolution,[],[f667,f641]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : RNG020-7 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.10 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48 % Computer : n002.cluster.edu
% 0.21/0.48 % Model : x86_64 x86_64
% 0.21/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48 % Memory : 8046.5625MB
% 0.21/0.48 % OS : Linux 6.8.0-71-generic
% 0.21/0.48 % CPULimit : 300
% 0.21/0.48 % WCLimit : 300
% 0.21/0.48 % DateTime : Sun Sep 27 23:01:51 UTC 2026
% 0.21/0.48 % CPUTime :
% 0.21/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.54 Running first-order theorem proving
% 0.26/0.54 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
% 4.46/2.03 % (3990224)Detected a unit-equality problem, will run specialized UEQ schedule.
% 4.46/2.03 % (3990232)ott-1010_1_sfv=off:to=lpo:sil=8000:fdtod=off:sp=reverse_frequency:spb=goal_then_units:fd=preordered:random_seed=2811072572:i=136:bd=preordered:ins=2:av=off_2999 on theBenchmark for (2999ds/136Mi)
% 4.46/2.03 % (3990232)First to succeed.
% 4.46/2.03 % (3990232)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3990224"
% 4.46/2.03 % (3990230)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=3026161510:i=130792:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/130792Mi)
% 4.46/2.03 % (3990229)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=2884549404:i=138329:kws=inv_arity_squared:fgj=on:bd=preordered_2999 on theBenchmark for (2999ds/138329Mi)
% 4.46/2.03 % (3990231)lrs+10_1_ncem=casc2026/models/loop5.pt:sil=128000:tgt=ground:npcc=on:spb=goal_then_units:urr=ec_only:random_seed=4145581588:i=130716:gtgl=4:add=on:doe=on:bd=all:gtg=exists_sym_2999 on theBenchmark for (2999ds/130716Mi)
% 4.46/2.03 % (3990233)dis+10_14_to=lpo:sil=8000:tgt=full:drc=off:sp=const_frequency:sos=all:random_seed=2418615582:i=181:gtgl=5:bs=unit_only:fsr=off:gtg=exists_all_2999 on theBenchmark for (2999ds/181Mi)
% 4.46/2.03 % (3990233)Refutation not found, incomplete strategy
% 4.46/2.03 % (3990233)------------------------------
% 4.46/2.03 % (3990233)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/2.03 % (3990233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/2.03 % (3990233)CaDiCaL version: 2.1.3
% 4.46/2.03 % (3990233)Termination reason: Refutation not found, incomplete strategy
% 4.46/2.03 % (3990233)Time elapsed: 0.004 s
% 4.46/2.03 % (3990233)Peak memory usage: 88 MB
% 4.46/2.03 % (3990233)Instructions burned: 2 (million)
% 4.46/2.03 % (3990235)dis-1010_7_sil=8000:fde=unused:flr=on:random_seed=1962123983:i=1187:sd=4:av=off:ss=axioms:sgt=32_2999 on theBenchmark for (2999ds/1187Mi)
% 4.46/2.03 % (3990234)lrs+10_3_to=lpo:sil=64000:drc=off:fde=unused:sp=reverse_frequency:acc=on:bsr=on:fd=preordered:nwc=1:random_seed=1129629172:avsq=on:i=257:avsqr=16,3:bd=preordered:fsr=off_2999 on theBenchmark for (2999ds/257Mi)
% 4.46/2.03 % (3990234)Also succeeded, but the first one will report.
% 4.46/2.03 % (3990232)Refutation found. Thanks to Tanya!
% 4.46/2.03 % SZS status Unsatisfiable for theBenchmark
% 4.46/2.03 % SZS output start Proof for theBenchmark
% See solution above
% 4.46/2.03 % (3990232)------------------------------
% 4.46/2.03 % (3990232)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.46/2.03 % (3990232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.46/2.03 % (3990232)CaDiCaL version: 2.1.3
% 4.46/2.03 % (3990232)Termination reason: Refutation
% 4.46/2.03 % (3990232)Time elapsed: 0.015 s
% 4.46/2.03 % (3990232)Peak memory usage: 88 MB
% 4.46/2.03 % (3990232)Instructions burned: 26 (million)
% 4.46/2.03 % (3990232)------------------------------
% 4.46/2.03 % (3990232)------------------------------
% 4.46/2.03 % (3990224)Success in time 0.509 s
% 4.46/2.03 % Vampire exiting
%------------------------------------------------------------------------------