TSTP Solution File: LCL821_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL821_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 : 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 : Sun May 5 07:42:45 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 65
% Syntax : Number of formulae : 83 ( 10 unt; 58 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 14 ~; 8 |; 6 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 55 ( 25 >; 30 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 47 ( 47 usr; 21 con; 0-5 aty)
% Number of variables : 59 ( 30 !; 4 ?; 59 :)
% ( 25 !>; 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,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(fun(X0,X1),fun(X0,X2))) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
it: 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,
lift: ( dB * nat ) > dB ).
tff(func_def_10,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_11,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_12,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_13,type,
suc: nat > nat ).
tff(func_def_14,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_15,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_16,type,
typing: fun(fun(nat,type),fun(dB,fun(type,bool))) ).
tff(func_def_17,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_18,type,
fAll:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fTrue: bool ).
tff(func_def_21,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_22,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
t1: type ).
tff(func_def_24,type,
t_a: type ).
tff(func_def_25,type,
t: type ).
tff(func_def_26,type,
e: fun(nat,type) ).
tff(func_def_27,type,
ea: fun(nat,type) ).
tff(func_def_28,type,
i: nat ).
tff(func_def_29,type,
ia: nat ).
tff(func_def_30,type,
n: nat ).
tff(func_def_31,type,
rs: list(dB) ).
tff(func_def_32,type,
t2: dB ).
tff(func_def_33,type,
u: dB ).
tff(func_def_34,type,
ua: dB ).
tff(func_def_35,type,
sK0: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_36,type,
sK1: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_37,type,
sK2: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_38,type,
sK3: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_39,type,
sK4: ( nat * nat ) > nat ).
tff(func_def_40,type,
sK5: ( nat * nat ) > nat ).
tff(func_def_41,type,
sK6: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_42,type,
sK7: fun(nat,bool) > nat ).
tff(func_def_43,type,
sK8: fun(nat,bool) > nat ).
tff(func_def_44,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_5,type,
typings: ( fun(nat,type) * list(dB) * list(type) ) > $o ).
tff(pred_def_6,type,
pp: bool > $o ).
tff(pred_def_8,type,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f535,plain,
$false,
inference(avatar_sat_refutation,[],[f387,f388,f534]) ).
tff(f534,plain,
~ spl11_1,
inference(avatar_contradiction_clause,[],[f533]) ).
tff(f533,plain,
( $false
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f528,f382]) ).
tff(f382,plain,
( ! [X0: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f381]) ).
tff(f381,plain,
( spl11_1
<=> ! [X0: list(type)] : ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
tff(f528,plain,
typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,sK0(t1,rs,var(n),aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t))),
inference(resolution,[],[f325,f253]) ).
tff(f253,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: list(dB)] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,X2,X1)),X0))
| typings(X3,X1,sK0(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f220]) ).
tff(f220,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ( typings(X3,X1,sK0(X0,X1,X2,X3))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),X2),foldr(type,type,fun1,sK0(X0,X1,X2,X3),X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,X2,X1)),X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f169,f219]) ).
tff(f219,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ? [X4: list(type)] :
( typings(X3,X1,X4)
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),X2),foldr(type,type,fun1,X4,X0))) )
=> ( typings(X3,X1,sK0(X0,X1,X2,X3))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),X2),foldr(type,type,fun1,sK0(X0,X1,X2,X3),X0))) ) ),
introduced(choice_axiom,[]) ).
tff(f169,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( ? [X4: list(type)] :
( typings(X3,X1,X4)
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),X2),foldr(type,type,fun1,X4,X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,X2,X1)),X0)) ),
inference(ennf_transformation,[],[f120]) ).
tff(f120,plain,
! [X0: type,X1: list(dB),X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),foldl(dB,dB,app,X2,X1)),X0))
=> ? [X4: list(type)] :
( typings(X3,X1,X4)
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X3),X2),foldr(type,type,fun1,X4,X0))) ) ),
inference(rectify,[],[f97]) ).
tff(f97,axiom,
! [X3: type,X25: list(dB),X8: dB,X4: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X4),foldl(dB,dB,app,X8,X25)),X3))
=> ? [X65: list(type)] :
( typings(X4,X25,X65)
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X4),X8),foldr(type,type,fun1,X65,X3))) ) ),
file('/export/starexec/sandbox/tmp/tmp.upaPqAbO6G/Vampire---4.8_14050',fact_96_list__app__typeD) ).
tff(f325,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),foldl(dB,dB,app,var(n),rs)),t1)),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t)),foldl(dB,dB,app,var(n),rs)),t1)),
file('/export/starexec/sandbox/tmp/tmp.upaPqAbO6G/Vampire---4.8_14050',fact_3_nT) ).
tff(f388,plain,
~ spl11_2,
inference(avatar_split_clause,[],[f251,f384]) ).
tff(f384,plain,
( spl11_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
tff(f251,plain,
~ thesis,
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
~ thesis,
inference(flattening,[],[f117]) ).
tff(f117,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f116]) ).
tff(f116,conjecture,
thesis,
file('/export/starexec/sandbox/tmp/tmp.upaPqAbO6G/Vampire---4.8_14050',conj_1) ).
tff(f387,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f250,f384,f381]) ).
tff(f250,plain,
! [X0: list(type)] :
( thesis
| ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0) ),
inference(cnf_transformation,[],[f168]) ).
tff(f168,plain,
! [X0: list(type)] :
( thesis
| ~ typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0) ),
inference(ennf_transformation,[],[f118]) ).
tff(f118,plain,
! [X0: list(type)] :
( typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X0)
=> thesis ),
inference(rectify,[],[f115]) ).
tff(f115,axiom,
! [X73: list(type)] :
( typings(aa(type,fun(nat,type),aa(nat,fun(type,fun(nat,type)),aa(fun(nat,type),fun(nat,fun(type,fun(nat,type))),shift(type),e),i),t),rs,X73)
=> thesis ),
file('/export/starexec/sandbox/tmp/tmp.upaPqAbO6G/Vampire---4.8_14050',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LCL821_5 : TPTP v8.1.2. Released v6.0.0.
% 0.02/0.11 % 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.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 13:55:19 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TF1_THM_EQU_NAR problem
% 0.11/0.31 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.upaPqAbO6G/Vampire---4.8_14050
% 0.57/0.77 % (14158)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.57/0.77 % (14161)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.57/0.77 % (14160)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.57/0.77 % (14159)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.57/0.77 % (14164)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.57/0.77 % (14162)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.57/0.77 % (14163)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.57/0.77 % (14165)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.57/0.77 % (14161)Refutation not found, incomplete strategy% (14161)------------------------------
% 0.57/0.77 % (14161)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (14161)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (14161)Memory used [KB]: 1138
% 0.61/0.77 % (14161)Time elapsed: 0.004 s
% 0.61/0.77 % (14161)Instructions burned: 6 (million)
% 0.61/0.77 % (14161)------------------------------
% 0.61/0.77 % (14161)------------------------------
% 0.61/0.77 % (14164)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.77 % (14165)Refutation not found, incomplete strategy% (14165)------------------------------
% 0.61/0.77 % (14165)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (14165)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (14165)Memory used [KB]: 1208
% 0.61/0.77 % (14165)Time elapsed: 0.006 s
% 0.61/0.77 % (14165)Instructions burned: 11 (million)
% 0.61/0.77 % (14165)------------------------------
% 0.61/0.77 % (14165)------------------------------
% 0.61/0.77 % (14163)Refutation not found, incomplete strategy% (14163)------------------------------
% 0.61/0.77 % (14163)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.77 % (14163)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (14163)Memory used [KB]: 1200
% 0.61/0.77 % (14163)Time elapsed: 0.007 s
% 0.61/0.77 % (14163)Instructions burned: 13 (million)
% 0.61/0.77 % (14164)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.61/0.77 % (14163)------------------------------
% 0.61/0.77 % (14163)------------------------------
% 0.61/0.77 % (14166)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.61/0.77 % (14167)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.61/0.77 % (14158)First to succeed.
% 0.61/0.77 % (14168)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.61/0.78 % (14158)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14157"
% 0.61/0.78 % (14158)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (14158)------------------------------
% 0.61/0.78 % (14158)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.78 % (14158)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (14158)Memory used [KB]: 1261
% 0.61/0.78 % (14158)Time elapsed: 0.011 s
% 0.61/0.78 % (14158)Instructions burned: 24 (million)
% 0.61/0.78 % (14157)Success in time 0.461 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------