%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL786_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:35 PM UTC 2026
% Result : Theorem 4.21s 1.05s
% Output : Refutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 56 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 30 ~; 19 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 78 ( 78 usr; 22 con; 0-6 aty)
% Number of variables : 51 ( 50 !; 1 ?; 51 :)
% 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,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
collect:
!>[X0: $tType] : ( fun1(X0,bool) > fun1(X0,bool) ) ).
tff(func_def_22,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_23,type,
atom: nat > type ).
tff(func_def_24,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_25,type,
type_case:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,X0)) * type ) > X0 ) ).
tff(func_def_26,type,
type_size: type > nat ).
tff(func_def_27,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_28,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_29,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_30,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_31,type,
fFalse: bool ).
tff(func_def_32,type,
fTrue: bool ).
tff(func_def_33,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_34,type,
fequal:
!>[X0: $tType] : fun1(X0,fun1(X0,bool)) ).
tff(func_def_35,type,
member:
!>[X0: $tType] : fun1(X0,fun1(fun1(X0,bool),bool)) ).
tff(func_def_36,type,
t1: type ).
tff(func_def_37,type,
t_a: type ).
tff(func_def_38,type,
t: type ).
tff(func_def_39,type,
a: dB ).
tff(func_def_40,type,
as: list(dB) ).
tff(func_def_41,type,
e: fun1(nat,type) ).
tff(func_def_42,type,
ea: fun1(nat,type) ).
tff(func_def_43,type,
i: nat ).
tff(func_def_44,type,
ia: nat ).
tff(func_def_45,type,
n: nat ).
tff(func_def_46,type,
rs: list(dB) ).
tff(func_def_47,type,
t2: dB ).
tff(func_def_48,type,
u: dB ).
tff(func_def_49,type,
ua: dB ).
tff(func_def_50,type,
sK0: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_51,type,
sK1: ( type * list(dB) * nat * fun1(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK2: ( type * type * list(dB) * fun1(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK3: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK4: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_56,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_57,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X0 ) ).
tff(func_def_58,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > X0 ) ).
tff(func_def_59,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > list(X0) ) ).
tff(func_def_60,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_61,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_62,type,
sK12: type > nat ).
tff(func_def_63,type,
sK13: type > type ).
tff(func_def_64,type,
sK14: type > type ).
tff(func_def_65,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( fun1(X1,X0) * fun1(X1,X0) ) > X1 ) ).
tff(func_def_66,type,
sK16: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_67,type,
sK17: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_68,type,
sK18: ( dB * fun1(nat,type) ) > type ).
tff(func_def_69,type,
sK19: ( dB * fun1(nat,type) ) > type ).
tff(func_def_70,type,
sK20: dB > dB ).
tff(func_def_71,type,
sK21: dB > dB ).
tff(func_def_72,type,
sK22: dB > list(dB) ).
tff(func_def_73,type,
sK23: dB > dB ).
tff(func_def_74,type,
sK24: dB > list(dB) ).
tff(func_def_75,type,
sK25: dB > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(f2,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_True) ).
tff(f4,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a),as)),t1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3__096e_060i_058T_062_A_092_060turnstile_062_AVar_An_A_092_060degree_062_Aa_A_092_060degree_062_092_060degree_062_Aas_A_058_AT_H_096) ).
tff(f26,axiom,
! [X0: type,X1: list(dB),X2: dB,X3: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),foldl(dB,dB,app,X2,X1)),X0))
=> ~ ! [X4: list(type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),foldr(type,type,fun,X4,X0)))
=> ~ pp(aa(list(type),bool,typings(X3,X1),X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_list__app__typeE) ).
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(f115,axiom,
! [X0: list(type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,X0,t1)))
=> ( pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0))
=> thesis ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f116,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f117,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f116]) ).
tff(f119,plain,
~ thesis,
inference(flattening,[],[f117]) ).
tff(f134,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun1(nat,type)] :
( ? [X4: list(type)] :
( pp(aa(list(type),bool,typings(X3,X1),X4))
& pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),foldr(type,type,fun,X4,X0))) )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),foldl(dB,dB,app,X2,X1)),X0)) ),
inference(ennf_transformation,[],[f26]) ).
tff(f168,plain,
! [X0: list(type)] :
( thesis
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,X0,t1))) ),
inference(ennf_transformation,[],[f115]) ).
tff(f169,plain,
! [X0: list(type)] :
( thesis
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,X0,t1))) ),
inference(flattening,[],[f168]) ).
tff(f171,plain,
n = i,
inference(cnf_transformation,[],[f2]) ).
tff(f173,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a),as)),t1)),
inference(cnf_transformation,[],[f4]) ).
tff(f205,plain,
! [X2: dB,X3: fun1(nat,type),X0: type,X1: list(dB)] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),foldl(dB,dB,app,X2,X1)),X0))
| pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),foldr(type,type,fun,sK3(X0,X1,X2,X3),X0))) ),
inference(cnf_transformation,[],[f134]) ).
tff(f206,plain,
! [X2: dB,X3: fun1(nat,type),X0: type,X1: list(dB)] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),foldl(dB,dB,app,X2,X1)),X0))
| pp(aa(list(type),bool,typings(X3,X1),sK3(X0,X1,X2,X3))) ),
inference(cnf_transformation,[],[f134]) ).
tff(f317,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(f327,plain,
! [X0: list(type)] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(n)),a)),foldr(type,type,fun,X0,t1)))
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0))
| thesis ),
inference(cnf_transformation,[],[f169]) ).
tff(f328,plain,
~ thesis,
inference(cnf_transformation,[],[f119]) ).
tff(f329,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a),as)),t1)),
inference(definition_unfolding,[],[f173,f171]) ).
tff(f333,plain,
! [X0: list(type)] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a)),foldr(type,type,fun,X0,t1)))
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0))
| thesis ),
inference(definition_unfolding,[],[f327,f171]) ).
tff(f1605,plain,
! [X2: dB,X3: fun1(nat,type),X0: type,X1: list(dB)] :
( pp(aa(list(type),bool,typings(X3,X1),sK3(X0,X1,X2,X3)))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X0),foldl(dB,dB,app,X2,X1))) ),
inference(forward_demodulation,[],[f206,f317]) ).
tff(f2862,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a),as))),
inference(forward_demodulation,[],[f329,f317]) ).
tff(f2863,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),as))),
inference(forward_demodulation,[],[f2862,f317]) ).
tff(f4139,plain,
! [X2: dB,X3: fun1(nat,type),X0: type,X1: list(dB)] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X0),foldl(dB,dB,app,X2,X1)))
| pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X3),X2),foldr(type,type,fun,sK3(X0,X1,X2,X3),X0))) ),
inference(forward_demodulation,[],[f205,f317]) ).
tff(f4140,plain,
! [X2: dB,X3: fun1(nat,type),X0: type,X1: list(dB)] :
( pp(aa(dB,bool,combc(dB,type,bool,typing(X3),foldr(type,type,fun,sK3(X0,X1,X2,X3),X0)),X2))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(X3),X0),foldl(dB,dB,app,X2,X1))) ),
inference(forward_demodulation,[],[f4139,f317]) ).
tff(f6004,plain,
! [X0: list(type)] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a)),foldr(type,type,fun,X0,t1)))
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0)) ),
inference(forward_subsumption_resolution,[],[f333,f328]) ).
tff(f6005,plain,
! [X0: list(type)] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),foldr(type,type,fun,X0,t1)),aa(dB,dB,aa(dB,fun1(dB,dB),app,var(i)),a)))
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0)) ),
inference(forward_demodulation,[],[f6004,f317]) ).
tff(f6006,plain,
! [X0: list(type)] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),foldr(type,type,fun,X0,t1)),aa(dB,dB,combc(dB,dB,dB,app,a),var(i))))
| ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0)) ),
inference(forward_demodulation,[],[f6005,f317]) ).
tff(f6007,plain,
! [X0: list(dB)] :
( ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),sK3(t1,X0,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),shift(type,e,i,t))))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),X0))) ),
inference(resolution,[],[f6006,f4140]) ).
tff(f8276,plain,
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),as)))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),as))) ),
inference(resolution,[],[f6007,f1605]) ).
tff(f8320,plain,
~ pp(aa(dB,bool,combc(dB,type,bool,typing(shift(type,e,i,t)),t1),foldl(dB,dB,app,aa(dB,dB,combc(dB,dB,dB,app,a),var(i)),as))),
inference(duplicate_literal_removal,[],[f8276]) ).
tff(f8335,plain,
$false,
inference(forward_subsumption_resolution,[],[f8320,f2863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL786_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 16:53:41 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 Running first-order model finding
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.21/1.05 % (3059988)Will run a generic schedule for satisfiability detection.
% 4.21/1.05 % (3059997)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3068357074:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.21/1.05 % (3059994)% WARNING: option uhcvi not known.
% 4.21/1.05 % (3059993)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2352758681_2999 on theBenchmark for (2999ds/0Mi)
% 4.21/1.05 % (3059994)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2763406828:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.21/1.05 % (3059995)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3930824368:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.21/1.05 % (3059996)dis+10_1_sil=32000:sp=arity:random_seed=2272163486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.21/1.05 % (3059998)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4007367257:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.21/1.05 % (3059999)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=728149912:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3059997)Instruction limit reached!
% 4.21/1.05 % (3059997)------------------------------
% 4.21/1.05 % (3059997)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3059997)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3059997)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3059997)Termination reason: Instruction limit
% 4.21/1.05 % (3059997)Termination phase: Saturation
% 4.21/1.05 % (3059997)Time elapsed: 0.035 s
% 4.21/1.05 % (3059997)Peak memory usage: 12 MB
% 4.21/1.05 % (3059997)Instructions burned: 117 (million)
% 4.21/1.05 % (3060007)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1272321242:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060009)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2379378257:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.21/1.05 % (3060010)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=600595593:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 4.21/1.05 % (3059996)Instruction limit reached!
% 4.21/1.05 % (3059996)------------------------------
% 4.21/1.05 % (3059996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3059996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3059996)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3059996)Termination reason: Instruction limit
% 4.21/1.05 % (3059996)Termination phase: Saturation
% 4.21/1.05 % (3059996)Time elapsed: 0.061 s
% 4.21/1.05 % (3059996)Peak memory usage: 12 MB
% 4.21/1.05 % (3059996)Instructions burned: 104 (million)
% 4.21/1.05 % (3059998)Instruction limit reached!
% 4.21/1.05 % (3059998)------------------------------
% 4.21/1.05 % (3059998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3059998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3059998)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3059998)Termination reason: Instruction limit
% 4.21/1.05 % (3059998)Termination phase: Saturation
% 4.21/1.05 % (3059998)Time elapsed: 0.073 s
% 4.21/1.05 % (3059998)Peak memory usage: 13 MB
% 4.21/1.05 % (3059998)Instructions burned: 132 (million)
% 4.21/1.05 % (3060009)Instruction limit reached!
% 4.21/1.05 % (3060009)------------------------------
% 4.21/1.05 % (3060009)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060009)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060009)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060009)Termination reason: Instruction limit
% 4.21/1.05 % (3060009)Termination phase: Saturation
% 4.21/1.05 % (3060009)Time elapsed: 0.041 s
% 4.21/1.05 % (3060009)Peak memory usage: 13 MB
% 4.21/1.05 % (3060009)Instructions burned: 132 (million)
% 4.21/1.05 % (3060013)ott-21_1_sil=16000:fs=off:random_seed=1341288795:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.21/1.05 % (3060015)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2401506257:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 4.21/1.05 % (3059999)Instruction limit reached!
% 4.21/1.05 % (3059999)------------------------------
% 4.21/1.05 % (3059999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3059999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3059999)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3059999)Termination reason: Instruction limit
% 4.21/1.05 % (3059999)Termination phase: Saturation
% 4.21/1.05 % (3059999)Time elapsed: 0.089 s
% 4.21/1.05 % (3059999)Peak memory usage: 13 MB
% 4.21/1.05 % (3059999)Instructions burned: 161 (million)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060014)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3200050483:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.21/1.05 % (3060020)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=524034382:i=889:ins=1_2998 on theBenchmark for (2998ds/889Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060018)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3924136557:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 4.21/1.05 % (3060022)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=465202222: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.21/1.05 % (3060013)Instruction limit reached!
% 4.21/1.05 % (3060013)------------------------------
% 4.21/1.05 % (3060013)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060013)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060013)Termination reason: Instruction limit
% 4.21/1.05 % (3060013)Termination phase: Saturation
% 4.21/1.05 % (3060013)Time elapsed: 0.090 s
% 4.21/1.05 % (3060013)Peak memory usage: 13 MB
% 4.21/1.05 % (3060013)Instructions burned: 180 (million)
% 4.21/1.05 % (3060025)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2435887165:i=879:kws=inv_precedence:fsr=off_2997 on theBenchmark for (2997ds/879Mi)
% 4.21/1.05 % (3060022)Instruction limit reached!
% 4.21/1.05 % (3060022)------------------------------
% 4.21/1.05 % (3060022)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060022)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060022)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060022)Termination reason: Instruction limit
% 4.21/1.05 % (3060022)Termination phase: Saturation
% 4.21/1.05 % (3060022)Time elapsed: 0.195 s
% 4.21/1.05 % (3060022)Peak memory usage: 17 MB
% 4.21/1.05 % (3060022)Instructions burned: 693 (million)
% 4.21/1.05 % (3060027)fmb+10_1_sil=64000:random_seed=2093294343:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 4.21/1.05 % (3060027)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060029)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3714772215:i=9515:nm=5_2996 on theBenchmark for (2996ds/9515Mi)
% 4.21/1.05 % (3060014)Instruction limit reached!
% 4.21/1.05 % (3060014)------------------------------
% 4.21/1.05 % (3060014)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060014)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060014)Termination reason: Instruction limit
% 4.21/1.05 % (3060014)Termination phase: Saturation
% 4.21/1.05 % (3060014)Time elapsed: 0.247 s
% 4.21/1.05 % (3060014)Peak memory usage: 13 MB
% 4.21/1.05 % (3060014)Instructions burned: 477 (million)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060032)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=713369376:i=5131_2996 on theBenchmark for (2996ds/5131Mi)
% 4.21/1.05 % (3060031)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=642400642:fmbsr=1.7:i=920_2996 on theBenchmark for (2996ds/920Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060035)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=2292912903:i=1472:ins=7:fdi=8:gsp=on_2995 on theBenchmark for (2995ds/1472Mi)
% 4.21/1.05 % (3060010)Instruction limit reached!
% 4.21/1.05 % (3060010)------------------------------
% 4.21/1.05 % (3060010)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060010)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060010)Termination reason: Instruction limit
% 4.21/1.05 % (3060010)Termination phase: Saturation
% 4.21/1.05 % (3060010)Time elapsed: 0.337 s
% 4.21/1.05 % (3060010)Peak memory usage: 15 MB
% 4.21/1.05 % (3060010)Instructions burned: 684 (million)
% 4.21/1.05 % (3060035)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 4.21/1.05 % (3060037)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=1751683638:i=6324_2995 on theBenchmark for (2995ds/6324Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060039)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=1350177494:fmbsr=2.30978:i=2174_2995 on theBenchmark for (2995ds/2174Mi)
% 4.21/1.05 % Exception at run slice level
% 4.21/1.05 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 4.21/1.05 % (3060041)ott-2_1_sil=16000:newcnf=on:random_seed=3659165605:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2995 on theBenchmark for (2995ds/869Mi)
% 4.21/1.05 % (3060032) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3059988-3060032"...
% 4.21/1.05 % (3060032)...printing done.
% 4.21/1.05 % (3060032)Refutation found. Thanks to Tanya!
% 4.21/1.05 % SZS status Theorem for theBenchmark
% 4.21/1.05 % SZS output start Proof for theBenchmark
% See solution above
% 4.21/1.05 % (3060032)------------------------------
% 4.21/1.05 % (3060032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.21/1.05 % (3060032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.21/1.05 % (3060032)CaDiCaL version: 2.1.3
% 4.21/1.05 % (3060032)Termination reason: Refutation
% 4.21/1.05 % (3060032)Time elapsed: 0.212 s
% 4.21/1.05 % (3060032)Peak memory usage: 15 MB
% 4.21/1.05 % (3060032)Instructions burned: 844 (million)
% 4.21/1.05 % (3059988)Success in time 0.62 s
% 4.21/1.05 % Vampire exiting
%------------------------------------------------------------------------------