%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL836_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 12:00:48 PM UTC 2026
% Result : Theorem 2.25s 1.00s
% Output : Refutation 2.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 2 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 29 ~; 21 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 80 ( 80 usr; 22 con; 0-6 aty)
% Number of variables : 44 ( 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
type: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_12,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_13,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_14,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_15,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_16,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_17,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_22,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_25,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
t1: type ).
tff(func_def_31,type,
t_a: type ).
tff(func_def_32,type,
t: type ).
tff(func_def_33,type,
a: dB ).
tff(func_def_34,type,
as: list(dB) ).
tff(func_def_35,type,
e: fun(nat,type) ).
tff(func_def_36,type,
ea: fun(nat,type) ).
tff(func_def_37,type,
i: nat ).
tff(func_def_38,type,
ia: nat ).
tff(func_def_39,type,
r: dB ).
tff(func_def_40,type,
t2: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK0: ( dB * dB ) > dB ).
tff(func_def_44,type,
sK1: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK2: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK3: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_47,type,
sK4: ( dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK5: ( dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK6: ( dB * dB * dB ) > dB ).
tff(func_def_50,type,
sK7: ( dB * dB * dB ) > dB ).
tff(func_def_51,type,
sK8: ( dB * dB * dB ) > dB ).
tff(func_def_52,type,
sK9: dB > dB ).
tff(func_def_53,type,
sK10: dB > dB ).
tff(func_def_54,type,
sK11: dB > list(dB) ).
tff(func_def_55,type,
sK12: dB > dB ).
tff(func_def_56,type,
sK13: dB > list(dB) ).
tff(func_def_57,type,
sK14: dB > nat ).
tff(func_def_58,type,
sK15:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK16:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_60,type,
sK17:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_61,type,
sK18: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_62,type,
sK19: ( dB * list(dB) * dB ) > dB ).
tff(func_def_63,type,
sK20: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_64,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_65,type,
sK22: ( dB * list(dB) * dB ) > dB ).
tff(func_def_66,type,
sK23: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_67,type,
sK24:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_68,type,
sK25:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_69,type,
sK26:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_70,type,
sK27: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_71,type,
sK28: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_72,type,
sK29: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_73,type,
sK30: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_74,type,
sK31:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_75,type,
sK32:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_76,type,
sK33:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_77,type,
sK34:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(f3,axiom,
pp(aa(dB,bool,it,u)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_uIT) ).
tff(f5,axiom,
pp(aa(type,bool,typing(e,u),t)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_uT) ).
tff(f7,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),t1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6__096e_060i_058T_062_A_092_060turnstile_062_Ar_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_A_058_AT_H_096) ).
tff(f13,axiom,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1))
=> ( pp(aa(dB,bool,it,X0))
=> ( pp(aa(type,bool,typing(X3,X0),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_12_SI1) ).
tff(f104,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f112,conjecture,
pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f113,negated_conjecture,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(negated_conjecture,[status(cth)],[f112]) ).
tff(f116,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(flattening,[],[f113]) ).
tff(f117,plain,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2)))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1)) ),
inference(ennf_transformation,[],[f13]) ).
tff(f118,plain,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2)))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1)) ),
inference(flattening,[],[f117]) ).
tff(f176,plain,
pp(aa(dB,bool,it,u)),
inference(cnf_transformation,[],[f3]) ).
tff(f178,plain,
pp(aa(type,bool,typing(e,u),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f180,plain,
pp(aa(type,bool,typing(shift(type,e,i,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),t1)),
inference(cnf_transformation,[],[f7]) ).
tff(f189,plain,
! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2))) ),
inference(cnf_transformation,[],[f118]) ).
tff(f346,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f104]) ).
tff(f354,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(cnf_transformation,[],[f116]) ).
tff(f1067,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),i),u))),
inference(superposition,[],[f354,f346]) ).
tff(f1091,plain,
~ pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),i),u))),
inference(forward_demodulation,[],[f1067,f346]) ).
tff(f3009,plain,
pp(aa(type,bool,typing(shift(type,e,i,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),t1)),
inference(forward_demodulation,[],[f180,f346]) ).
tff(f8494,plain,
! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X1))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2))) ),
inference(forward_demodulation,[],[f189,f346]) ).
tff(f8495,plain,
! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
( pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X2),X0)))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X1))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(X3,X0),t)) ),
inference(forward_demodulation,[],[f8494,f346]) ).
tff(f8496,plain,
! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
( pp(aa(dB,bool,it,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X2),X0)))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X1))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(X3,X0),t)) ),
inference(forward_demodulation,[],[f8495,f346]) ).
tff(f8497,plain,
! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X0,i,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X1))
| ~ pp(aa(dB,bool,it,u))
| ~ pp(aa(type,bool,typing(X0,u),t)) ),
inference(resolution,[],[f8496,f1091]) ).
tff(f8532,plain,
! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X0,i,t),foldl(dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,r),zero_zero(nat)),a),as)),X1))
| ~ pp(aa(type,bool,typing(X0,u),t)) ),
inference(forward_subsumption_resolution,[],[f8497,f176]) ).
tff(f8539,plain,
~ pp(aa(type,bool,typing(e,u),t)),
inference(resolution,[],[f8532,f3009]) ).
tff(f8578,plain,
$false,
inference(forward_subsumption_resolution,[],[f8539,f178]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL836_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.12/0.38 % Computer : n026.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 17:01:56 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/0.41 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
% 2.25/1.00 % (3064113)Will run a generic schedule for satisfiability detection.
% 2.25/1.00 % (3064122)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3295126653:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 2.25/1.00 % (3064119)% WARNING: option uhcvi not known.
% 2.25/1.00 % (3064118)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3626103399_2999 on theBenchmark for (2999ds/0Mi)
% 2.25/1.00 % (3064119)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3878890915:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 2.25/1.00 % (3064120)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1761296317:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 2.25/1.00 % (3064121)dis+10_1_sil=32000:sp=arity:random_seed=1560011362:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 2.25/1.00 % (3064123)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=275099065:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 2.25/1.00 % (3064124)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=619291642:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064122)Instruction limit reached!
% 2.25/1.00 % (3064122)------------------------------
% 2.25/1.00 % (3064122)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064122)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064122)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064122)Termination reason: Instruction limit
% 2.25/1.00 % (3064122)Termination phase: Saturation
% 2.25/1.00 % (3064122)Time elapsed: 0.032 s
% 2.25/1.00 % (3064122)Peak memory usage: 12 MB
% 2.25/1.00 % (3064122)Instructions burned: 119 (million)
% 2.25/1.00 % (3064132)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2917170012:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064133)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1310138201:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 2.25/1.00 % (3064135)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=3014548540:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 2.25/1.00 % (3064121)Instruction limit reached!
% 2.25/1.00 % (3064121)------------------------------
% 2.25/1.00 % (3064121)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064121)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064121)Termination reason: Instruction limit
% 2.25/1.00 % (3064121)Termination phase: Saturation
% 2.25/1.00 % (3064121)Time elapsed: 0.058 s
% 2.25/1.00 % (3064121)Peak memory usage: 12 MB
% 2.25/1.00 % (3064121)Instructions burned: 104 (million)
% 2.25/1.00 % (3064133)Instruction limit reached!
% 2.25/1.00 % (3064133)------------------------------
% 2.25/1.00 % (3064133)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064133)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064133)Termination reason: Instruction limit
% 2.25/1.00 % (3064133)Termination phase: Saturation
% 2.25/1.00 % (3064133)Time elapsed: 0.041 s
% 2.25/1.00 % (3064133)Peak memory usage: 13 MB
% 2.25/1.00 % (3064133)Instructions burned: 133 (million)
% 2.25/1.00 % (3064138)ott-21_1_sil=16000:fs=off:random_seed=2137107724:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 2.25/1.00 % (3064123)Instruction limit reached!
% 2.25/1.00 % (3064123)------------------------------
% 2.25/1.00 % (3064123)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064123)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064123)Termination reason: Instruction limit
% 2.25/1.00 % (3064123)Termination phase: Saturation
% 2.25/1.00 % (3064123)Time elapsed: 0.078 s
% 2.25/1.00 % (3064123)Peak memory usage: 13 MB
% 2.25/1.00 % (3064123)Instructions burned: 131 (million)
% 2.25/1.00 % (3064124)Instruction limit reached!
% 2.25/1.00 % (3064124)------------------------------
% 2.25/1.00 % (3064124)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064124)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064124)Termination reason: Instruction limit
% 2.25/1.00 % (3064124)Termination phase: Saturation
% 2.25/1.00 % (3064124)Time elapsed: 0.085 s
% 2.25/1.00 % (3064124)Peak memory usage: 13 MB
% 2.25/1.00 % (3064124)Instructions burned: 160 (million)
% 2.25/1.00 % (3064140)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=628859169:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 2.25/1.00 % (3064141)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=887139737:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs% (3064142)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3156770864:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 2.25/1.00
% 2.25/1.00 % (3064146)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=427706436:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064148)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=3597982510: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)
% 2.25/1.00 % (3064138)Instruction limit reached!
% 2.25/1.00 % (3064138)------------------------------
% 2.25/1.00 % (3064138)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064138)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064138)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064138)Termination reason: Instruction limit
% 2.25/1.00 % (3064138)Termination phase: Saturation
% 2.25/1.00 % (3064138)Time elapsed: 0.097 s
% 2.25/1.00 % (3064138)Peak memory usage: 12 MB
% 2.25/1.00 % (3064138)Instructions burned: 184 (million)
% 2.25/1.00 % (3064150)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=4095908756:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 2.25/1.00 % (3064140)Instruction limit reached!
% 2.25/1.00 % (3064140)------------------------------
% 2.25/1.00 % (3064140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064140)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064140)Termination reason: Instruction limit
% 2.25/1.00 % (3064140)Termination phase: Saturation
% 2.25/1.00 % (3064140)Time elapsed: 0.143 s
% 2.25/1.00 % (3064140)Peak memory usage: 13 MB
% 2.25/1.00 % (3064140)Instructions burned: 479 (million)
% 2.25/1.00 % (3064152)fmb+10_1_sil=64000:random_seed=2845981900:i=22061:nm=2:gsp=on_2997 on theBenchmark for (2997ds/22061Mi)
% 2.25/1.00 % (3064152)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064154)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=537294729:i=9515:nm=5_2997 on theBenchmark for (2997ds/9515Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064156)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=3778887357:fmbsr=1.7:i=920_2997 on theBenchmark for (2997ds/920Mi)
% 2.25/1.00 % Exception at run slice level
% 2.25/1.00 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 2.25/1.00 % (3064158)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=3278973038:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 2.25/1.00 % (3064135)Instruction limit reached!
% 2.25/1.00 % (3064135)------------------------------
% 2.25/1.00 % (3064135)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064135)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064135)Termination reason: Instruction limit
% 2.25/1.00 % (3064135)Termination phase: Saturation
% 2.25/1.00 % (3064135)Time elapsed: 0.319 s
% 2.25/1.00 % (3064135)Peak memory usage: 15 MB
% 2.25/1.00 % (3064135)Instructions burned: 685 (million)
% 2.25/1.00 % (3064160)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=3365594401:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 2.25/1.00 % (3064160)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.25/1.00 % (3064158) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3064113-3064158"...
% 2.25/1.00 % (3064158)...printing done.
% 2.25/1.00 % (3064158)Refutation found. Thanks to Tanya!
% 2.25/1.00 % SZS status Theorem for theBenchmark
% 2.25/1.00 % SZS output start Proof for theBenchmark
% See solution above
% 2.25/1.00 % (3064158)------------------------------
% 2.25/1.00 % (3064158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.25/1.00 % (3064158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.25/1.00 % (3064158)CaDiCaL version: 2.1.3
% 2.25/1.00 % (3064158)Termination reason: Refutation
% 2.25/1.00 % (3064158)Time elapsed: 0.252 s
% 2.25/1.00 % (3064158)Peak memory usage: 15 MB
% 2.25/1.00 % (3064158)Instructions burned: 979 (million)
% 2.25/1.00 % (3064113)Success in time 0.578 s
% 2.25/1.00 % Vampire exiting
%------------------------------------------------------------------------------