TSTP Solution File: LCL834_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL834_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 : n027.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:52 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 67
% Syntax : Number of formulae : 77 ( 9 unt; 64 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 79 ( 37 >; 42 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 54 ( 54 usr; 19 con; 0-5 aty)
% Number of variables : 51 ( 18 !; 0 ?; 51 :)
% ( 33 !>; 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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_4,type,
abs: dB > dB ).
tff(func_def_5,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_6,type,
var: nat > dB ).
tff(func_def_7,type,
dB_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_13,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_16,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_17,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_18,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_19,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_20,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_21,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_22,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_27,type,
t1: type ).
tff(func_def_28,type,
t_a: type ).
tff(func_def_29,type,
t: type ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
e: fun(nat,type) ).
tff(func_def_33,type,
ea: fun(nat,type) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
ia: nat ).
tff(func_def_36,type,
r: dB ).
tff(func_def_37,type,
t2: dB ).
tff(func_def_38,type,
u: dB ).
tff(func_def_39,type,
ua: dB ).
tff(func_def_40,type,
sK0: ( dB * dB * dB ) > dB ).
tff(func_def_41,type,
sK1: ( dB * dB * dB ) > dB ).
tff(func_def_42,type,
sK2: ( dB * dB * dB ) > dB ).
tff(func_def_43,type,
sK3: ( dB * dB ) > dB ).
tff(func_def_44,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_45,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_46,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_47,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_48,type,
sK8: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_49,type,
sK9: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_50,type,
sK10: ( dB * fun(nat,type) ) > type ).
tff(func_def_51,type,
sK11: ( dB * fun(nat,type) ) > type ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
it: dB > $o ).
tff(pred_def_3,type,
step1:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sQ12_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f340,plain,
$false,
inference(subsumption_resolution,[],[f339,f235]) ).
tff(f235,plain,
! [X0: dB,X1: dB] : pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X0)),subst(X1,X0,zero_zero(nat)))),
inference(cnf_transformation,[],[f122]) ).
tff(f122,plain,
! [X0: dB,X1: dB] : pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X0)),subst(X1,X0,zero_zero(nat)))),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X4: dB,X5: dB] : pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X5)),X4)),subst(X5,X4,zero_zero(nat)))),
file('/export/starexec/sandbox2/tmp/tmp.VeLpwzWx72/Vampire---4.8_12080',fact_3_beta) ).
tff(f339,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a)),subst(r,a,zero_zero(nat)))),
inference(resolution,[],[f217,f231]) ).
tff(f231,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0)))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1)) ),
inference(cnf_transformation,[],[f164]) ).
tff(f164,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0)))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1)) ),
inference(ennf_transformation,[],[f118]) ).
tff(f118,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X1))
=> pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X2,X0)),foldl(dB,dB,app,X1,X0))) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X6: list(dB),X7: dB,X9: dB] :
( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X9),X7))
=> pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,X9,X6)),foldl(dB,dB,app,X7,X6))) ),
file('/export/starexec/sandbox2/tmp/tmp.VeLpwzWx72/Vampire---4.8_12080',fact_10_apps__preserves__beta) ).
tff(f217,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(cnf_transformation,[],[f112]) ).
tff(f112,plain,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(flattening,[],[f111]) ).
tff(f111,negated_conjecture,
~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
inference(negated_conjecture,[],[f110]) ).
tff(f110,conjecture,
pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as))),
file('/export/starexec/sandbox2/tmp/tmp.VeLpwzWx72/Vampire---4.8_12080',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LCL834_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/0.12 % 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.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 14:02:36 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TF1_THM_EQU_NAR problem
% 0.11/0.33 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.VeLpwzWx72/Vampire---4.8_12080
% 0.55/0.78 % (12188)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.55/0.78 % (12190)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.55/0.78 % (12191)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.55/0.78 % (12194)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.55/0.78 % (12189)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.55/0.78 % (12193)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.55/0.78 % (12192)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.55/0.78 % (12195)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.61/0.78 % (12194)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.78 % (12194)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.78 % (12195)First to succeed.
% 0.61/0.78 % (12193)Also succeeded, but the first one will report.
% 0.61/0.78 % (12195)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12187"
% 0.61/0.79 % (12194)Refutation not found, incomplete strategy% (12194)------------------------------
% 0.61/0.79 % (12194)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (12194)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (12194)Memory used [KB]: 1238
% 0.61/0.79 % (12194)Time elapsed: 0.008 s
% 0.61/0.79 % (12195)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for Vampire---4
% 0.61/0.79 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.79 % (12195)------------------------------
% 0.61/0.79 % (12195)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (12195)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (12195)Memory used [KB]: 1218
% 0.61/0.79 % (12195)Time elapsed: 0.006 s
% 0.61/0.79 % (12195)Instructions burned: 12 (million)
% 0.61/0.79 % (12187)Success in time 0.452 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------