%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP131^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n001.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 : Wed Sep 30 08:10:49 AM UTC 2026
% Result : ContradictoryAxioms 1.14s 0.46s
% Output : Refutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 18 unt; 0 typ; 2 def)
% Number of atoms : 156 ( 59 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 415 ( 26 ~; 29 |; 1 &; 348 @)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 66 ( 63 usr; 7 con; 0-4 aty)
% Number of variables : 38 ( 0 sgn 38 !; 0 ?; 38 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
zero:
!>[X0: $tType] : $o ).
thf(func_def_1,type,
group_add:
!>[X0: $tType] : $o ).
thf(func_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
thf(func_def_3,type,
ab_group_add:
!>[X0: $tType] : $o ).
thf(func_def_4,type,
wellorder:
!>[X0: $tType] : $o ).
thf(func_def_5,type,
semigroup_add:
!>[X0: $tType] : $o ).
thf(func_def_6,type,
semigroup_mult:
!>[X0: $tType] : $o ).
thf(func_def_7,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
thf(func_def_8,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
thf(func_def_9,type,
comm_monoid_diff:
!>[X0: $tType] : $o ).
thf(func_def_10,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
thf(func_def_11,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
thf(func_def_12,type,
ordered_ab_group_add:
!>[X0: $tType] : $o ).
thf(func_def_13,type,
cancel1352612707id_add:
!>[X0: $tType] : $o ).
thf(func_def_14,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
thf(func_def_15,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
thf(func_def_16,type,
ordere779506340up_add:
!>[X0: $tType] : $o ).
thf(func_def_17,type,
canoni770627133id_add:
!>[X0: $tType] : $o ).
thf(func_def_18,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
thf(func_def_19,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
thf(func_def_20,type,
ordere623563068d_diff:
!>[X0: $tType] : $o ).
thf(func_def_21,type,
strict2144017051up_add:
!>[X0: $tType] : $o ).
thf(func_def_22,type,
ordere516151231imp_le:
!>[X0: $tType] : $o ).
thf(func_def_23,type,
minus_minus:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_24,type,
plus_plus:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_25,type,
times_times:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_26,type,
zero_zero:
!>[X0: $tType] : X0 ).
thf(func_def_27,type,
number2016821345itions: ( nat > nat ) > nat > $o ).
thf(func_def_28,type,
ord_less:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_29,type,
ord_less_eq:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_30,type,
i: nat ).
thf(func_def_31,type,
k: nat ).
thf(func_def_32,type,
n: nat ).
thf(func_def_33,type,
p: nat > nat ).
thf(func_def_37,type,
vLAM:
!>[X0: $tType,X1: $tType] : ( X1 > X0 > X1 ) ).
thf(func_def_38,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_39,type,
vIMP: $o > $o > $o ).
thf(func_def_40,type,
vAND: $o > $o > $o ).
thf(func_def_41,type,
vOR: $o > $o > $o ).
thf(func_def_42,type,
vNOT: $o > $o ).
thf(func_def_43,type,
db1:
!>[X0: $tType] : X0 ).
thf(func_def_44,type,
db0:
!>[X0: $tType] : X0 ).
thf(func_def_45,type,
vSIGMA:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_46,type,
vPI:
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_47,type,
db2:
!>[X0: $tType] : X0 ).
thf(func_def_48,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X1 > X0 ) > X1 ) ).
thf(func_def_49,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( X1 > $o ) > ( X1 > X0 ) > X1 ) ).
thf(func_def_50,type,
sK2:
!>[X0: $tType] : ( ( X0 > nat ) > ( X0 > $o ) > X0 ) ).
thf(func_def_51,type,
sK3: ( nat > $o ) > nat ).
thf(func_def_52,type,
sK4: ( nat > $o ) > nat ).
thf(func_def_53,type,
sK5: ( nat > $o ) > nat ).
thf(func_def_54,type,
sK6: nat > ( nat > $o ) > nat ).
thf(func_def_55,type,
sK7:
!>[X0: $tType] : ( X0 > X0 > X0 ) ).
thf(func_def_56,type,
sK8:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > nat ) > X0 ) ).
thf(func_def_57,type,
sK9:
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > nat ) > X0 ) ).
thf(func_def_58,type,
sK10: ( nat > $o ) > nat ).
thf(func_def_59,type,
sK11: ( nat > nat ) > nat ).
thf(func_def_60,type,
sK12: ( nat > nat ) > nat ).
thf(func_def_61,type,
sK13: nat > ( nat > $o ) > nat > nat ).
thf(func_def_62,type,
sK14: nat > ( nat > $o ) > nat > nat ).
thf(f3,axiom,
ord_less_eq @ nat @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) @ n,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_upper__bound) ).
thf(f4,axiom,
ord_less @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_lower__bound) ).
thf(f187,axiom,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
= ( ord_less @ nat @ X1 @ X0 ) )
| ( ord_less @ nat @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_186_nat__neq__iff) ).
thf(f190,axiom,
! [X0: nat,X1: nat] :
( ( ord_less_eq @ nat @ X0 @ X1 )
=> ( ( ord_less_eq @ nat @ X1 @ X0 )
=> ( X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_189_le__antisym) ).
thf(f236,axiom,
! [X0: nat,X1: nat] :
( ( ( X0 = X1 )
| ( ord_less @ nat @ X0 @ X1 ) )
=> ( ord_less_eq @ nat @ X0 @ X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_235_less__or__eq__imp__le) ).
thf(f280,plain,
ord_less_eq @ nat @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) @ n,
inference(rectify,[],[f3]) ).
thf(f281,plain,
( ( ord_less_eq @ nat @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) @ n )
= $true ),
inference(fool_elimination,[],[f280]) ).
thf(f282,plain,
ord_less @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ),
inference(rectify,[],[f4]) ).
thf(f283,plain,
( ( ord_less @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) )
= $true ),
inference(fool_elimination,[],[f282]) ).
thf(f596,plain,
! [X0: nat,X1: nat] :
( ( ( X0 != X1 )
= ( ord_less @ nat @ X1 @ X0 ) )
| ( ord_less @ nat @ X0 @ X1 ) ),
inference(rectify,[],[f187]) ).
thf(f597,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
= ( ( ord_less @ nat @ X0 @ X1 )
| ( ord_less @ nat @ X1 @ X0 ) ) ),
inference(fool_elimination,[],[f596]) ).
thf(f602,plain,
! [X0: nat,X1: nat] :
( ( ord_less_eq @ nat @ X0 @ X1 )
=> ( ( ord_less_eq @ nat @ X1 @ X0 )
=> ( X0 = X1 ) ) ),
inference(rectify,[],[f190]) ).
thf(f603,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less_eq @ nat @ X0 @ X1 )
= $true )
=> ( ( ( ord_less_eq @ nat @ X1 @ X0 )
= $true )
=> ( X0 = X1 ) ) ),
inference(fool_elimination,[],[f602]) ).
thf(f688,plain,
! [X0: nat,X1: nat] :
( ( ( X0 = X1 )
| ( ord_less @ nat @ X0 @ X1 ) )
=> ( ord_less_eq @ nat @ X0 @ X1 ) ),
inference(rectify,[],[f236]) ).
thf(f689,plain,
! [X0: nat,X1: nat] :
( ( ( X0 = X1 )
| ( ( ord_less @ nat @ X0 @ X1 )
= $true ) )
=> ( ( ord_less_eq @ nat @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f688]) ).
thf(f928,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( ord_less_eq @ nat @ X1 @ X0 )
!= $true )
| ( ( ord_less_eq @ nat @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f603]) ).
thf(f929,plain,
! [X0: nat,X1: nat] :
( ( X0 = X1 )
| ( ( ord_less_eq @ nat @ X1 @ X0 )
!= $true )
| ( ( ord_less_eq @ nat @ X0 @ X1 )
!= $true ) ),
inference(flattening,[],[f928]) ).
thf(f979,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less_eq @ nat @ X0 @ X1 )
= $true )
| ( ( X0 != X1 )
& ( ( ord_less @ nat @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f689]) ).
thf(f1008,plain,
( ( ord_less_eq @ nat @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) @ n )
= $true ),
inference(cnf_transformation,[],[f281]) ).
thf(f1009,plain,
( ( ord_less @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) )
= $true ),
inference(cnf_transformation,[],[f283]) ).
thf(f1197,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
= ( ( ord_less @ nat @ X0 @ X1 )
| ( ord_less @ nat @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f597]) ).
thf(f1203,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less_eq @ nat @ X1 @ X0 )
!= $true )
| ( X0 = X1 )
| ( ( ord_less_eq @ nat @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f929]) ).
thf(f1257,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less @ nat @ X0 @ X1 )
!= $true )
| ( ( ord_less_eq @ nat @ X0 @ X1 )
= $true ) ),
inference(cnf_transformation,[],[f979]) ).
thf(f1345,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( X0 != X1 ) )
| ( ( ( ord_less @ nat @ X0 @ X1 )
| ( ord_less @ nat @ X1 @ X0 ) )
= $false ) ),
inference(iff_proxy_clausification,[],[f1197]) ).
thf(f1350,plain,
! [X0: nat,X1: nat] :
( ( ( X0 = X1 )
= $false )
| ( ( ( ord_less @ nat @ X0 @ X1 )
| ( ord_less @ nat @ X1 @ X0 ) )
= $false ) ),
inference(not_proxy_clausification,[],[f1345]) ).
thf(f1351,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
| ( ( ( ord_less @ nat @ X0 @ X1 )
| ( ord_less @ nat @ X1 @ X0 ) )
= $false ) ),
inference(equality_proxy_clausification,[],[f1350]) ).
thf(f1352,plain,
! [X0: nat,X1: nat] :
( ( ( ord_less @ nat @ X1 @ X0 )
= $false )
| ( X0 != X1 ) ),
inference(or_proxy_clausification,[],[f1351]) ).
thf(f5127,plain,
( ( $true != $true )
| ( n
= ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) )
| ( $true
!= ( ord_less_eq @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ) ),
inference(constrained_superposition,[],[f1203,f1008]) ).
thf(f5181,plain,
( ( n
= ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) )
| ( $true
!= ( ord_less_eq @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ) ),
inference(trivial_inequality_removal,[],[f5127]) ).
thf(f5197,definition,
( spl15_39
<=> ( n
= ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ),
introduced(definition,[new_symbols(definition,[spl15_39])],[avatar_definition]) ).
thf(f5202,definition,
( spl15_40
<=> ( $true
= ( ord_less_eq @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ) ),
introduced(definition,[new_symbols(definition,[spl15_40])],[avatar_definition]) ).
thf(f5205,plain,
( ~ spl15_40
| spl15_39 ),
inference(avatar_split_clause,[],[f5181,f5197,f5202]) ).
thf(f5230,plain,
( ( $true != $true )
| ( $true
= ( ord_less_eq @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ) ),
inference(constrained_superposition,[],[f1257,f1009]) ).
thf(f5234,plain,
( ( $true = $false )
| ( n
!= ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ),
inference(constrained_superposition,[],[f1352,f1009]) ).
thf(f5270,plain,
( n
!= ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ),
inference(trivial_inequality_removal,[],[f5234]) ).
thf(f5274,plain,
( $true
= ( ord_less_eq @ nat @ n @ ( plus_plus @ nat @ ( times_times @ nat @ ( p @ i ) @ i ) @ ( times_times @ nat @ ( p @ k ) @ k ) ) ) ),
inference(trivial_inequality_removal,[],[f5230]) ).
thf(f5279,plain,
~ spl15_39,
inference(avatar_split_clause,[],[f5270,f5197]) ).
thf(f5280,plain,
spl15_40,
inference(avatar_split_clause,[],[f5274,f5202]) ).
cnf(s51,plain,
( spl15_39
| ~ spl15_40 ),
inference(sat_conversion,[],[f5205]) ).
cnf(s52,plain,
~ spl15_39,
inference(sat_conversion,[],[f5279]) ).
cnf(s53,plain,
spl15_40,
inference(sat_conversion,[],[f5280]) ).
cnf(s55,plain,
$false,
inference(rat,[],[s51,s53,s52]) ).
thf(f5284,plain,
$false,
inference(avatar_sat_refutation,[],[s55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP131^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18 % Computer : n001.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 20:04:06 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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
% 1.14/0.46 % (1742991)Will run a generic schedule for satisfiability detection.
% 1.14/0.46 % (1743001)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2472926950:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.14/0.46 % (1742997)% WARNING: option uhcvi not known.
% 1.14/0.46 % (1743000)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=160297700:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.14/0.46 % (1742996)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2216865116_2999 on theBenchmark for (2999ds/0Mi)
% 1.14/0.46 % (1742999)dis+10_1_sil=32000:sp=arity:random_seed=4233528451:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.14/0.46 % (1742998)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2276019056:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.14/0.46 % (1742997)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1372639416:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.14/0.46 % (1743000)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.14/0.46 % (1742997)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.14/0.46 % (1743002)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=772187410:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.14/0.46 % Exception at run slice level
% 1.14/0.46 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.14/0.46 % (1742997)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.14/0.46 % (1743001)Instruction limit reached!
% 1.14/0.46 % (1743001)------------------------------
% 1.14/0.46 % (1743001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1743001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1743001)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1743001)Termination reason: Instruction limit
% 1.14/0.46 % (1743001)Termination phase: Saturation
% 1.14/0.46 % (1743001)Time elapsed: 0.035 s
% 1.14/0.46 % (1743001)Peak memory usage: 13 MB
% 1.14/0.46 % (1743001)Instructions burned: 131 (million)
% 1.14/0.46 % (1743011)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3826299990:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.14/0.46 % (1743010)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3084754553:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.14/0.46 % (1742999)Instruction limit reached!
% 1.14/0.46 % (1742999)------------------------------
% 1.14/0.46 % (1742999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1742999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1742999)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1742999)Termination reason: Instruction limit
% 1.14/0.46 % (1742999)Termination phase: Saturation
% 1.14/0.46 % (1742999)Time elapsed: 0.048 s
% 1.14/0.46 % (1742999)Peak memory usage: 12 MB
% 1.14/0.46 % (1742999)Instructions burned: 103 (million)
% 1.14/0.46 % (1743000)Instruction limit reached!
% 1.14/0.46 % (1743000)------------------------------
% 1.14/0.46 % (1743000)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1743000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1743000)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1743000)Termination reason: Instruction limit
% 1.14/0.46 % (1743000)Termination phase: Saturation
% 1.14/0.46 % (1743000)Time elapsed: 0.054 s
% 1.14/0.46 % (1743000)Peak memory usage: 13 MB
% 1.14/0.46 % (1743000)Instructions burned: 116 (million)
% 1.14/0.46 % Exception at run slice level
% 1.14/0.46 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.14/0.46 % (1743014)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=1181568813:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 1.14/0.46 % (1743015)ott-21_1_sil=16000:fs=off:random_seed=683610091:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 1.14/0.46 % (1743011)Instruction limit reached!
% 1.14/0.46 % (1743011)------------------------------
% 1.14/0.46 % (1743011)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1743011)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1743011)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1743011)Termination reason: Instruction limit
% 1.14/0.46 % (1743011)Termination phase: Saturation
% 1.14/0.46 % (1743011)Time elapsed: 0.034 s
% 1.14/0.46 % (1743011)Peak memory usage: 13 MB
% 1.14/0.46 % (1743011)Instructions burned: 134 (million)
% 1.14/0.46 % (1743014)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.14/0.46 % (1743019)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=483575498:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 1.14/0.46 % (1743016)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1103797207:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.14/0.46 % (1743014)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 1.14/0.46 % Exception at run slice level
% 1.14/0.46 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.14/0.46 % (1743022)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3948780395:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 1.14/0.46 % (1743002)Instruction limit reached!
% 1.14/0.46 % (1743002)------------------------------
% 1.14/0.46 % (1743002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1743002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1743002)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1743002)Termination reason: Instruction limit
% 1.14/0.46 % (1743002)Termination phase: Saturation
% 1.14/0.46 % (1743002)Time elapsed: 0.104 s
% 1.14/0.46 % (1743002)Peak memory usage: 13 MB
% 1.14/0.46 % (1743002)Instructions burned: 161 (million)
% 1.14/0.46 % (1743024)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=2858335661:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 1.14/0.46 % (1743015)Instruction limit reached!
% 1.14/0.46 % (1743015)------------------------------
% 1.14/0.46 % (1743015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1743015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1743015)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1743015)Termination reason: Instruction limit
% 1.14/0.46 % (1743015)Termination phase: Saturation
% 1.14/0.46 % (1743015)Time elapsed: 0.077 s
% 1.14/0.46 % (1743015)Peak memory usage: 13 MB
% 1.14/0.46 % (1743015)Instructions burned: 181 (million)
% 1.14/0.46 % Exception at run slice level
% 1.14/0.46 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 1.14/0.46 % (1743026)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=3618010590: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)
% 1.14/0.46 % (1743026)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.14/0.46 % (1743027)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=496790773:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 1.14/0.46 % (1742997) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1742991-1742997"...
% 1.14/0.46 % (1743027)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 1.14/0.46 % (1742997)...printing done.
% 1.14/0.46 % (1742997)Refutation found. Thanks to Tanya!
% 1.14/0.46 % SZS status ContradictoryAxioms for theBenchmark
% 1.14/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 1.14/0.46 % (1742997)------------------------------
% 1.14/0.46 % (1742997)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.14/0.46 % (1742997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.14/0.46 % (1742997)CaDiCaL version: 2.1.3
% 1.14/0.46 % (1742997)Termination reason: Refutation
% 1.14/0.46 % (1742997)Time elapsed: 0.196 s
% 1.14/0.46 % (1742997)Peak memory usage: 15 MB
% 1.14/0.46 % (1742997)Instructions burned: 394 (million)
% 1.14/0.46 % (1742991)Success in time 0.243 s
% 1.14/0.46 % Vampire exiting
%------------------------------------------------------------------------------