%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL805_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 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 11:56:40 AM UTC 2026
% Result : Theorem 3.42s 1.34s
% Output : Refutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 18 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 46 ( 46 usr; 16 con; 0-5 aty)
% Number of variables : 19 ( 19 !; 0 ?; 19 :)
% 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,
sK1: dB > dB ).
tff(func_def_39,type,
sK2: dB > dB ).
tff(func_def_40,type,
sK3: dB > list(dB) ).
tff(func_def_41,type,
sK4: dB > list(dB) ).
tff(func_def_42,type,
sK5: dB > nat ).
tff(func_def_43,type,
sK6: 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,
sP7: list(dB) > $o ).
tff(f7,axiom,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6_listsp_ONil) ).
tff(f10,axiom,
! [X0: $tType,X1: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( map(X1,X0,X3,X2) = nil(X0) )
<=> ( X2 = nil(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9_map__is__Nil__conv) ).
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/sandbox2/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(f114,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(f136,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( ( map(X1,X0,X3,X2) = nil(X0) )
| ( nil(X1) != X2 ) )
& ( ( X2 = nil(X1) )
| ( nil(X0) != map(X1,X0,X3,X2) ) ) ),
inference(nnf_transformation,[],[f10]) ).
tff(f138,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,[],[f114]) ).
tff(f155,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f7]) ).
tff(f173,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( nil(X0) = map(X1,X0,X3,X2) )
| ( nil(X1) != X2 ) ),
inference(cnf_transformation,[],[f136]) ).
tff(f184,plain,
! [X1: $tType,X0: $tType,X3: fun(X1,X0)] : ( nil(X0) = map(X1,X0,X3,nil(X1)) ),
inference(equality_resolution,[],[f173]) ).
tff(f186,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),nil(dB))),
inference(forward_demodulation,[],[f138,f184]) ).
tff(f187,plain,
~ listsp(dB,it,nil(dB)),
inference(forward_demodulation,[],[f186,f184]) ).
tff(f188,plain,
$false,
inference(forward_subsumption_resolution,[],[f187,f155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL805_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 16:55:12 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.34 % (779213)Detected formulas, will run a generic FOF schedule.
% 3.42/1.34 % (779251)dis-21_1_sil=8000:lcm=predicate:random_seed=384862347: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.42/1.34 % (779245)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=1038312928:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.42/1.34 % (779248)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3458594905:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.42/1.34 % (779246)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=697225090:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.42/1.34 % (779247)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=3964425513:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.42/1.34 % (779251)Instruction limit reached!
% 3.42/1.34 % (779251)------------------------------
% 3.42/1.34 % (779251)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.34 % (779251)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.34 % (779251)CaDiCaL version: 2.1.3
% 3.42/1.34 % (779251)Termination reason: Instruction limit
% 3.42/1.34 % (779251)Termination phase: Saturation
% 3.42/1.34 % (779251)Time elapsed: 0.041 s
% 3.42/1.34 % (779251)Peak memory usage: 89 MB
% 3.42/1.34 % (779251)Instructions burned: 130 (million)
% 3.42/1.34 % (779248)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.42/1.34 % (779248)First to succeed.
% 3.42/1.34 % (779248)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-779213"
% 3.42/1.34 % (779247)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.42/1.34 % (779250)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1097778173:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.42/1.34 % (779249)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=95157182:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.42/1.34 % (779249)Also succeeded, but the first one will report.
% 3.42/1.34 % (779250)Also succeeded, but the first one will report.
% 3.42/1.34 % (779257)lrs+10_1_sil=8000:sp=occurrence:random_seed=68152854:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.42/1.34 % (779257)Also succeeded, but the first one will report.
% 3.42/1.34 % (779248)Refutation found. Thanks to Tanya!
% 3.42/1.34 % SZS status Theorem for theBenchmark
% 3.42/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 3.42/1.34 % (779248)------------------------------
% 3.42/1.34 % (779248)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.34 % (779248)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.34 % (779248)CaDiCaL version: 2.1.3
% 3.42/1.34 % (779248)Termination reason: Refutation
% 3.42/1.34 % (779248)Time elapsed: 0.005 s
% 3.42/1.34 % (779248)Peak memory usage: 89 MB
% 3.42/1.34 % (779248)Instructions burned: 6 (million)
% 3.42/1.34 % (779248)------------------------------
% 3.42/1.34 % (779248)------------------------------
% 3.42/1.34 % (779213)Success in time 0.415 s
% 3.42/1.34 % Vampire exiting
%------------------------------------------------------------------------------