%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:26:07 PM UTC 2026
% Result : Theorem 0.35s 0.56s
% Output : Refutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,axiom,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(f43,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
fof(f62,axiom,
! [X0] : number_number_of(int,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(f63,axiom,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(f102,axiom,
! [X0] : times_times(int,pls,X0) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(f136,axiom,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
fof(f137,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_97_zero__is__num__zero) ).
fof(f155,conjecture,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f156,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(negated_conjecture,[status(cth)],[f155]) ).
fof(f157,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(flattening,[],[f156]) ).
fof(f299,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(cnf_transformation,[],[f42]) ).
fof(f300,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),
inference(cnf_transformation,[],[f43]) ).
fof(f325,plain,
! [X0] : number_number_of(int,X0) = X0,
inference(cnf_transformation,[],[f62]) ).
fof(f326,plain,
! [X0,X1] : times_times(int,X0,X1) = times_times(int,X1,X0),
inference(cnf_transformation,[],[f63]) ).
fof(f388,plain,
! [X0] : pls = times_times(int,pls,X0),
inference(cnf_transformation,[],[f102]) ).
fof(f440,plain,
! [X0,X1] : plus_plus(int,X0,X1) = plus_plus(int,X1,X0),
inference(cnf_transformation,[],[f136]) ).
fof(f441,plain,
zero_zero(int) = number_number_of(int,pls),
inference(cnf_transformation,[],[f137]) ).
fof(f459,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(cnf_transformation,[],[f157]) ).
fof(f468,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),
inference(forward_demodulation,[],[f300,f440]) ).
fof(f469,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,zero_zero(int),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))),
inference(forward_demodulation,[],[f299,f326]) ).
fof(f482,plain,
plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,t,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(forward_demodulation,[],[f468,f326]) ).
fof(f483,plain,
ord_less(int,times_times(int,plus_plus(int,one_one(int),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m)),t),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m)))),
inference(forward_demodulation,[],[f469,f440]) ).
fof(f487,plain,
plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,t,plus_plus(int,one_one(int),times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m))),
inference(forward_demodulation,[],[f482,f440]) ).
fof(f488,plain,
ord_less(int,times_times(int,plus_plus(int,one_one(int),times_times(int,m,number_number_of(int,bit0(bit0(bit1(pls)))))),t),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,m,number_number_of(int,bit0(bit0(bit1(pls)))))))),
inference(forward_demodulation,[],[f483,f326]) ).
fof(f490,plain,
plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,number_number_of(int,bit0(bit0(bit1(pls))))))),
inference(forward_demodulation,[],[f487,f326]) ).
fof(f491,plain,
ord_less(int,times_times(int,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))),t),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))),
inference(forward_demodulation,[],[f488,f325]) ).
fof(f493,plain,
plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))) = times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))),
inference(forward_demodulation,[],[f490,f325]) ).
fof(f494,plain,
ord_less(int,times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))),
inference(forward_demodulation,[],[f491,f326]) ).
fof(f495,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))),
inference(forward_demodulation,[],[f494,f493]) ).
fof(f497,plain,
pls = zero_zero(int),
inference(superposition,[],[f325,f441]) ).
fof(f500,plain,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
inference(superposition,[],[f459,f497]) ).
fof(f501,plain,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(forward_demodulation,[],[f500,f440]) ).
fof(f2639,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),times_times(int,pls,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))),
inference(superposition,[],[f495,f497]) ).
fof(f2640,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(forward_demodulation,[],[f2639,f388]) ).
fof(f2645,plain,
$false,
inference(forward_subsumption_resolution,[],[f2640,f501]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40 % Computer : n014.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 21:41:17 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.44 Running first-order model finding
% 0.13/0.44 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.35/0.56 % (1197699)Will run a generic schedule for satisfiability detection.
% 0.35/0.56 % (1197704)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2816356068_2999 on theBenchmark for (2999ds/0Mi)
% 0.35/0.56 % (1197705)% WARNING: option uhcvi not known.
% 0.35/0.56 % (1197705)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3934736000:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.35/0.56 % (1197706)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3257885950:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.35/0.56 % (1197707)dis+10_1_sil=32000:sp=arity:random_seed=119548468:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.35/0.56 % (1197708)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1238153446:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.35/0.56 % (1197709)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3157147818:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.35/0.56 % (1197710)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1639464918:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.35/0.56 % TRYING [1]
% 0.35/0.56 % TRYING [2]
% 0.35/0.56 % TRYING [3]
% 0.35/0.56 % TRYING [4]
% 0.35/0.56 % (1197707)Instruction limit reached!
% 0.35/0.56 % (1197707)------------------------------
% 0.35/0.56 % (1197707)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.56 % (1197707)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.56 % (1197707)CaDiCaL version: 2.1.3
% 0.35/0.56 % (1197707)Termination reason: Instruction limit
% 0.35/0.56 % (1197707)Termination phase: Saturation
% 0.35/0.56 % (1197707)Time elapsed: 0.065 s
% 0.35/0.56 % (1197707)Peak memory usage: 12 MB
% 0.35/0.56 % (1197707)Instructions burned: 104 (million)
% 0.35/0.56 % (1197708) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1197699-1197708"...
% 0.35/0.56 % (1197708)...printing done.
% 0.35/0.56 % (1197708)Refutation found. Thanks to Tanya!
% 0.35/0.56 % SZS status Theorem for theBenchmark
% 0.35/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.56 % (1197708)------------------------------
% 0.35/0.56 % (1197708)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.56 % (1197708)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.56 % (1197708)CaDiCaL version: 2.1.3
% 0.35/0.56 % (1197708)Termination reason: Refutation
% 0.35/0.56 % (1197708)Time elapsed: 0.068 s
% 0.35/0.56 % (1197708)Peak memory usage: 13 MB
% 0.35/0.56 % (1197708)Instructions burned: 105 (million)
% 0.35/0.56 % (1197699)Success in time 0.113 s
% 0.35/0.56 % Vampire exiting
%------------------------------------------------------------------------------