TSTP Solution File: LCL838_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL838_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 : 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 : Wed May 1 03:20:31 EDT 2024
% Result : Theorem 0.66s 0.82s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 81
% Syntax : Number of formulae : 99 ( 9 unt; 74 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 16 ~; 9 |; 6 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 94 ( 45 >; 49 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 4 prp; 0-3 aty)
% Number of functors : 62 ( 62 usr; 21 con; 0-5 aty)
% Number of variables : 61 ( 32 !; 4 ?; 61 :)
% ( 25 !>; 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,
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,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_15,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_16,type,
suc: nat > nat ).
tff(func_def_17,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_18,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_19,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_20,type,
fFalse: bool ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
t1: type ).
tff(func_def_24,type,
t_a: type ).
tff(func_def_25,type,
t: type ).
tff(func_def_26,type,
a: dB ).
tff(func_def_27,type,
as: list(dB) ).
tff(func_def_28,type,
e: fun(nat,type) ).
tff(func_def_29,type,
ea: fun(nat,type) ).
tff(func_def_30,type,
i: nat ).
tff(func_def_31,type,
ia: nat ).
tff(func_def_32,type,
r: dB ).
tff(func_def_33,type,
t2: dB ).
tff(func_def_34,type,
u: dB ).
tff(func_def_35,type,
ua: dB ).
tff(func_def_36,type,
sK1: ( dB * fun(nat,type) ) > type ).
tff(func_def_37,type,
sK2: ( dB * fun(nat,type) ) > type ).
tff(func_def_38,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_39,type,
sK4: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_40,type,
sK5: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_41,type,
sK6: ( dB * dB ) > dB ).
tff(func_def_42,type,
sK7: ( dB * dB * dB ) > dB ).
tff(func_def_43,type,
sK8: ( dB * dB * dB ) > dB ).
tff(func_def_44,type,
sK9: ( dB * dB * dB ) > dB ).
tff(func_def_45,type,
sK10: nat > nat ).
tff(func_def_46,type,
sK11: fun(nat,bool) > nat ).
tff(func_def_47,type,
sK12: fun(nat,bool) > nat ).
tff(func_def_48,type,
sK13: nat > nat ).
tff(func_def_49,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_50,type,
sK15: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_51,type,
sK16: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK17: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK18: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK19: dB > dB ).
tff(func_def_55,type,
sK20: dB > dB ).
tff(func_def_56,type,
sK21: dB > list(dB) ).
tff(func_def_57,type,
sK22: dB > dB ).
tff(func_def_58,type,
sK23: dB > list(dB) ).
tff(func_def_59,type,
sK24: dB > nat ).
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,
typing: ( fun(nat,type) * dB * type ) > $o ).
tff(pred_def_5,type,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(pred_def_8,type,
sP0: dB > $o ).
tff(pred_def_9,type,
sQ25_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f599,plain,
$false,
inference(avatar_sat_refutation,[],[f583,f584,f598]) ).
tff(f598,plain,
~ spl26_1,
inference(avatar_contradiction_clause,[],[f591]) ).
tff(f591,plain,
( $false
| ~ spl26_1 ),
inference(resolution,[],[f587,f328]) ).
tff(f328,plain,
typing(shift(type,e,i,t),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as),t1),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
typing(shift(type,e,i,t),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as),t1),
file('/export/starexec/sandbox2/tmp/tmp.G4LGYQOUNJ/Vampire---4.8_23163',fact_3_T) ).
tff(f587,plain,
( ! [X0: type,X1: list(dB)] : ~ typing(shift(type,e,i,t),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X1),X0)
| ~ spl26_1 ),
inference(resolution,[],[f578,f423]) ).
tff(f423,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: list(dB)] :
( typing(X3,X2,foldr(type,type,fun1,sK15(X0,X1,X2,X3),X0))
| ~ typing(X3,foldl(dB,dB,app,X2,X1),X0) ),
inference(cnf_transformation,[],[f305]) ).
tff(f305,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ( typings(X3,X1,sK15(X0,X1,X2,X3))
& typing(X3,X2,foldr(type,type,fun1,sK15(X0,X1,X2,X3),X0)) )
| ~ typing(X3,foldl(dB,dB,app,X2,X1),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f254,f304]) ).
tff(f304,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ? [X4: list(type)] :
( typings(X3,X1,X4)
& typing(X3,X2,foldr(type,type,fun1,X4,X0)) )
=> ( typings(X3,X1,sK15(X0,X1,X2,X3))
& typing(X3,X2,foldr(type,type,fun1,sK15(X0,X1,X2,X3),X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f254,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ? [X4: list(type)] :
( typings(X3,X1,X4)
& typing(X3,X2,foldr(type,type,fun1,X4,X0)) )
| ~ typing(X3,foldl(dB,dB,app,X2,X1),X0) ),
inference(ennf_transformation,[],[f173]) ).
tff(f173,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( typing(X3,foldl(dB,dB,app,X2,X1),X0)
=> ? [X4: list(type)] :
( typings(X3,X1,X4)
& typing(X3,X2,foldr(type,type,fun1,X4,X0)) ) ),
inference(rectify,[],[f75]) ).
tff(f75,axiom,
! [X16: type,X20: list(dB),X22: dB,X17: fun(nat,type)] :
( typing(X17,foldl(dB,dB,app,X22,X20),X16)
=> ? [X69: list(type)] :
( typings(X17,X20,X69)
& typing(X17,X22,foldr(type,type,fun1,X69,X16)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.G4LGYQOUNJ/Vampire---4.8_23163',fact_74_list__app__typeD) ).
tff(f578,plain,
( ! [X0: type] : ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0)
| ~ spl26_1 ),
inference(avatar_component_clause,[],[f577]) ).
tff(f577,plain,
( spl26_1
<=> ! [X0: type] : ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl26_1])]) ).
tff(f584,plain,
~ spl26_2,
inference(avatar_split_clause,[],[f475,f580]) ).
tff(f580,plain,
( spl26_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl26_2])]) ).
tff(f475,plain,
~ thesis,
inference(cnf_transformation,[],[f205]) ).
tff(f205,plain,
~ thesis,
inference(flattening,[],[f111]) ).
tff(f111,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f110]) ).
tff(f110,conjecture,
thesis,
file('/export/starexec/sandbox2/tmp/tmp.G4LGYQOUNJ/Vampire---4.8_23163',conj_1) ).
tff(f583,plain,
( spl26_1
| spl26_2 ),
inference(avatar_split_clause,[],[f474,f580,f577]) ).
tff(f474,plain,
! [X0: type] :
( thesis
| ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0) ),
inference(cnf_transformation,[],[f266]) ).
tff(f266,plain,
! [X0: type] :
( thesis
| ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0) ),
inference(ennf_transformation,[],[f204]) ).
tff(f204,plain,
! [X0: type] :
( typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0)
=> thesis ),
inference(rectify,[],[f109]) ).
tff(f109,axiom,
! [X85: type] :
( typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X85)
=> thesis ),
file('/export/starexec/sandbox2/tmp/tmp.G4LGYQOUNJ/Vampire---4.8_23163',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL838_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/0.11 % 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.12/0.32 % Computer : n006.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Apr 30 16:33:20 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a TF1_THM_EQU_NAR problem
% 0.12/0.32 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.G4LGYQOUNJ/Vampire---4.8_23163
% 0.58/0.81 % (23281)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.58/0.81 % (23280)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.58/0.81 % (23278)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.58/0.81 % (23279)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.58/0.81 % (23282)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.58/0.81 % (23283)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.58/0.81 % (23284)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.58/0.81 % (23285)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.58/0.81 % (23284)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.58/0.81 % (23285)Refutation not found, incomplete strategy% (23285)------------------------------
% 0.58/0.81 % (23285)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.81 % (23285)Termination reason: Refutation not found, incomplete strategy
% 0.58/0.81
% 0.58/0.81 % (23285)Memory used [KB]: 1191
% 0.58/0.81 % (23285)Time elapsed: 0.006 s
% 0.58/0.81 % (23285)Instructions burned: 9 (million)
% 0.58/0.81 % (23285)------------------------------
% 0.58/0.81 % (23285)------------------------------
% 0.66/0.81 % (23284)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.66/0.82 % (23286)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.66/0.82 % (23282)First to succeed.
% 0.66/0.82 % (23282)Refutation found. Thanks to Tanya!
% 0.66/0.82 % SZS status Theorem for Vampire---4
% 0.66/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.82 % (23282)------------------------------
% 0.66/0.82 % (23282)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.82 % (23282)Termination reason: Refutation
% 0.66/0.82
% 0.66/0.82 % (23282)Memory used [KB]: 1336
% 0.66/0.82 % (23282)Time elapsed: 0.012 s
% 0.66/0.82 % (23282)Instructions burned: 22 (million)
% 0.66/0.82 % (23282)------------------------------
% 0.66/0.82 % (23282)------------------------------
% 0.66/0.82 % (23274)Success in time 0.495 s
% 0.66/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------