TSTP Solution File: LCL811_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL811_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 : n028.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:36 EDT 2024
% Result : Theorem 4.55s 1.03s
% Output : Refutation 4.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 78
% Syntax : Number of formulae : 97 ( 24 unt; 73 typ; 0 def)
% Number of atoms : 24 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 93 ( 46 >; 47 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 61 ( 61 usr; 17 con; 0-6 aty)
% Number of variables : 102 ( 49 !; 0 ?; 102 :)
% ( 53 !>; 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,
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,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_4,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_5,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
it: fun(dB,bool) ).
tff(func_def_8,type,
abs: dB > dB ).
tff(func_def_9,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_10,type,
var: nat > dB ).
tff(func_def_11,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_12,type,
dB_size: dB > nat ).
tff(func_def_13,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_14,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_15,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_16,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_17,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_18,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_20,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_21,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_22,type,
monoid_add_listsum:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_23,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_24,type,
suc: nat > nat ).
tff(func_def_25,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
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,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
b: dB ).
tff(func_def_33,type,
bs: list(dB) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
n: nat ).
tff(func_def_36,type,
rs: list(dB) ).
tff(func_def_37,type,
t: dB ).
tff(func_def_38,type,
u: dB ).
tff(func_def_39,type,
ua: dB ).
tff(func_def_40,type,
sK2: nat > nat ).
tff(func_def_41,type,
sK3: nat > nat ).
tff(func_def_42,type,
sK4: dB > dB ).
tff(func_def_43,type,
sK5: dB > list(dB) ).
tff(func_def_44,type,
sK6: dB > nat ).
tff(func_def_45,type,
sK7: dB > dB ).
tff(func_def_46,type,
sK8: dB > dB ).
tff(func_def_47,type,
sK9: dB > list(dB) ).
tff(func_def_48,type,
sK10: fun(nat,bool) > nat ).
tff(func_def_49,type,
sK11: fun(nat,bool) > nat ).
tff(func_def_50,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_51,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_52,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_53,type,
sK15:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_54,type,
sK16:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_55,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_56,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_57,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_58,type,
sK20:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_7,type,
pp: bool > $o ).
tff(pred_def_8,type,
sP0: dB > $o ).
tff(pred_def_9,type,
sP1: dB > $o ).
tff(f15326,plain,
$false,
inference(subsumption_resolution,[],[f15325,f477]) ).
tff(f477,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),cons(dB,b,bs)))),
inference(backward_demodulation,[],[f293,f299]) ).
tff(f299,plain,
n = i,
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_True) ).
tff(f293,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(cnf_transformation,[],[f114]) ).
tff(f114,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(flattening,[],[f113]) ).
tff(f113,negated_conjecture,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
inference(negated_conjecture,[],[f112]) ).
tff(f112,conjecture,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),cons(dB,b,bs)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f15325,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),cons(dB,b,bs)))),
inference(forward_demodulation,[],[f15296,f421]) ).
tff(f421,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: fun(X1,X0)] : ( map(X1,X0,X4,cons(X1,X3,X2)) = cons(X0,aa(X1,X0,X4,X3),map(X1,X0,X4,X2)) ),
inference(cnf_transformation,[],[f195]) ).
tff(f195,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: fun(X1,X0)] : ( map(X1,X0,X4,cons(X1,X3,X2)) = cons(X0,aa(X1,X0,X4,X3),map(X1,X0,X4,X2)) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X0: $tType,X1: $tType,X7: list(X1),X8: X1,X9: fun(X1,X0)] : ( map(X1,X0,X9,cons(X1,X8,X7)) = cons(X0,aa(X1,X0,X9,X8),map(X1,X0,X9,X7)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_10_map_Osimps_I2_J) ).
tff(f15296,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),cons(dB,aa(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),b),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),bs)))),
inference(backward_demodulation,[],[f525,f15185]) ).
tff(f15185,plain,
! [X1: $tType,X0: $tType,X3: $tType,X2: $tType,X6: X2,X7: X0,X4: fun(X3,fun(X2,fun(X0,X1))),X5: X3] : ( aa(X2,X1,combc(X2,X0,X1,aa(X3,fun(X2,fun(X0,X1)),X4,X5),X7),X6) = aa(X3,X1,combc(X3,X0,X1,combc(X3,X2,fun(X0,X1),X4,X6),X7),X5) ),
inference(superposition,[],[f1609,f426]) ).
tff(f426,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f198]) ).
tff(f198,plain,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(rectify,[],[f105]) ).
tff(f105,axiom,
! [X0: $tType,X2: $tType,X1: $tType,X77: X0,X78: X1,X79: fun(X0,fun(X1,X2))] : ( aa(X0,X2,combc(X0,X1,X2,X79,X78),X77) = aa(X1,X2,aa(X0,fun(X1,X2),X79,X77),X78) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f1609,plain,
! [X1: $tType,X0: $tType,X3: $tType,X2: $tType,X6: X0,X7: X1,X4: fun(X0,fun(X3,fun(X1,X2))),X5: X3] : ( aa(X0,X2,combc(X0,X1,X2,combc(X0,X3,fun(X1,X2),X4,X5),X7),X6) = aa(X1,X2,aa(X3,fun(X1,X2),aa(X0,fun(X3,fun(X1,X2)),X4,X6),X5),X7) ),
inference(superposition,[],[f426,f426]) ).
tff(f525,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),cons(dB,aa(dB,dB,combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),subst,b),n),u),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),bs)))),
inference(forward_demodulation,[],[f524,f426]) ).
tff(f524,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),n),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),bs)))),
inference(forward_demodulation,[],[f507,f421]) ).
tff(f507,plain,
listsp(dB,it,cons(dB,aa(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),n)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),bs)))),
inference(backward_demodulation,[],[f482,f426]) ).
tff(f482,plain,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),n)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),bs)))),
inference(forward_demodulation,[],[f308,f299]) ).
tff(f308,plain,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
listsp(dB,it,cons(dB,aa(nat,dB,aa(dB,fun(nat,dB),lift,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,b),u),i)),zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),bs)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4__096listsp_AIT_A_Ilift_A_Ib_091u_Pi_093_J_A0_A_D_Amap_A_I_Ft_O_Alift_At_A0_J_A_Imap_A_I_Ft_O_At_091u_Pi_093_J_Abs_J_J_096) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL811_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.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:59:48 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % (16722)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.36 % (16727)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.14/0.37 % (16725)WARNING: value z3 for option sas not known
% 0.14/0.37 % (16723)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (16724)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (16726)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (16725)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.14/0.37 % (16728)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.14/0.37 % (16729)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.14/0.38 % (16729)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.38 % Exception at run slice level% Exception at run slice level
% 0.14/0.38
% 0.14/0.38 User error: User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructsFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.38
% 0.14/0.38 % Exception at run slice level
% 0.14/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39 % (16730)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.20/0.39 % (16732)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.39 % (16731)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 % (16730)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.40 % Exception at run slice level
% 0.20/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.40 % (16731)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.41 % (16733)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)
% 4.55/1.03 % (16732)First to succeed.
% 4.55/1.03 % (16732)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16722"
% 4.55/1.03 % (16732)Refutation found. Thanks to Tanya!
% 4.55/1.03 % SZS status Theorem for theBenchmark
% 4.55/1.03 % SZS output start Proof for theBenchmark
% See solution above
% 4.55/1.03 % (16732)------------------------------
% 4.55/1.03 % (16732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 4.55/1.03 % (16732)Termination reason: Refutation
% 4.55/1.03
% 4.55/1.03 % (16732)Memory used [KB]: 9490
% 4.55/1.03 % (16732)Time elapsed: 0.635 s
% 4.55/1.03 % (16732)Instructions burned: 1807 (million)
% 4.55/1.03 % (16722)Success in time 0.67 s
%------------------------------------------------------------------------------