TSTP Solution File: LCL822_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL822_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 : n032.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 : Sun May 5 07:42:45 EDT 2024
% Result : Theorem 0.64s 0.83s
% Output : Refutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 68
% Syntax : Number of formulae : 80 ( 11 unt; 64 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 9 ~; 2 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 46 ( 26 >; 20 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 54 ( 54 usr; 24 con; 0-5 aty)
% Number of variables : 46 ( 14 !; 2 ?; 46 :)
% ( 30 !>; 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(fun(X0,fun(X1,X2)),fun(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,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_12,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_13,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_14,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_15,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_16,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_17,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
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(fun(nat,X0),fun(nat,fun(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(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_25,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_26,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_27,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_28,type,
fFalse: bool ).
tff(func_def_29,type,
fTrue: bool ).
tff(func_def_30,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_31,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
e: fun(nat,type) ).
tff(func_def_37,type,
ea: fun(nat,type) ).
tff(func_def_38,type,
i: nat ).
tff(func_def_39,type,
ia: nat ).
tff(func_def_40,type,
n: nat ).
tff(func_def_41,type,
rs: list(dB) ).
tff(func_def_42,type,
t2: dB ).
tff(func_def_43,type,
u: dB ).
tff(func_def_44,type,
ua: dB ).
tff(func_def_45,type,
sK1: dB > dB ).
tff(func_def_46,type,
sK2: dB > dB ).
tff(func_def_47,type,
sK3: dB > list(dB) ).
tff(func_def_48,type,
sK4: dB > dB ).
tff(func_def_49,type,
sK5: dB > list(dB) ).
tff(func_def_50,type,
sK6: dB > nat ).
tff(func_def_51,type,
sK7: 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,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: dB > $o ).
tff(f201,plain,
$false,
inference(subsumption_resolution,[],[f200,f154]) ).
tff(f154,plain,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),rs),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),rs),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),rs),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),rs),
file('/export/starexec/sandbox/tmp/tmp.7jYP3J1vQv/Vampire---4.8_1257',conj_0) ).
tff(f200,plain,
listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),rs),
inference(unit_resulting_resolution,[],[f176,f173]) ).
tff(f173,plain,
! [X2: fun(nat,type),X0: list(type),X1: list(dB)] :
( listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X2)),X1)
| ~ typings(X2,X1,X0) ),
inference(cnf_transformation,[],[f134]) ).
tff(f134,plain,
! [X0: list(type),X1: list(dB),X2: fun(nat,type)] :
( listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X2)),X1)
| ~ typings(X2,X1,X0) ),
inference(ennf_transformation,[],[f126]) ).
tff(f126,plain,
! [X0: list(type),X1: list(dB),X2: fun(nat,type)] :
( typings(X2,X1,X0)
=> listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X2)),X1) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X8: list(type),X9: list(dB),X10: fun(nat,type)] :
( typings(X10,X9,X8)
=> listsp(dB,aa(fun(dB,fun(type,bool)),fun(dB,bool),aa(fun(fun(type,bool),bool),fun(fun(dB,fun(type,bool)),fun(dB,bool)),combb(fun(type,bool),bool,dB),fEx(type)),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X10)),X9) ),
file('/export/starexec/sandbox/tmp/tmp.7jYP3J1vQv/Vampire---4.8_1257',fact_7_lists__typings) ).
tff(f176,plain,
typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,sK7),
inference(cnf_transformation,[],[f153]) ).
tff(f153,plain,
typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,sK7),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f139,f152]) ).
tff(f152,plain,
( ? [X0: list(type)] : typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
=> typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,sK7) ),
introduced(choice_axiom,[]) ).
tff(f139,plain,
? [X0: list(type)] : typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0),
inference(ennf_transformation,[],[f129]) ).
tff(f129,plain,
~ ! [X0: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
~ ! [X4: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X4),
file('/export/starexec/sandbox/tmp/tmp.7jYP3J1vQv/Vampire---4.8_1257',fact_5__096_B_Bthesis_O_A_I_B_BTs_O_Ae_060i_058T_062_A_124_124_N_Ars_A_058_ATs_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : LCL822_5 : TPTP v8.1.2. Released v6.0.0.
% 0.02/0.13 % 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.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 13:20:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TF1_THM_EQU_NAR problem
% 0.12/0.34 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.7jYP3J1vQv/Vampire---4.8_1257
% 0.64/0.82 % (1372)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.64/0.82 % (1371)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.64/0.82 % (1367)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.64/0.82 % (1370)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.64/0.82 % (1369)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.64/0.82 % (1373)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.64/0.82 % (1374)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.64/0.82 % (1375)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.64/0.83 % (1374)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.64/0.83 % (1371)First to succeed.
% 0.64/0.83 % (1371)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1365"
% 0.64/0.83 % (1375)Refutation not found, incomplete strategy% (1375)------------------------------
% 0.64/0.83 % (1375)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83 % (1375)Termination reason: Refutation not found, incomplete strategy
% 0.64/0.83
% 0.64/0.83 % (1375)Memory used [KB]: 1273
% 0.64/0.83 % (1375)Time elapsed: 0.009 s
% 0.64/0.83 % (1375)Instructions burned: 16 (million)
% 0.64/0.83 % (1375)------------------------------
% 0.64/0.83 % (1375)------------------------------
% 0.64/0.83 % (1371)Refutation found. Thanks to Tanya!
% 0.64/0.83 % SZS status Theorem for Vampire---4
% 0.64/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.64/0.83 % (1371)------------------------------
% 0.64/0.83 % (1371)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.64/0.83 % (1371)Termination reason: Refutation
% 0.64/0.83
% 0.64/0.83 % (1371)Memory used [KB]: 1242
% 0.64/0.83 % (1371)Time elapsed: 0.008 s
% 0.64/0.83 % (1371)Instructions burned: 14 (million)
% 0.64/0.83 % (1365)Success in time 0.483 s
% 0.64/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------