TSTP Solution File: LCL763_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL763_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 : n009.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:49:12 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 107
% Syntax : Number of formulae : 129 ( 14 unt; 99 typ; 0 def)
% Number of atoms : 111 ( 33 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 117 ( 36 ~; 37 |; 37 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 172 ( 86 >; 86 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-6 aty)
% Number of functors : 80 ( 80 usr; 6 con; 0-5 aty)
% Number of variables : 128 ( 50 !; 30 ?; 128 :)
% ( 48 !>; 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,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
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,
dB_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
step1:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(list(X0),fun(list(X0),bool)) ) ).
tff(func_def_12,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_17,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_20,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_21,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_22,type,
conversep:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,bool)) > fun(X1,fun(X0,bool)) ) ).
tff(func_def_23,type,
accp:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(X0,bool) ) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_28,type,
n: nat ).
tff(func_def_29,type,
sK11: dB > dB ).
tff(func_def_30,type,
sK12: dB > dB ).
tff(func_def_31,type,
sK13: dB > dB ).
tff(func_def_32,type,
sK14: dB > nat ).
tff(func_def_33,type,
sK15: dB > dB ).
tff(func_def_34,type,
sK16: dB > list(dB) ).
tff(func_def_35,type,
sK17: dB > nat ).
tff(func_def_36,type,
sK18: dB > dB ).
tff(func_def_37,type,
sK19: dB > dB ).
tff(func_def_38,type,
sK20: dB > list(dB) ).
tff(func_def_39,type,
sK21: dB > list(dB) ).
tff(func_def_40,type,
sK22: dB > dB ).
tff(func_def_41,type,
sK23: dB > dB ).
tff(func_def_42,type,
sK24: dB > nat ).
tff(func_def_43,type,
sK25:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_44,type,
sK26:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_45,type,
sK27: ( dB * dB ) > dB ).
tff(func_def_46,type,
sK28:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK29:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK30: ( dB * dB ) > dB ).
tff(func_def_49,type,
sK31: ( dB * dB ) > dB ).
tff(func_def_50,type,
sK32: ( dB * dB ) > dB ).
tff(func_def_51,type,
sK33: ( dB * dB ) > dB ).
tff(func_def_52,type,
sK34: ( dB * dB ) > dB ).
tff(func_def_53,type,
sK35: ( dB * dB ) > dB ).
tff(func_def_54,type,
sK36: ( dB * dB ) > dB ).
tff(func_def_55,type,
sK37: ( dB * dB ) > dB ).
tff(func_def_56,type,
sK38: ( dB * dB ) > dB ).
tff(func_def_57,type,
sK39: ( dB * dB ) > dB ).
tff(func_def_58,type,
sK40: ( dB * list(dB) * dB ) > dB ).
tff(func_def_59,type,
sK41: ( dB * list(dB) * dB ) > dB ).
tff(func_def_60,type,
sK42: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_61,type,
sK43: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_62,type,
sK44: ( dB * list(dB) * dB ) > dB ).
tff(func_def_63,type,
sK45: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_64,type,
sK46: ( dB * dB * dB ) > dB ).
tff(func_def_65,type,
sK47: ( dB * dB * dB ) > dB ).
tff(func_def_66,type,
sK48: ( dB * dB * dB ) > dB ).
tff(func_def_67,type,
sK49:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_68,type,
sK50:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_69,type,
sK51:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_70,type,
sK52: ( dB * dB * list(dB) * dB ) > list(dB) ).
tff(func_def_71,type,
sK53:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_72,type,
sK54:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_73,type,
sK55:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 * fun(X0,fun(X1,bool)) ) > X0 ) ).
tff(func_def_74,type,
sK56:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 * fun(X0,fun(X1,bool)) ) > X1 ) ).
tff(func_def_75,type,
sK57:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_76,type,
sK58:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_77,type,
sK59:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $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 * dB ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB ) > $o ).
tff(pred_def_10,type,
sP4: ( dB * dB ) > $o ).
tff(pred_def_11,type,
sP5: ( dB * dB ) > $o ).
tff(pred_def_12,type,
sP6: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_13,type,
sP7: ( dB * dB * dB ) > $o ).
tff(pred_def_14,type,
sP8:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_15,type,
sP9: ( dB * dB * list(dB) * dB ) > $o ).
tff(pred_def_16,type,
sP10:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f673,plain,
$false,
inference(resolution,[],[f672,f648]) ).
tff(f648,plain,
~ sP1(var(n)),
inference(resolution,[],[f647,f408]) ).
tff(f408,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f280]) ).
tff(f280,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ~ sP1(X0) )
& ( sP1(X0)
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(nnf_transformation,[],[f248]) ).
tff(f248,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
<=> sP1(X0) ),
inference(definition_folding,[],[f115,f247,f246]) ).
tff(f246,plain,
! [X0: dB] :
( sP0(X0)
<=> ? [X1: dB,X2: dB,X3: list(dB)] :
( pp(aa(dB,bool,it,X2))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X1,X2,zero_zero(nat)),X3)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X2),X3) = X0 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f247,plain,
! [X0: dB] :
( sP1(X0)
<=> ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
tff(f115,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
<=> ( ? [X1: dB,X2: dB,X3: list(dB)] :
( pp(aa(dB,bool,it,X2))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X1,X2,zero_zero(nat)),X3)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X2),X3) = X0 ) )
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) ) ) ),
inference(rectify,[],[f27]) ).
tff(f27,axiom,
! [X19: dB] :
( pp(aa(dB,bool,it,X19))
<=> ( ? [X42: dB,X43: dB,X44: list(dB)] :
( pp(aa(dB,bool,it,X43))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X42,X43,zero_zero(nat)),X44)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X42)),X43),X44) = X19 ) )
| ? [X42: dB] :
( pp(aa(dB,bool,it,X42))
& ( abs(X42) = X19 ) )
| ? [X40: list(dB),X41: nat] :
( listsp(dB,it,X40)
& ( foldl(dB,dB,app,var(X41),X40) = X19 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_26_IT_Osimps) ).
tff(f647,plain,
~ pp(aa(dB,bool,it,var(n))),
inference(forward_demodulation,[],[f383,f521]) ).
tff(f521,plain,
! [X1: $tType,X0: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
inference(cnf_transformation,[],[f175]) ).
tff(f175,plain,
! [X0: $tType,X1: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X2: $tType,X0: $tType,X19: X0,X20: fun(X0,fun(X2,X0))] : ( foldl(X0,X2,X20,X19,nil(X2)) = X19 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_foldl__Nil) ).
tff(f383,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(cnf_transformation,[],[f107]) ).
tff(f107,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(flattening,[],[f106]) ).
tff(f106,negated_conjecture,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(negated_conjecture,[],[f105]) ).
tff(f105,conjecture,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f672,plain,
! [X0: nat] : sP1(var(X0)),
inference(subsumption_resolution,[],[f671,f413]) ).
tff(f413,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f120]) ).
tff(f120,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(rectify,[],[f14]) ).
tff(f14,axiom,
! [X0: $tType,X26: fun(X0,bool)] : listsp(X0,X26,nil(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_13_listsp_ONil) ).
tff(f671,plain,
! [X0: nat] :
( sP1(var(X0))
| ~ listsp(dB,it,nil(dB)) ),
inference(superposition,[],[f590,f521]) ).
tff(f590,plain,
! [X2: list(dB),X3: nat] :
( sP1(foldl(dB,dB,app,var(X3),X2))
| ~ listsp(dB,it,X2) ),
inference(equality_resolution,[],[f400]) ).
tff(f400,plain,
! [X2: list(dB),X3: nat,X0: dB] :
( sP1(X0)
| ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ),
inference(cnf_transformation,[],[f275]) ).
tff(f275,plain,
! [X0: dB] :
( ( sP1(X0)
| ( ~ sP0(X0)
& ! [X1: dB] :
( ~ pp(aa(dB,bool,it,X1))
| ( abs(X1) != X0 ) )
& ! [X2: list(dB),X3: nat] :
( ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ) ) )
& ( sP0(X0)
| ( pp(aa(dB,bool,it,sK15(X0)))
& ( abs(sK15(X0)) = X0 ) )
| ( listsp(dB,it,sK16(X0))
& ( foldl(dB,dB,app,var(sK17(X0)),sK16(X0)) = X0 ) )
| ~ sP1(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17])],[f272,f274,f273]) ).
tff(f273,plain,
! [X0: dB] :
( ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
=> ( pp(aa(dB,bool,it,sK15(X0)))
& ( abs(sK15(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f274,plain,
! [X0: dB] :
( ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
=> ( listsp(dB,it,sK16(X0))
& ( foldl(dB,dB,app,var(sK17(X0)),sK16(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f272,plain,
! [X0: dB] :
( ( sP1(X0)
| ( ~ sP0(X0)
& ! [X1: dB] :
( ~ pp(aa(dB,bool,it,X1))
| ( abs(X1) != X0 ) )
& ! [X2: list(dB),X3: nat] :
( ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ sP1(X0) ) ),
inference(rectify,[],[f271]) ).
tff(f271,plain,
! [X0: dB] :
( ( sP1(X0)
| ( ~ sP0(X0)
& ! [X4: dB] :
( ~ pp(aa(dB,bool,it,X4))
| ( abs(X4) != X0 ) )
& ! [X5: list(dB),X6: nat] :
( ~ listsp(dB,it,X5)
| ( foldl(dB,dB,app,var(X6),X5) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ sP1(X0) ) ),
inference(flattening,[],[f270]) ).
tff(f270,plain,
! [X0: dB] :
( ( sP1(X0)
| ( ~ sP0(X0)
& ! [X4: dB] :
( ~ pp(aa(dB,bool,it,X4))
| ( abs(X4) != X0 ) )
& ! [X5: list(dB),X6: nat] :
( ~ listsp(dB,it,X5)
| ( foldl(dB,dB,app,var(X6),X5) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ sP1(X0) ) ),
inference(nnf_transformation,[],[f247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL763_5 : TPTP v8.1.2. Released v6.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 29 22:25:26 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (11825)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (11828)WARNING: value z3 for option sas not known
% 0.14/0.38 % (11826)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (11827)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (11829)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (11828)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.14/0.38 % (11830)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.14/0.38 % (11831)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.14/0.38 % (11832)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.14/0.39 % (11832)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.14/0.39 % Exception at run slice level
% 0.14/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.39 % Exception at run slice level
% 0.14/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.39 % Exception at run slice level
% 0.14/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.14/0.40 % (11828)First to succeed.
% 0.14/0.40 % (11832)Also succeeded, but the first one will report.
% 0.14/0.40 % (11828)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (11828)------------------------------
% 0.14/0.40 % (11828)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.40 % (11828)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (11828)Memory used [KB]: 1258
% 0.14/0.40 % (11828)Time elapsed: 0.021 s
% 0.14/0.40 % (11828)Instructions burned: 33 (million)
% 0.14/0.40 % (11828)------------------------------
% 0.14/0.40 % (11828)------------------------------
% 0.14/0.40 % (11825)Success in time 0.043 s
%------------------------------------------------------------------------------