%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG008-3 : 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 : 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:42 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : add(additive_identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',left_identity) ).
fof(f4,axiom,
! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',distribute1) ).
fof(f5,axiom,
! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',distribute2) ).
fof(f8,axiom,
! [X0] : additive_inverse(additive_inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',additive_inverse_additive_inverse) ).
fof(f14,axiom,
! [X0,X1] : multiply(X0,additive_inverse(X1)) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse1) ).
fof(f15,axiom,
! [X0,X1] : multiply(additive_inverse(X0),X1) = additive_inverse(multiply(X0,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse2) ).
fof(f16,plain,
! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(additive_inverse(X0),X1),
inference(reorient_equations,[],[f15]) ).
fof(f17,axiom,
! [X2,X0,X1] : add(add(X0,X1),X2) = add(X0,add(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',associative_addition) ).
fof(f18,axiom,
! [X0,X1] : add(X0,X1) = add(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',commutative_addition) ).
fof(f20,axiom,
! [X0] : add(X0,additive_identity) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
fof(f21,axiom,
! [X0] : add(X0,additive_inverse(X0)) = additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_inverse) ).
fof(f22,plain,
! [X0] : additive_identity = add(X0,additive_inverse(X0)),
inference(reorient_equations,[],[f21]) ).
fof(f23,axiom,
! [X0] : multiply(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boolean_ring) ).
fof(f24,negated_conjecture,
multiply(a,b) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b_is_c) ).
fof(f25,negated_conjecture,
multiply(b,a) != c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutativity) ).
fof(f26,plain,
c != multiply(b,a),
inference(reorient_equations,[],[f25]) ).
fof(f43,plain,
! [X0] : additive_inverse(X0) = multiply(X0,additive_inverse(X0)),
inference(superposition,[],[f14,f23]) ).
fof(f81,plain,
! [X0] : additive_inverse(additive_inverse(X0)) = multiply(additive_inverse(X0),additive_inverse(X0)),
inference(superposition,[],[f16,f43]) ).
fof(f85,plain,
! [X0] : additive_inverse(X0) = additive_inverse(additive_inverse(X0)),
inference(forward_demodulation,[],[f81,f23]) ).
fof(f89,plain,
! [X0] : additive_inverse(X0) = X0,
inference(forward_demodulation,[],[f85,f8]) ).
fof(f145,plain,
! [X0] : additive_identity = add(X0,X0),
inference(superposition,[],[f22,f89]) ).
fof(f155,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(additive_inverse(X0),X1)),
inference(superposition,[],[f17,f22]) ).
fof(f168,plain,
! [X2,X0,X1] : add(X0,add(X1,X2)) = add(X2,add(X0,X1)),
inference(superposition,[],[f18,f17]) ).
fof(f173,plain,
! [X0,X1] : add(additive_identity,X1) = add(X0,add(X0,X1)),
inference(forward_demodulation,[],[f155,f89]) ).
fof(f176,plain,
! [X0,X1] : add(X0,add(X0,X1)) = X1,
inference(forward_demodulation,[],[f173,f1]) ).
fof(f250,plain,
! [X0,X1] : multiply(X0,add(X0,X1)) = add(X0,multiply(X0,X1)),
inference(superposition,[],[f4,f23]) ).
fof(f310,plain,
! [X0,X1] : multiply(add(X0,X1),X0) = add(X0,multiply(X1,X0)),
inference(superposition,[],[f5,f23]) ).
fof(f315,plain,
! [X0] : multiply(add(a,X0),b) = add(c,multiply(X0,b)),
inference(superposition,[],[f5,f24]) ).
fof(f478,plain,
multiply(add(a,b),b) = add(c,b),
inference(superposition,[],[f315,f23]) ).
fof(f495,plain,
multiply(add(a,b),b) = add(b,c),
inference(forward_demodulation,[],[f478,f18]) ).
fof(f1160,plain,
multiply(add(a,b),add(add(a,b),b)) = add(add(a,b),add(b,c)),
inference(superposition,[],[f250,f495]) ).
fof(f1211,plain,
multiply(add(a,b),add(add(a,b),b)) = add(c,add(add(a,b),b)),
inference(forward_demodulation,[],[f1160,f168]) ).
fof(f1236,plain,
multiply(add(a,b),add(add(a,b),b)) = add(b,add(c,add(a,b))),
inference(forward_demodulation,[],[f1211,f168]) ).
fof(f1250,plain,
multiply(add(a,b),add(add(a,b),b)) = add(b,add(b,add(c,a))),
inference(forward_demodulation,[],[f1236,f168]) ).
fof(f1257,plain,
add(c,a) = multiply(add(a,b),add(add(a,b),b)),
inference(forward_demodulation,[],[f1250,f176]) ).
fof(f1261,plain,
add(c,a) = multiply(add(a,b),add(b,add(a,b))),
inference(forward_demodulation,[],[f1257,f18]) ).
fof(f1262,plain,
add(c,a) = multiply(add(a,b),add(a,add(b,b))),
inference(forward_demodulation,[],[f1261,f168]) ).
fof(f1263,plain,
add(c,a) = multiply(add(a,b),add(a,additive_identity)),
inference(forward_demodulation,[],[f1262,f145]) ).
fof(f1264,plain,
add(c,a) = multiply(add(a,b),a),
inference(forward_demodulation,[],[f1263,f20]) ).
fof(f1265,plain,
add(a,c) = multiply(add(a,b),a),
inference(forward_demodulation,[],[f1264,f18]) ).
fof(f2137,plain,
add(a,add(a,c)) = multiply(add(a,add(a,b)),a),
inference(superposition,[],[f310,f1265]) ).
fof(f2140,plain,
multiply(b,a) = add(a,add(a,c)),
inference(forward_demodulation,[],[f2137,f176]) ).
fof(f2152,plain,
c = multiply(b,a),
inference(forward_demodulation,[],[f2140,f176]) ).
fof(f2162,plain,
$false,
inference(forward_subsumption_resolution,[],[f2152,f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG008-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n026.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 23:01:26 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.43 Running first-order model finding
% 0.12/0.43 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.18/0.50 % (3311030)Will run a generic schedule for satisfiability detection.
% 0.18/0.50 % (3311039)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=353685023:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.50 % (3311036)% WARNING: option uhcvi not known.
% 0.18/0.50 % (3311036)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2775455669:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.50 % (3311035)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4097111702_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.50 % (3311040)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3194843279:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.50 % (3311037)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2203541840:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.50 % (3311038)dis+10_1_sil=32000:sp=arity:random_seed=1715345432:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.50 % (3311041)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=102056382:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.50 % TRYING [1]
% 0.18/0.50 % TRYING [2]
% 0.18/0.50 % TRYING [3]
% 0.18/0.50 % TRYING [4]
% 0.18/0.50 % (3311039) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3311030-3311039"...
% 0.18/0.50 % (3311039)...printing done.
% 0.18/0.50 % (3311039)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (3311039)------------------------------
% 0.18/0.50 % (3311039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.50 % (3311039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.50 % (3311039)CaDiCaL version: 2.1.3
% 0.18/0.50 % (3311039)Termination reason: Refutation
% 0.18/0.50 % (3311039)Time elapsed: 0.021 s
% 0.18/0.50 % (3311039)Peak memory usage: 12 MB
% 0.18/0.50 % (3311039)Instructions burned: 63 (million)
% 0.18/0.50 % (3311030)Success in time 0.059 s
% 0.18/0.50 % Vampire exiting
%------------------------------------------------------------------------------