TSTP Solution File: LCL816_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL816_5 : TPTP v8.1.2. 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 : n028.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 : Wed May 1 03:20:20 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 72
% Syntax : Number of formulae : 84 ( 10 unt; 68 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 : 70 ( 31 >; 39 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 59 ( 59 usr; 24 con; 0-5 aty)
% Number of variables : 60 ( 26 !; 0 ?; 60 :)
% ( 34 !>; 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,
sK0: ( dB * fun(nat,type) ) > type ).
tff(func_def_48,type,
sK1: ( dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK2: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_50,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_51,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_52,type,
sK5:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_53,type,
sK6: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK8: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_56,type,
sK9: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
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,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f371,plain,
$false,
inference(subsumption_resolution,[],[f362,f271]) ).
tff(f271,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/tmp/tmp.DKi6dApMbO/Vampire---4.8_3571',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(f362,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,[],[f360,f270]) ).
tff(f270,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/tmp/tmp.DKi6dApMbO/Vampire---4.8_3571',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(f360,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,[],[f229,f299]) ).
tff(f299,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,[],[f195]) ).
tff(f195,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,[],[f194]) ).
tff(f194,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,[],[f163]) ).
tff(f163,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/tmp/tmp.DKi6dApMbO/Vampire---4.8_3571',fact_43_list__app__typeI) ).
tff(f229,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,[],[f117]) ).
tff(f117,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/tmp/tmp.DKi6dApMbO/Vampire---4.8_3571',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL816_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/0.15 % 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.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 17:03:15 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF1_THM_EQU_NAR problem
% 0.15/0.36 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/tmp/tmp.DKi6dApMbO/Vampire---4.8_3571
% 0.61/0.78 % (3769)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.78 % (3771)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.78 % (3764)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.78 % (3765)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.78 % (3766)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.78 % (3767)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.78 % (3768)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 Vampire---4 for (2995ds/34Mi)
% 0.61/0.78 % (3770)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.79 % (3769)Refutation not found, incomplete strategy% (3769)------------------------------
% 0.61/0.79 % (3769)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (3769)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (3769)Memory used [KB]: 1243
% 0.61/0.79 % (3769)Time elapsed: 0.009 s
% 0.61/0.79 % (3769)Instructions burned: 15 (million)
% 0.61/0.79 % (3769)------------------------------
% 0.61/0.79 % (3769)------------------------------
% 0.61/0.79 % (3771)First to succeed.
% 0.61/0.79 % (3770)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.79 % (3771)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (3771)------------------------------
% 0.61/0.79 % (3771)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.79 % (3771)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (3771)Memory used [KB]: 1270
% 0.61/0.79 % (3771)Time elapsed: 0.010 s
% 0.61/0.79 % (3771)Instructions burned: 17 (million)
% 0.61/0.79 % (3771)------------------------------
% 0.61/0.79 % (3771)------------------------------
% 0.61/0.79 % (3738)Success in time 0.415 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------