TSTP Solution File: LCL839_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL839_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 : n029.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:32 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 62
% Syntax : Number of formulae : 83 ( 13 unt; 54 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 44 ( 22 ~; 8 |; 4 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 50 ( 23 >; 27 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 4 prp; 0-3 aty)
% Number of functors : 43 ( 43 usr; 23 con; 0-5 aty)
% Number of variables : 61 ( 34 !; 4 ?; 61 :)
% ( 23 !>; 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)) * 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(X0,fun(X1,X2)) * 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,
lift: fun(dB,fun(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,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_14,type,
suc: nat > nat ).
tff(func_def_15,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_16,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_17,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_18,type,
fFalse: bool ).
tff(func_def_19,type,
fTrue: bool ).
tff(func_def_20,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_21,type,
t1: type ).
tff(func_def_22,type,
t_a: type ).
tff(func_def_23,type,
t: type ).
tff(func_def_24,type,
ua1: type ).
tff(func_def_25,type,
a: dB ).
tff(func_def_26,type,
as: list(dB) ).
tff(func_def_27,type,
e: fun(nat,type) ).
tff(func_def_28,type,
ea: fun(nat,type) ).
tff(func_def_29,type,
i: nat ).
tff(func_def_30,type,
ia: nat ).
tff(func_def_31,type,
r: 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: ( dB * fun(nat,type) ) > type ).
tff(func_def_36,type,
sK1: ( dB * fun(nat,type) ) > type ).
tff(func_def_37,type,
sK2: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_38,type,
sK3: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_39,type,
sK4: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_40,type,
sK5: type ).
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,
typing: ( fun(nat,type) * dB * type ) > $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,
sQ6_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f250,plain,
$false,
inference(avatar_sat_refutation,[],[f234,f235,f249]) ).
tff(f249,plain,
~ spl7_1,
inference(avatar_contradiction_clause,[],[f248]) ).
tff(f248,plain,
( $false
| ~ spl7_1 ),
inference(subsumption_resolution,[],[f245,f229]) ).
tff(f229,plain,
( ! [X0: type] : ~ typing(shift(type,e,i,t),a,X0)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f228]) ).
tff(f228,plain,
( spl7_1
<=> ! [X0: type] : ~ typing(shift(type,e,i,t),a,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
tff(f245,plain,
typing(shift(type,e,i,t),a,sK2(sK5,a,abs(r),shift(type,e,i,t))),
inference(resolution,[],[f182,f200]) ).
tff(f200,plain,
typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),sK5),
inference(cnf_transformation,[],[f173]) ).
tff(f173,plain,
typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),sK5),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f163,f172]) ).
tff(f172,plain,
( ? [X0: type] : typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0)
=> typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),sK5) ),
introduced(choice_axiom,[]) ).
tff(f163,plain,
? [X0: type] : typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0),
inference(ennf_transformation,[],[f134]) ).
tff(f134,plain,
~ ! [X0: type] : ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X0),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
~ ! [X3: type] : ~ typing(shift(type,e,i,t),aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),a),X3),
file('/export/starexec/sandbox/tmp/tmp.JTJxem0EDO/Vampire---4.8_1455',fact_4__096_B_Bthesis_O_A_I_B_BU_O_Ae_060i_058T_062_A_092_060turnstile_062_AAbs_Ar_A_092_060degree_062_Aa_A_058_AU_A_061_061_062_Athesis_J_A_061_061_062_Athesis_096) ).
tff(f182,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: dB] :
( ~ typing(X3,aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1),X0)
| typing(X3,X1,sK2(X0,X1,X2,X3)) ),
inference(cnf_transformation,[],[f167]) ).
tff(f167,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ( typing(X3,X1,sK2(X0,X1,X2,X3))
& typing(X3,X2,aa(type,type,aa(type,fun(type,type),fun1,sK2(X0,X1,X2,X3)),X0)) )
| ~ typing(X3,aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f143,f166]) ).
tff(f166,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ? [X4: type] :
( typing(X3,X1,X4)
& typing(X3,X2,aa(type,type,aa(type,fun(type,type),fun1,X4),X0)) )
=> ( typing(X3,X1,sK2(X0,X1,X2,X3))
& typing(X3,X2,aa(type,type,aa(type,fun(type,type),fun1,sK2(X0,X1,X2,X3)),X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f143,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ? [X4: type] :
( typing(X3,X1,X4)
& typing(X3,X2,aa(type,type,aa(type,fun(type,type),fun1,X4),X0)) )
| ~ typing(X3,aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1),X0) ),
inference(ennf_transformation,[],[f119]) ).
tff(f119,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( typing(X3,aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1),X0)
=> ~ ! [X4: type] :
( typing(X3,X2,aa(type,type,aa(type,fun(type,type),fun1,X4),X0))
=> ~ typing(X3,X1,X4) ) ),
inference(rectify,[],[f27]) ).
tff(f27,axiom,
! [X4: type,X10: dB,X9: dB,X5: fun(nat,type)] :
( typing(X5,aa(dB,dB,aa(dB,fun(dB,dB),app,X9),X10),X4)
=> ~ ! [X25: type] :
( typing(X5,X9,aa(type,type,aa(type,fun(type,type),fun1,X25),X4))
=> ~ typing(X5,X10,X25) ) ),
file('/export/starexec/sandbox/tmp/tmp.JTJxem0EDO/Vampire---4.8_1455',fact_26_typing__elims_I2_J) ).
tff(f235,plain,
~ spl7_2,
inference(avatar_split_clause,[],[f175,f231]) ).
tff(f231,plain,
( spl7_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
tff(f175,plain,
~ thesis,
inference(cnf_transformation,[],[f113]) ).
tff(f113,plain,
~ thesis,
inference(flattening,[],[f111]) ).
tff(f111,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f110]) ).
tff(f110,conjecture,
thesis,
file('/export/starexec/sandbox/tmp/tmp.JTJxem0EDO/Vampire---4.8_1455',conj_1) ).
tff(f234,plain,
( spl7_1
| spl7_2 ),
inference(avatar_split_clause,[],[f174,f231,f228]) ).
tff(f174,plain,
! [X0: type] :
( thesis
| ~ typing(shift(type,e,i,t),a,X0) ),
inference(cnf_transformation,[],[f135]) ).
tff(f135,plain,
! [X0: type] :
( thesis
| ~ typing(shift(type,e,i,t),a,X0) ),
inference(ennf_transformation,[],[f112]) ).
tff(f112,plain,
! [X0: type] :
( typing(shift(type,e,i,t),a,X0)
=> thesis ),
inference(rectify,[],[f109]) ).
tff(f109,axiom,
! [X85: type] :
( typing(shift(type,e,i,t),a,X85)
=> thesis ),
file('/export/starexec/sandbox/tmp/tmp.JTJxem0EDO/Vampire---4.8_1455',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL839_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:05:05 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.JTJxem0EDO/Vampire---4.8_1455
% 0.59/0.75 % (1729)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.59/0.75 % (1730)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.59/0.75 % (1724)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.59/0.75 % (1726)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.59/0.75 % (1727)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.59/0.75 % (1725)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.59/0.75 % (1731)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 (2996ds/56Mi)
% 0.59/0.75 % (1730)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.59/0.75 % (1730)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.59/0.75 % (1727)Refutation not found, incomplete strategy% (1727)------------------------------
% 0.59/0.75 % (1727)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (1727)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (1727)Memory used [KB]: 1118
% 0.59/0.75 % (1727)Time elapsed: 0.004 s
% 0.59/0.75 % (1727)Instructions burned: 5 (million)
% 0.59/0.75 % (1727)------------------------------
% 0.59/0.75 % (1727)------------------------------
% 0.59/0.75 % (1731)Refutation not found, incomplete strategy% (1731)------------------------------
% 0.59/0.75 % (1731)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (1731)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (1731)Memory used [KB]: 1124
% 0.59/0.75 % (1731)Time elapsed: 0.005 s
% 0.59/0.75 % (1731)Instructions burned: 7 (million)
% 0.59/0.75 % (1731)------------------------------
% 0.59/0.75 % (1731)------------------------------
% 0.59/0.75 % (1724)First to succeed.
% 0.59/0.75 % (1730)Also succeeded, but the first one will report.
% 0.59/0.75 % (1724)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (1724)------------------------------
% 0.59/0.76 % (1724)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.76 % (1724)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (1724)Memory used [KB]: 1144
% 0.59/0.76 % (1724)Time elapsed: 0.007 s
% 0.59/0.76 % (1724)Instructions burned: 9 (million)
% 0.59/0.76 % (1724)------------------------------
% 0.59/0.76 % (1724)------------------------------
% 0.59/0.76 % (1719)Success in time 0.382 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------