%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG021-6 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:45 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 30 unt; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 11 ( 11 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 37 ( 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
fof(f2,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
fof(f9,axiom,
! [X0] : add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',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/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute2) ).
fof(f14,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
fof(f15,axiom,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',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/sandbox/benchmark/Axioms/RNG003-0.ax',associator) ).
fof(f20,negated_conjecture,
associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_linearised_form3) ).
fof(f21,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y))))),
inference(definition_unfolding,[],[f20,f18,f18,f18]) ).
fof(f39,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(additive_inverse(X0),X1)),
inference(superposition,[],[f15,f10]) ).
fof(f47,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(multiply(u,x),y),add(additive_inverse(multiply(u,multiply(x,y))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y)))))),
inference(superposition,[],[f21,f15]) ).
fof(f49,plain,
! [X0,X1] : additive_identity = add(X0,add(X1,additive_inverse(add(X0,X1)))),
inference(superposition,[],[f10,f15]) ).
fof(f51,plain,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
inference(superposition,[],[f14,f15]) ).
fof(f52,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),add(additive_inverse(multiply(v,multiply(x,y))),additive_inverse(multiply(u,multiply(x,y)))))),
inference(forward_demodulation,[],[f47,f51]) ).
fof(f54,plain,
! [X0,X1] : add(X0,add(additive_inverse(X0),X1)) = X1,
inference(forward_demodulation,[],[f39,f1]) ).
fof(f55,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),add(additive_inverse(multiply(u,multiply(x,y))),additive_inverse(multiply(v,multiply(x,y)))))),
inference(forward_demodulation,[],[f52,f14]) ).
fof(f162,plain,
! [X0,X1] : add(X0,additive_identity) = add(X1,additive_inverse(add(additive_inverse(X0),X1))),
inference(superposition,[],[f54,f49]) ).
fof(f163,plain,
! [X0,X1] : add(X1,additive_inverse(add(additive_inverse(X0),X1))) = X0,
inference(forward_demodulation,[],[f162,f2]) ).
fof(f196,plain,
! [X2,X3,X0,X1] : add(multiply(X0,X2),add(multiply(X1,X2),X3)) = add(multiply(add(X0,X1),X2),X3),
inference(superposition,[],[f15,f13]) ).
fof(f225,plain,
! [X0,X1] : add(X1,X0) = additive_inverse(add(additive_inverse(X0),additive_inverse(X1))),
inference(superposition,[],[f54,f163]) ).
fof(f957,plain,
! [X0,X1] : additive_inverse(add(X0,X1)) = add(additive_inverse(X1),additive_inverse(X0)),
inference(superposition,[],[f11,f225]) ).
fof(f1451,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),additive_inverse(add(multiply(v,multiply(x,y)),multiply(u,multiply(x,y)))))),
inference(superposition,[],[f55,f957]) ).
fof(f1493,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(add(multiply(u,x),multiply(v,x)),y),additive_inverse(add(multiply(v,multiply(x,y)),multiply(u,multiply(x,y))))),
inference(forward_demodulation,[],[f1451,f196]) ).
fof(f1519,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(add(multiply(u,x),multiply(v,x)),y),additive_inverse(add(multiply(u,multiply(x,y)),multiply(v,multiply(x,y))))),
inference(forward_demodulation,[],[f1493,f14]) ).
fof(f1540,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(multiply(add(multiply(u,x),multiply(v,x)),y),additive_inverse(multiply(add(u,v),multiply(x,y)))),
inference(forward_demodulation,[],[f1519,f13]) ).
fof(f1550,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(additive_inverse(multiply(add(u,v),multiply(x,y))),multiply(add(multiply(u,x),multiply(v,x)),y)),
inference(forward_demodulation,[],[f1540,f14]) ).
fof(f1555,plain,
add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(additive_inverse(multiply(add(u,v),multiply(x,y))),multiply(multiply(add(u,v),x),y)),
inference(forward_demodulation,[],[f1550,f13]) ).
fof(f1558,plain,
$false,
inference(forward_subsumption_resolution,[],[f1555,f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG021-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 22:59:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.49 % (2862412)Will run a generic schedule for satisfiability detection.
% 0.16/0.49 % (2862423)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2123510366:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49 % (2862418)% WARNING: option uhcvi not known.
% 0.16/0.49 % (2862419)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1441286011:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49 % (2862420)dis+10_1_sil=32000:sp=arity:random_seed=2513199169:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49 % (2862418)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1104996431:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49 % (2862421)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3185363961:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49 % (2862417)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2382900802_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49 % (2862422)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1199096949:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49 % TRYING [1]
% 0.16/0.49 % TRYING [2]
% 0.16/0.49 % TRYING [3]
% 0.16/0.49 % TRYING [4]
% 0.16/0.49 % (2862421) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2862412-2862421"...
% 0.16/0.49 % (2862422) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2862412-2862422"...
% 0.16/0.49 % (2862421)...printing done.
% 0.16/0.49 % (2862422)...printing done.
% 0.16/0.49 % (2862421)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (2862421)------------------------------
% 0.16/0.49 % (2862421)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49 % (2862421)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49 % (2862421)CaDiCaL version: 2.1.3
% 0.16/0.49 % (2862421)Termination reason: Refutation
% 0.16/0.49 % (2862421)Time elapsed: 0.034 s
% 0.16/0.49 % (2862421)Peak memory usage: 12 MB
% 0.16/0.49 % (2862421)Instructions burned: 56 (million)
% 0.16/0.49 % (2862412)Success in time 0.067 s
% 0.16/0.49 % Vampire exiting
%------------------------------------------------------------------------------