%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL825_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:45 PM UTC 2026
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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; 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(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,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_15,type,
hd:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_16,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_17,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_22,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: fun(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_25,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_26,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_27,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_28,type,
fFalse: bool ).
tff(func_def_29,type,
fTrue: bool ).
tff(func_def_30,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_31,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
e: fun(nat,type) ).
tff(func_def_37,type,
ea: fun(nat,type) ).
tff(func_def_38,type,
i: nat ).
tff(func_def_39,type,
ia: nat ).
tff(func_def_40,type,
n: nat ).
tff(func_def_41,type,
rs: list(dB) ).
tff(func_def_42,type,
t2: dB ).
tff(func_def_43,type,
u: dB ).
tff(func_def_44,type,
ua: dB ).
tff(func_def_45,type,
sK1: list(type) ).
tff(func_def_46,type,
sK2: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_47,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK5: ( dB * fun(nat,type) ) > type ).
tff(func_def_50,type,
sK6: ( dB * fun(nat,type) ) > type ).
tff(func_def_51,type,
sK7: dB > dB ).
tff(func_def_52,type,
sK8: dB > dB ).
tff(func_def_53,type,
sK9: dB > list(dB) ).
tff(func_def_54,type,
sK10: dB > list(dB) ).
tff(func_def_55,type,
sK11: dB > nat ).
tff(func_def_56,type,
sK12: dB > dB ).
tff(func_def_57,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_58,type,
sK14: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_59,type,
sK15: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_60,type,
sK16: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_61,type,
sK17: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_62,type,
sK18: ( dB * dB ) > dB ).
tff(func_def_63,type,
sK19: ( dB * dB * dB ) > dB ).
tff(func_def_64,type,
sK20: ( dB * dB * dB ) > dB ).
tff(func_def_65,type,
sK21: ( dB * dB * dB ) > dB ).
tff(func_def_66,type,
sK22:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_67,type,
sK23:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_68,type,
sK24:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
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] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: dB > $o ).
tff(f5,axiom,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_listsp_ONil) ).
tff(f7,axiom,
! [X0: $tType,X1: $tType,X2: fun(X0,X1)] : ( map(X0,X1,X2,nil(X0)) = nil(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_map_Osimps_I1_J) ).
tff(f115,conjecture,
listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f116,negated_conjecture,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(negated_conjecture,[status(cth)],[f115]) ).
tff(f119,plain,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(flattening,[],[f116]) ).
tff(f223,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f5]) ).
tff(f226,plain,
! [X1: $tType,X0: $tType,X2: fun(X0,X1)] : ( nil(X1) = map(X0,X1,X2,nil(X0)) ),
inference(cnf_transformation,[],[f7]) ).
tff(f380,plain,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(cnf_transformation,[],[f119]) ).
tff(f571,plain,
~ listsp(dB,it,nil(dB)),
inference(superposition,[],[f380,f226]) ).
tff(f572,plain,
$false,
inference(forward_subsumption_resolution,[],[f571,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL825_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.13/0.38 % Computer : n007.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 16:55:10 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/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
% 0.20/0.49 % (1649466)Will run a generic schedule for satisfiability detection.
% 0.20/0.49 % (1649473)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=578728540:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.49 % (1649472)% WARNING: option uhcvi not known.
% 0.20/0.49 % (1649472)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=148430852:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.49 % (1649471)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2804539861_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.49 % (1649474)dis+10_1_sil=32000:sp=arity:random_seed=974337045:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.49 % (1649475)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1860837867:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.49 % (1649476)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3204207341:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.49 % (1649477)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2956431055:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.49 % (1649473) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1649466-1649473"...
% 0.20/0.49 % (1649473)...printing done.
% 0.20/0.49 % (1649473)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (1649473)------------------------------
% 0.20/0.49 % (1649473)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.49 % (1649473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.49 % (1649473)CaDiCaL version: 2.1.3
% 0.20/0.49 % (1649473)Termination reason: Refutation
% 0.20/0.49 % (1649473)Time elapsed: 0.010 s
% 0.20/0.49 % (1649473)Peak memory usage: 12 MB
% 0.20/0.49 % (1649473)Instructions burned: 31 (million)
% 0.20/0.49 % (1649466)Success in time 0.061 s
% 0.20/0.49 % Vampire exiting
%------------------------------------------------------------------------------