TSTP Solution File: LCL825_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL825_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 : 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 : Wed May 1 03:20:25 EDT 2024
% Result : Theorem 0.63s 0.85s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 66
% Syntax : Number of formulae : 77 ( 10 unt; 63 typ; 0 def)
% Number of atoms : 20 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 3 |; 1 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 43 ( 26 >; 17 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 53 ( 53 usr; 23 con; 0-5 aty)
% Number of variables : 56 ( 25 !; 0 ?; 56 :)
% ( 31 !>; 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(fun(X0,fun(X1,X2)),fun(X1,fun(X0,X2))) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(fun(X0,X1),fun(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_size: dB > nat ).
tff(func_def_10,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_11,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_15,type,
hd:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_16,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_17,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_18,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_22,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_23,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_24,type,
typing: fun(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_25,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_26,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_27,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_28,type,
fFalse: bool ).
tff(func_def_29,type,
fTrue: bool ).
tff(func_def_30,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_31,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
t1: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t: type ).
tff(func_def_35,type,
ts: list(type) ).
tff(func_def_36,type,
e: fun(nat,type) ).
tff(func_def_37,type,
ea: fun(nat,type) ).
tff(func_def_38,type,
i: nat ).
tff(func_def_39,type,
ia: nat ).
tff(func_def_40,type,
n: nat ).
tff(func_def_41,type,
rs: list(dB) ).
tff(func_def_42,type,
t2: dB ).
tff(func_def_43,type,
u: dB ).
tff(func_def_44,type,
ua: dB ).
tff(func_def_45,type,
sK1: dB > dB ).
tff(func_def_46,type,
sK2: dB > dB ).
tff(func_def_47,type,
sK3: dB > list(dB) ).
tff(func_def_48,type,
sK4: dB > dB ).
tff(func_def_49,type,
sK5: dB > list(dB) ).
tff(func_def_50,type,
sK6: dB > nat ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: dB > $o ).
tff(f215,plain,
$false,
inference(subsumption_resolution,[],[f214,f179]) ).
tff(f179,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f123]) ).
tff(f123,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X0: $tType,X4: fun(X0,bool)] : listsp(X0,X4,nil(X0)),
file('/export/starexec/sandbox/tmp/tmp.UIODHozrBQ/Vampire---4.8_615',fact_4_listsp_ONil) ).
tff(f214,plain,
~ listsp(dB,it,nil(dB)),
inference(backward_demodulation,[],[f163,f212]) ).
tff(f212,plain,
! [X1: $tType,X0: $tType,X3: fun(X1,X0)] : ( nil(X0) = map(X1,X0,X3,nil(X1)) ),
inference(equality_resolution,[],[f197]) ).
tff(f197,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( nil(X0) = map(X1,X0,X3,X2) )
| ( nil(X1) != X2 ) ),
inference(cnf_transformation,[],[f161]) ).
tff(f161,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( ( nil(X0) = map(X1,X0,X3,X2) )
| ( nil(X1) != X2 ) )
& ( ( nil(X1) = X2 )
| ( nil(X0) != map(X1,X0,X3,X2) ) ) ),
inference(nnf_transformation,[],[f134]) ).
tff(f134,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: fun(X1,X0)] :
( ( nil(X0) = map(X1,X0,X3,X2) )
<=> ( nil(X1) = X2 ) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X0: $tType,X1: $tType,X5: list(X1),X6: fun(X1,X0)] :
( ( nil(X0) = map(X1,X0,X6,X5) )
<=> ( nil(X1) = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.UIODHozrBQ/Vampire---4.8_615',fact_7_map__is__Nil__conv) ).
tff(f163,plain,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
listsp(dB,it,map(dB,dB,aa(nat,fun(dB,dB),aa(fun(dB,fun(nat,dB)),fun(nat,fun(dB,dB)),combc(dB,nat,dB),aa(dB,fun(dB,fun(nat,dB)),aa(fun(dB,fun(dB,fun(nat,dB))),fun(dB,fun(dB,fun(nat,dB))),combc(dB,dB,fun(nat,dB)),subst),u)),i),nil(dB))),
file('/export/starexec/sandbox/tmp/tmp.UIODHozrBQ/Vampire---4.8_615',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL825_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.12 % 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.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 17:06:48 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TF1_THM_EQU_NAR problem
% 0.17/0.32 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.UIODHozrBQ/Vampire---4.8_615
% 0.63/0.84 % (758)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.63/0.84 % (760)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 (2994ds/34Mi)
% 0.63/0.84 % (757)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.63/0.84 % (761)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.63/0.84 % (754)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 (2994ds/34Mi)
% 0.63/0.84 % (755)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 (2994ds/51Mi)
% 0.63/0.84 % (763)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 (2994ds/56Mi)
% 0.63/0.84 % (762)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 (2994ds/83Mi)
% 0.63/0.85 % (758)First to succeed.
% 0.63/0.85 % (763)Refutation not found, incomplete strategy% (763)------------------------------
% 0.63/0.85 % (763)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.85 % (763)Termination reason: Refutation not found, incomplete strategy
% 0.63/0.85
% 0.63/0.85 % (763)Memory used [KB]: 1249
% 0.63/0.85 % (763)Time elapsed: 0.008 s
% 0.63/0.85 % (763)Instructions burned: 15 (million)
% 0.63/0.85 % (763)------------------------------
% 0.63/0.85 % (763)------------------------------
% 0.63/0.85 % (758)Refutation found. Thanks to Tanya!
% 0.63/0.85 % SZS status Theorem for Vampire---4
% 0.63/0.85 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.85 % (758)------------------------------
% 0.63/0.85 % (758)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.63/0.85 % (758)Termination reason: Refutation
% 0.63/0.85
% 0.63/0.85 % (758)Memory used [KB]: 1228
% 0.63/0.85 % (758)Time elapsed: 0.008 s
% 0.63/0.85 % (758)Instructions burned: 12 (million)
% 0.63/0.85 % (758)------------------------------
% 0.63/0.85 % (758)------------------------------
% 0.63/0.85 % (751)Success in time 0.52 s
% 0.63/0.85 % Vampire---4.8 exiting
%------------------------------------------------------------------------------