TSTP Solution File: LCL814_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL814_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 : n024.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:20 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 86
% Syntax : Number of formulae : 96 ( 9 unt; 82 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 6 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 93 ( 43 >; 50 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 71 ( 71 usr; 26 con; 0-6 aty)
% Number of variables : 71 ( 30 !; 0 ?; 71 :)
% ( 41 !>; 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(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,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun(X0,bool)) > fun(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(list(X0),bool) ) > fun(list(X0),bool) ) ).
tff(func_def_19,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_21,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_22,type,
typing: fun(nat,type) > fun(dB,fun(type,bool)) ).
tff(func_def_23,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_26,type,
fFalse: bool ).
tff(func_def_27,type,
fTrue: bool ).
tff(func_def_28,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_31,type,
t2: type ).
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,
a: dB ).
tff(func_def_37,type,
as: list(dB) ).
tff(func_def_38,type,
e: fun(nat,type) ).
tff(func_def_39,type,
ea: fun(nat,type) ).
tff(func_def_40,type,
i: nat ).
tff(func_def_41,type,
ia: nat ).
tff(func_def_42,type,
n: nat ).
tff(func_def_43,type,
rs: list(dB) ).
tff(func_def_44,type,
t3: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK3:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_48,type,
sK4:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_49,type,
sK5:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_50,type,
sK6:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_51,type,
sK7: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK8: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK9: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK10: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK11: list(type) ).
tff(func_def_56,type,
sK12: type ).
tff(func_def_57,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_58,type,
sK14: ( dB * fun(nat,type) ) > type ).
tff(func_def_59,type,
sK15: ( dB * fun(nat,type) ) > type ).
tff(func_def_60,type,
sK16: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_61,type,
sK17: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_62,type,
sK18: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_63,type,
sK19: dB > dB ).
tff(func_def_64,type,
sK20: dB > list(dB) ).
tff(func_def_65,type,
sK21: dB > nat ).
tff(func_def_66,type,
sK22: dB > dB ).
tff(func_def_67,type,
sK23: dB > dB ).
tff(func_def_68,type,
sK24: dB > list(dB) ).
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,
pp: bool > $o ).
tff(pred_def_5,type,
sP0: dB > $o ).
tff(pred_def_6,type,
sP1: dB > $o ).
tff(pred_def_7,type,
sP2: dB > $o ).
tff(f423,plain,
$false,
inference(unit_resulting_resolution,[],[f324,f314,f278,f284]) ).
tff(f284,plain,
! [X2: nat,X3: type,X0: list(type),X1: list(dB),X4: dB,X5: fun(nat,type)] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0)) ),
inference(cnf_transformation,[],[f182]) ).
tff(f182,plain,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3)) ),
inference(flattening,[],[f181]) ).
tff(f181,plain,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0))
| ~ pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3)) ),
inference(ennf_transformation,[],[f122]) ).
tff(f122,plain,
! [X0: list(type),X1: list(dB),X2: nat,X3: type,X4: dB,X5: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X5),X4),X3))
=> ( pp(aa(list(type),bool,typings(shift(type,X5,X2,X3),X1),X0))
=> pp(aa(list(type),bool,typings(X5,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X4),X2),X1)),X0)) ) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X5: list(type),X6: list(dB),X7: nat,X8: type,X9: dB,X10: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X10),X9),X8))
=> ( pp(aa(list(type),bool,typings(shift(type,X10,X7,X8),X6),X5))
=> pp(aa(list(type),bool,typings(X10,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,X9),X7),X6)),X5)) ) ),
file('/export/starexec/sandbox/tmp/tmp.FutYyR0Ixv/Vampire---4.8_5443',fact_6_substs__lemma) ).
tff(f278,plain,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
pp(aa(list(type),bool,typings(e,map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as)),ts)),
file('/export/starexec/sandbox/tmp/tmp.FutYyR0Ixv/Vampire---4.8_5443',conj_0) ).
tff(f314,plain,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
pp(aa(list(type),bool,typings(shift(type,e,i,t),as),ts)),
file('/export/starexec/sandbox/tmp/tmp.FutYyR0Ixv/Vampire---4.8_5443',fact_4_argsT) ).
tff(f324,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(e),u),t)),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(e),u),t)),
file('/export/starexec/sandbox/tmp/tmp.FutYyR0Ixv/Vampire---4.8_5443',fact_0_uT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL814_5 : TPTP v8.1.2. Released v6.0.0.
% 0.13/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.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.21/0.35 % DateTime : Tue Apr 30 16:41:06 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 This is a TF1_THM_EQU_NAR problem
% 0.21/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/tmp/tmp.FutYyR0Ixv/Vampire---4.8_5443
% 0.57/0.75 % (5829)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 (2996ds/83Mi)
% 0.57/0.76 % (5823)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 (2996ds/34Mi)
% 0.57/0.76 % (5825)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.76 % (5824)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 (2996ds/51Mi)
% 0.57/0.76 % (5826)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.76 % (5827)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 (2996ds/34Mi)
% 0.57/0.76 % (5828)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.76 % (5829)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.57/0.76 % (5829)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.76 % (5829)First to succeed.
% 0.60/0.76 % (5829)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (5829)------------------------------
% 0.60/0.76 % (5829)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (5829)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (5829)Memory used [KB]: 1343
% 0.60/0.76 % (5829)Time elapsed: 0.009 s
% 0.60/0.76 % (5829)Instructions burned: 28 (million)
% 0.60/0.76 % (5829)------------------------------
% 0.60/0.76 % (5829)------------------------------
% 0.60/0.76 % (5697)Success in time 0.403 s
% 0.60/0.76 % Exception at proof search level
% 0.60/0.76 System fail: Cannot decrease semaphore. error 22: Invalid argument
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------