TSTP Solution File: LCL794_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL794_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:22:59 EDT 2024
% Result : Theorem 0.71s 0.92s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 66
% Syntax : Number of formulae : 92 ( 16 unt; 59 typ; 0 def)
% Number of atoms : 55 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 40 ( 18 ~; 12 |; 0 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 56 ( 26 >; 30 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 51 ( 51 usr; 25 con; 0-5 aty)
% Number of variables : 113 ( 85 !; 0 ?; 113 :)
% ( 28 !>; 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(X0,fun1(X1,X2)) * 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,
beta: fun1(dB,fun1(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun1(dB,fun1(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: fun1(dB,fun1(nat,dB)) ).
tff(func_def_12,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_20,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_21,type,
type_case:
!>[X0: $tType] : ( ( fun1(nat,X0) * fun1(type,fun1(type,X0)) * type ) > X0 ) ).
tff(func_def_22,type,
typing: ( fun1(nat,type) * dB ) > fun1(type,bool) ).
tff(func_def_23,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_28,type,
t1: type ).
tff(func_def_29,type,
t: type ).
tff(func_def_30,type,
t_a: type ).
tff(func_def_31,type,
t2: type ).
tff(func_def_32,type,
ts: list(type) ).
tff(func_def_33,type,
a: dB ).
tff(func_def_34,type,
as: list(dB) ).
tff(func_def_35,type,
e: fun1(nat,type) ).
tff(func_def_36,type,
ea: fun1(nat,type) ).
tff(func_def_37,type,
i: nat ).
tff(func_def_38,type,
ia: nat ).
tff(func_def_39,type,
n: nat ).
tff(func_def_40,type,
rs: list(dB) ).
tff(func_def_41,type,
t3: dB ).
tff(func_def_42,type,
u: dB ).
tff(func_def_43,type,
ua: dB ).
tff(func_def_44,type,
sK0: ( dB * fun1(nat,type) ) > type ).
tff(func_def_45,type,
sK1: ( dB * fun1(nat,type) ) > type ).
tff(func_def_46,type,
sK2: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_47,type,
sK3: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_48,type,
sK4: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun1(X0,fun1(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(f246,plain,
$false,
inference(subsumption_resolution,[],[f245,f211]) ).
tff(f211,plain,
! [X0: nat,X1: type] : pp(aa(type,bool,typing(shift(type,e,X0,X1),aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),X0)),t2)),
inference(unit_resulting_resolution,[],[f198,f174]) ).
tff(f174,plain,
! [X2: type,X3: dB,X0: type,X1: nat,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(shift(type,X4,X1,X0),aa(nat,dB,aa(dB,fun1(nat,dB),lift,X3),X1)),X2))
| ~ pp(aa(type,bool,typing(X4,X3),X2)) ),
inference(cnf_transformation,[],[f140]) ).
tff(f140,plain,
! [X0: type,X1: nat,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(shift(type,X4,X1,X0),aa(nat,dB,aa(dB,fun1(nat,dB),lift,X3),X1)),X2))
| ~ pp(aa(type,bool,typing(X4,X3),X2)) ),
inference(ennf_transformation,[],[f128]) ).
tff(f128,plain,
! [X0: type,X1: nat,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(X4,X3),X2))
=> pp(aa(type,bool,typing(shift(type,X4,X1,X0),aa(nat,dB,aa(dB,fun1(nat,dB),lift,X3),X1)),X2)) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X4: type,X5: nat,X6: type,X7: dB,X8: fun1(nat,type)] :
( pp(aa(type,bool,typing(X8,X7),X6))
=> pp(aa(type,bool,typing(shift(type,X8,X5,X4),aa(nat,dB,aa(dB,fun1(nat,dB),lift,X7),X5)),X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_lift__type) ).
tff(f198,plain,
pp(aa(type,bool,typing(e,u),t2)),
inference(forward_demodulation,[],[f185,f184]) ).
tff(f184,plain,
aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)) = t2,
inference(cnf_transformation,[],[f8]) ).
tff(f8,axiom,
aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)) = t2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_T) ).
tff(f185,plain,
pp(aa(type,bool,typing(e,u),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,typing(e,u),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_uT_H) ).
tff(f245,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),t2)),
inference(forward_demodulation,[],[f244,f184]) ).
tff(f244,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),aa(type,type,aa(type,fun1(type,type),fun,t1),foldr(type,type,fun,ts,t)))),
inference(forward_demodulation,[],[f242,f194]) ).
tff(f194,plain,
! [X0: $tType,X2: fun1(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
inference(equality_resolution,[],[f175]) ).
tff(f175,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,[],[f141]) ).
tff(f141,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,[],[f129]) ).
tff(f129,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,[],[f24]) ).
tff(f24,axiom,
! [X0: $tType,X6: X0,X8: fun1(nat,X0),X27: nat,X5: nat] :
( ( X5 = X27 )
=> ( aa(nat,X0,shift(X0,X8,X5,X6),X27) = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_shift__eq) ).
tff(f242,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),aa(type,type,aa(type,fun1(type,type),fun,aa(nat,type,shift(type,e,zero_zero(nat),t1),zero_zero(nat))),foldr(type,type,fun,ts,t)))),
inference(unit_resulting_resolution,[],[f192,f156,f181]) ).
tff(f181,plain,
! [X2: type,X3: dB,X0: dB,X1: type,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(X4,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,typing(X4,X0),X2))
| ~ pp(aa(type,bool,typing(X4,X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(cnf_transformation,[],[f144]) ).
tff(f144,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(X4,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,typing(X4,X0),X2))
| ~ pp(aa(type,bool,typing(X4,X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(flattening,[],[f143]) ).
tff(f143,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(X4,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,typing(X4,X0),X2))
| ~ pp(aa(type,bool,typing(X4,X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(ennf_transformation,[],[f132]) ).
tff(f132,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,typing(X4,X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1)))
=> ( pp(aa(type,bool,typing(X4,X0),X2))
=> pp(aa(type,bool,typing(X4,aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1)) ) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X7: dB,X4: type,X6: type,X9: dB,X10: fun1(nat,type)] :
( pp(aa(type,bool,typing(X10,X9),aa(type,type,aa(type,fun1(type,type),fun,X6),X4)))
=> ( pp(aa(type,bool,typing(X10,X7),X6))
=> pp(aa(type,bool,typing(X10,aa(dB,dB,aa(dB,fun1(dB,dB),app,X9),X7)),X4)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_App) ).
tff(f156,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),var(zero_zero(nat)))),foldr(type,type,fun,ts,t))),
inference(cnf_transformation,[],[f114]) ).
tff(f114,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),var(zero_zero(nat)))),foldr(type,type,fun,ts,t))),
inference(flattening,[],[f113]) ).
tff(f113,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),var(zero_zero(nat)))),foldr(type,type,fun,ts,t))),
inference(negated_conjecture,[],[f112]) ).
tff(f112,conjecture,
pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t1),aa(dB,dB,aa(dB,fun1(dB,dB),app,aa(nat,dB,aa(dB,fun1(nat,dB),lift,u),zero_zero(nat))),var(zero_zero(nat)))),foldr(type,type,fun,ts,t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f192,plain,
! [X2: fun1(nat,type),X1: nat] : pp(aa(type,bool,typing(X2,var(X1)),aa(nat,type,X2,X1))),
inference(equality_resolution,[],[f165]) ).
tff(f165,plain,
! [X2: fun1(nat,type),X0: type,X1: nat] :
( pp(aa(type,bool,typing(X2,var(X1)),X0))
| ( aa(nat,type,X2,X1) != X0 ) ),
inference(cnf_transformation,[],[f137]) ).
tff(f137,plain,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( pp(aa(type,bool,typing(X2,var(X1)),X0))
| ( aa(nat,type,X2,X1) != X0 ) ),
inference(ennf_transformation,[],[f120]) ).
tff(f120,plain,
! [X0: type,X1: nat,X2: fun1(nat,type)] :
( ( aa(nat,type,X2,X1) = X0 )
=> pp(aa(type,bool,typing(X2,var(X1)),X0)) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X6: type,X14: nat,X10: fun1(nat,type)] :
( ( aa(nat,type,X10,X14) = X6 )
=> pp(aa(type,bool,typing(X10,var(X14)),X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_10_typing_OVar) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL794_5 : TPTP v8.2.0. Released v6.0.0.
% 0.07/0.14 % 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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 00:31:38 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.71/0.91 % (15619)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.91 % (15620)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.91 % (15617)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 (2994ds/34Mi)
% 0.71/0.91 % (15621)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 (2994ds/34Mi)
% 0.71/0.91 % (15618)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 (2994ds/51Mi)
% 0.71/0.91 % (15622)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.91 % (15623)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 (2994ds/83Mi)
% 0.71/0.91 % (15624)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 (2994ds/56Mi)
% 0.71/0.92 % (15623)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.71/0.92 % (15623)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.71/0.92 % (15620)First to succeed.
% 0.71/0.92 % (15622)Refutation not found, incomplete strategy% (15622)------------------------------
% 0.71/0.92 % (15622)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.92 % (15622)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.92
% 0.71/0.92 % (15622)Memory used [KB]: 1254
% 0.71/0.92 % (15622)Time elapsed: 0.009 s
% 0.71/0.92 % (15622)Instructions burned: 17 (million)
% 0.71/0.92 % (15622)------------------------------
% 0.71/0.92 % (15622)------------------------------
% 0.71/0.92 % (15620)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15616"
% 0.71/0.92 % (15620)Refutation found. Thanks to Tanya!
% 0.71/0.92 % SZS status Theorem for theBenchmark
% 0.71/0.92 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.92 % (15620)------------------------------
% 0.71/0.92 % (15620)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.92 % (15620)Termination reason: Refutation
% 0.71/0.92
% 0.71/0.92 % (15620)Memory used [KB]: 1251
% 0.71/0.92 % (15620)Time elapsed: 0.010 s
% 0.71/0.92 % (15620)Instructions burned: 17 (million)
% 0.71/0.92 % (15616)Success in time 0.544 s
% 0.71/0.92 % Vampire---4.8 exiting
%------------------------------------------------------------------------------