TSTP Solution File: LCL764_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL764_5 : TPTP v8.2.0. 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 : Tue May 21 00:34:07 EDT 2024
% Result : Theorem 0.24s 0.41s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 63
% Syntax : Number of formulae : 69 ( 8 unt; 61 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 91 ( 49 >; 42 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-5 aty)
% Number of functors : 46 ( 46 usr; 3 con; 0-5 aty)
% Number of variables : 63 ( 6 !; 0 ?; 63 :)
% ( 57 !>; 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(type_def_10,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
product:
!>[X0: $tType,X1: $tType] : ( ( list(X0) * list(X1) ) > list(product_prod(X0,X1)) ) ).
tff(func_def_1,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_2,type,
it: fun(dB,bool) ).
tff(func_def_3,type,
lift: ( dB * nat ) > dB ).
tff(func_def_4,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_5,type,
butlast:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_6,type,
hd:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_7,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_8,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_9,type,
linorder_insort_key:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 * list(X0) ) > list(X0) ) ).
tff(func_def_10,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_12,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_13,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_14,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_15,type,
replicate:
!>[X0: $tType] : ( ( nat * X0 ) > list(X0) ) ).
tff(func_def_16,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_17,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
tl:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fTrue: bool ).
tff(func_def_23,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_24,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_25,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_26,type,
sK6:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_27,type,
sK7:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_28,type,
sK8:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_29,type,
sK9:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_30,type,
sK10:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_31,type,
sK11:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_32,type,
sK12:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_33,type,
sK13:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_34,type,
sK14:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_35,type,
sK15:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_36,type,
sK16:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_37,type,
sK17:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_38,type,
sK18:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_39,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_40,type,
sK20:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_41,type,
sK21:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_42,type,
sK22:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
member:
!>[X0: $tType] : ( ( list(X0) * X0 ) > $o ) ).
tff(pred_def_7,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_8,type,
pp: bool > $o ).
tff(pred_def_9,type,
sP0:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_10,type,
sP1:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_11,type,
sP2:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_12,type,
sP3:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(f587,plain,
$false,
inference(resolution,[],[f361,f342]) ).
tff(f342,plain,
~ listsp(dB,it,nil(dB)),
inference(cnf_transformation,[],[f116]) ).
tff(f116,plain,
~ listsp(dB,it,nil(dB)),
inference(flattening,[],[f115]) ).
tff(f115,negated_conjecture,
~ listsp(dB,it,nil(dB)),
inference(negated_conjecture,[],[f114]) ).
tff(f114,conjecture,
listsp(dB,it,nil(dB)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f361,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f124]) ).
tff(f124,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X0: $tType,X3: fun(X0,bool)] : listsp(X0,X3,nil(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_listsp_ONil) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : LCL764_5 : TPTP v8.2.0. Released v6.0.0.
% 0.04/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 02:29:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.38 % (29071)Running in auto input_syntax mode. Trying TPTP
% 0.24/0.40 % (29074)WARNING: value z3 for option sas not known
% 0.24/0.40 % (29075)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.24/0.40 % (29072)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.24/0.40 % (29073)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.24/0.40 % (29074)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.24/0.40 % (29077)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.24/0.40 % (29076)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.24/0.40 % Exception at run slice level% Exception at run slice level
% 0.24/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.24/0.40 % Exception at run slice level
% 0.24/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.24/0.40
% 0.24/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.24/0.41 % (29078)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.24/0.41 % (29074)First to succeed.
% 0.24/0.41 % (29074)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29071"
% 0.24/0.41 % (29074)Refutation found. Thanks to Tanya!
% 0.24/0.41 % SZS status Theorem for theBenchmark
% 0.24/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.41 % (29074)------------------------------
% 0.24/0.41 % (29074)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.24/0.41 % (29074)Termination reason: Refutation
% 0.24/0.41
% 0.24/0.41 % (29074)Memory used [KB]: 1084
% 0.24/0.41 % (29074)Time elapsed: 0.012 s
% 0.24/0.41 % (29074)Instructions burned: 17 (million)
% 0.24/0.41 % (29071)Success in time 0.02 s
%------------------------------------------------------------------------------