TSTP Solution File: LCL836_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL836_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 : n006.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:23 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 73
% Syntax : Number of formulae : 84 ( 11 unt; 68 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 9 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 84 ( 38 >; 46 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 58 ( 58 usr; 22 con; 0-5 aty)
% Number of variables : 56 ( 20 !; 0 ?; 56 :)
% ( 36 !>; 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(X0,fun(X1,X2)) * 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,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(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: fun(dB,fun(nat,dB)) ).
tff(func_def_12,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_13,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_14,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_15,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_16,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_17,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_22,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_25,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
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,
t1: type ).
tff(func_def_31,type,
t_a: type ).
tff(func_def_32,type,
t: type ).
tff(func_def_33,type,
a: dB ).
tff(func_def_34,type,
as: list(dB) ).
tff(func_def_35,type,
e: fun(nat,type) ).
tff(func_def_36,type,
ea: fun(nat,type) ).
tff(func_def_37,type,
i: nat ).
tff(func_def_38,type,
ia: nat ).
tff(func_def_39,type,
r: dB ).
tff(func_def_40,type,
t2: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK2: ( dB * dB * dB ) > dB ).
tff(func_def_44,type,
sK3: ( dB * dB * dB ) > dB ).
tff(func_def_45,type,
sK4: ( dB * dB * dB ) > dB ).
tff(func_def_46,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_47,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_48,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_49,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_50,type,
sK9: ( dB * dB ) > dB ).
tff(func_def_51,type,
sK10: ( dB * fun(nat,type) ) > type ).
tff(func_def_52,type,
sK11: ( dB * fun(nat,type) ) > type ).
tff(func_def_53,type,
sK12: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_54,type,
sK13: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_55,type,
sK14: ( type * dB * dB * fun(nat,type) ) > type ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $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 * dB * dB ) > $o ).
tff(pred_def_6,type,
sP1: ( dB * dB * dB ) > $o ).
tff(f330,plain,
$false,
inference(unit_resulting_resolution,[],[f277,f276,f275,f238,f270]) ).
tff(f270,plain,
! [X2: nat,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| ~ pp(aa(dB,bool,it,X0))
| pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2))) ),
inference(cnf_transformation,[],[f177]) ).
tff(f177,plain,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2)))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1)) ),
inference(flattening,[],[f176]) ).
tff(f176,plain,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2)))
| ~ pp(aa(type,bool,typing(X3,X0),t))
| ~ pp(aa(dB,bool,it,X0))
| ~ pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1)) ),
inference(ennf_transformation,[],[f134]) ).
tff(f134,plain,
! [X0: dB,X1: type,X2: nat,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(shift(type,X3,X2,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X1))
=> ( pp(aa(dB,bool,it,X0))
=> ( pp(aa(type,bool,typing(X3,X0),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X0),X2))) ) ) ),
inference(rectify,[],[f13]) ).
tff(f13,axiom,
! [X15: dB,X16: type,X17: nat,X18: fun(nat,type)] :
( pp(aa(type,bool,typing(shift(type,X18,X17,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X16))
=> ( pp(aa(dB,bool,it,X15))
=> ( pp(aa(type,bool,typing(X18,X15),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),X15),X17))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_12_SI1) ).
tff(f238,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(cnf_transformation,[],[f114]) ).
tff(f114,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(flattening,[],[f113]) ).
tff(f113,negated_conjecture,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
inference(negated_conjecture,[],[f112]) ).
tff(f112,conjecture,
pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),u),i))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f275,plain,
pp(aa(type,bool,typing(shift(type,e,i,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),t1)),
inference(cnf_transformation,[],[f7]) ).
tff(f7,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t),foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,r),a),zero_zero(nat)),as)),t1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_6__096e_060i_058T_062_A_092_060turnstile_062_Ar_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_A_058_AT_H_096) ).
tff(f276,plain,
pp(aa(type,bool,typing(e,u),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
pp(aa(type,bool,typing(e,u),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_uT) ).
tff(f277,plain,
pp(aa(dB,bool,it,u)),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
pp(aa(dB,bool,it,u)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_uIT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL836_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n006.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 : Mon May 20 01:44:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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/benchmark/theBenchmark.p
% 0.55/0.74 % (15050)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.55/0.75 % (15043)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.55/0.75 % (15045)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.75 % (15044)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.55/0.75 % (15046)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.55/0.75 % (15048)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.55/0.75 % (15047)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.55/0.75 % (15049)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.55/0.75 % (15049)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.55/0.75 % (15049)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.55/0.76 % (15049)First to succeed.
% 0.55/0.76 % (15049)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15042"
% 0.60/0.76 % (15049)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for theBenchmark
% 0.60/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.76 % (15049)------------------------------
% 0.60/0.76 % (15049)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (15049)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (15049)Memory used [KB]: 1265
% 0.60/0.76 % (15049)Time elapsed: 0.012 s
% 0.60/0.76 % (15049)Instructions burned: 20 (million)
% 0.60/0.76 % (15042)Success in time 0.385 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------