TSTP Solution File: LCL788_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL788_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.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:08 EDT 2024
% Result : Theorem 0.59s 0.84s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 76
% Syntax : Number of formulae : 92 ( 13 unt; 71 typ; 0 def)
% Number of atoms : 29 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 69 ( 32 >; 37 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 63 ( 63 usr; 26 con; 0-5 aty)
% Number of variables : 78 ( 36 !; 0 ?; 78 :)
% ( 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,
fun1: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,X1),fun1(fun1(X2,X0),fun1(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * X1 ) > fun1(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun1(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,fun1(X1,X2)),fun1(fun1(X0,X1),fun1(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun1(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun1(dB,fun1(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: fun1(dB,fun1(nat,dB)) ).
tff(func_def_11,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun1(X0,fun1(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun1(X0,bool)) > fun1(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun1(X0,bool) * fun1(list(X0),bool) ) > fun1(list(X0),bool) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
collect:
!>[X0: $tType] : ( fun1(X0,bool) > fun1(X0,bool) ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_22,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
type_rec:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,fun1(X0,fun1(X0,X0)))) * type ) > X0 ) ).
tff(func_def_25,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_26,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_27,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_28,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_29,type,
fFalse: bool ).
tff(func_def_30,type,
fTrue: bool ).
tff(func_def_31,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_32,type,
fequal:
!>[X0: $tType] : fun1(X0,fun1(X0,bool)) ).
tff(func_def_33,type,
member:
!>[X0: $tType] : fun1(X0,fun1(fun1(X0,bool),bool)) ).
tff(func_def_34,type,
t1: type ).
tff(func_def_35,type,
t: type ).
tff(func_def_36,type,
t_a: type ).
tff(func_def_37,type,
t2: type ).
tff(func_def_38,type,
ts: list(type) ).
tff(func_def_39,type,
a: dB ).
tff(func_def_40,type,
as: list(dB) ).
tff(func_def_41,type,
e: fun1(nat,type) ).
tff(func_def_42,type,
ea: fun1(nat,type) ).
tff(func_def_43,type,
i: nat ).
tff(func_def_44,type,
ia: nat ).
tff(func_def_45,type,
n: nat ).
tff(func_def_46,type,
rs: list(dB) ).
tff(func_def_47,type,
t3: dB ).
tff(func_def_48,type,
u: dB ).
tff(func_def_49,type,
ua: dB ).
tff(func_def_50,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun1(X1,X0) * fun1(X1,X0) ) > X1 ) ).
tff(func_def_51,type,
sK1: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK2: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK3: ( type * type * list(dB) * fun1(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK4: ( type * list(dB) * nat * fun1(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK5: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_56,type,
sK6: list(type) ).
tff(func_def_57,type,
sK7: type ).
tff(func_def_58,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(X1,X0)) > X1 ) ).
tff(func_def_60,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun1(X0,fun1(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] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(f320,plain,
$false,
inference(subsumption_resolution,[],[f319,f208]) ).
tff(f208,plain,
t2 != aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
t2 != aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
( ~ t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)) ),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
file('/export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074',conj_0) ).
tff(f319,plain,
t2 = aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)),
inference(forward_demodulation,[],[f318,f299]) ).
tff(f299,plain,
! [X0: $tType,X2: fun1(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
inference(equality_resolution,[],[f258]) ).
tff(f258,plain,
! [X0: $tType,X2: fun1(nat,X0),X3: nat,X1: X0,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(cnf_transformation,[],[f174]) ).
tff(f174,plain,
! [X0: $tType,X1: X0,X2: fun1(nat,X0),X3: nat,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(ennf_transformation,[],[f144]) ).
tff(f144,plain,
! [X0: $tType,X1: X0,X2: fun1(nat,X0),X3: nat,X4: nat] :
( ( X3 = X4 )
=> ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 ) ),
inference(rectify,[],[f23]) ).
tff(f23,axiom,
! [X0: $tType,X10: X0,X12: fun1(nat,X0),X28: nat,X11: nat] :
( ( X11 = X28 )
=> ( aa(nat,X0,shift(X0,X12,X11,X10),X28) = X10 ) ),
file('/export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074',fact_22_shift__eq) ).
tff(f318,plain,
aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)) = aa(nat,type,shift(type,e,n,t2),n),
inference(resolution,[],[f279,f256]) ).
tff(f256,plain,
! [X2: fun1(nat,type),X0: type,X1: nat] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0))
| ( aa(nat,type,X2,X1) = X0 ) ),
inference(cnf_transformation,[],[f172]) ).
tff(f172,plain,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( ( aa(nat,type,X2,X1) = X0 )
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0)) ),
inference(ennf_transformation,[],[f142]) ).
tff(f142,plain,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X2),var(X1)),X0))
=> ( aa(nat,type,X2,X1) = X0 ) ),
inference(rectify,[],[f18]) ).
tff(f18,axiom,
! [X10: type,X11: nat,X12: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X12),var(X11)),X10))
=> ( aa(nat,type,X12,X11) = X10 ) ),
file('/export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074',fact_17_typing__elims_I1_J) ).
tff(f279,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,n,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(definition_unfolding,[],[f227,f261]) ).
tff(f261,plain,
i = n,
inference(cnf_transformation,[],[f16]) ).
tff(f16,axiom,
i = n,
file('/export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074',fact_15_True) ).
tff(f227,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(shift(type,e,i,t2)),var(n)),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
file('/export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074',fact_2_varT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL788_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 16:56:41 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF1_THM_EQU_NAR problem
% 0.16/0.31 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.VwDih54HHT/Vampire---4.8_10074
% 0.59/0.82 % (10188)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.59/0.82 % (10191)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.59/0.82 % (10190)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.59/0.82 % (10192)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.59/0.82 % (10193)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.59/0.82 % (10194)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.59/0.82 % (10195)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.59/0.82 % (10189)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.59/0.82 % (10194)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.59/0.82 % (10193)Refutation not found, incomplete strategy% (10193)------------------------------
% 0.59/0.82 % (10193)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.82 % (10193)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.82
% 0.59/0.82 % (10193)Memory used [KB]: 1198
% 0.59/0.82 % (10193)Time elapsed: 0.006 s
% 0.59/0.82 % (10193)Instructions burned: 10 (million)
% 0.59/0.82 % (10193)------------------------------
% 0.59/0.82 % (10193)------------------------------
% 0.59/0.83 % (10194)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.59/0.83 % (10196)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 Vampire---4 for (2995ds/55Mi)
% 0.59/0.83 % (10190)First to succeed.
% 0.59/0.83 % (10191)Instruction limit reached!
% 0.59/0.83 % (10191)------------------------------
% 0.59/0.83 % (10191)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.84 % (10191)Termination reason: Unknown
% 0.59/0.84 % (10191)Termination phase: Saturation
% 0.59/0.84 % (10192)Instruction limit reached!
% 0.59/0.84 % (10192)------------------------------
% 0.59/0.84 % (10192)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.84 % (10192)Termination reason: Unknown
% 0.59/0.84 % (10192)Termination phase: Saturation
% 0.59/0.84
% 0.59/0.84 % (10192)Memory used [KB]: 1584
% 0.59/0.84 % (10192)Time elapsed: 0.017 s
% 0.59/0.84 % (10192)Instructions burned: 34 (million)
% 0.59/0.84 % (10192)------------------------------
% 0.59/0.84 % (10192)------------------------------
% 0.59/0.84
% 0.59/0.84 % (10191)Memory used [KB]: 1474
% 0.59/0.84 % (10191)Time elapsed: 0.017 s
% 0.59/0.84 % (10191)Instructions burned: 33 (million)
% 0.59/0.84 % (10191)------------------------------
% 0.59/0.84 % (10191)------------------------------
% 0.59/0.84 % (10188)Instruction limit reached!
% 0.59/0.84 % (10188)------------------------------
% 0.59/0.84 % (10188)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.84 % (10188)Termination reason: Unknown
% 0.59/0.84 % (10188)Termination phase: Saturation
% 0.59/0.84
% 0.59/0.84 % (10188)Memory used [KB]: 1378
% 0.59/0.84 % (10188)Time elapsed: 0.018 s
% 0.59/0.84 % (10190)Refutation found. Thanks to Tanya!
% 0.59/0.84 % SZS status Theorem for Vampire---4
% 0.59/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.84 % (10190)------------------------------
% 0.59/0.84 % (10190)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.84 % (10190)Termination reason: Refutation
% 0.59/0.84
% 0.59/0.84 % (10190)Memory used [KB]: 1258
% 0.59/0.84 % (10190)Time elapsed: 0.013 s
% 0.59/0.84 % (10190)Instructions burned: 20 (million)
% 0.59/0.84 % (10190)------------------------------
% 0.59/0.84 % (10190)------------------------------
% 0.59/0.84 % (10183)Success in time 0.52 s
% 0.59/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------