TSTP Solution File: LCL826_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL826_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue Apr 30 13:50:17 EDT 2024
% Result : Theorem 2.40s 0.75s
% Output : Refutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 101
% Syntax : Number of formulae : 118 ( 6 unt; 97 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 83 ( 34 ~; 24 |; 17 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 116 ( 52 >; 64 *; 0 +; 0 <<)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 84 ( 84 usr; 32 con; 0-5 aty)
% Number of variables : 89 ( 40 !; 13 ?; 89 :)
% ( 36 !>; 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,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_7,type,
abs: dB > dB ).
tff(func_def_8,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_9,type,
var: nat > dB ).
tff(func_def_10,type,
dB_size: dB > nat ).
tff(func_def_11,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_12,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_13,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_14,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_15,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_16,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_17,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_19,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : fun(fun(nat,X0),fun(nat,fun(X0,fun(nat,X0)))) ).
tff(func_def_21,type,
atom: nat > type ).
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,
a: dB ).
tff(func_def_37,type,
as: list(dB) ).
tff(func_def_38,type,
e: fun(nat,type) ).
tff(func_def_39,type,
ea: fun(nat,type) ).
tff(func_def_40,type,
i: nat ).
tff(func_def_41,type,
ia: nat ).
tff(func_def_42,type,
n: nat ).
tff(func_def_43,type,
rs: list(dB) ).
tff(func_def_44,type,
t2: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK4: fun(nat,type) ).
tff(func_def_48,type,
sK5: type ).
tff(func_def_49,type,
sK6: dB ).
tff(func_def_50,type,
sK7: nat ).
tff(func_def_51,type,
sK8: type ).
tff(func_def_52,type,
sK9: list(type) ).
tff(func_def_53,type,
sK10: dB > dB ).
tff(func_def_54,type,
sK11: dB > list(dB) ).
tff(func_def_55,type,
sK12: dB > nat ).
tff(func_def_56,type,
sK13: dB > dB ).
tff(func_def_57,type,
sK14: dB > dB ).
tff(func_def_58,type,
sK15: dB > list(dB) ).
tff(func_def_59,type,
sK16: ( dB * dB ) > dB ).
tff(func_def_60,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_61,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_62,type,
sK19: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_63,type,
sK20: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_64,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_65,type,
sK22: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_66,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_67,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_68,type,
sK25: ( dB * dB * dB ) > dB ).
tff(func_def_69,type,
sK26: ( dB * fun(nat,type) ) > type ).
tff(func_def_70,type,
sK27: ( dB * fun(nat,type) ) > type ).
tff(func_def_71,type,
sK28: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_72,type,
sK29: ( type * dB * fun(nat,type) ) > type ).
tff(func_def_73,type,
sK30: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_74,type,
sK31: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_75,type,
sK32: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_76,type,
sK33: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_77,type,
sK34:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_78,type,
sK35:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_79,type,
sK36:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_80,type,
sK37:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_81,type,
sK38: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
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,
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(pred_def_7,type,
sP1: dB > $o ).
tff(pred_def_8,type,
sP2: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB * dB ) > $o ).
tff(f2971,plain,
$false,
inference(subsumption_resolution,[],[f2968,f355]) ).
tff(f355,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK4),sK6),t)),
inference(cnf_transformation,[],[f281]) ).
tff(f281,plain,
( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),sK6),sK7)))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK4),sK6),t))
& pp(aa(dB,bool,it,sK6))
& 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),sK4),sK7),t)),a),sK5)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f214,f280]) ).
tff(f280,plain,
( ? [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X2),X3)))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
& pp(aa(dB,bool,it,X2))
& 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),X0),X3),t)),a),X1)) )
=> ( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),sK6),sK7)))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK4),sK6),t))
& pp(aa(dB,bool,it,sK6))
& 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),sK4),sK7),t)),a),sK5)) ) ),
introduced(choice_axiom,[]) ).
tff(f214,plain,
? [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X2),X3)))
& pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
& pp(aa(dB,bool,it,X2))
& 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),X0),X3),t)),a),X1)) ),
inference(ennf_transformation,[],[f117]) ).
tff(f117,plain,
~ ! [X0: fun(nat,type),X1: type,X2: dB,X3: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X2),X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),X2),t))
| ~ pp(aa(dB,bool,it,X2))
| ~ 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),X0),X3),t)),a),X1)) ),
inference(rectify,[],[f116]) ).
tff(f116,negated_conjecture,
~ ! [X93: fun(nat,type),X94: type,X84: dB,X95: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X84),X95)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X93),X84),t))
| ~ pp(aa(dB,bool,it,X84))
| ~ 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),X93),X95),t)),a),X94)) ),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
! [X93: fun(nat,type),X94: type,X84: dB,X95: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X84),X95)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X93),X84),t))
| ~ pp(aa(dB,bool,it,X84))
| ~ 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),X93),X95),t)),a),X94)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f2968,plain,
~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,sK4),sK6),t)),
inference(resolution,[],[f2963,f353]) ).
tff(f353,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),sK4),sK7),t)),a),sK5)),
inference(cnf_transformation,[],[f281]) ).
tff(f2963,plain,
! [X0: fun(nat,type),X1: type] :
( ~ 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),X0),sK7),t)),a),X1))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),sK6),t)) ),
inference(subsumption_resolution,[],[f2959,f354]) ).
tff(f354,plain,
pp(aa(dB,bool,it,sK6)),
inference(cnf_transformation,[],[f281]) ).
tff(f2959,plain,
! [X0: fun(nat,type),X1: type] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X0),sK6),t))
| ~ pp(aa(dB,bool,it,sK6))
| ~ 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),X0),sK7),t)),a),X1)) ),
inference(resolution,[],[f375,f356]) ).
tff(f356,plain,
~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),sK6),sK7))),
inference(cnf_transformation,[],[f281]) ).
tff(f375,plain,
! [X2: type,X3: dB,X1: fun(nat,type),X4: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X3),X4)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X1),X3),t))
| ~ pp(aa(dB,bool,it,X3))
| ~ 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),X1),X4),t)),a),X2)) ),
inference(cnf_transformation,[],[f283]) ).
tff(f283,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)),a),sK8))
& ! [X1: fun(nat,type),X2: type,X3: dB,X4: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X3),X4)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X1),X3),t))
| ~ pp(aa(dB,bool,it,X3))
| ~ 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),X1),X4),t)),a),X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f216,f282]) ).
tff(f282,plain,
( ? [X0: type] : 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)),a),X0))
=> 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)),a),sK8)) ),
introduced(choice_axiom,[]) ).
tff(f216,plain,
( ? [X0: type] : 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)),a),X0))
& ! [X1: fun(nat,type),X2: type,X3: dB,X4: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X3),X4)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X1),X3),t))
| ~ pp(aa(dB,bool,it,X3))
| ~ 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),X1),X4),t)),a),X2)) ) ),
inference(flattening,[],[f215]) ).
tff(f215,plain,
( ? [X0: type] : 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)),a),X0))
& ! [X1: fun(nat,type),X2: type,X3: dB,X4: nat] :
( pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X3),X4)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X1),X3),t))
| ~ pp(aa(dB,bool,it,X3))
| ~ 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),X1),X4),t)),a),X2)) ) ),
inference(ennf_transformation,[],[f118]) ).
tff(f118,plain,
( ? [X0: type] : 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)),a),X0))
& ! [X1: fun(nat,type),X2: type,X3: dB,X4: nat] :
( 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),X1),X4),t)),a),X2))
=> ( pp(aa(dB,bool,it,X3))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X1),X3),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X3),X4))) ) ) ) ),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
( ? [X8: type] : 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)),a),X8))
& ! [X4: fun(nat,type),X5: type,X6: dB,X7: nat] :
( 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),X4),X7),t)),a),X5))
=> ( pp(aa(dB,bool,it,X6))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),aa(fun(nat,type),fun(dB,fun(type,bool)),typing,X4),X6),t))
=> pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),X6),X7))) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_Cons_I1_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL826_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Mon Apr 29 23:23:20 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (22001)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.43 % (22005)WARNING: value z3 for option sas not known
% 0.23/0.43 % (22008)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.23/0.43 % (22004)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.23/0.43 % (22003)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.23/0.43 % (22006)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.23/0.43 % (22005)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.23/0.43 % (22009)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.23/0.43 % (22010)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.23/0.44 % Exception at run slice level
% 0.23/0.44 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.44 % (22010)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.44 % Exception at run slice level
% 0.23/0.44 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.44 % Exception at run slice level
% 0.23/0.44 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.46 % (22011)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.23/0.46 % (22012)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.23/0.46 % (22013)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.23/0.47 % (22011)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.47 % (22012)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.47 % Exception at run slice level
% 0.23/0.47 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.49 % (22014)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 2.40/0.74 % (22013)First to succeed.
% 2.40/0.75 % (22013)Refutation found. Thanks to Tanya!
% 2.40/0.75 % SZS status Theorem for theBenchmark
% 2.40/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 2.40/0.75 % (22013)------------------------------
% 2.40/0.75 % (22013)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 2.40/0.75 % (22013)Termination reason: Refutation
% 2.40/0.75
% 2.40/0.75 % (22013)Memory used [KB]: 3645
% 2.40/0.75 % (22013)Time elapsed: 0.284 s
% 2.40/0.75 % (22013)Instructions burned: 881 (million)
% 2.40/0.75 % (22013)------------------------------
% 2.40/0.75 % (22013)------------------------------
% 2.40/0.75 % (22001)Success in time 0.364 s
%------------------------------------------------------------------------------