TSTP Solution File: LCL816_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL816_5 : TPTP v8.2.0. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 00:23:11 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 85
% Syntax : Number of formulae : 97 ( 10 unt; 81 typ; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 93 ( 42 >; 51 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 71 ( 71 usr; 26 con; 0-6 aty)
% Number of variables : 68 ( 26 !; 0 ?; 68 :)
% ( 42 !>; 0 ?*; 0 @-; 0 @+)
% 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,
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(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
typing: 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,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_26,type,
fFalse: bool ).
tff(func_def_27,type,
fTrue: bool ).
tff(func_def_28,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_31,type,
t2: type ).
tff(func_def_32,type,
t: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
a: dB ).
tff(func_def_37,type,
as: list(dB) ).
tff(func_def_38,type,
e: fun(nat,type) ).
tff(func_def_39,type,
ea: fun(nat,type) ).
tff(func_def_40,type,
i: nat ).
tff(func_def_41,type,
ia: nat ).
tff(func_def_42,type,
n: nat ).
tff(func_def_43,type,
rs: list(dB) ).
tff(func_def_44,type,
t3: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK1: list(type) ).
tff(func_def_48,type,
sK2: type ).
tff(func_def_49,type,
sK3: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_50,type,
sK4: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_51,type,
sK5: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK6: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_55,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_56,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_57,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_58,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_59,type,
sK13: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_60,type,
sK14: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_61,type,
sK15: ( dB * fun(nat,type) ) > type ).
tff(func_def_62,type,
sK16: ( dB * fun(nat,type) ) > type ).
tff(func_def_63,type,
sK17: dB > dB ).
tff(func_def_64,type,
sK18: dB > dB ).
tff(func_def_65,type,
sK19: dB > list(dB) ).
tff(func_def_66,type,
sK20: dB > dB ).
tff(func_def_67,type,
sK21: dB > list(dB) ).
tff(func_def_68,type,
sK22: dB > nat ).
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,
pp: bool > $o ).
tff(pred_def_5,type,
sP0: dB > $o ).
tff(pred_def_6,type,
sQ23_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f583,plain,
$false,
inference(subsumption_resolution,[],[f575,f306]) ).
tff(f306,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),var(zero_zero(nat))),foldr(type,type,fun1,ts,t))),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),var(zero_zero(nat))),foldr(type,type,fun1,ts,t))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__096e_0600_058Ts_A_061_062_062_AT_H_062_A_092_060turnstile_062_AVar_A0_A_058_ATs_A_061_062_062_AT_H_096) ).
tff(f575,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),var(zero_zero(nat))),foldr(type,type,fun1,ts,t))),
inference(resolution,[],[f570,f308]) ).
tff(f308,plain,
pp(aa(list(type),bool,typings(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t)),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),as))),ts)),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
pp(aa(list(type),bool,typings(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t)),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),as))),ts)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096e_0600_058Ts_A_061_062_062_AT_H_062_A_124_124_N_Amap_A_I_Ft_O_Alift_At_A0_J_A_Imap_A_I_Ft_O_At_091u_Pi_093_J_Aas_J_A_058_ATs_096) ).
tff(f570,plain,
! [X0: list(type)] :
( ~ pp(aa(list(type),bool,typings(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t)),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),as))),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),var(zero_zero(nat))),foldr(type,type,fun1,X0,t))) ),
inference(resolution,[],[f460,f355]) ).
tff(f355,plain,
! [X2: list(type),X3: dB,X0: list(dB),X1: type,X4: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),foldl(dB,dB,app,X3,X0)),X1))
| ~ pp(aa(list(type),bool,typings(X4,X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),X3),foldr(type,type,fun1,X2,X1))) ),
inference(cnf_transformation,[],[f221]) ).
tff(f221,plain,
! [X0: list(dB),X1: type,X2: list(type),X3: dB,X4: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),foldl(dB,dB,app,X3,X0)),X1))
| ~ pp(aa(list(type),bool,typings(X4,X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),X3),foldr(type,type,fun1,X2,X1))) ),
inference(flattening,[],[f220]) ).
tff(f220,plain,
! [X0: list(dB),X1: type,X2: list(type),X3: dB,X4: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),foldl(dB,dB,app,X3,X0)),X1))
| ~ pp(aa(list(type),bool,typings(X4,X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),X3),foldr(type,type,fun1,X2,X1))) ),
inference(ennf_transformation,[],[f143]) ).
tff(f143,plain,
! [X0: list(dB),X1: type,X2: list(type),X3: dB,X4: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),X3),foldr(type,type,fun1,X2,X1)))
=> ( pp(aa(list(type),bool,typings(X4,X0),X2))
=> pp(aa(type,bool,aa(dB,fun(type,bool),typing(X4),foldl(dB,dB,app,X3,X0)),X1)) ) ),
inference(rectify,[],[f44]) ).
tff(f44,axiom,
! [X5: list(dB),X9: type,X43: list(type),X6: dB,X10: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X10),X6),foldr(type,type,fun1,X43,X9)))
=> ( pp(aa(list(type),bool,typings(X10,X5),X43))
=> pp(aa(type,bool,aa(dB,fun(type,bool),typing(X10),foldl(dB,dB,app,X6,X5)),X9)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_43_list__app__typeI) ).
tff(f460,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),foldl(dB,dB,app,var(zero_zero(nat)),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),as)))),t)),
inference(cnf_transformation,[],[f203]) ).
tff(f203,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),foldl(dB,dB,app,var(zero_zero(nat)),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),as)))),t)),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),foldl(dB,dB,app,var(zero_zero(nat)),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),as)))),t)),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,zero_zero(nat),foldr(type,type,fun1,ts,t))),foldl(dB,dB,app,var(zero_zero(nat)),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),as)))),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL816_5 : TPTP v8.2.0. Released v6.0.0.
% 0.06/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 02:32:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF1_THM_EQU_NAR problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.58/0.74 % (20213)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.58/0.74 % (20207)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (20210)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.74 % (20209)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.58/0.74 % (20208)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.58/0.74 % (20211)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.58/0.74 % (20212)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.58/0.74 % (20213)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.75 % (20213)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.75 % (20213)Refutation not found, incomplete strategy% (20213)------------------------------
% 0.58/0.75 % (20213)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (20213)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (20213)Memory used [KB]: 1338
% 0.58/0.75 % (20213)Time elapsed: 0.009 s
% 0.58/0.75 % (20213)Instructions burned: 27 (million)
% 0.58/0.75 % (20213)------------------------------
% 0.58/0.75 % (20213)------------------------------
% 0.58/0.75 % (20212)Refutation not found, incomplete strategy% (20212)------------------------------
% 0.58/0.75 % (20212)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.75 % (20212)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.75
% 0.58/0.75 % (20212)Memory used [KB]: 1243
% 0.58/0.75 % (20212)Time elapsed: 0.009 s
% 0.58/0.75 % (20212)Instructions burned: 15 (million)
% 0.58/0.75 % (20212)------------------------------
% 0.58/0.75 % (20212)------------------------------
% 0.58/0.75 % (20214)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.58/0.75 % (20215)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.58/0.76 % (20211)First to succeed.
% 0.58/0.76 % (20216)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.58/0.76 % (20214)Also succeeded, but the first one will report.
% 0.58/0.76 % (20211)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20206"
% 0.58/0.76 % (20211)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for theBenchmark
% 0.58/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.76 % (20211)------------------------------
% 0.58/0.76 % (20211)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.76 % (20211)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (20211)Memory used [KB]: 1382
% 0.58/0.76 % (20211)Time elapsed: 0.015 s
% 0.58/0.76 % (20211)Instructions burned: 29 (million)
% 0.58/0.76 % (20206)Success in time 0.392 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------