TSTP Solution File: LCL785_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL785_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 : n019.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:07 EDT 2024
% Result : Theorem 0.66s 0.82s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 72
% Syntax : Number of formulae : 85 ( 18 unt; 67 typ; 0 def)
% Number of atoms : 18 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 76 ( 39 >; 37 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 61 ( 61 usr; 20 con; 0-5 aty)
% Number of variables : 68 ( 18 !; 0 ?; 68 :)
% ( 50 !>; 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(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)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
it: fun(dB,bool) ).
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,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_8,type,
append:
!>[X0: $tType] : fun(list(X0),fun(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,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_13,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_14,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_15,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_16,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_17,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_19,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_20,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_21,type,
typing: ( fun(nat,type) * dB ) > fun(type,bool) ).
tff(func_def_22,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_23,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_24,type,
fFalse: bool ).
tff(func_def_25,type,
fTrue: bool ).
tff(func_def_26,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_27,type,
t: type ).
tff(func_def_28,type,
t_a: type ).
tff(func_def_29,type,
t1: type ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
e: fun(nat,type) ).
tff(func_def_33,type,
ea: fun(nat,type) ).
tff(func_def_34,type,
i: nat ).
tff(func_def_35,type,
ia: nat ).
tff(func_def_36,type,
n: nat ).
tff(func_def_37,type,
rs: list(dB) ).
tff(func_def_38,type,
t2: dB ).
tff(func_def_39,type,
u: dB ).
tff(func_def_40,type,
ua: dB ).
tff(func_def_41,type,
sK0: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(func_def_42,type,
sK1:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_43,type,
sK2:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_44,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_45,type,
sK4:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_46,type,
sK5:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_47,type,
sK6:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK7:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK8:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK9:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK10:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_52,type,
sK11:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_53,type,
sK12:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_54,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_55,type,
sK14:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_56,type,
sK15:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_57,type,
sK16:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_58,type,
sK17:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(pred_def_1,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_2,type,
pp: bool > $o ).
tff(f375,plain,
$false,
inference(subsumption_resolution,[],[f374,f324]) ).
tff(f324,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),rs)),t)),
inference(definition_unfolding,[],[f259,f261]) ).
tff(f261,plain,
n = i,
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
n = i,
file('/export/starexec/sandbox2/tmp/tmp.7USFT4cMXV/Vampire---4.8_19998',fact_1_True) ).
tff(f259,plain,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(n),rs)),t)),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(n),rs)),t)),
file('/export/starexec/sandbox2/tmp/tmp.7USFT4cMXV/Vampire---4.8_19998',fact_4_nT) ).
tff(f374,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),rs)),t)),
inference(forward_demodulation,[],[f373,f260]) ).
tff(f260,plain,
rs = aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
rs = aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as),
file('/export/starexec/sandbox2/tmp/tmp.7USFT4cMXV/Vampire---4.8_19998',fact_2_Cons) ).
tff(f373,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,var(i),aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),a),as))),t)),
inference(forward_demodulation,[],[f323,f256]) ).
tff(f256,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f126]) ).
tff(f126,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,aa(list(X1),list(X1),aa(X1,fun(list(X1),list(X1)),cons(X1),X3),X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(rectify,[],[f23]) ).
tff(f23,axiom,
! [X2: $tType,X0: $tType,X34: list(X0),X9: X0,X33: X2,X35: fun(X2,fun(X0,X2))] : ( foldl(X2,X0,X35,X33,aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X9),X34)) = foldl(X2,X0,X35,aa(X0,X2,aa(X2,fun(X0,X2),X35,X33),X9),X34) ),
file('/export/starexec/sandbox2/tmp/tmp.7USFT4cMXV/Vampire---4.8_19998',fact_22_foldl__Cons) ).
tff(f323,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a),as)),t)),
inference(definition_unfolding,[],[f230,f261]) ).
tff(f230,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(cnf_transformation,[],[f113]) ).
tff(f113,plain,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(flattening,[],[f112]) ).
tff(f112,negated_conjecture,
~ pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
inference(negated_conjecture,[],[f111]) ).
tff(f111,conjecture,
pp(aa(type,bool,typing(shift(type,e,i,t1),foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a),as)),t)),
file('/export/starexec/sandbox2/tmp/tmp.7USFT4cMXV/Vampire---4.8_19998',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL785_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/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.35 % Computer : n019.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 : Tue Apr 30 16:47:14 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TF1_THM_EQU_NAR problem
% 0.15/0.36 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.7USFT4cMXV/Vampire---4.8_19998
% 0.64/0.81 % (20227)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.64/0.81 % (20224)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.64/0.81 % (20226)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.64/0.81 % (20225)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.64/0.81 % (20230)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.64/0.81 % (20228)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.64/0.81 % (20229)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.66/0.81 % (20231)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.66/0.82 % (20230)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.66/0.82 % (20230)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.66/0.82 % (20229)First to succeed.
% 0.66/0.82 % (20231)Refutation not found, incomplete strategy% (20231)------------------------------
% 0.66/0.82 % (20231)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.82 % (20231)Termination reason: Refutation not found, incomplete strategy
% 0.66/0.82
% 0.66/0.82 % (20231)Memory used [KB]: 1239
% 0.66/0.82 % (20231)Time elapsed: 0.010 s
% 0.66/0.82 % (20231)Instructions burned: 17 (million)
% 0.66/0.82 % (20231)------------------------------
% 0.66/0.82 % (20231)------------------------------
% 0.66/0.82 % (20229)Refutation found. Thanks to Tanya!
% 0.66/0.82 % SZS status Theorem for Vampire---4
% 0.66/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.82 % (20229)------------------------------
% 0.66/0.82 % (20229)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.82 % (20229)Termination reason: Refutation
% 0.66/0.82
% 0.66/0.82 % (20229)Memory used [KB]: 1237
% 0.66/0.82 % (20229)Time elapsed: 0.011 s
% 0.66/0.82 % (20229)Instructions burned: 19 (million)
% 0.66/0.82 % (20229)------------------------------
% 0.66/0.82 % (20229)------------------------------
% 0.66/0.82 % (20181)Success in time 0.454 s
% 0.66/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------