%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM926_1 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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:11 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 7 |; 1 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 11 con; 0-2 aty)
% Number of variables : 20 ( 8 !; 12 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
int: $tType ).
tff(type_def_6,type,
nat: $tType ).
tff(func_def_0,type,
one_one_int: int ).
tff(func_def_1,type,
one_one_nat: nat ).
tff(func_def_2,type,
plus_plus_int: ( int * int ) > int ).
tff(func_def_3,type,
plus_plus_nat: ( nat * nat ) > nat ).
tff(func_def_4,type,
times_times_int: ( int * int ) > int ).
tff(func_def_5,type,
times_times_nat: ( nat * nat ) > nat ).
tff(func_def_6,type,
bit0: int > int ).
tff(func_def_7,type,
bit1: int > int ).
tff(func_def_8,type,
pls: int ).
tff(func_def_9,type,
number_number_of_int: int > int ).
tff(func_def_10,type,
number_number_of_nat: int > nat ).
tff(func_def_11,type,
power_power_int: ( int * nat ) > int ).
tff(func_def_12,type,
power_power_nat: ( nat * nat ) > nat ).
tff(func_def_13,type,
m: int ).
tff(func_def_14,type,
s: int ).
tff(func_def_15,type,
t: int ).
tff(func_def_16,type,
sK0: int ).
tff(func_def_17,type,
sK1: int ).
tff(func_def_18,type,
sK2: int ).
tff(func_def_19,type,
sK3: int ).
tff(func_def_20,type,
sK4: int ).
tff(pred_def_1,type,
zprime: int > $o ).
tff(pred_def_2,type,
ord_less_int: ( int * int ) > $o ).
tff(pred_def_3,type,
ord_less_nat: ( nat * nat ) > $o ).
tff(pred_def_4,type,
ord_less_eq_int: ( int * int ) > $o ).
tff(pred_def_5,type,
ord_less_eq_nat: ( nat * nat ) > $o ).
tff(pred_def_6,type,
twoSqu1431725154sum2sq: int > $o ).
tff(f1,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
tff(f2,axiom,
( ( t = one_one_int )
=> ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(f3,axiom,
( ord_less_int(one_one_int,t)
=> ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(f29,axiom,
! [X0: int,X1: int] :
( ord_less_int(X0,X1)
<=> ( ord_less_eq_int(X0,X1)
& ( X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_28_zless__le) ).
tff(f124,conjecture,
? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f125,negated_conjecture,
~ ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(negated_conjecture,[status(cth)],[f124]) ).
tff(f128,plain,
( ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ( one_one_int != t ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f129,plain,
( ? [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(ennf_transformation,[],[f3]) ).
tff(f143,plain,
! [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(ennf_transformation,[],[f125]) ).
tff(f144,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f1]) ).
tff(f145,plain,
( ( one_one_int != t )
| ( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ) ),
inference(cnf_transformation,[],[f128]) ).
tff(f146,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ) ),
inference(cnf_transformation,[],[f129]) ).
tff(f173,plain,
! [X0: int,X1: int] :
( ~ ord_less_eq_int(X0,X1)
| ( X0 = X1 )
| ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
tff(f300,plain,
! [X0: int,X1: int] : ( plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(cnf_transformation,[],[f143]) ).
tff(f347,plain,
~ ord_less_int(one_one_int,t),
inference(forward_subsumption_resolution,[],[f146,f300]) ).
tff(f348,plain,
one_one_int != t,
inference(forward_subsumption_resolution,[],[f145,f300]) ).
tff(f655,plain,
( ( one_one_int = t )
| ord_less_int(one_one_int,t) ),
inference(resolution,[],[f173,f144]) ).
tff(f667,plain,
ord_less_int(one_one_int,t),
inference(forward_subsumption_resolution,[],[f655,f348]) ).
tff(f668,plain,
$false,
inference(forward_subsumption_resolution,[],[f667,f347]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926_1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 % Computer : n020.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.40 % WCLimit : 300
% 0.11/0.40 % DateTime : Sun Sep 27 21:44:34 UTC 2026
% 0.11/0.40 % CPUTime :
% 0.11/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.43 Running first-order model finding
% 0.11/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.11/0.47 % (3784196)Will run a generic schedule for satisfiability detection.
% 0.11/0.47 % (3784205)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3335192781:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.47 % (3784202)% WARNING: option uhcvi not known.
% 0.11/0.47 % (3784201)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3487151677_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.47 % (3784202)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4057172706:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.47 % (3784203)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3732580907:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.47 % (3784204)dis+10_1_sil=32000:sp=arity:random_seed=959551750:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.47 % (3784207)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1000590890:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.47 % (3784206)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=444187381:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.47 % (3784205) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3784196-3784205"...
% 0.11/0.47 % (3784205)...printing done.
% 0.11/0.47 % (3784205)Refutation found. Thanks to Tanya!
% 0.11/0.47 % SZS status Theorem for theBenchmark
% 0.11/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.47 % (3784205)------------------------------
% 0.11/0.47 % (3784205)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.47 % (3784205)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.47 % (3784205)CaDiCaL version: 2.1.3
% 0.11/0.47 % (3784205)Termination reason: Refutation
% 0.11/0.47 % (3784205)Time elapsed: 0.008 s
% 0.11/0.47 % (3784205)Peak memory usage: 12 MB
% 0.11/0.47 % (3784205)Instructions burned: 23 (million)
% 0.11/0.47 % (3784196)Success in time 0.037 s
% 0.11/0.47 % Vampire exiting
%------------------------------------------------------------------------------