%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM973_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:19 PM UTC 2026
% Result : Theorem 0.17s 0.55s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 47 unt; 0 typ; 0 def)
% Number of atoms : 71 ( 54 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 32 ( 20 ~; 9 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-4 aty)
% Number of variables : 53 ( 49 !; 4 ?; 53 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
real: $tType ).
tff(type_def_9,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
min: int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
power_power:
!>[X0: $tType] : ( ( X0 * nat ) > X0 ) ).
tff(func_def_9,type,
product_Pair:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > product_prod(X0,X1) ) ).
tff(func_def_10,type,
twoSqu196287499sum2sq: product_prod(int,int) > int ).
tff(func_def_11,type,
fFalse: bool ).
tff(func_def_12,type,
fTrue: bool ).
tff(func_def_13,type,
m: int ).
tff(func_def_14,type,
s1: int ).
tff(func_def_15,type,
s: int ).
tff(func_def_16,type,
t: int ).
tff(func_def_17,type,
sK0: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
zcong: ( int * int * int ) > $o ).
tff(pred_def_12,type,
zprime: int > $o ).
tff(pred_def_13,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
dvd_dvd:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_15,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_16,type,
pp: bool > $o ).
tff(f1,axiom,
t = one_one(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__096t_A_061_A1_096) ).
tff(f12,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/sandbox/benchmark/theBenchmark.p',fact_11_t) ).
tff(f46,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_45_number__of__is__id) ).
tff(f48,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_47_add__Pls__right) ).
tff(f50,axiom,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_49_Bit0__def) ).
tff(f59,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_58_Bit1__def) ).
tff(f63,axiom,
! [X0: $tType] :
( number_ring(X0)
=> ! [X1: X0] : ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__numeral__1__right) ).
tff(f65,axiom,
! [X0: $tType] :
( number_ring(X0)
=> ( one_one(X0) = number_number_of(X0,bit1(pls)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_64_semiring__norm_I110_J) ).
tff(f81,axiom,
! [X0: $tType] :
( monoid_mult(X0)
=> ! [X1: nat] : ( power_power(X0,one_one(X0),X1) = one_one(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_80_power__one) ).
tff(f82,axiom,
twoSqu196287499sum2sq(product_Pair(int,int,s,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/sandbox/benchmark/theBenchmark.p',fact_81__096sum2sq_A_Is_M_A1_J_A_061_A_I4_A_K_Am_A_L_A1_J_A_K_At_096) ).
tff(f103,axiom,
monoid_mult(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Omonoid__mult) ).
tff(f106,axiom,
number_ring(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Int_Onumber__ring) ).
tff(f128,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(f129,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)],[f128]) ).
tff(f163,plain,
! [X0: $tType] :
( ! [X1: X0] : ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f63]) ).
tff(f165,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,bit1(pls)) )
| ~ number_ring(X0) ),
inference(ennf_transformation,[],[f65]) ).
tff(f176,plain,
! [X0: $tType] :
( ! [X1: nat] : ( power_power(X0,one_one(X0),X1) = one_one(X0) )
| ~ monoid_mult(X0) ),
inference(ennf_transformation,[],[f81]) ).
tff(f186,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(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))))) ),
inference(ennf_transformation,[],[f129]) ).
tff(f204,plain,
t = one_one(int),
inference(cnf_transformation,[],[f1]) ).
tff(f214,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,[],[f12]) ).
tff(f253,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f46]) ).
tff(f255,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f48]) ).
tff(f257,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f50]) ).
tff(f266,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f59]) ).
tff(f270,plain,
! [X0: $tType,X1: X0] :
( ( times_times(X0,X1,number_number_of(X0,bit1(pls))) = X1 )
| ~ number_ring(X0) ),
inference(cnf_transformation,[],[f163]) ).
tff(f272,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,bit1(pls)) )
| ~ number_ring(X0) ),
inference(cnf_transformation,[],[f165]) ).
tff(f288,plain,
! [X0: $tType,X1: nat] :
( ~ monoid_mult(X0)
| ( one_one(X0) = power_power(X0,one_one(X0),X1) ) ),
inference(cnf_transformation,[],[f176]) ).
tff(f289,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t) = twoSqu196287499sum2sq(product_Pair(int,int,s,one_one(int))),
inference(cnf_transformation,[],[f82]) ).
tff(f320,plain,
monoid_mult(int),
inference(cnf_transformation,[],[f103]) ).
tff(f323,plain,
number_ring(int),
inference(cnf_transformation,[],[f106]) ).
tff(f345,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(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))))) ),
inference(cnf_transformation,[],[f186]) ).
tff(f355,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)),
inference(definition_unfolding,[],[f214,f257,f257,f266,f257,f266]) ).
tff(f385,plain,
! [X0: $tType,X1: X0] :
( ( times_times(X0,X1,number_number_of(X0,plus_plus(int,plus_plus(int,one_one(int),pls),pls))) = X1 )
| ~ number_ring(X0) ),
inference(definition_unfolding,[],[f270,f266]) ).
tff(f387,plain,
! [X0: $tType] :
( ( one_one(X0) = number_number_of(X0,plus_plus(int,plus_plus(int,one_one(int),pls),pls)) )
| ~ number_ring(X0) ),
inference(definition_unfolding,[],[f272,f266]) ).
tff(f403,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,one_one(int))) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t),
inference(definition_unfolding,[],[f289,f257,f257,f266]) ).
tff(f421,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))) ),
inference(definition_unfolding,[],[f345,f257,f257,f266,f257,f266,f257,f266]) ).
tff(f429,plain,
! [X0: $tType,X1: X0] :
( ~ number_ring(X0)
| ( times_times(X0,X1,one_one(X0)) = X1 ) ),
inference(forward_subsumption_demodulation,[],[f385,f387]) ).
tff(f446,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,one_one(int))) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),m),one_one(int)),t),
inference(backward_demodulation,[],[f403,f255]) ).
tff(f452,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls))))) ),
inference(backward_demodulation,[],[f421,f255]) ).
tff(f465,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),m),one_one(int)),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)))),one_one(int)),
inference(forward_demodulation,[],[f355,f255]) ).
tff(f485,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,one_one(int),one_one(int)),plus_plus(int,one_one(int),one_one(int)))),m),one_one(int)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))),power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),one_one(int))))) ),
inference(forward_demodulation,[],[f452,f255]) ).
tff(f491,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)))),m),t),t),
inference(forward_demodulation,[],[f446,f204]) ).
tff(f519,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)))),m),t),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)))),t),
inference(forward_demodulation,[],[f465,f204]) ).
tff(f527,plain,
! [X0: int,X1: int] : ( plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t))),m),t) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,t,t))),power_power(int,X1,number_number_of(nat,plus_plus(int,t,t)))) ),
inference(forward_demodulation,[],[f485,f204]) ).
tff(f533,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls)),plus_plus(int,plus_plus(int,t,pls),plus_plus(int,t,pls))),m),t),t),
inference(forward_demodulation,[],[f491,f253]) ).
tff(f558,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t))),m),t),t) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t),
inference(forward_demodulation,[],[f519,f255]) ).
tff(f565,plain,
! [X0: int,X1: int] : ( plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,t,t))),power_power(int,X1,number_number_of(nat,plus_plus(int,t,t)))) != plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t) ),
inference(forward_demodulation,[],[f527,f253]) ).
tff(f566,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),t),
inference(forward_demodulation,[],[f533,f255]) ).
tff(f572,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t) = times_times(int,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),t),
inference(forward_demodulation,[],[f558,f253]) ).
tff(f576,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) = plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,t,t))),t),
inference(forward_demodulation,[],[f572,f566]) ).
tff(f585,plain,
! [X0: int] : ( times_times(int,X0,one_one(int)) = X0 ),
inference(resolution,[],[f429,f323]) ).
tff(f587,plain,
! [X0: int] : ( times_times(int,X0,t) = X0 ),
inference(forward_demodulation,[],[f585,f204]) ).
tff(f588,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) = plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,t,t),plus_plus(int,t,t)),m),t),
inference(backward_demodulation,[],[f566,f587]) ).
tff(f591,plain,
! [X0: int,X1: int] : ( twoSqu196287499sum2sq(product_Pair(int,int,s,t)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,t,t))),power_power(int,X1,number_number_of(nat,plus_plus(int,t,t)))) ),
inference(backward_demodulation,[],[f565,f588]) ).
tff(f605,plain,
! [X0: nat] : ( one_one(int) = power_power(int,one_one(int),X0) ),
inference(resolution,[],[f288,f320]) ).
tff(f608,plain,
! [X0: nat] : ( t = power_power(int,t,X0) ),
inference(forward_demodulation,[],[f605,f204]) ).
tff(f609,plain,
! [X0: int] : ( twoSqu196287499sum2sq(product_Pair(int,int,s,t)) != plus_plus(int,power_power(int,X0,number_number_of(nat,plus_plus(int,t,t))),t) ),
inference(superposition,[],[f591,f608]) ).
tff(f923,plain,
twoSqu196287499sum2sq(product_Pair(int,int,s,t)) != twoSqu196287499sum2sq(product_Pair(int,int,s,t)),
inference(superposition,[],[f609,f576]) ).
tff(f924,plain,
$false,
inference(trivial_inequality_removal,[],[f923]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM973_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n016.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 21:53:48 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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.17/0.55 % (3025200)Will run a generic schedule for satisfiability detection.
% 0.17/0.55 % (3025211)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=809978724:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.55 % (3025207)% WARNING: option uhcvi not known.
% 0.17/0.55 % (3025208)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4174352997:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.55 % (3025207)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1366420832:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.55 % (3025206)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=279217432_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.55 % (3025210)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=696115413:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.55 % (3025209)dis+10_1_sil=32000:sp=arity:random_seed=925366115:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.55 % (3025212)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1022050673:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.55 % Exception at run slice level
% 0.17/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.55 % (3025223)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1664737861:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.55 % Exception at run slice level
% 0.17/0.55 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.55 % (3025211)Instruction limit reached!
% 0.17/0.55 % (3025211)------------------------------
% 0.17/0.55 % (3025211)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.55 % (3025211)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.55 % (3025211)CaDiCaL version: 2.1.3
% 0.17/0.55 % (3025211)Termination reason: Instruction limit
% 0.17/0.55 % (3025211)Termination phase: Saturation
% 0.17/0.55 % (3025211)Time elapsed: 0.037 s
% 0.17/0.55 % (3025211)Peak memory usage: 13 MB
% 0.17/0.55 % (3025211)Instructions burned: 135 (million)
% 0.17/0.55 % (3025234)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=1766638032:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.17/0.55 % (3025233)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1707247821:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.55 % (3025209)Instruction limit reached!
% 0.17/0.55 % (3025209)------------------------------
% 0.17/0.55 % (3025209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.55 % (3025209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.55 % (3025209)CaDiCaL version: 2.1.3
% 0.17/0.55 % (3025209)Termination reason: Instruction limit
% 0.17/0.55 % (3025209)Termination phase: Saturation
% 0.17/0.55 % (3025209)Time elapsed: 0.055 s
% 0.17/0.55 % (3025209)Peak memory usage: 12 MB
% 0.17/0.55 % (3025209)Instructions burned: 103 (million)
% 0.17/0.55 % (3025210)Instruction limit reached!
% 0.17/0.55 % (3025210)------------------------------
% 0.17/0.55 % (3025210)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.55 % (3025210)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.55 % (3025210)CaDiCaL version: 2.1.3
% 0.17/0.55 % (3025210)Termination reason: Instruction limit
% 0.17/0.55 % (3025210)Termination phase: Saturation
% 0.17/0.55 % (3025210)Time elapsed: 0.063 s
% 0.17/0.55 % (3025210)Peak memory usage: 12 MB
% 0.17/0.55 % (3025210)Instructions burned: 117 (million)
% 0.17/0.55 % (3025244)ott-21_1_sil=16000:fs=off:random_seed=2756718390:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.17/0.55 % (3025246)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2001175887:i=477:bd=all_2999 on theBenchmark for (2999ds/477Mi)
% 0.17/0.55 % (3025233) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3025200-3025233"...
% 0.17/0.55 % (3025212)Instruction limit reached!
% 0.17/0.55 % (3025212)------------------------------
% 0.17/0.55 % (3025212)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.55 % (3025212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.55 % (3025212)CaDiCaL version: 2.1.3
% 0.17/0.55 % (3025212)Termination reason: Instruction limit
% 0.17/0.55 % (3025212)Termination phase: Saturation
% 0.17/0.55 % (3025212)Time elapsed: 0.085 s
% 0.17/0.55 % (3025212)Peak memory usage: 13 MB
% 0.17/0.55 % (3025212)Instructions burned: 161 (million)
% 0.17/0.55 % (3025233)...printing done.
% 0.17/0.55 % (3025233)Refutation found. Thanks to Tanya!
% 0.17/0.55 % SZS status Theorem for theBenchmark
% 0.17/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.55 % (3025233)------------------------------
% 0.17/0.55 % (3025233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.55 % (3025233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.55 % (3025233)CaDiCaL version: 2.1.3
% 0.17/0.55 % (3025233)Termination reason: Refutation
% 0.17/0.55 % (3025233)Time elapsed: 0.040 s
% 0.17/0.55 % (3025233)Peak memory usage: 12 MB
% 0.17/0.55 % (3025233)Instructions burned: 64 (million)
% 0.17/0.55 % (3025200)Success in time 0.114 s
% 0.17/0.55 % Vampire exiting
%------------------------------------------------------------------------------