TSTP Solution File: LCL777_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL777_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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.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:42:23 EDT 2024
% Result : Theorem 0.52s 0.73s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 84
% Syntax : Number of formulae : 92 ( 11 unt; 81 typ; 0 def)
% Number of atoms : 11 ( 3 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 172 ( 66 >; 106 *; 0 +; 0 <<)
% Number of predicates : 24 ( 22 usr; 1 prp; 0-6 aty)
% Number of functors : 56 ( 56 usr; 9 con; 0-5 aty)
% Number of variables : 61 ( 9 !; 0 ?; 61 :)
% ( 52 !>; 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_size: dB > nat ).
tff(func_def_7,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_8,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_10,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_13,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),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,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_16,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_17,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_20,type,
fFalse: bool ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
i: nat ).
tff(func_def_23,type,
r: dB ).
tff(func_def_24,type,
s: dB ).
tff(func_def_25,type,
ss: list(dB) ).
tff(func_def_26,type,
sK17: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_27,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_28,type,
sK19: ( dB * dB * list(dB) ) > dB ).
tff(func_def_29,type,
sK20: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_30,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_31,type,
sK22: ( dB * dB * dB ) > dB ).
tff(func_def_32,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_33,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_34,type,
sK25: ( dB * dB * list(dB) * dB ) > list(dB) ).
tff(func_def_35,type,
sK26:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_36,type,
sK27:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_37,type,
sK28:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_38,type,
sK29:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_39,type,
sK30:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_40,type,
sK31:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_41,type,
sK32:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_42,type,
sK33:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_43,type,
sK34:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_44,type,
sK35:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_45,type,
sK36:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_46,type,
sK37:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK38:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK39:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK40:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK41:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > X0 ) ).
tff(func_def_51,type,
sK42:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_52,type,
sK43: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_53,type,
sK44: ( dB * dB ) > dB ).
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,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: ( dB * dB * list(dB) ) > $o ).
tff(pred_def_7,type,
sP1: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_8,type,
sP2: ( dB * dB * list(dB) ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB * dB ) > $o ).
tff(pred_def_10,type,
sP4: ( dB * dB * dB ) > $o ).
tff(pred_def_11,type,
sP5: ( dB * dB * dB * list(dB) ) > $o ).
tff(pred_def_12,type,
sP6: ( dB * dB * list(dB) * dB ) > $o ).
tff(pred_def_13,type,
sP7:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_14,type,
sP8:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_15,type,
sP9:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_16,type,
sP10:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_17,type,
sP11:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_18,type,
sP12:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_19,type,
sP13:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_20,type,
sP14:
!>[X0: $tType] : ( ( X0 * X0 * list(X0) * list(X0) * fun(X0,fun(X0,bool)) ) > $o ) ).
tff(pred_def_21,type,
sP15:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * X0 * fun(X0,fun(X0,bool)) ) > $o ) ).
tff(pred_def_22,type,
sP16:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f598,plain,
$false,
inference(subsumption_resolution,[],[f372,f597]) ).
tff(f597,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(forward_demodulation,[],[f369,f399]) ).
tff(f399,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(cnf_transformation,[],[f121]) ).
tff(f121,plain,
! [X0: dB,X1: list(dB),X2: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X20: dB,X16: list(dB),X17: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X17,X16)),X20) = foldl(dB,dB,app,X17,append(dB,X16,cons(dB,X20,nil(dB)))) ),
file('/export/starexec/sandbox/tmp/tmp.Zk5UUpNwFt/Vampire---4.8_3934',fact_6_app__last) ).
tff(f369,plain,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
inference(cnf_transformation,[],[f104]) ).
tff(f104,axiom,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
file('/export/starexec/sandbox/tmp/tmp.Zk5UUpNwFt/Vampire---4.8_3934',conj_1) ).
tff(f372,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(cnf_transformation,[],[f109]) ).
tff(f109,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(flattening,[],[f108]) ).
tff(f108,negated_conjecture,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(negated_conjecture,[],[f107]) ).
tff(f107,conjecture,
pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
file('/export/starexec/sandbox/tmp/tmp.Zk5UUpNwFt/Vampire---4.8_3934',conj_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL777_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n002.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 14:09:57 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF1_THM_EQU_NAR problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Zk5UUpNwFt/Vampire---4.8_3934
% 0.52/0.72 % (4048)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 (2996ds/83Mi)
% 0.52/0.72 % (4042)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 (2996ds/34Mi)
% 0.52/0.72 % (4044)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.52/0.72 % (4045)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.52/0.72 % (4043)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 (2996ds/51Mi)
% 0.52/0.72 % (4046)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 (2996ds/34Mi)
% 0.52/0.72 % (4047)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.52/0.72 % (4048)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.52/0.73 % (4048)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.52/0.73 % (4048)First to succeed.
% 0.52/0.73 % (4048)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4041"
% 0.52/0.73 % (4045)Also succeeded, but the first one will report.
% 0.52/0.73 % (4048)Refutation found. Thanks to Tanya!
% 0.52/0.73 % SZS status Theorem for Vampire---4
% 0.52/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.52/0.73 % (4048)------------------------------
% 0.52/0.73 % (4048)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.73 % (4048)Termination reason: Refutation
% 0.52/0.73
% 0.52/0.73 % (4048)Memory used [KB]: 1388
% 0.52/0.73 % (4048)Time elapsed: 0.008 s
% 0.52/0.73 % (4048)Instructions burned: 25 (million)
% 0.52/0.73 % (4041)Success in time 0.366 s
% 0.52/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------