%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL805_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 : n003.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:40 PM UTC 2026
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-4 aty)
% Number of functors : 68 ( 68 usr; 16 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,
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,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_4,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_5,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_6,type,
it: fun(dB,bool) ).
tff(func_def_7,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_8,type,
abs: dB > dB ).
tff(func_def_9,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_10,type,
var: nat > dB ).
tff(func_def_11,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_12,type,
dB_size: dB > nat ).
tff(func_def_13,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_14,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_15,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_16,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_17,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_18,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_20,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_21,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_22,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_23,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_24,type,
monoid_add_listsum:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_25,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
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,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
i: nat ).
tff(func_def_33,type,
n: nat ).
tff(func_def_34,type,
rs: list(dB) ).
tff(func_def_35,type,
t: dB ).
tff(func_def_36,type,
u: dB ).
tff(func_def_37,type,
ua: dB ).
tff(func_def_38,type,
sK2:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_39,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_40,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_41,type,
sK5: dB > dB ).
tff(func_def_42,type,
sK6: dB > dB ).
tff(func_def_43,type,
sK7: dB > list(dB) ).
tff(func_def_44,type,
sK8: dB > list(dB) ).
tff(func_def_45,type,
sK9: dB > nat ).
tff(func_def_46,type,
sK10: dB > dB ).
tff(func_def_47,type,
sK11: dB > dB ).
tff(func_def_48,type,
sK12: dB > dB ).
tff(func_def_49,type,
sK13: dB > dB ).
tff(func_def_50,type,
sK14: dB > nat ).
tff(func_def_51,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_52,type,
sK16: ( dB * dB ) > dB ).
tff(func_def_53,type,
sK17: ( dB * dB * dB ) > dB ).
tff(func_def_54,type,
sK18: ( dB * dB * dB ) > dB ).
tff(func_def_55,type,
sK19: ( dB * dB * dB ) > dB ).
tff(func_def_56,type,
sK20: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_57,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_58,type,
sK22: ( dB * list(dB) * dB ) > dB ).
tff(func_def_59,type,
sK23: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_60,type,
sK24: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_61,type,
sK25: ( dB * list(dB) * dB ) > dB ).
tff(func_def_62,type,
sK26: dB > list(dB) ).
tff(func_def_63,type,
sK27: dB > dB ).
tff(func_def_64,type,
sK28: dB > nat ).
tff(func_def_65,type,
sK29: dB > dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
equal_equal:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_4,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_7,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_8,type,
pp: bool > $o ).
tff(pred_def_9,type,
sP0: dB > $o ).
tff(pred_def_10,type,
sP1: ( dB * list(dB) * dB ) > $o ).
tff(f7,axiom,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_listsp_ONil) ).
tff(f9,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_8_map_Osimps_I1_J) ).
tff(f112,conjecture,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),nil(dB)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f113,negated_conjecture,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),nil(dB)))),
inference(negated_conjecture,[status(cth)],[f112]) ).
tff(f116,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),nil(dB)))),
inference(flattening,[],[f113]) ).
tff(f205,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f7]) ).
tff(f208,plain,
! [X1: $tType,X0: $tType,X2: fun(X0,X1)] : ( nil(X1) = map(X0,X1,X2,nil(X0)) ),
inference(cnf_transformation,[],[f9]) ).
tff(f366,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),nil(dB)))),
inference(cnf_transformation,[],[f116]) ).
tff(f409,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),nil(dB))),
inference(superposition,[],[f366,f208]) ).
tff(f410,plain,
~ listsp(dB,it,nil(dB)),
inference(forward_demodulation,[],[f409,f208]) ).
tff(f411,plain,
$false,
inference(forward_subsumption_resolution,[],[f410,f205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL805_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.14/0.40 % Computer : n003.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sun Sep 27 16:55:11 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.44 Running first-order model finding
% 0.14/0.44 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.18/0.50 % (778957)Will run a generic schedule for satisfiability detection.
% 0.18/0.50 % (778966)% WARNING: option uhcvi not known.
% 0.18/0.50 % (778970)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3581629548:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.50 % (778968)dis+10_1_sil=32000:sp=arity:random_seed=2612804768:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.50 % (778971)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2384455959:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.50 % (778965)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2594302206_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.50 % (778967)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2985479323:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.50 % (778966)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2167206588:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.50 % (778969)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1484883518:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.50 % Exception at run slice level
% 0.18/0.50 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.50 % (778968) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-778957-778968"...
% 0.18/0.50 % (778966) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-778957-778966"...
% 0.18/0.50 % (778968)...printing done.
% 0.18/0.50 % (778971) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-778957-778971"...
% 0.18/0.50 % (778966)...printing done.
% 0.18/0.50 % (778968)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50 % (778968)------------------------------
% 0.18/0.50 % (778968)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.50 % (778968)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.50 % (778968)CaDiCaL version: 2.1.3
% 0.18/0.50 % (778968)Termination reason: Refutation
% 0.18/0.50 % (778968)Time elapsed: 0.010 s
% 0.18/0.50 % (778968)Peak memory usage: 12 MB
% 0.18/0.50 % (778968)Instructions burned: 16 (million)
% 0.18/0.50 % (778957)Success in time 0.052 s
% 0.18/0.50 % Vampire exiting
%------------------------------------------------------------------------------