TSTP Solution File: LCL796_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL796_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 : n007.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:53:16 EDT 2024
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 90
% Syntax : Number of formulae : 110 ( 14 unt; 84 typ; 0 def)
% Number of atoms : 38 ( 21 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 8 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 116 ( 52 >; 64 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 72 ( 72 usr; 25 con; 0-5 aty)
% Number of variables : 71 ( 45 !; 0 ?; 71 :)
% ( 26 !>; 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,
bool_size: bool > nat ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: ( dB * nat ) > dB ).
tff(func_def_12,type,
subst: ( dB * dB * 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,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > 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,
nat_size: nat > nat ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_20,type,
fun1: fun(type,fun(type,type)) ).
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,
t: type ).
tff(func_def_28,type,
t2: type ).
tff(func_def_29,type,
t_a: type ).
tff(func_def_30,type,
t1: type ).
tff(func_def_31,type,
ts: list(type) ).
tff(func_def_32,type,
a: dB ).
tff(func_def_33,type,
as: list(dB) ).
tff(func_def_34,type,
e: fun(nat,type) ).
tff(func_def_35,type,
ea: fun(nat,type) ).
tff(func_def_36,type,
i: nat ).
tff(func_def_37,type,
ia: nat ).
tff(func_def_38,type,
n: nat ).
tff(func_def_39,type,
rs: list(dB) ).
tff(func_def_40,type,
t3: dB ).
tff(func_def_41,type,
u: dB ).
tff(func_def_42,type,
ua: dB ).
tff(func_def_43,type,
sK4: type ).
tff(func_def_44,type,
sK5: list(type) ).
tff(func_def_45,type,
sK6: dB > dB ).
tff(func_def_46,type,
sK7: dB > list(dB) ).
tff(func_def_47,type,
sK8: dB > nat ).
tff(func_def_48,type,
sK9: dB > dB ).
tff(func_def_49,type,
sK10: dB > dB ).
tff(func_def_50,type,
sK11: dB > list(dB) ).
tff(func_def_51,type,
sK12: ( dB * dB ) > dB ).
tff(func_def_52,type,
sK13: ( dB * fun(nat,type) ) > type ).
tff(func_def_53,type,
sK14: ( dB * fun(nat,type) ) > type ).
tff(func_def_54,type,
sK15: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_55,type,
sK16: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_56,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_57,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_58,type,
sK19: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_59,type,
sK20: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_60,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_61,type,
sK22: ( dB * dB * dB ) > dB ).
tff(func_def_62,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_63,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_64,type,
sK25: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_65,type,
sK26: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_66,type,
sK27: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_67,type,
sK28: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_68,type,
sK29:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_69,type,
sK30: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
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,
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 * list(dB) * dB ) > $o ).
tff(pred_def_8,type,
sP3: ( dB * dB * dB ) > $o ).
tff(f1132,plain,
$false,
inference(resolution,[],[f1118,f323]) ).
tff(f323,plain,
~ pp(fFalse),
inference(cnf_transformation,[],[f111]) ).
tff(f111,axiom,
~ pp(fFalse),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fFalse_1_1_U) ).
tff(f1118,plain,
pp(fFalse),
inference(superposition,[],[f1101,f539]) ).
tff(f539,plain,
fFalse = aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t),
inference(resolution,[],[f322,f525]) ).
tff(f525,plain,
! [X0: bool] :
( pp(X0)
| ( fFalse = X0 ) ),
inference(superposition,[],[f326,f362]) ).
tff(f362,plain,
! [X0: bool] :
( ( fTrue = X0 )
| ( fFalse = X0 ) ),
inference(cnf_transformation,[],[f123]) ).
tff(f123,plain,
! [X0: bool] :
( ( fFalse = X0 )
| ( fTrue = X0 ) ),
inference(rectify,[],[f107]) ).
tff(f107,axiom,
! [X87: bool] :
( ( fFalse = X87 )
| ( fTrue = X87 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_fTrue_1_1_T) ).
tff(f326,plain,
pp(fTrue),
inference(cnf_transformation,[],[f102]) ).
tff(f102,axiom,
pp(fTrue),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',help_pp_2_1_U) ).
tff(f322,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
inference(cnf_transformation,[],[f115]) ).
tff(f115,plain,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
inference(flattening,[],[f114]) ).
tff(f114,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
inference(negated_conjecture,[],[f113]) ).
tff(f113,conjecture,
pp(aa(type,bool,typing(shift(type,e,zero_zero(nat),t),var(zero_zero(nat))),t)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f1101,plain,
! [X2: type,X0: fun(nat,type),X1: nat] : pp(aa(type,bool,typing(shift(type,X0,X1,X2),var(X1)),X2)),
inference(superposition,[],[f491,f501]) ).
tff(f501,plain,
! [X0: $tType,X2: fun(nat,X0),X1: X0,X4: nat] : ( aa(nat,X0,shift(X0,X2,X4,X1),X4) = X1 ),
inference(equality_resolution,[],[f465]) ).
tff(f465,plain,
! [X0: $tType,X2: fun(nat,X0),X3: nat,X1: X0,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(cnf_transformation,[],[f232]) ).
tff(f232,plain,
! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
( ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 )
| ( X3 != X4 ) ),
inference(ennf_transformation,[],[f182]) ).
tff(f182,plain,
! [X0: $tType,X1: X0,X2: fun(nat,X0),X3: nat,X4: nat] :
( ( X3 = X4 )
=> ( aa(nat,X0,shift(X0,X2,X4,X1),X3) = X1 ) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X0: $tType,X4: X0,X8: fun(nat,X0),X11: nat,X7: nat] :
( ( X7 = X11 )
=> ( aa(nat,X0,shift(X0,X8,X7,X4),X11) = X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_shift__eq) ).
tff(f491,plain,
! [X2: fun(nat,type),X1: nat] : pp(aa(type,bool,typing(X2,var(X1)),aa(nat,type,X2,X1))),
inference(equality_resolution,[],[f408]) ).
tff(f408,plain,
! [X2: fun(nat,type),X0: type,X1: nat] :
( pp(aa(type,bool,typing(X2,var(X1)),X0))
| ( aa(nat,type,X2,X1) != X0 ) ),
inference(cnf_transformation,[],[f209]) ).
tff(f209,plain,
! [X0: type,X1: nat,X2: fun(nat,type)] :
( pp(aa(type,bool,typing(X2,var(X1)),X0))
| ( aa(nat,type,X2,X1) != X0 ) ),
inference(ennf_transformation,[],[f153]) ).
tff(f153,plain,
! [X0: type,X1: nat,X2: fun(nat,type)] :
( ( aa(nat,type,X2,X1) = X0 )
=> pp(aa(type,bool,typing(X2,var(X1)),X0)) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X4: type,X5: nat,X6: fun(nat,type)] :
( ( aa(nat,type,X6,X5) = X4 )
=> pp(aa(type,bool,typing(X6,var(X5)),X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_typing_OVar) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL796_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n007.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.14/0.35 % DateTime : Fri May 3 13:23:20 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (16713)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (16729)WARNING: value z3 for option sas not known
% 0.14/0.37 % (16729)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.20/0.38 % (16728)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.20/0.38 % (16730)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.20/0.38 % (16731)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.20/0.38 % (16727)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.20/0.38 % (16733)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.20/0.38 % (16733)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.39 % Exception at run slice level
% 0.20/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39 % Exception at run slice level
% 0.20/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39 % Exception at run slice level
% 0.20/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39 % (16732)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.20/0.40 % (16739)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.20/0.40 % (16740)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.20/0.40 % (16741)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.20/0.41 % (16739)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.41 % Exception at run slice level
% 0.20/0.41 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.41 % (16740)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.44 % (16761)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)
% 0.20/0.45 % (16732)First to succeed.
% 0.20/0.45 % (16732)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16713"
% 0.20/0.45 % (16732)Refutation found. Thanks to Tanya!
% 0.20/0.45 % SZS status Theorem for theBenchmark
% 0.20/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.45 % (16732)------------------------------
% 0.20/0.45 % (16732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.45 % (16732)Termination reason: Refutation
% 0.20/0.45
% 0.20/0.45 % (16732)Memory used [KB]: 1315
% 0.20/0.45 % (16732)Time elapsed: 0.065 s
% 0.20/0.45 % (16732)Instructions burned: 81 (million)
% 0.20/0.45 % (16713)Success in time 0.096 s
%------------------------------------------------------------------------------