%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : RNG039-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n012.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:49 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.41s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 49 ( 40 unt; 0 def)
% Number of atoms : 60 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 18 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : product(X0,X1,multiply(X0,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',closure_of_multiplication) ).
fof(f17,axiom,
! [X2,X3,X0,X1] :
( ~ product(X0,X1,X2)
| ~ product(X0,X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/RNG001-0.ax',multiplication_is_well_defined) ).
fof(f22,axiom,
! [X0] : add(X0,X0) = additive_identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause34) ).
fof(f23,plain,
! [X0] : additive_identity = add(X0,X0),
inference(reorient_equations,[],[f22]) ).
fof(f24,axiom,
! [X0] : multiply(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause35) ).
fof(f26,axiom,
multiply(b,a) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause37) ).
fof(f33,axiom,
! [X0,X1] : product(a,multiply(b,X0),multiply(X1,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause44) ).
fof(f46,axiom,
! [X0] : product(multiply(X0,b),a,multiply(X0,d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause57) ).
fof(f55,axiom,
product(add(b,a),b,add(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause68) ).
fof(f56,axiom,
product(add(b,a),a,add(d,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause69) ).
fof(f59,negated_conjecture,
product(a,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_b) ).
fof(f60,negated_conjecture,
product(b,a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a) ).
fof(f61,negated_conjecture,
c != d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_equals_d) ).
fof(f64,plain,
! [X0,X1] : ~ product(X0,X1,multiply(X0,X1)),
inference(consistent_polarity_flipping,[],[f3]) ).
fof(f78,plain,
! [X2,X3,X0,X1] :
( product(X0,X1,X3)
| product(X0,X1,X2)
| X2 = X3 ),
inference(consistent_polarity_flipping,[],[f17]) ).
fof(f88,plain,
! [X0,X1] : ~ product(a,multiply(b,X0),multiply(X1,X0)),
inference(consistent_polarity_flipping,[],[f33]) ).
fof(f101,plain,
! [X0] : ~ product(multiply(X0,b),a,multiply(X0,d)),
inference(consistent_polarity_flipping,[],[f46]) ).
fof(f110,plain,
~ product(add(b,a),b,add(b,c)),
inference(consistent_polarity_flipping,[],[f55]) ).
fof(f111,plain,
~ product(add(b,a),a,add(d,a)),
inference(consistent_polarity_flipping,[],[f56]) ).
fof(f114,plain,
~ product(a,b,c),
inference(consistent_polarity_flipping,[],[f59]) ).
fof(f115,plain,
~ product(b,a,d),
inference(consistent_polarity_flipping,[],[f60]) ).
fof(f130,plain,
! [X0] : ~ product(a,d,multiply(X0,a)),
inference(superposition,[],[f88,f26]) ).
fof(f131,plain,
! [X0] : ~ product(a,b,multiply(X0,b)),
inference(superposition,[],[f88,f24]) ).
fof(f147,plain,
~ product(a,b,b),
inference(superposition,[],[f131,f24]) ).
fof(f176,plain,
! [X2,X0,X1] :
( product(X0,X1,X2)
| multiply(X0,X1) = X2 ),
inference(resolution,[],[f78,f64]) ).
fof(f185,plain,
! [X0] :
( product(add(b,a),a,X0)
| add(d,a) = X0 ),
inference(resolution,[],[f78,f111]) ).
fof(f198,plain,
! [X0] :
( product(a,b,X0)
| c = X0 ),
inference(resolution,[],[f78,f114]) ).
fof(f202,plain,
! [X0] :
( product(b,a,X0)
| d = X0 ),
inference(resolution,[],[f78,f115]) ).
fof(f258,plain,
! [X0] : c = multiply(X0,b),
inference(resolution,[],[f198,f131]) ).
fof(f261,plain,
b = c,
inference(resolution,[],[f198,f147]) ).
fof(f290,plain,
b != d,
inference(superposition,[],[f61,f261]) ).
fof(f347,plain,
! [X0] : b = multiply(X0,b),
inference(forward_demodulation,[],[f258,f261]) ).
fof(f393,plain,
! [X0] : ~ product(b,a,multiply(X0,d)),
inference(superposition,[],[f101,f347]) ).
fof(f460,plain,
! [X0] : d = multiply(X0,d),
inference(resolution,[],[f393,f202]) ).
fof(f529,plain,
add(b,c) = multiply(add(b,a),b),
inference(resolution,[],[f176,f110]) ).
fof(f533,plain,
! [X0] : multiply(a,d) = multiply(X0,a),
inference(resolution,[],[f176,f130]) ).
fof(f579,plain,
! [X0] : d = multiply(X0,a),
inference(forward_demodulation,[],[f533,f460]) ).
fof(f580,plain,
b = add(b,c),
inference(forward_demodulation,[],[f529,f347]) ).
fof(f591,plain,
b = add(b,b),
inference(forward_demodulation,[],[f580,f261]) ).
fof(f610,plain,
a = d,
inference(superposition,[],[f579,f24]) ).
fof(f617,plain,
! [X0] : ~ product(X0,a,d),
inference(superposition,[],[f64,f579]) ).
fof(f655,plain,
a != b,
inference(superposition,[],[f290,f610]) ).
fof(f703,plain,
! [X0] : ~ product(X0,a,a),
inference(forward_demodulation,[],[f617,f610]) ).
fof(f786,plain,
additive_identity = b,
inference(superposition,[],[f591,f23]) ).
fof(f845,plain,
! [X0] :
( add(a,a) = X0
| product(add(b,a),a,X0) ),
inference(forward_demodulation,[],[f185,f610]) ).
fof(f846,plain,
! [X0] :
( additive_identity = X0
| product(add(b,a),a,X0) ),
inference(forward_demodulation,[],[f845,f23]) ).
fof(f847,plain,
! [X0] :
( product(add(b,a),a,X0)
| b = X0 ),
inference(forward_demodulation,[],[f846,f786]) ).
fof(f856,plain,
a = b,
inference(resolution,[],[f847,f703]) ).
fof(f862,plain,
$false,
inference(forward_subsumption_resolution,[],[f856,f655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : RNG039-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.33 % Computer : n012.cluster.edu
% 0.08/0.33 % Model : x86_64 x86_64
% 0.08/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.33 % Memory : 8046.5625MB
% 0.08/0.33 % OS : Linux 6.8.0-71-generic
% 0.08/0.33 % CPULimit : 300
% 0.08/0.33 % WCLimit : 300
% 0.08/0.33 % DateTime : Sun Sep 27 23:00:49 UTC 2026
% 0.11/0.34 % CPUTime :
% 0.11/0.34 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 Running first-order model finding
% 0.11/0.37 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.41 % (2858513)Will run a generic schedule for satisfiability detection.
% 0.11/0.41 % (2858519)% WARNING: option uhcvi not known.
% 0.11/0.41 % (2858524)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3094893959:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.41 % (2858519)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=592103:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.41 % (2858521)dis+10_1_sil=32000:sp=arity:random_seed=2535953260:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.41 % (2858518)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2440474873_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.41 % (2858522)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1004116980:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.41 % (2858520)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1320669672:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.41 % (2858523)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=380121691:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.41 % TRYING [1]
% 0.11/0.41 % TRYING [2]
% 0.11/0.41 % TRYING [3]
% 0.11/0.41 % (2858519) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2858513-2858519"...
% 0.11/0.41 % (2858519)...printing done.
% 0.11/0.41 % TRYING [4]
% 0.11/0.41 % (2858519)Refutation found. Thanks to Tanya!
% 0.11/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.41 % (2858519)------------------------------
% 0.11/0.41 % (2858519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.41 % (2858519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.41 % (2858519)CaDiCaL version: 2.1.3
% 0.11/0.41 % (2858519)Termination reason: Refutation
% 0.11/0.41 % (2858519)Time elapsed: 0.014 s
% 0.11/0.41 % (2858519)Peak memory usage: 11 MB
% 0.11/0.41 % (2858519)Instructions burned: 28 (million)
% 0.11/0.41 % (2858513)Success in time 0.038 s
% 0.11/0.41 % Vampire exiting
%------------------------------------------------------------------------------