%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM926+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 : n019.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:13 PM UTC 2026
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 10 unt; 0 def)
% Number of atoms : 46 ( 25 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 42 ( 19 ~; 15 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 24 ( 12 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f28,axiom,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f29,axiom,
( t = one_one(int)
=> ? [X0,X1] : 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/sandbox2/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) ).
fof(f30,axiom,
( ord_less(int,one_one(int),t)
=> ? [X0,X1] : 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/sandbox2/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) ).
fof(f50,axiom,
! [X0,X1] :
( ord_less(int,X0,X1)
<=> ( ord_less_eq(int,X0,X1)
& X0 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_zless__le) ).
fof(f142,conjecture,
? [X0,X1] : 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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(f143,negated_conjecture,
~ ? [X0,X1] : 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)],[f142]) ).
fof(f164,plain,
( ? [X0,X1] : 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))
| t != one_one(int) ),
inference(ennf_transformation,[],[f29]) ).
fof(f165,plain,
( ? [X0,X1] : 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,[],[f30]) ).
fof(f215,plain,
! [X0,X1] : 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,[],[f143]) ).
fof(f222,plain,
( 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)))))
| t != one_one(int) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f164]) ).
fof(f223,plain,
( 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)))))
| ~ ord_less(int,one_one(int),t) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f165]) ).
fof(f225,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| ~ ord_less_eq(int,X0,X1)
| X0 = X1 )
& ( ( ord_less_eq(int,X0,X1)
& X0 != X1 )
| ~ ord_less(int,X0,X1) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f226,plain,
! [X0,X1] :
( ( ord_less(int,X0,X1)
| ~ ord_less_eq(int,X0,X1)
| X0 = X1 )
& ( ( ord_less_eq(int,X0,X1)
& X0 != X1 )
| ~ ord_less(int,X0,X1) ) ),
inference(flattening,[],[f225]) ).
fof(f293,plain,
ord_less_eq(int,one_one(int),t),
inference(cnf_transformation,[],[f28]) ).
fof(f294,plain,
( 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)))))
| t != one_one(int) ),
inference(cnf_transformation,[],[f222]) ).
fof(f295,plain,
( 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)))))
| ~ ord_less(int,one_one(int),t) ),
inference(cnf_transformation,[],[f223]) ).
fof(f317,plain,
! [X0,X1] :
( ~ ord_less_eq(int,X0,X1)
| ord_less(int,X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f226]) ).
fof(f444,plain,
! [X0,X1] : 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,[],[f215]) ).
fof(f460,plain,
~ ord_less(int,one_one(int),t),
inference(forward_subsumption_resolution,[],[f295,f444]) ).
fof(f461,plain,
t != one_one(int),
inference(forward_subsumption_resolution,[],[f294,f444]) ).
fof(f787,plain,
( ord_less(int,one_one(int),t)
| t = one_one(int) ),
inference(resolution,[],[f317,f293]) ).
fof(f817,plain,
t = one_one(int),
inference(forward_subsumption_resolution,[],[f787,f460]) ).
fof(f818,plain,
$false,
inference(forward_subsumption_resolution,[],[f817,f461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+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.12/0.38 % Computer : n019.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 21:44:49 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.18/0.47 % (3439438)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (3439448)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=43099566:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (3439444)% WARNING: option uhcvi not known.
% 0.18/0.47 % (3439446)dis+10_1_sil=32000:sp=arity:random_seed=551599386:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (3439443)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1795873977_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (3439444)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2605953853:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (3439445)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1556214081:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (3439447)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3668727466:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (3439449)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=707603945:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (3439448) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3439438-3439448"...
% 0.18/0.47 % (3439448)...printing done.
% 0.18/0.47 % (3439448)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Theorem for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (3439448)------------------------------
% 0.18/0.47 % (3439448)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (3439448)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (3439448)CaDiCaL version: 2.1.3
% 0.18/0.47 % (3439448)Termination reason: Refutation
% 0.18/0.47 % (3439448)Time elapsed: 0.009 s
% 0.18/0.47 % (3439448)Peak memory usage: 12 MB
% 0.18/0.47 % (3439448)Instructions burned: 25 (million)
% 0.18/0.47 % (3439438)Success in time 0.042 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------