%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : COM040_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 : n026.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 09:40:12 AM UTC 2026
% Result : Theorem 4.06s 1.07s
% Output : Refutation 4.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 66 ( 60 unt; 0 typ; 11 def)
% Number of atoms : 72 ( 61 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 1 prp; 0-2 aty)
% Number of functors : 43 ( 43 usr; 22 con; 0-5 aty)
% Number of variables : 45 ( 45 !; 0 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
atom: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
div_mod:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
minus_minus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
plus_plus:
!>[X0: $tType] : fun(X0,fun(X0,X0)) ).
tff(func_def_4,type,
times_times:
!>[X0: $tType] : ( X0 > fun(X0,X0) ) ).
tff(func_def_5,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_6,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( fun(X0,fun(X1,X2)) > fun(list(X0),fun(list(X1),list(X2))) ) ).
tff(func_def_7,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_8,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_9,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_10,type,
dvd: ( int * int * list(int) ) > atom ).
tff(func_def_11,type,
c_PresArith_Oatom_OLe: ( int * list(int) ) > atom ).
tff(func_def_12,type,
nDvd: ( int * int * list(int) ) > atom ).
tff(func_def_13,type,
atom_case:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_14,type,
atom_rec:
!>[X0: $tType] : ( ( fun(int,fun(list(int),X0)) * fun(int,fun(int,fun(list(int),X0))) * fun(int,fun(int,fun(list(int),X0))) * atom ) > X0 ) ).
tff(func_def_15,type,
divisor: atom > int ).
tff(func_def_16,type,
hd_coeff: atom > int ).
tff(func_def_17,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_18,type,
fFalse: bool ).
tff(func_def_19,type,
fTrue: bool ).
tff(func_def_20,type,
a: atom ).
tff(func_def_21,type,
d: int ).
tff(func_def_22,type,
e: list(int) ).
tff(func_def_23,type,
i: int ).
tff(func_def_24,type,
j: int ).
tff(func_def_25,type,
ks: list(int) ).
tff(func_def_26,type,
ks1: list(int) ).
tff(func_def_27,type,
l: int ).
tff(func_def_28,type,
sK0: list(int) ).
tff(func_def_29,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_30,type,
sF2: fun(int,fun(int,int)) ).
tff(func_def_31,type,
sF3: fun(int,int) ).
tff(func_def_32,type,
sF4: fun(int,int) ).
tff(func_def_33,type,
sF5: int ).
tff(func_def_34,type,
sF6: int ).
tff(func_def_35,type,
sF7: int ).
tff(func_def_36,type,
sF8: int ).
tff(func_def_37,type,
sF9: fun(int,int) ).
tff(func_def_38,type,
sF10: int ).
tff(func_def_39,type,
sF11: int ).
tff(func_def_40,type,
sF12: int ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cl_Groups_Oplus:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
cl_Groups_Ominus:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
comm_ring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
comm_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
semiring_div:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
comm_monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
ab_sem1668676832m_mult:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_20,type,
i_Z: ( atom * list(int) ) > $o ).
tff(pred_def_21,type,
pp: bool > $o ).
tff(f1,axiom,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_assms_I3_J) ).
tff(f4,axiom,
a = nDvd(d,l,ks1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_NDvd) ).
tff(f12,axiom,
! [X0: $tType] :
( semiring_div(X0)
=> ! [X1: X0,X2: X0,X3: X0] : ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),div_mod(X0,X2,X1)),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_11_zmod__simps_I2_J) ).
tff(f22,axiom,
! [X0: list(int),X1: int,X2: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_21_divisor_Osimps_I3_J) ).
tff(f33,axiom,
! [X0: $tType] :
( comm_semiring_1(X0)
=> ! [X1: X0,X2: X0] : ( aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X2),X1) = aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
tff(f107,axiom,
comm_semiring_1(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Ocomm__semiring__1) ).
tff(f108,axiom,
semiring_div(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Divides_Osemiring__div) ).
tff(f124,conjecture,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),i),iprod(int,ks,e))),d) = div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f125,negated_conjecture,
( ( ~ div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),i),iprod(int,ks,e))),d) ) = div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d) ),
inference(negated_conjecture,[status(cth)],[f124]) ).
tff(f126,plain,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),i),iprod(int,ks,e))),d) != div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
inference(flattening,[],[f125]) ).
tff(f139,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] : ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),div_mod(X0,X2,X1)),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) )
| ~ semiring_div(X0) ),
inference(ennf_transformation,[],[f12]) ).
tff(f160,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] : ( aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X2),X1) = aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X1),X2) )
| ~ comm_semiring_1(X0) ),
inference(ennf_transformation,[],[f33]) ).
tff(f231,plain,
div_mod(int,i,divisor(a)) = div_mod(int,j,divisor(a)),
inference(cnf_transformation,[],[f1]) ).
tff(f234,plain,
a = nDvd(d,l,ks1),
inference(cnf_transformation,[],[f4]) ).
tff(f244,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( ~ semiring_div(X0)
| ( div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),X2),X1) = div_mod(X0,aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X3),div_mod(X0,X2,X1)),X1) ) ),
inference(cnf_transformation,[],[f139]) ).
tff(f257,plain,
! [X2: int,X0: list(int),X1: int] : ( divisor(nDvd(X2,X1,X0)) = X2 ),
inference(cnf_transformation,[],[f22]) ).
tff(f269,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ~ comm_semiring_1(X0)
| ( aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X2),X1) = aa(X0,X0,aa(X0,fun(X0,X0),plus_plus(X0),X1),X2) ) ),
inference(cnf_transformation,[],[f160]) ).
tff(f354,plain,
comm_semiring_1(int),
inference(cnf_transformation,[],[f107]) ).
tff(f355,plain,
semiring_div(int),
inference(cnf_transformation,[],[f108]) ).
tff(f371,plain,
div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),i),iprod(int,ks,e))),d) != div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),l),aa(int,int,aa(int,fun(int,int),plus_plus(int),j),iprod(int,ks,e))),d),
inference(cnf_transformation,[],[f126]) ).
tff(f392,definition,
sF2 = plus_plus(int),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
tff(f393,plain,
plus_plus(int) = sF2,
inference(reorient_equations,[],[f392]) ).
tff(f394,definition,
sF3 = aa(int,fun(int,int),sF2,l),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
tff(f395,plain,
aa(int,fun(int,int),sF2,l) = sF3,
inference(reorient_equations,[],[f394]) ).
tff(f396,definition,
sF4 = aa(int,fun(int,int),sF2,i),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
tff(f397,plain,
aa(int,fun(int,int),sF2,i) = sF4,
inference(reorient_equations,[],[f396]) ).
tff(f398,definition,
sF5 = iprod(int,ks,e),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
tff(f399,plain,
iprod(int,ks,e) = sF5,
inference(reorient_equations,[],[f398]) ).
tff(f400,definition,
sF6 = aa(int,int,sF4,sF5),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
tff(f401,plain,
aa(int,int,sF4,sF5) = sF6,
inference(reorient_equations,[],[f400]) ).
tff(f402,definition,
sF7 = aa(int,int,sF3,sF6),
introduced(definition,[new_symbols(definition,[sF7])],[function_definition]) ).
tff(f403,plain,
aa(int,int,sF3,sF6) = sF7,
inference(reorient_equations,[],[f402]) ).
tff(f404,definition,
sF8 = div_mod(int,sF7,d),
introduced(definition,[new_symbols(definition,[sF8])],[function_definition]) ).
tff(f405,plain,
div_mod(int,sF7,d) = sF8,
inference(reorient_equations,[],[f404]) ).
tff(f406,definition,
sF9 = aa(int,fun(int,int),sF2,j),
introduced(definition,[new_symbols(definition,[sF9])],[function_definition]) ).
tff(f407,plain,
aa(int,fun(int,int),sF2,j) = sF9,
inference(reorient_equations,[],[f406]) ).
tff(f408,definition,
sF10 = aa(int,int,sF9,sF5),
introduced(definition,[new_symbols(definition,[sF10])],[function_definition]) ).
tff(f409,plain,
aa(int,int,sF9,sF5) = sF10,
inference(reorient_equations,[],[f408]) ).
tff(f410,definition,
sF11 = aa(int,int,sF3,sF10),
introduced(definition,[new_symbols(definition,[sF11])],[function_definition]) ).
tff(f411,plain,
aa(int,int,sF3,sF10) = sF11,
inference(reorient_equations,[],[f410]) ).
tff(f412,definition,
sF12 = div_mod(int,sF11,d),
introduced(definition,[new_symbols(definition,[sF12])],[function_definition]) ).
tff(f413,plain,
div_mod(int,sF11,d) = sF12,
inference(reorient_equations,[],[f412]) ).
tff(f414,plain,
sF8 != sF12,
inference(definition_folding,[],[f371,f413,f411,f409,f399,f407,f393,f395,f393,f405,f403,f401,f399,f397,f393,f395,f393]) ).
tff(f415,plain,
divisor(a) = d,
inference(superposition,[],[f257,f234]) ).
tff(f416,plain,
sF12 = div_mod(int,sF11,divisor(a)),
inference(superposition,[],[f413,f415]) ).
tff(f417,plain,
sF8 = div_mod(int,sF7,divisor(a)),
inference(superposition,[],[f405,f415]) ).
tff(f616,plain,
! [X0: int,X1: int] : ( aa(int,int,aa(int,fun(int,int),plus_plus(int),X0),X1) = aa(int,int,aa(int,fun(int,int),plus_plus(int),X1),X0) ),
inference(resolution,[],[f269,f354]) ).
tff(f617,plain,
! [X0: int,X1: int] : ( aa(int,int,aa(int,fun(int,int),sF2,X0),X1) = aa(int,int,aa(int,fun(int,int),sF2,X1),X0) ),
inference(forward_demodulation,[],[f616,f393]) ).
tff(f758,plain,
! [X2: int,X0: int,X1: int] : ( div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X0),X1),X2) = div_mod(int,aa(int,int,aa(int,fun(int,int),plus_plus(int),X0),div_mod(int,X1,X2)),X2) ),
inference(resolution,[],[f244,f355]) ).
tff(f759,plain,
! [X2: int,X0: int,X1: int] : ( div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),X1),X2) = div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),div_mod(int,X1,X2)),X2) ),
inference(forward_demodulation,[],[f758,f393]) ).
tff(f1645,plain,
! [X0: int] : ( aa(int,int,sF4,X0) = aa(int,int,aa(int,fun(int,int),sF2,X0),i) ),
inference(superposition,[],[f617,f397]) ).
tff(f1646,plain,
! [X0: int] : ( aa(int,int,sF9,X0) = aa(int,int,aa(int,fun(int,int),sF2,X0),j) ),
inference(superposition,[],[f617,f407]) ).
tff(f3489,plain,
! [X0: int,X1: int] : ( div_mod(int,aa(int,int,sF3,X0),X1) = div_mod(int,aa(int,int,sF3,div_mod(int,X0,X1)),X1) ),
inference(superposition,[],[f759,f395]) ).
tff(f3509,plain,
! [X0: int] : ( div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),j),divisor(a)) = div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),div_mod(int,i,divisor(a))),divisor(a)) ),
inference(superposition,[],[f759,f231]) ).
tff(f3569,plain,
! [X0: int] : ( div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),j),divisor(a)) = div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),i),divisor(a)) ),
inference(forward_demodulation,[],[f3509,f759]) ).
tff(f3590,plain,
! [X0: int] : ( div_mod(int,aa(int,int,aa(int,fun(int,int),sF2,X0),j),divisor(a)) = div_mod(int,aa(int,int,sF4,X0),divisor(a)) ),
inference(forward_demodulation,[],[f3569,f1645]) ).
tff(f3600,plain,
! [X0: int] : ( div_mod(int,aa(int,int,sF4,X0),divisor(a)) = div_mod(int,aa(int,int,sF9,X0),divisor(a)) ),
inference(forward_demodulation,[],[f3590,f1646]) ).
tff(f8495,plain,
div_mod(int,aa(int,int,sF4,sF5),divisor(a)) = div_mod(int,sF10,divisor(a)),
inference(superposition,[],[f3600,f409]) ).
tff(f8546,plain,
div_mod(int,sF10,divisor(a)) = div_mod(int,sF6,divisor(a)),
inference(forward_demodulation,[],[f8495,f401]) ).
tff(f11061,plain,
div_mod(int,aa(int,int,sF3,sF10),divisor(a)) = div_mod(int,aa(int,int,sF3,div_mod(int,sF6,divisor(a))),divisor(a)),
inference(superposition,[],[f3489,f8546]) ).
tff(f11143,plain,
div_mod(int,aa(int,int,sF3,sF10),divisor(a)) = div_mod(int,aa(int,int,sF3,sF6),divisor(a)),
inference(forward_demodulation,[],[f11061,f3489]) ).
tff(f11193,plain,
div_mod(int,sF7,divisor(a)) = div_mod(int,aa(int,int,sF3,sF10),divisor(a)),
inference(forward_demodulation,[],[f11143,f403]) ).
tff(f11225,plain,
div_mod(int,sF11,divisor(a)) = div_mod(int,sF7,divisor(a)),
inference(forward_demodulation,[],[f11193,f411]) ).
tff(f11240,plain,
sF8 = div_mod(int,sF11,divisor(a)),
inference(forward_demodulation,[],[f11225,f417]) ).
tff(f12322,plain,
sF8 = sF12,
inference(superposition,[],[f416,f11240]) ).
tff(f12360,plain,
$false,
inference(forward_subsumption_resolution,[],[f12322,f414]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COM040_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n026.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 21:53:27 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 4.06/1.07 % (115225)Will run a generic schedule for satisfiability detection.
% 4.06/1.07 % (115233)dis+10_1_sil=32000:sp=arity:random_seed=3692534218:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.06/1.07 % (115231)% WARNING: option uhcvi not known.
% 4.06/1.07 % (115231)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2783115761:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.06/1.07 % (115230)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3148075469_2999 on theBenchmark for (2999ds/0Mi)
% 4.06/1.07 % (115232)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=558065414:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.06/1.07 % (115234)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3468383244:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.06/1.07 % (115235)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3480279979:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115236)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3599131876:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.06/1.07 % (115233)Instruction limit reached!
% 4.06/1.07 % (115233)------------------------------
% 4.06/1.07 % (115233)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115233)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115233)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115233)Termination reason: Instruction limit
% 4.06/1.07 % (115233)Termination phase: Saturation
% 4.06/1.07 % (115233)Time elapsed: 0.032 s
% 4.06/1.07 % (115233)Peak memory usage: 12 MB
% 4.06/1.07 % (115233)Instructions burned: 104 (million)
% 4.06/1.07 % (115244)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3892606730:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115245)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2950266409:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.06/1.07 % (115247)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=1441718160:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.06/1.07 % (115234)Instruction limit reached!
% 4.06/1.07 % (115234)------------------------------
% 4.06/1.07 % (115234)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115234)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115234)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115234)Termination reason: Instruction limit
% 4.06/1.07 % (115234)Termination phase: Saturation
% 4.06/1.07 % (115234)Time elapsed: 0.070 s
% 4.06/1.07 % (115234)Peak memory usage: 13 MB
% 4.06/1.07 % (115234)Instructions burned: 116 (million)
% 4.06/1.07 % (115245)Instruction limit reached!
% 4.06/1.07 % (115245)------------------------------
% 4.06/1.07 % (115245)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115245)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115245)Termination reason: Instruction limit
% 4.06/1.07 % (115245)Termination phase: Saturation
% 4.06/1.07 % (115245)Time elapsed: 0.045 s
% 4.06/1.07 % (115245)Peak memory usage: 13 MB
% 4.06/1.07 % (115245)Instructions burned: 133 (million)
% 4.06/1.07 % (115235)Instruction limit reached!
% 4.06/1.07 % (115235)------------------------------
% 4.06/1.07 % (115235)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115235)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115235)Termination reason: Instruction limit
% 4.06/1.07 % (115235)Termination phase: Saturation
% 4.06/1.07 % (115235)Time elapsed: 0.082 s
% 4.06/1.07 % (115235)Peak memory usage: 13 MB
% 4.06/1.07 % (115235)Instructions burned: 131 (million)
% 4.06/1.07 % (115251)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1035620580:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.06/1.07 % (115250)ott-21_1_sil=16000:fs=off:random_seed=638079795:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.06/1.07 % (115236)Instruction limit reached!
% 4.06/1.07 % (115236)------------------------------
% 4.06/1.07 % (115236)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115236)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115236)Termination reason: Instruction limit
% 4.06/1.07 % (115236)Termination phase: Saturation
% 4.06/1.07 % (115236)Time elapsed: 0.099 s
% 4.06/1.07 % (115236)Peak memory usage: 12 MB
% 4.06/1.07 % (115236)Instructions burned: 160 (million)
% 4.06/1.07 % (115253)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1242509058:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115260)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=508549811:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 4.06/1.07 % (115264)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3279935799:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115269)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=415768661:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2998 on theBenchmark for (2998ds/692Mi)
% 4.06/1.07 % (115250)Instruction limit reached!
% 4.06/1.07 % (115250)------------------------------
% 4.06/1.07 % (115250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115250)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115250)Termination reason: Instruction limit
% 4.06/1.07 % (115250)Termination phase: Saturation
% 4.06/1.07 % (115250)Time elapsed: 0.085 s
% 4.06/1.07 % (115250)Peak memory usage: 12 MB
% 4.06/1.07 % (115250)Instructions burned: 180 (million)
% 4.06/1.07 % (115281)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2492364515:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 4.06/1.07 % (115251)Instruction limit reached!
% 4.06/1.07 % (115251)------------------------------
% 4.06/1.07 % (115251)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115251)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115251)Termination reason: Instruction limit
% 4.06/1.07 % (115251)Termination phase: Saturation
% 4.06/1.07 % (115251)Time elapsed: 0.148 s
% 4.06/1.07 % (115251)Peak memory usage: 14 MB
% 4.06/1.07 % (115251)Instructions burned: 479 (million)
% 4.06/1.07 % (115306)fmb+10_1_sil=64000:random_seed=4222185237:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 4.06/1.07 % (115306)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115313)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1169061681:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115321)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=649368181:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115330)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3422302819:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 4.06/1.07 % (115247)Instruction limit reached!
% 4.06/1.07 % (115247)------------------------------
% 4.06/1.07 % (115247)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115247)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115247)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115247)Termination reason: Instruction limit
% 4.06/1.07 % (115247)Termination phase: Saturation
% 4.06/1.07 % (115247)Time elapsed: 0.325 s
% 4.06/1.07 % (115247)Peak memory usage: 16 MB
% 4.06/1.07 % (115247)Instructions burned: 686 (million)
% 4.06/1.07 % (115355)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3681102705:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 4.06/1.07 % (115355)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.06/1.07 % (115269)Instruction limit reached!
% 4.06/1.07 % (115269)------------------------------
% 4.06/1.07 % (115269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115269)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115269)Termination reason: Instruction limit
% 4.06/1.07 % (115269)Termination phase: Saturation
% 4.06/1.07 % (115269)Time elapsed: 0.362 s
% 4.06/1.07 % (115269)Peak memory usage: 16 MB
% 4.06/1.07 % (115269)Instructions burned: 693 (million)
% 4.06/1.07 % (115383)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=491107299:i=6324_2994 on theBenchmark for (2994ds/6324Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115388)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=2751652443:fmbsr=2.30978:i=2174_2994 on theBenchmark for (2994ds/2174Mi)
% 4.06/1.07 % Exception at run slice level
% 4.06/1.07 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.06/1.07 % (115396)ott-2_1_sil=16000:newcnf=on:random_seed=4293097304:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2993 on theBenchmark for (2993ds/869Mi)
% 4.06/1.07 % (115281)Instruction limit reached!
% 4.06/1.07 % (115281)------------------------------
% 4.06/1.07 % (115281)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115281)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115281)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115281)Termination reason: Instruction limit
% 4.06/1.07 % (115281)Termination phase: Saturation
% 4.06/1.07 % (115281)Time elapsed: 0.516 s
% 4.06/1.07 % (115281)Peak memory usage: 17 MB
% 4.06/1.07 % (115281)Instructions burned: 879 (million)
% 4.06/1.07 % (115427)ott+10_1_sil=32000:tgt=ground:random_seed=2365723617:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 4.06/1.07 % (115260) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-115225-115260"...
% 4.06/1.07 % (115260)...printing done.
% 4.06/1.07 % (115260)Refutation found. Thanks to Tanya!
% 4.06/1.07 % SZS status Theorem for theBenchmark
% 4.06/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 4.06/1.07 % (115260)------------------------------
% 4.06/1.07 % (115260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.06/1.07 % (115260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.06/1.07 % (115260)CaDiCaL version: 2.1.3
% 4.06/1.07 % (115260)Termination reason: Refutation
% 4.06/1.07 % (115260)Time elapsed: 0.665 s
% 4.06/1.07 % (115260)Peak memory usage: 22 MB
% 4.06/1.07 % (115260)Instructions burned: 1100 (million)
% 4.06/1.07 % (115225)Success in time 0.839 s
% 4.06/1.07 % Vampire exiting
%------------------------------------------------------------------------------