TSTP Solution File: LCL835_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL835_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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:54:12 EDT 2024
% Result : Theorem 5.72s 1.21s
% Output : Refutation 5.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 97
% Syntax : Number of formulae : 108 ( 10 unt; 93 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 10 ~; 6 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 141 ( 66 >; 75 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-6 aty)
% Number of functors : 78 ( 78 usr; 19 con; 0-5 aty)
% Number of variables : 66 ( 20 !; 0 ?; 66 :)
% ( 46 !>; 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,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
it: fun(dB,bool) ).
tff(func_def_5,type,
beta: fun(dB,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,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_15,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_17,type,
nil:
!>[X0: $tType] : 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,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
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: ( type * 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,
t: type ).
tff(func_def_31,type,
t_a: type ).
tff(func_def_32,type,
t1: 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,
sK6: dB > dB ).
tff(func_def_44,type,
sK7: dB > list(dB) ).
tff(func_def_45,type,
sK8: dB > nat ).
tff(func_def_46,type,
sK9: dB > dB ).
tff(func_def_47,type,
sK10: dB > dB ).
tff(func_def_48,type,
sK11: dB > list(dB) ).
tff(func_def_49,type,
sK12:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_50,type,
sK13:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_51,type,
sK14: ( dB * dB ) > dB ).
tff(func_def_52,type,
sK15:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_53,type,
sK16:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_54,type,
sK17: ( dB * fun(nat,type) ) > type ).
tff(func_def_55,type,
sK18: ( dB * fun(nat,type) ) > type ).
tff(func_def_56,type,
sK19: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_57,type,
sK20: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_58,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_59,type,
sK22: ( dB * list(dB) * dB ) > dB ).
tff(func_def_60,type,
sK23: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_61,type,
sK24: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_62,type,
sK25: ( dB * list(dB) * dB ) > dB ).
tff(func_def_63,type,
sK26: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_64,type,
sK27: ( dB * dB * dB ) > dB ).
tff(func_def_65,type,
sK28: ( dB * dB * dB ) > dB ).
tff(func_def_66,type,
sK29: ( dB * dB * dB ) > dB ).
tff(func_def_67,type,
sK30:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_68,type,
sK31:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_69,type,
sK32: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_70,type,
sK33:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_71,type,
sK34:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_72,type,
sK35:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_73,type,
sK36:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_74,type,
sK37:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_75,type,
sK38:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
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,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: dB > $o ).
tff(pred_def_7,type,
sP1: dB > $o ).
tff(pred_def_8,type,
sP2: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB * dB ) > $o ).
tff(pred_def_10,type,
sP4:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_11,type,
sP5:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f38688,plain,
$false,
inference(subsumption_resolution,[],[f38649,f369]) ).
tff(f369,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,[],[f4]) ).
tff(f4,axiom,
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/benchmark/theBenchmark.p',fact_3__096Abs_Ar_A_092_060degree_062_Aa_A_092_060degree_062_092_060degree_062_Aas_A_092_060rightarrow_062_092_060_094sub_062_092_060beta_062r_091a_P0_093_A_092_060degree_062_092_060degree_062_Aas_096) ).
tff(f38649,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(unit_resulting_resolution,[],[f368,f355,f482]) ).
tff(f482,plain,
! [X2: dB,X3: fun(nat,type),X0: dB,X1: type] :
( ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(cnf_transformation,[],[f235]) ).
tff(f235,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(flattening,[],[f234]) ).
tff(f234,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X0),X1))
| ~ pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
| ~ pp(aa(type,bool,typing(X3,X2),X1)) ),
inference(ennf_transformation,[],[f181]) ).
tff(f181,plain,
! [X0: dB,X1: type,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,typing(X3,X2),X1))
=> ( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X2),X0))
=> pp(aa(type,bool,typing(X3,X0),X1)) ) ),
inference(rectify,[],[f30]) ).
tff(f30,axiom,
! [X37: dB,X15: type,X16: dB,X17: fun(nat,type)] :
( pp(aa(type,bool,typing(X17,X16),X15))
=> ( pp(aa(dB,bool,aa(dB,fun(dB,bool),beta,X16),X37))
=> pp(aa(type,bool,typing(X17,X37),X15)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_29_subject__reduction) ).
tff(f355,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(cnf_transformation,[],[f113]) ).
tff(f113,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(flattening,[],[f112]) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
inference(negated_conjecture,[],[f111]) ).
tff(f111,conjecture,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,subst(r,a,zero_zero(nat)),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f368,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),as)),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4_T) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL835_5 : TPTP v8.1.2. Released v6.0.0.
% 0.06/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n012.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:48:10 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (19287)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (19301)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.12/0.36 % (19299)WARNING: value z3 for option sas not known
% 0.12/0.36 % (19300)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.36 % (19303)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.12/0.36 % (19302)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.12/0.37 % (19298)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.37 % (19297)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.37 % (19299)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.37 % (19303)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.37 % Exception at run slice level
% 0.12/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.37 % Exception at run slice level
% 0.12/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.37 % Exception at run slice level
% 0.12/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.39 % (19321)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.19/0.39 % (19322)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.19/0.39 % (19325)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.19/0.40 % (19321)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.19/0.40 % Exception at run slice level
% 0.19/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.40 % (19322)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.19/0.41 % (19338)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 5.72/1.20 % (19322)First to succeed.
% 5.72/1.20 % (19322)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-19287"
% 5.72/1.21 % (19322)Refutation found. Thanks to Tanya!
% 5.72/1.21 % SZS status Theorem for theBenchmark
% 5.72/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 5.72/1.21 % (19322)------------------------------
% 5.72/1.21 % (19322)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 5.72/1.21 % (19322)Termination reason: Refutation
% 5.72/1.21
% 5.72/1.21 % (19322)Memory used [KB]: 17476
% 5.72/1.21 % (19322)Time elapsed: 0.815 s
% 5.72/1.21 % (19322)Instructions burned: 2886 (million)
% 5.72/1.21 % (19287)Success in time 0.849 s
%------------------------------------------------------------------------------