%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL802_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 11:56:39 AM UTC 2026
% Result : Theorem 3.30s 1.15s
% Output : Refutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 57 ( 57 usr; 24 con; 0-5 aty)
% Number of variables : 10 ( 10 !; 0 ?; 10 :)
% 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,
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,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun(dB,fun(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: ( dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun(X0,bool)) > fun(list(X0),bool) ) ).
tff(func_def_17,type,
set_Cons:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(list(X0),bool) ) > fun(list(X0),bool) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_23,type,
typing: fun(nat,type) > fun(dB,fun(type,bool)) ).
tff(func_def_24,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_25,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_26,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
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,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_31,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_32,type,
t2: type ).
tff(func_def_33,type,
t1: type ).
tff(func_def_34,type,
t_a: type ).
tff(func_def_35,type,
t: type ).
tff(func_def_36,type,
ts: list(type) ).
tff(func_def_37,type,
a: dB ).
tff(func_def_38,type,
as: list(dB) ).
tff(func_def_39,type,
e: fun(nat,type) ).
tff(func_def_40,type,
ea: fun(nat,type) ).
tff(func_def_41,type,
i: nat ).
tff(func_def_42,type,
ia: nat ).
tff(func_def_43,type,
n: nat ).
tff(func_def_44,type,
rs: list(dB) ).
tff(func_def_45,type,
t3: dB ).
tff(func_def_46,type,
u: dB ).
tff(func_def_47,type,
ua: dB ).
tff(func_def_48,type,
sK1: dB > dB ).
tff(func_def_49,type,
sK2: dB > dB ).
tff(func_def_50,type,
sK3: dB > list(dB) ).
tff(func_def_51,type,
sK4: dB > list(dB) ).
tff(func_def_52,type,
sK5: dB > nat ).
tff(func_def_53,type,
sK6: dB > dB ).
tff(func_def_54,type,
sK7: list(type) ).
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(pred_def_5,type,
sP0: dB > $o ).
tff(pred_def_6,type,
sP8: type > $o ).
tff(pred_def_7,type,
sP9: type > $o ).
tff(f3,axiom,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_argsT) ).
tff(f8,axiom,
! [X0: list(type),X1: list(dB),X2: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X2,X1),X0))
=> listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(X2)),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_lists__typings) ).
tff(f114,conjecture,
listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(shift(type,e,i,t))),as),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f115,negated_conjecture,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(shift(type,e,i,t))),as),
inference(negated_conjecture,[status(cth)],[f114]) ).
tff(f116,plain,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(shift(type,e,i,t))),as),
inference(flattening,[],[f115]) ).
tff(f119,plain,
! [X0: list(type),X1: list(dB),X2: fun(nat,type)] :
( listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(X2)),X1)
| ~ pp(aa(list(type),bool,typings(X2,X1),X0)) ),
inference(ennf_transformation,[],[f8]) ).
tff(f135,plain,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(shift(type,e,i,t))),as),
inference(cnf_transformation,[],[f116]) ).
tff(f150,plain,
! [X2: fun(nat,type),X0: list(type),X1: list(dB)] :
( listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),typing(X2)),X1)
| ~ pp(aa(list(type),bool,typings(X2,X1),X0)) ),
inference(cnf_transformation,[],[f119]) ).
tff(f156,plain,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
inference(cnf_transformation,[],[f3]) ).
tff(f164,plain,
! [X0: list(type)] : ~ pp(aa(list(type),bool,typings(shift(type,e,i,t),as),X0)),
inference(resolution,[],[f135,f150]) ).
tff(f166,plain,
$false,
inference(resolution,[],[f164,f156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL802_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n013.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 16:52:06 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.30/1.15 % (415930)Detected formulas, will run a generic FOF schedule.
% 3.30/1.15 % (415941)dis-21_1_sil=8000:lcm=predicate:random_seed=3729952778:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.30/1.15 % (415940)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2024936871:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.30/1.15 % (415939)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=899447857:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.30/1.15 % (415937)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3350403577:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.30/1.15 % (415935)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1572538355:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.30/1.15 % (415938)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=996276992:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.30/1.15 % (415936)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2020215641:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.30/1.15 % (415938)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.30/1.15 % (415938)First to succeed.
% 3.30/1.15 % (415938)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-415930"
% 3.30/1.15 % (415937)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.30/1.15 % (415941)Also succeeded, but the first one will report.
% 3.30/1.15 % (415940)Also succeeded, but the first one will report.
% 3.30/1.15 % (415939)Also succeeded, but the first one will report.
% 3.30/1.15 % (415938)Refutation found. Thanks to Tanya!
% 3.30/1.15 % SZS status Theorem for theBenchmark
% 3.30/1.15 % SZS output start Proof for theBenchmark
% See solution above
% 3.30/1.15 % (415938)------------------------------
% 3.30/1.15 % (415938)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.30/1.15 % (415938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.30/1.15 % (415938)CaDiCaL version: 2.1.3
% 3.30/1.15 % (415938)Termination reason: Refutation
% 3.30/1.15 % (415938)Time elapsed: 0.005 s
% 3.30/1.15 % (415938)Peak memory usage: 89 MB
% 3.30/1.15 % (415938)Instructions burned: 5 (million)
% 3.30/1.15 % (415938)------------------------------
% 3.30/1.15 % (415938)------------------------------
% 3.30/1.15 % (415930)Success in time 0.428 s
% 3.30/1.15 % Vampire exiting
%------------------------------------------------------------------------------