%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL807_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 : 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 11:56:40 AM UTC 2026
% Result : Theorem 2.67s 1.29s
% Output : Refutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 34 ( 15 ~; 11 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 5 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 54 ( 54 usr; 29 con; 0-5 aty)
% Number of variables : 23 ( 20 !; 3 ?; 23 :)
% 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,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(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,
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: fun(dB,fun(nat,dB)) ).
tff(func_def_11,type,
subst: fun(dB,fun(dB,fun(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,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(list(X0),bool) ) > fun(list(X0),bool) ) ).
tff(func_def_19,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
typing: fun(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_23,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
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,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_33,type,
t2: type ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
t_a: type ).
tff(func_def_36,type,
t: type ).
tff(func_def_37,type,
ts: list(type) ).
tff(func_def_38,type,
a: dB ).
tff(func_def_39,type,
as: list(dB) ).
tff(func_def_40,type,
b: dB ).
tff(func_def_41,type,
bs: list(dB) ).
tff(func_def_42,type,
e: fun(nat,type) ).
tff(func_def_43,type,
ea: fun(nat,type) ).
tff(func_def_44,type,
i: nat ).
tff(func_def_45,type,
ia: nat ).
tff(func_def_46,type,
n: nat ).
tff(func_def_47,type,
rs: list(dB) ).
tff(func_def_48,type,
t3: dB ).
tff(func_def_49,type,
u: dB ).
tff(func_def_50,type,
ua: dB ).
tff(func_def_51,type,
sK0: type ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
pp: bool > $o ).
tff(f3,axiom,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( 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),X0),X3),t)),b),X1))
=> ( pp(aa(dB,bool,it,X2))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3))) ) ) )
& ? [X4: type] : 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)),b),X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_Cons_I1_J) ).
tff(f119,axiom,
! [X0: type] :
( 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)),b),X0))
=> thesis ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f120,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f121,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f120]) ).
tff(f122,plain,
~ thesis,
inference(flattening,[],[f121]) ).
tff(f123,plain,
! [X0: type] :
( thesis
| ~ 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)),b),X0)) ),
inference(ennf_transformation,[],[f119]) ).
tff(f127,plain,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ 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),X0),X3),t)),b),X1)) )
& ? [X4: type] : 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)),b),X4)) ),
inference(ennf_transformation,[],[f3]) ).
tff(f128,plain,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ 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),X0),X3),t)),b),X1)) )
& ? [X4: type] : 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)),b),X4)) ),
inference(flattening,[],[f127]) ).
tff(f129,plain,
( ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ 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),X0),X3),t)),b),X1)) )
& 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)),b),sK0)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X4,sK0)],[f128]) ).
tff(f130,plain,
! [X0: type] :
( thesis
| ~ 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)),b),X0)) ),
inference(cnf_transformation,[],[f123]) ).
tff(f131,plain,
~ thesis,
inference(cnf_transformation,[],[f122]) ).
tff(f134,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)),b),sK0)),
inference(cnf_transformation,[],[f129]) ).
tff(f137,plain,
! [X0: type] : ~ 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)),b),X0)),
inference(forward_subsumption_resolution,[],[f130,f131]) ).
tff(f138,plain,
$false,
inference(resolution,[],[f137,f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL807_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.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 16:56:26 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 2.67/1.29 % (3062897)Detected formulas, will run a generic FOF schedule.
% 2.67/1.29 % (3062904)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=2506325733:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.67/1.29 % (3062904)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.67/1.29 % (3062906)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1803396586:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.67/1.29 % (3062902)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=1893964968:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.67/1.29 % (3062908)dis-21_1_sil=8000:lcm=predicate:random_seed=3588868649: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)
% 2.67/1.29 % (3062903)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=2416681489:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.67/1.29 % (3062905)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3905575499:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.67/1.29 % (3062907)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2598133366:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.67/1.29 % (3062905)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.67/1.29 % (3062905)First to succeed.
% 2.67/1.29 % (3062905)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3062897"
% 2.67/1.29 % (3062906)Also succeeded, but the first one will report.
% 2.67/1.29 % (3062907)Also succeeded, but the first one will report.
% 2.67/1.29 % (3062908)Instruction limit reached!
% 2.67/1.29 % (3062908)------------------------------
% 2.67/1.29 % (3062908)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3062908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3062908)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3062908)Termination reason: Instruction limit
% 2.67/1.29 % (3062908)Termination phase: Saturation
% 2.67/1.29 % (3062908)Time elapsed: 0.064 s
% 2.67/1.29 % (3062908)Peak memory usage: 89 MB
% 2.67/1.29 % (3062908)Instructions burned: 131 (million)
% 2.67/1.29 % Exception at run slice level
% 2.67/1.29 User error: GNN currently only supports monomorphic FOL.
% 2.67/1.29 % (3062916)lrs+10_1_sil=8000:sp=occurrence:random_seed=2233520043:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.67/1.29 % (3062916)Also succeeded, but the first one will report.
% 2.67/1.29 % (3062917)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3306438710:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 2.67/1.29 % (3062917)Refutation not found, incomplete strategy
% 2.67/1.29 % (3062917)------------------------------
% 2.67/1.29 % (3062917)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.67/1.29 % (3062917)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.67/1.29 % (3062917)CaDiCaL version: 2.1.3
% 2.67/1.29 % (3062917)Termination reason: Refutation not found, incomplete strategy
% 2.67/1.29 % (3062917)Time elapsed: 0.003 s
% 2.67/1.29 % (3062917)Peak memory usage: 87 MB
% 2.67/1.29 % (3062917)Instructions burned: 10 (million)
% 2.67/1.29 % (3062905)Refutation found. Thanks to Tanya!
% 2.67/1.29 % SZS status Theorem for theBenchmark
% 2.67/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.53/1.48 % (3062905)------------------------------
% 3.53/1.48 % (3062905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.53/1.48 % (3062905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.53/1.48 % (3062905)CaDiCaL version: 2.1.3
% 3.53/1.48 % (3062905)Termination reason: Refutation
% 3.53/1.48 % (3062905)Time elapsed: 0.005 s
% 3.53/1.48 % (3062905)Peak memory usage: 89 MB
% 3.53/1.48 % (3062905)Instructions burned: 6 (million)
% 3.53/1.48 % (3062905)------------------------------
% 3.53/1.48 % (3062905)------------------------------
% 3.53/1.48 % (3062897)Success in time 0.45 s
% 3.53/1.48 % Vampire exiting
%------------------------------------------------------------------------------