TSTP Solution File: LCL779_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL779_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 : n015.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 : Tue Apr 30 13:49:16 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 101
% Syntax : Number of formulae : 106 ( 7 unt; 99 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 198 ( 84 >; 114 *; 0 +; 0 <<)
% Number of predicates : 27 ( 26 usr; 1 prp; 0-6 aty)
% Number of functors : 70 ( 70 usr; 9 con; 0-5 aty)
% Number of variables : 51 ( 0 !; 0 ?; 51 :)
% ( 51 !>; 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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
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,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
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,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
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,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_22,type,
fFalse: bool ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
i: nat ).
tff(func_def_25,type,
r: dB ).
tff(func_def_26,type,
s: dB ).
tff(func_def_27,type,
ss: list(dB) ).
tff(func_def_28,type,
sK20: dB > dB ).
tff(func_def_29,type,
sK21: dB > dB ).
tff(func_def_30,type,
sK22: dB > dB ).
tff(func_def_31,type,
sK23: dB > nat ).
tff(func_def_32,type,
sK24: dB > dB ).
tff(func_def_33,type,
sK25: dB > list(dB) ).
tff(func_def_34,type,
sK26: dB > nat ).
tff(func_def_35,type,
sK27: dB > dB ).
tff(func_def_36,type,
sK28: dB > dB ).
tff(func_def_37,type,
sK29: dB > list(dB) ).
tff(func_def_38,type,
sK30: dB > list(dB) ).
tff(func_def_39,type,
sK31: dB > dB ).
tff(func_def_40,type,
sK32: dB > dB ).
tff(func_def_41,type,
sK33: dB > nat ).
tff(func_def_42,type,
sK34:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_43,type,
sK35:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_44,type,
sK36: ( dB * dB ) > dB ).
tff(func_def_45,type,
sK37:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_46,type,
sK38:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_47,type,
sK39: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_48,type,
sK40: ( dB * list(dB) * dB ) > dB ).
tff(func_def_49,type,
sK41: ( dB * dB * list(dB) ) > dB ).
tff(func_def_50,type,
sK42: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_51,type,
sK43: ( dB * list(dB) * dB ) > dB ).
tff(func_def_52,type,
sK44: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_53,type,
sK45: ( dB * dB * dB ) > dB ).
tff(func_def_54,type,
sK46: ( dB * dB * dB ) > dB ).
tff(func_def_55,type,
sK47: ( dB * dB * dB ) > dB ).
tff(func_def_56,type,
sK48:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_57,type,
sK49:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_58,type,
sK50:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_59,type,
sK51: ( dB * dB * list(dB) * dB ) > list(dB) ).
tff(func_def_60,type,
sK52:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > X0 ) ).
tff(func_def_61,type,
sK53:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_62,type,
sK54:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_63,type,
sK55:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_64,type,
sK56:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_65,type,
sK57:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_66,type,
sK58:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_67,type,
sK59:
!>[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,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(pred_def_7,type,
sP0: dB > $o ).
tff(pred_def_8,type,
sP1: dB > $o ).
tff(pred_def_9,type,
sP2: dB > $o ).
tff(pred_def_10,type,
sP3: ( dB * dB * list(dB) ) > $o ).
tff(pred_def_11,type,
sP4: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_12,type,
sP5: ( dB * dB * list(dB) ) > $o ).
tff(pred_def_13,type,
sP6: ( dB * dB * dB ) > $o ).
tff(pred_def_14,type,
sP7: ( dB * dB * dB ) > $o ).
tff(pred_def_15,type,
sP8:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_16,type,
sP9: ( dB * dB * dB * list(dB) ) > $o ).
tff(pred_def_17,type,
sP10: ( dB * dB * list(dB) * dB ) > $o ).
tff(pred_def_18,type,
sP11:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_19,type,
sP12:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_20,type,
sP13:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_21,type,
sP14:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_22,type,
sP15:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_23,type,
sP16:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_24,type,
sP17:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_25,type,
sP18:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * X0 * fun(X0,fun(X0,bool)) ) > $o ) ).
tff(pred_def_26,type,
sP19:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f703,plain,
$false,
inference(subsumption_resolution,[],[f423,f422]) ).
tff(f422,plain,
~ pp(aa(dB,bool,it,s)),
inference(cnf_transformation,[],[f109]) ).
tff(f109,plain,
~ pp(aa(dB,bool,it,s)),
inference(flattening,[],[f108]) ).
tff(f108,negated_conjecture,
~ pp(aa(dB,bool,it,s)),
inference(negated_conjecture,[],[f107]) ).
tff(f107,conjecture,
pp(aa(dB,bool,it,s)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_4) ).
tff(f423,plain,
pp(aa(dB,bool,it,s)),
inference(cnf_transformation,[],[f105]) ).
tff(f105,axiom,
pp(aa(dB,bool,it,s)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL779_5 : TPTP v8.1.2. Released v6.0.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n015.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Apr 29 22:50:02 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.35 % (29067)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37 % (29074)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.21/0.37 % (29074)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.21/0.37 % (29070)WARNING: value z3 for option sas not known
% 0.21/0.37 % (29074)First to succeed.
% 0.21/0.37 % (29068)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (29069)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (29071)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (29070)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.21/0.38 % (29072)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.21/0.38 % (29073)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.21/0.38 % (29074)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (29074)------------------------------
% 0.21/0.38 % (29074)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.38 % (29074)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (29074)Memory used [KB]: 1197
% 0.21/0.38 % (29074)Time elapsed: 0.007 s
% 0.21/0.38 % (29074)Instructions burned: 22 (million)
% 0.21/0.38 % (29074)------------------------------
% 0.21/0.38 % (29074)------------------------------
% 0.21/0.38 % (29067)Success in time 0.024 s
%------------------------------------------------------------------------------