TSTP Solution File: LCL784_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL784_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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 : Wed May 1 03:20:06 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 91
% Syntax : Number of formulae : 110 ( 19 unt; 85 typ; 0 def)
% Number of atoms : 42 ( 32 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 32 ( 15 ~; 9 |; 6 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 125 ( 60 >; 65 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 75 ( 75 usr; 18 con; 0-5 aty)
% Number of variables : 65 ( 25 !; 0 ?; 65 :)
% ( 40 !>; 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(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
it: fun(dB,bool) ).
tff(func_def_4,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_5,type,
abs: dB > dB ).
tff(func_def_6,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_7,type,
var: nat > dB ).
tff(func_def_8,type,
dB_size: dB > nat ).
tff(func_def_9,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_10,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
substn: ( dB * dB * nat ) > dB ).
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_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > 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,
atom: nat > type ).
tff(func_def_21,type,
fun1: ( type * type ) > type ).
tff(func_def_22,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_23,type,
type_size: type > nat ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_28,type,
t1: type ).
tff(func_def_29,type,
t_a: type ).
tff(func_def_30,type,
t: type ).
tff(func_def_31,type,
e: fun(nat,type) ).
tff(func_def_32,type,
ea: fun(nat,type) ).
tff(func_def_33,type,
i: nat ).
tff(func_def_34,type,
ia: nat ).
tff(func_def_35,type,
n: nat ).
tff(func_def_36,type,
rs: list(dB) ).
tff(func_def_37,type,
t2: dB ).
tff(func_def_38,type,
u: dB ).
tff(func_def_39,type,
ua: dB ).
tff(func_def_40,type,
sK0: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_41,type,
sK1:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_42,type,
sK2:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_43,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_44,type,
sK4: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_45,type,
sK5: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_46,type,
sK6: dB > dB ).
tff(func_def_47,type,
sK7: dB > dB ).
tff(func_def_48,type,
sK8: dB > list(dB) ).
tff(func_def_49,type,
sK9: dB > dB ).
tff(func_def_50,type,
sK10: dB > list(dB) ).
tff(func_def_51,type,
sK11: dB > nat ).
tff(func_def_52,type,
sK12: ( dB * fun(nat,type) ) > type ).
tff(func_def_53,type,
sK13: ( dB * fun(nat,type) ) > type ).
tff(func_def_54,type,
sK14: ( dB * dB ) > dB ).
tff(func_def_55,type,
sK15: ( dB * dB * dB ) > dB ).
tff(func_def_56,type,
sK16: ( dB * dB * dB ) > dB ).
tff(func_def_57,type,
sK17: ( dB * dB * dB ) > dB ).
tff(func_def_58,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_59,type,
sK19: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_60,type,
sK20: ( dB * list(dB) * dB ) > dB ).
tff(func_def_61,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_62,type,
sK22: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_63,type,
sK23: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_64,type,
sK24: ( dB * list(dB) * dB ) > dB ).
tff(func_def_65,type,
sK25:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_66,type,
sK26:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_67,type,
sK27:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_68,type,
sK28:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_69,type,
sK29:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_70,type,
sK30:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_71,type,
sK31:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_72,type,
sK32:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > 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,
typing: ( fun(nat,type) * dB * type ) > $o ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(f548,plain,
$false,
inference(resolution,[],[f325,f546]) ).
tff(f546,plain,
~ pp(aa(dB,bool,it,u)),
inference(forward_demodulation,[],[f545,f344]) ).
tff(f344,plain,
! [X0: dB,X1: nat] : ( subst(var(X1),X0,X1) = X0 ),
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
! [X0: dB,X1: nat] : ( subst(var(X1),X0,X1) = X0 ),
inference(rectify,[],[f15]) ).
tff(f15,axiom,
! [X15: dB,X13: nat] : ( subst(var(X13),X15,X13) = X15 ),
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',fact_14_subst__eq) ).
tff(f545,plain,
~ pp(aa(dB,bool,it,subst(var(i),u,i))),
inference(forward_demodulation,[],[f505,f539]) ).
tff(f539,plain,
! [X2: nat] : ( var(X2) = foldl(dB,dB,app,var(X2),rs) ),
inference(forward_demodulation,[],[f513,f324]) ).
tff(f324,plain,
rs = nil(dB),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
rs = nil(dB),
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',fact_2_Nil) ).
tff(f513,plain,
! [X2: nat] : ( var(X2) = foldl(dB,dB,app,var(X2),nil(dB)) ),
inference(equality_resolution,[],[f512]) ).
tff(f512,plain,
! [X2: nat,X1: dB] :
( ( var(X2) = foldl(dB,dB,app,X1,nil(dB)) )
| ( var(X2) != X1 ) ),
inference(equality_resolution,[],[f343]) ).
tff(f343,plain,
! [X2: nat,X0: list(dB),X1: dB] :
( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) ),
inference(cnf_transformation,[],[f257]) ).
tff(f257,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) )
& ( ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) )
| ( var(X2) != foldl(dB,dB,app,X1,X0) ) ) ),
inference(flattening,[],[f256]) ).
tff(f256,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( ( var(X2) = foldl(dB,dB,app,X1,X0) )
| ( nil(dB) != X0 )
| ( var(X2) != X1 ) )
& ( ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) )
| ( var(X2) != foldl(dB,dB,app,X1,X0) ) ) ),
inference(nnf_transformation,[],[f118]) ).
tff(f118,plain,
! [X0: list(dB),X1: dB,X2: nat] :
( ( var(X2) = foldl(dB,dB,app,X1,X0) )
<=> ( ( nil(dB) = X0 )
& ( var(X2) = X1 ) ) ),
inference(rectify,[],[f14]) ).
tff(f14,axiom,
! [X9: list(dB),X16: dB,X12: nat] :
( ( var(X12) = foldl(dB,dB,app,X16,X9) )
<=> ( ( nil(dB) = X9 )
& ( var(X12) = X16 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',fact_13_Var__eq__apps__conv) ).
tff(f505,plain,
~ pp(aa(dB,bool,it,subst(foldl(dB,dB,app,var(i),rs),u,i))),
inference(definition_unfolding,[],[f500,f326]) ).
tff(f326,plain,
n = i,
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
n = i,
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',fact_4_True) ).
tff(f500,plain,
~ pp(aa(dB,bool,it,subst(foldl(dB,dB,app,var(n),rs),u,i))),
inference(cnf_transformation,[],[f205]) ).
tff(f205,plain,
~ pp(aa(dB,bool,it,subst(foldl(dB,dB,app,var(n),rs),u,i))),
inference(flattening,[],[f109]) ).
tff(f109,negated_conjecture,
~ pp(aa(dB,bool,it,subst(foldl(dB,dB,app,var(n),rs),u,i))),
inference(negated_conjecture,[],[f108]) ).
tff(f108,conjecture,
pp(aa(dB,bool,it,subst(foldl(dB,dB,app,var(n),rs),u,i))),
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',conj_0) ).
tff(f325,plain,
pp(aa(dB,bool,it,u)),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
pp(aa(dB,bool,it,u)),
file('/export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429',fact_3_uIT) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL784_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34 % Computer : n006.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Tue Apr 30 16:38:35 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.15/0.34 This is a TF1_THM_EQU_NAR problem
% 0.15/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.ZjEPKnc1Tr/Vampire---4.8_10429
% 0.60/0.76 % (10617)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.60/0.76 % (10623)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.60/0.76 % (10618)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.60/0.76 % (10616)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.76 % (10620)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.60/0.76 % (10619)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.60/0.76 % (10621)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.60/0.76 % (10622)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.60/0.76 % (10623)Refutation not found, incomplete strategy% (10623)------------------------------
% 0.60/0.76 % (10623)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (10623)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (10623)Memory used [KB]: 1116
% 0.60/0.76 % (10623)Time elapsed: 0.005 s
% 0.60/0.76 % (10623)Instructions burned: 7 (million)
% 0.60/0.76 % (10623)------------------------------
% 0.60/0.76 % (10623)------------------------------
% 0.60/0.77 % (10622)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.77 % (10621)Refutation not found, incomplete strategy% (10621)------------------------------
% 0.60/0.77 % (10621)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (10621)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (10621)Memory used [KB]: 1161
% 0.60/0.77 % (10621)Time elapsed: 0.009 s
% 0.60/0.77 % (10621)Instructions burned: 6 (million)
% 0.60/0.77 % (10621)------------------------------
% 0.60/0.77 % (10621)------------------------------
% 0.60/0.77 % (10625)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2995ds/55Mi)
% 0.60/0.77 % (10617)First to succeed.
% 0.60/0.77 % (10622)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.77 % (10618)Also succeeded, but the first one will report.
% 0.60/0.77 % (10617)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (10617)------------------------------
% 0.60/0.77 % (10617)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.77 % (10617)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (10617)Memory used [KB]: 1336
% 0.60/0.77 % (10617)Time elapsed: 0.014 s
% 0.60/0.77 % (10617)Instructions burned: 24 (million)
% 0.60/0.77 % (10617)------------------------------
% 0.60/0.77 % (10617)------------------------------
% 0.60/0.77 % (10592)Success in time 0.414 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------