%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL821_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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:44 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 14 unt; 0 typ; 2 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 9 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 4 prp; 0-3 aty)
% Number of functors : 54 ( 54 usr; 21 con; 0-5 aty)
% Number of variables : 20 ( 0 sgn 19 !; 1 ?; 20 :)
% 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(fun(X0,fun(X1,X2)),fun(X1,fun(X0,X2))) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(fun(X0,X1),fun(X0,X2))) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
it: fun(dB,bool) ).
tff(func_def_5,type,
abs: dB > dB ).
tff(func_def_6,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_7,type,
var: nat > dB ).
tff(func_def_8,type,
dB_size: dB > nat ).
tff(func_def_9,type,
lift: ( dB * nat ) > dB ).
tff(func_def_10,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_13,type,
suc: nat > nat ).
tff(func_def_14,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_15,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_16,type,
typing: fun(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_17,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_18,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fTrue: bool ).
tff(func_def_21,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_22,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
t1: type ).
tff(func_def_24,type,
t_a: type ).
tff(func_def_25,type,
t: type ).
tff(func_def_26,type,
e: fun(nat,type) ).
tff(func_def_27,type,
ea: fun(nat,type) ).
tff(func_def_28,type,
i: nat ).
tff(func_def_29,type,
ia: nat ).
tff(func_def_30,type,
n: nat ).
tff(func_def_31,type,
rs: list(dB) ).
tff(func_def_32,type,
t2: dB ).
tff(func_def_33,type,
u: dB ).
tff(func_def_34,type,
ua: dB ).
tff(func_def_35,type,
sK0: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_36,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_37,type,
sK2: ( nat * nat ) > nat ).
tff(func_def_38,type,
sK3: nat > nat ).
tff(func_def_39,type,
sK4: nat > nat ).
tff(func_def_40,type,
sK5:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_41,type,
sK6:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_42,type,
sK7: ( nat * nat ) > nat ).
tff(func_def_43,type,
sK8: ( nat * nat ) > nat ).
tff(func_def_44,type,
sK9: nat > nat ).
tff(func_def_45,type,
sK10: fun(nat,bool) > nat ).
tff(func_def_46,type,
sK11: nat > nat ).
tff(func_def_47,type,
sK12: fun(nat,bool) > nat ).
tff(func_def_48,type,
sK13: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_49,type,
sK14: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_50,type,
sK15: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_51,type,
sK16: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_5,type,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(f4,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),foldl(dB,dB,app,var(n),rs)),t1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_nT) ).
tff(f94,axiom,
! [X0: type,X1: list(dB),X2: nat,X3: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,var(X2),X1)),X0))
=> ~ ! [X4: list(type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),var(X2)),foldr(type,type,fun1,X4,X0)))
=> ~ typings(X3,X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_93_var__app__typesE) ).
tff(f115,axiom,
! [X0: list(type)] :
( typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
=> thesis ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f116,conjecture,
thesis,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f117,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f116]) ).
tff(f118,plain,
~ thesis,
inference(flattening,[],[f117]) ).
tff(f179,plain,
! [X0: type,X1: list(dB),X2: nat,X3: fun(nat,type)] :
( ? [X4: list(type)] :
( typings(X3,X1,X4)
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),var(X2)),foldr(type,type,fun1,X4,X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,var(X2),X1)),X0)) ),
inference(ennf_transformation,[],[f94]) ).
tff(f187,plain,
! [X0: list(type)] :
( thesis
| ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0) ),
inference(ennf_transformation,[],[f115]) ).
tff(f191,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),foldl(dB,dB,app,var(n),rs)),t1)),
inference(cnf_transformation,[],[f4]) ).
tff(f311,plain,
! [X2: nat,X3: fun(nat,type),X0: type,X1: list(dB)] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,var(X2),X1)),X0))
| typings(X3,X1,sK13(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f179]) ).
tff(f335,plain,
! [X0: list(type)] :
( ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
| thesis ),
inference(cnf_transformation,[],[f187]) ).
tff(f336,plain,
~ thesis,
inference(cnf_transformation,[],[f118]) ).
tff(f424,plain,
! [X0: list(type)] :
( ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
| ~ thesis ),
inference(consistent_polarity_flipping,[],[f335]) ).
tff(f425,plain,
thesis,
inference(consistent_polarity_flipping,[],[f336]) ).
tff(f427,definition,
( spl17_1
<=> thesis ),
introduced(definition,[new_symbols(definition,[spl17_1])],[avatar_definition]) ).
tff(f431,definition,
( spl17_2
<=> ! [X0: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0) ),
introduced(definition,[new_symbols(definition,[spl17_2])],[avatar_definition]) ).
tff(f432,plain,
( ! [X0: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
| ~ spl17_2 ),
inference(avatar_component_clause,[],[f431]) ).
tff(f433,plain,
( ~ spl17_1
| spl17_2 ),
inference(avatar_split_clause,[],[f424,f431,f427]) ).
tff(f434,plain,
spl17_1,
inference(avatar_split_clause,[],[f425,f427]) ).
tff(f1071,plain,
typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,sK13(t1,rs,n,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),
inference(resolution,[],[f191,f311]) ).
tff(f1078,plain,
( $false
| ~ spl17_2 ),
inference(forward_subsumption_resolution,[],[f1071,f432]) ).
tff(f1079,plain,
~ spl17_2,
inference(avatar_contradiction_clause,[],[f1078]) ).
cnf(s1,plain,
( ~ spl17_1
| spl17_2 ),
inference(sat_conversion,[],[f433]) ).
cnf(s2,plain,
spl17_1,
inference(sat_conversion,[],[f434]) ).
cnf(s13,plain,
~ spl17_2,
inference(sat_conversion,[],[f1079]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s13,s2]) ).
tff(f1080,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL821_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 % Computer : n008.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Sun Sep 27 16:56:55 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/0.42 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
% 0.17/0.52 % (1451758)Will run a generic schedule for satisfiability detection.
% 0.17/0.52 % (1451769)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3530656868:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.52 % (1451764)% WARNING: option uhcvi not known.
% 0.17/0.52 % (1451763)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3387392421_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.52 % (1451767)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=681419386:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.52 % (1451768)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1335447711:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.52 % (1451764)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1597842344:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.52 % (1451765)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3997971042:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.52 % (1451766)dis+10_1_sil=32000:sp=arity:random_seed=1634459248:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.52 % Exception at run slice level
% 0.17/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.52 % (1451777)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2006549141:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.52 % Exception at run slice level
% 0.17/0.52 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.52 % (1451764) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1451758-1451764"...
% 0.17/0.52 % (1451764)...printing done.
% 0.17/0.52 % (1451766) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1451758-1451766"...
% 0.17/0.52 % (1451764)Refutation found. Thanks to Tanya!
% 0.17/0.52 % SZS status Theorem for theBenchmark
% 0.17/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.52 % (1451764)------------------------------
% 0.17/0.52 % (1451764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.52 % (1451764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.52 % (1451764)CaDiCaL version: 2.1.3
% 0.17/0.52 % (1451764)Termination reason: Refutation
% 0.17/0.52 % (1451764)Time elapsed: 0.037 s
% 0.17/0.52 % (1451764)Peak memory usage: 13 MB
% 0.17/0.52 % (1451764)Instructions burned: 60 (million)
% 0.17/0.52 % (1451758)Success in time 0.089 s
% 0.17/0.52 % Vampire exiting
%------------------------------------------------------------------------------