%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL818_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 : n007.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:43 PM UTC 2026
% Result : Theorem 11.38s 2.06s
% Output : Refutation 11.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 52 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 58 ( 29 ~; 26 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 71 ( 71 usr; 26 con; 0-6 aty)
% Number of variables : 110 ( 110 !; 0 ?; 110 :)
% 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,
fun1: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,X1),fun1(fun1(X2,X0),fun1(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * X1 ) > fun1(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun1(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,fun1(X1,X2)),fun1(fun1(X0,X1),fun1(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun1(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun1(dB,fun1(dB,dB)) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_size: dB > nat ).
tff(func_def_10,type,
lift: fun1(dB,fun1(nat,dB)) ).
tff(func_def_11,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun1(X0,fun1(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun1(X0,bool)) > fun1(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun1(X0,bool) * fun1(list(X0),bool) ) > fun1(list(X0),bool) ) ).
tff(func_def_19,type,
collect:
!>[X0: $tType] : ( fun1(X0,bool) > fun1(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_21,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_22,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_23,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_26,type,
fFalse: bool ).
tff(func_def_27,type,
fTrue: bool ).
tff(func_def_28,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun1(X0,fun1(X0,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun1(X0,fun1(fun1(X0,bool),bool)) ).
tff(func_def_31,type,
t2: type ).
tff(func_def_32,type,
t: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
a: dB ).
tff(func_def_37,type,
as: list(dB) ).
tff(func_def_38,type,
e: fun1(nat,type) ).
tff(func_def_39,type,
ea: fun1(nat,type) ).
tff(func_def_40,type,
i: nat ).
tff(func_def_41,type,
ia: nat ).
tff(func_def_42,type,
n: nat ).
tff(func_def_43,type,
rs: list(dB) ).
tff(func_def_44,type,
t3: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK3: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_48,type,
sK4: type ).
tff(func_def_49,type,
sK5: list(type) ).
tff(func_def_50,type,
sK6: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_51,type,
sK7: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_52,type,
sK8: ( type * list(dB) * nat * fun1(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK9: ( type * type * list(dB) * fun1(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK10: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK11: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_56,type,
sK12: ( dB * fun1(nat,type) ) > type ).
tff(func_def_57,type,
sK13: ( dB * fun1(nat,type) ) > type ).
tff(func_def_58,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun1(X1,X0) * fun1(X1,X0) ) > X1 ) ).
tff(func_def_59,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > X0 ) ).
tff(func_def_60,type,
sK16:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > list(X0) ) ).
tff(func_def_61,type,
sK17: dB > list(dB) ).
tff(func_def_62,type,
sK18: dB > nat ).
tff(func_def_63,type,
sK19: dB > dB ).
tff(func_def_64,type,
sK20: dB > dB ).
tff(func_def_65,type,
sK21: dB > dB ).
tff(func_def_66,type,
sK22: dB > list(dB) ).
tff(func_def_67,type,
sK23:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_68,type,
sK24:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
listsp:
!>[X0: $tType] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
pp: bool > $o ).
tff(pred_def_4,type,
sP0: dB > $o ).
tff(pred_def_5,type,
sP1: dB > $o ).
tff(pred_def_6,type,
sP2: dB > $o ).
tff(f1,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_True) ).
tff(f6,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_uT) ).
tff(f9,axiom,
! [X0: nat,X1: dB,X2: dB,X3: dB] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X1),X0) = aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X1),X0)),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X1),X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_8_subst__App) ).
tff(f15,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t1)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,ts,t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_14_headT) ).
tff(f31,axiom,
! [X0: dB,X1: nat] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,var(X1)),X0),X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_subst__eq) ).
tff(f32,axiom,
! [X0: nat,X1: type,X2: dB,X3: fun1(nat,type),X4: type,X5: dB,X6: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X6),X5),X4))
=> ( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
=> ( ( X6 = shift(type,X3,X0,X1) )
=> pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)),X4)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_31_subst__lemma) ).
tff(f102,axiom,
pp(fTrue),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_pp_2_1_U) ).
tff(f105,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f111,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).
tff(f112,axiom,
! [X0: bool] :
( ( X0 = fTrue )
| ( X0 = fFalse ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_fFalse_1_1_T) ).
tff(f115,conjecture,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f116,negated_conjecture,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(negated_conjecture,[status(cth)],[f115]) ).
tff(f118,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(flattening,[],[f116]) ).
tff(f132,plain,
! [X0: nat,X1: type,X2: dB,X3: fun1(nat,type),X4: type,X5: dB,X6: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X6),X5),X4)) ),
inference(ennf_transformation,[],[f32]) ).
tff(f133,plain,
! [X0: nat,X1: type,X2: dB,X3: fun1(nat,type),X4: type,X5: dB,X6: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X6),X5),X4)) ),
inference(flattening,[],[f132]) ).
tff(f209,plain,
n = i,
inference(cnf_transformation,[],[f1]) ).
tff(f214,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t1)),
inference(cnf_transformation,[],[f6]) ).
tff(f217,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X1),X0) = aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X1),X0)),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X1),X0)) ),
inference(cnf_transformation,[],[f9]) ).
tff(f228,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t1)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,ts,t))),
inference(cnf_transformation,[],[f15]) ).
tff(f246,plain,
! [X0: dB,X1: nat] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,var(X1)),X0),X1) = X0 ),
inference(cnf_transformation,[],[f31]) ).
tff(f247,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X6: fun1(nat,type),X4: type,X5: dB] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)),X4))
| ( shift(type,X3,X0,X1) != X6 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X6),X5),X4)) ),
inference(cnf_transformation,[],[f133]) ).
tff(f355,plain,
pp(fTrue),
inference(cnf_transformation,[],[f102]) ).
tff(f358,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f105]) ).
tff(f364,plain,
~ pp(fFalse),
inference(cnf_transformation,[],[f111]) ).
tff(f365,plain,
! [X0: bool] :
( ( fTrue = X0 )
| ( fFalse = X0 ) ),
inference(cnf_transformation,[],[f112]) ).
tff(f368,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(cnf_transformation,[],[f118]) ).
tff(f369,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t1)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a)),foldr(type,type,fun,ts,t))),
inference(definition_unfolding,[],[f228,f209]) ).
tff(f384,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)),X4))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,X3,X0,X1)),X5),X4)) ),
inference(equality_resolution,[],[f247]) ).
tff(f467,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X4),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X2),X0)))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,X3,X0,X1)),X5),X4)) ),
inference(forward_demodulation,[],[f384,f358]) ).
tff(f468,plain,
! [X0: dB,X1: nat] : ( aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,var(X1)),X1),X0) = X0 ),
inference(forward_demodulation,[],[f246,f358]) ).
tff(f481,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t1)),foldr(type,type,fun,ts,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a))),
inference(forward_demodulation,[],[f369,f358]) ).
tff(f490,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X1),X0) = aa(dB,dB,combc(dB,dB,dB,app,aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X1),X0)),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X1),X0)) ),
inference(forward_demodulation,[],[f217,f358]) ).
tff(f493,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),t1),u)),
inference(forward_demodulation,[],[f214,f358]) ).
tff(f531,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X4),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X0),X2)))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,X3,X0,X1)),X5),X4)) ),
inference(forward_demodulation,[],[f467,f358]) ).
tff(f536,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t1)),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,dB,dB,app,a),var(i)))),
inference(forward_demodulation,[],[f481,f358]) ).
tff(f543,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X1),X0) = aa(dB,dB,combc(dB,dB,dB,app,aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X1),X0)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X0),X1)) ),
inference(forward_demodulation,[],[f490,f358]) ).
tff(f556,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X1),X2))
| pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X4),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X0),X2)))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,X3,X0,X1)),X5),X4)) ),
inference(forward_demodulation,[],[f531,f358]) ).
tff(f562,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X1),X0) = aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X0),X1)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X0),X1)) ),
inference(forward_demodulation,[],[f543,f358]) ).
tff(f568,plain,
! [X2: dB,X3: fun1(nat,type),X0: nat,X1: type,X4: type,X5: dB] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,X3,X0,X1)),X4),X5))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X1),X2))
| pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X4),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X5),X0),X2))) ),
inference(forward_demodulation,[],[f556,f358]) ).
tff(f572,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X0),X1)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X0),X1)) = aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X2)),X0),X1) ),
inference(forward_demodulation,[],[f562,f358]) ).
tff(f576,plain,
! [X2: dB,X3: dB,X0: nat,X1: dB] : ( aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X2),X0),X1)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X3),X0),X1)) = aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,combc(dB,dB,dB,app,X2),X3)),X0),X1) ),
inference(forward_demodulation,[],[f572,f358]) ).
tff(f587,plain,
( ~ pp(fTrue)
| ( fFalse = aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t)) ) ),
inference(superposition,[],[f368,f365]) ).
tff(f599,plain,
( ( fFalse = aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))) )
| ~ pp(fTrue) ),
inference(forward_demodulation,[],[f587,f358]) ).
tff(f601,plain,
( ( fFalse = aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,dB,dB,app,aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)),u)) )
| ~ pp(fTrue) ),
inference(forward_demodulation,[],[f599,f358]) ).
tff(f602,plain,
( ( fFalse = aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)),u)) )
| ~ pp(fTrue) ),
inference(forward_demodulation,[],[f601,f358]) ).
tff(f603,plain,
fFalse = aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)),u)),
inference(global_subsumption,[],[f602,f355]) ).
tff(f1776,plain,
! [X0: dB] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),t1),X0))
| pp(aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,combc(dB,dB,dB,app,a),var(i))),i),X0))) ),
inference(resolution,[],[f568,f536]) ).
tff(f1908,plain,
! [X2: nat,X0: dB,X1: dB] : ( aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,combc(dB,dB,dB,app,X1),var(X2))),X2),X0) = aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,X1),X2),X0)),X0) ),
inference(superposition,[],[f576,f468]) ).
tff(f4882,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,aa(dB,dB,combc(dB,dB,dB,app,a),var(i))),i),u))),
inference(resolution,[],[f1776,f493]) ).
tff(f4906,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),foldr(type,type,fun,ts,t)),aa(dB,dB,combc(dB,dB,dB,app,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)),u))),
inference(forward_demodulation,[],[f4882,f1908]) ).
tff(f4907,plain,
pp(fFalse),
inference(forward_demodulation,[],[f4906,f603]) ).
tff(f4908,plain,
$false,
inference(global_subsumption,[],[f4907,f364]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL818_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.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 16:53:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 6.73/1.53 % (1647120)Will run a generic schedule for satisfiability detection.
% 6.73/1.53 % (1647129)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3956170096:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.73/1.53 % (1647126)% WARNING: option uhcvi not known.
% 6.73/1.53 % (1647125)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2259235247_2999 on theBenchmark for (2999ds/0Mi)
% 6.73/1.53 % (1647126)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2343344632:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.73/1.53 % (1647127)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1444733391:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.73/1.53 % (1647128)dis+10_1_sil=32000:sp=arity:random_seed=57351106:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.73/1.53 % (1647131)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3773688264:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.73/1.53 % (1647130)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2586576304:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.73/1.53 % Exception at run slice level
% 6.73/1.53 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.73/1.53 % (1647129)Instruction limit reached!
% 6.73/1.53 % (1647129)------------------------------
% 6.73/1.53 % (1647129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.73/1.53 % (1647129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.73/1.53 % (1647129)CaDiCaL version: 2.1.3
% 6.73/1.53 % (1647129)Termination reason: Instruction limit
% 6.73/1.53 % (1647129)Termination phase: Saturation
% 6.73/1.53 % (1647129)Time elapsed: 0.033 s
% 6.73/1.53 % (1647129)Peak memory usage: 12 MB
% 6.73/1.53 % (1647129)Instructions burned: 120 (million)
% 6.73/1.53 % (1647139)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3484643382:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 6.73/1.53 % Exception at run slice level
% 6.73/1.53 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 6.73/1.53 % (1647140)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2082492833:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 6.73/1.53 % (1647142)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=239861649:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 6.73/1.53 % (1647128)Instruction limit reached!
% 6.73/1.53 % (1647128)------------------------------
% 6.73/1.53 % (1647128)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.73/1.53 % (1647128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.73/1.53 % (1647128)CaDiCaL version: 2.1.3
% 6.73/1.53 % (1647128)Termination reason: Instruction limit
% 6.73/1.53 % (1647128)Termination phase: Saturation
% 6.73/1.53 % (1647128)Time elapsed: 0.059 s
% 6.73/1.53 % (1647128)Peak memory usage: 12 MB
% 6.73/1.53 % (1647128)Instructions burned: 104 (million)
% 6.73/1.53 % (1647130)Instruction limit reached!
% 6.73/1.53 % (1647130)------------------------------
% 6.73/1.53 % (1647130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.73/1.53 % (1647130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.73/1.53 % (1647130)CaDiCaL version: 2.1.3
% 6.73/1.53 % (1647130)Termination reason: Instruction limit
% 6.73/1.53 % (1647130)Termination phase: Saturation
% 6.73/1.53 % (1647130)Time elapsed: 0.072 s
% 6.73/1.53 % (1647130)Peak memory usage: 12 MB
% 6.73/1.53 % (1647130)Instructions burned: 131 (million)
% 6.73/1.53 % (1647140)Instruction limit reached!
% 6.73/1.53 % (1647140)------------------------------
% 6.73/1.53 % (1647140)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.73/1.53 % (1647140)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.73/1.53 % (1647140)CaDiCaL version: 2.1.3
% 6.73/1.53 % (1647140)Termination reason: Instruction limit
% 6.73/1.53 % (1647140)Termination phase: Saturation
% 6.73/1.53 % (1647140)Time elapsed: 0.042 s
% 6.73/1.53 % (1647140)Peak memory usage: 13 MB
% 6.73/1.53 % (1647140)Instructions burned: 136 (million)
% 6.73/1.53 % (1647131)Instruction limit reached!
% 6.73/1.53 % (1647131)------------------------------
% 6.73/1.53 % (1647131)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647131)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647131)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647131)Termination reason: Instruction limit
% 11.38/2.06 % (1647131)Termination phase: Saturation
% 11.38/2.06 % (1647131)Time elapsed: 0.078 s
% 11.38/2.06 % (1647131)Peak memory usage: 13 MB
% 11.38/2.06 % (1647131)Instructions burned: 162 (million)
% 11.38/2.06 % (1647145)ott-21_1_sil=16000:fs=off:random_seed=1999062690:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 11.38/2.06 % (1647148)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3291959753:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 11.38/2.06 % (1647146)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2263406331:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647149)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1413979143:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 11.38/2.06 % (1647152)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1579187228:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647155)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=1556351118: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)
% 11.38/2.06 % (1647145)Instruction limit reached!
% 11.38/2.06 % (1647145)------------------------------
% 11.38/2.06 % (1647145)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647145)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647145)Termination reason: Instruction limit
% 11.38/2.06 % (1647145)Termination phase: Saturation
% 11.38/2.06 % (1647145)Time elapsed: 0.090 s
% 11.38/2.06 % (1647145)Peak memory usage: 12 MB
% 11.38/2.06 % (1647145)Instructions burned: 181 (million)
% 11.38/2.06 % (1647157)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1913621891:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 11.38/2.06 % (1647146)Instruction limit reached!
% 11.38/2.06 % (1647146)------------------------------
% 11.38/2.06 % (1647146)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647146)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647146)Termination reason: Instruction limit
% 11.38/2.06 % (1647146)Termination phase: Saturation
% 11.38/2.06 % (1647146)Time elapsed: 0.242 s
% 11.38/2.06 % (1647146)Peak memory usage: 13 MB
% 11.38/2.06 % (1647146)Instructions burned: 477 (million)
% 11.38/2.06 % (1647159)fmb+10_1_sil=64000:random_seed=690288181:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 11.38/2.06 % (1647159)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647142)Instruction limit reached!
% 11.38/2.06 % (1647142)------------------------------
% 11.38/2.06 % (1647142)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647142)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647142)Termination reason: Instruction limit
% 11.38/2.06 % (1647142)Termination phase: Saturation
% 11.38/2.06 % (1647142)Time elapsed: 0.316 s
% 11.38/2.06 % (1647142)Peak memory usage: 15 MB
% 11.38/2.06 % (1647142)Instructions burned: 685 (million)
% 11.38/2.06 % (1647161)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3019199315:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 11.38/2.06 % (1647155)Instruction limit reached!
% 11.38/2.06 % (1647155)------------------------------
% 11.38/2.06 % (1647155)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647155)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647155)Termination reason: Instruction limit
% 11.38/2.06 % (1647155)Termination phase: Saturation
% 11.38/2.06 % (1647155)Time elapsed: 0.262 s
% 11.38/2.06 % (1647155)Peak memory usage: 15 MB
% 11.38/2.06 % (1647155)Instructions burned: 693 (million)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647162)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=655937787:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 11.38/2.06 % (1647164)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=2295121557:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647165)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2311613033:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 11.38/2.06 % (1647165)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 11.38/2.06 % (1647168)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2396808584:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647171)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=810965206:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647173)ott-2_1_sil=16000:newcnf=on:random_seed=1295589559:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2994 on theBenchmark for (2994ds/869Mi)
% 11.38/2.06 % (1647149)Instruction limit reached!
% 11.38/2.06 % (1647149)------------------------------
% 11.38/2.06 % (1647149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647149)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647149)Termination reason: Instruction limit
% 11.38/2.06 % (1647149)Termination phase: Saturation
% 11.38/2.06 % (1647149)Time elapsed: 0.583 s
% 11.38/2.06 % (1647149)Peak memory usage: 16 MB
% 11.38/2.06 % (1647149)Instructions burned: 1181 (million)
% 11.38/2.06 % (1647157)Instruction limit reached!
% 11.38/2.06 % (1647157)------------------------------
% 11.38/2.06 % (1647157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647157)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647157)Termination reason: Instruction limit
% 11.38/2.06 % (1647157)Termination phase: Saturation
% 11.38/2.06 % (1647157)Time elapsed: 0.504 s
% 11.38/2.06 % (1647157)Peak memory usage: 18 MB
% 11.38/2.06 % (1647157)Instructions burned: 879 (million)
% 11.38/2.06 % (1647175)ott+10_1_sil=32000:tgt=ground:random_seed=3875033422:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 11.38/2.06 % (1647176)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=1729768851:i=54282_2992 on theBenchmark for (2992ds/54282Mi)
% 11.38/2.06 % Exception at run slice level
% 11.38/2.06 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 11.38/2.06 % (1647179)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1719206862:i=3512:aac=none_2992 on theBenchmark for (2992ds/3512Mi)
% 11.38/2.06 % (1647173)Instruction limit reached!
% 11.38/2.06 % (1647173)------------------------------
% 11.38/2.06 % (1647173)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647173)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647173)Termination reason: Instruction limit
% 11.38/2.06 % (1647173)Termination phase: Saturation
% 11.38/2.06 % (1647173)Time elapsed: 0.386 s
% 11.38/2.06 % (1647173)Peak memory usage: 14 MB
% 11.38/2.06 % (1647173)Instructions burned: 870 (million)
% 11.38/2.06 % (1647181)dis+21_1_sil=32000:sas=cadical:random_seed=2493008271:i=3773:amm=off_2990 on theBenchmark for (2990ds/3773Mi)
% 11.38/2.06 % (1647165)Instruction limit reached!
% 11.38/2.06 % (1647165)------------------------------
% 11.38/2.06 % (1647165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647165)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647165)Termination reason: Instruction limit
% 11.38/2.06 % (1647165)Termination phase: Saturation
% 11.38/2.06 % (1647165)Time elapsed: 0.661 s
% 11.38/2.06 % (1647165)Peak memory usage: 19 MB
% 11.38/2.06 % (1647165)Instructions burned: 1474 (million)
% 11.38/2.06 % (1647183)ott+11_1_sil=16000:gs=on:random_seed=1280300852:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2988 on theBenchmark for (2988ds/2251Mi)
% 11.38/2.06 % (1647183) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1647120-1647183"...
% 11.38/2.06 % (1647183)...printing done.
% 11.38/2.06 % (1647183)Refutation found. Thanks to Tanya!
% 11.38/2.06 % SZS status Theorem for theBenchmark
% 11.38/2.06 % SZS output start Proof for theBenchmark
% See solution above
% 11.38/2.06 % (1647183)------------------------------
% 11.38/2.06 % (1647183)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 11.38/2.06 % (1647183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.38/2.06 % (1647183)CaDiCaL version: 2.1.3
% 11.38/2.06 % (1647183)Termination reason: Refutation
% 11.38/2.06 % (1647183)Time elapsed: 0.504 s
% 11.38/2.06 % (1647183)Peak memory usage: 17 MB
% 11.38/2.06 % (1647183)Instructions burned: 974 (million)
% 11.38/2.06 % (1647120)Success in time 1.656 s
% 11.38/2.06 % Vampire exiting
%------------------------------------------------------------------------------