TSTP Solution File: LCL812_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL812_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 : n027.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:53:37 EDT 2024
% Result : Theorem 0.17s 0.39s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 94
% Syntax : Number of formulae : 114 ( 13 unt; 86 typ; 0 def)
% Number of atoms : 108 ( 32 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 116 ( 36 ~; 36 |; 37 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 131 ( 61 >; 70 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-6 aty)
% Number of functors : 72 ( 72 usr; 16 con; 0-6 aty)
% Number of variables : 117 ( 30 !; 30 ?; 117 :)
% ( 57 !>; 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,
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,
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,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
concat:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_17,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_18,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_20,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_21,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_22,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_23,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_24,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_25,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_26,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_27,type,
fFalse: bool ).
tff(func_def_28,type,
fTrue: bool ).
tff(func_def_29,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_30,type,
a: dB ).
tff(func_def_31,type,
as: list(dB) ).
tff(func_def_32,type,
i: nat ).
tff(func_def_33,type,
n: nat ).
tff(func_def_34,type,
rs: list(dB) ).
tff(func_def_35,type,
t: dB ).
tff(func_def_36,type,
u: dB ).
tff(func_def_37,type,
ua: dB ).
tff(func_def_38,type,
sK6: dB > dB ).
tff(func_def_39,type,
sK7: dB > list(dB) ).
tff(func_def_40,type,
sK8: dB > nat ).
tff(func_def_41,type,
sK9: dB > dB ).
tff(func_def_42,type,
sK10: dB > dB ).
tff(func_def_43,type,
sK11: dB > list(dB) ).
tff(func_def_44,type,
sK12:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_45,type,
sK13:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_46,type,
sK14: ( dB * dB ) > dB ).
tff(func_def_47,type,
sK15:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_48,type,
sK16:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_49,type,
sK17: ( dB * list(dB) * dB ) > dB ).
tff(func_def_50,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_51,type,
sK19: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_52,type,
sK20: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_53,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_54,type,
sK22: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_55,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_56,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_57,type,
sK25: ( dB * dB * dB ) > dB ).
tff(func_def_58,type,
sK26:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_59,type,
sK27:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_60,type,
sK28:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_61,type,
sK29:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_62,type,
sK30:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_63,type,
sK31:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_64,type,
sK32:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_65,type,
sK33:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_66,type,
sK34:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_67,type,
sK35:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_68,type,
sK36:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_69,type,
sK37:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
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,
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 * list(dB) * dB ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB * dB ) > $o ).
tff(pred_def_10,type,
sP4:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_11,type,
sP5:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f693,plain,
$false,
inference(subsumption_resolution,[],[f690,f555]) ).
tff(f555,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),as))),
inference(forward_demodulation,[],[f346,f341]) ).
tff(f341,plain,
n = i,
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
n = i,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_True) ).
tff(f346,plain,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))),
inference(cnf_transformation,[],[f5]) ).
tff(f5,axiom,
listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4__096listsp_AIT_A_Imap_A_I_Ft_O_Alift_At_A0_J_A_Imap_A_I_Ft_O_At_091u_Pi_093_J_Aas_J_J_096) ).
tff(f690,plain,
~ listsp(dB,it,map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),as))),
inference(resolution,[],[f522,f680]) ).
tff(f680,plain,
~ sP1(foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),as)))),
inference(resolution,[],[f368,f554]) ).
tff(f554,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),n),as))))),
inference(backward_demodulation,[],[f337,f341]) ).
tff(f337,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))))),
inference(cnf_transformation,[],[f112]) ).
tff(f112,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))))),
inference(flattening,[],[f111]) ).
tff(f111,negated_conjecture,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))))),
inference(negated_conjecture,[],[f110]) ).
tff(f110,conjecture,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,lift,zero_zero(nat)),map(dB,dB,combc(dB,nat,dB,combc(dB,dB,fun(nat,dB),subst,u),i),as))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f368,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f261]) ).
tff(f261,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ~ sP1(X0) )
& ( sP1(X0)
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(nnf_transformation,[],[f241]) ).
tff(f241,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
<=> sP1(X0) ),
inference(definition_folding,[],[f119,f240,f239]) ).
tff(f239,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,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),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(f240,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(f119,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,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),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,[],[f51]) ).
tff(f51,axiom,
! [X36: dB] :
( pp(aa(dB,bool,it,X36))
<=> ( ? [X54: dB,X55: dB,X56: list(dB)] :
( pp(aa(dB,bool,it,X55))
& pp(aa(dB,bool,it,foldl(dB,dB,app,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,X54),X55),zero_zero(nat)),X56)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X54)),X55),X56) = X36 ) )
| ? [X54: dB] :
( pp(aa(dB,bool,it,X54))
& ( abs(X54) = X36 ) )
| ? [X52: list(dB),X53: nat] :
( listsp(dB,it,X52)
& ( foldl(dB,dB,app,var(X53),X52) = X36 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_50_IT_Osimps) ).
tff(f522,plain,
! [X2: list(dB),X3: nat] :
( sP1(foldl(dB,dB,app,var(X3),X2))
| ~ listsp(dB,it,X2) ),
inference(equality_resolution,[],[f360]) ).
tff(f360,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,[],[f256]) ).
tff(f256,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,sK6(X0)))
& ( abs(sK6(X0)) = X0 ) )
| ( listsp(dB,it,sK7(X0))
& ( foldl(dB,dB,app,var(sK8(X0)),sK7(X0)) = X0 ) )
| ~ sP1(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f253,f255,f254]) ).
tff(f254,plain,
! [X0: dB] :
( ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
=> ( pp(aa(dB,bool,it,sK6(X0)))
& ( abs(sK6(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f255,plain,
! [X0: dB] :
( ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
=> ( listsp(dB,it,sK7(X0))
& ( foldl(dB,dB,app,var(sK8(X0)),sK7(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f253,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,[],[f252]) ).
tff(f252,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,[],[f251]) ).
tff(f251,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,[],[f240]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL812_5 : TPTP v8.1.2. Released v6.0.0.
% 0.10/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.11/0.32 % Computer : n027.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 : Fri May 3 14:07:36 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 % (25415)Running in auto input_syntax mode. Trying TPTP
% 0.17/0.34 % (25418)WARNING: value z3 for option sas not known
% 0.17/0.34 % (25420)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.17/0.34 % (25416)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.17/0.34 % (25419)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.17/0.34 % (25422)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.17/0.34 % (25421)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.17/0.34 % (25417)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.17/0.34 % (25418)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.17/0.35 % (25422)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.17/0.35 % Exception at run slice level
% 0.17/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.35 % Exception at run slice level
% 0.17/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.35 % Exception at run slice level
% 0.17/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.36 % (25424)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.17/0.36 % (25423)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.17/0.37 % (25425)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.17/0.37 % (25424)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.17/0.37 % (25423)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.17/0.37 % Exception at run slice level
% 0.17/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.17/0.39 % (25426)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)
% 0.17/0.39 % (25425)First to succeed.
% 0.17/0.39 % (25425)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25415"
% 0.17/0.39 % (25425)Refutation found. Thanks to Tanya!
% 0.17/0.39 % SZS status Theorem for theBenchmark
% 0.17/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.39 % (25425)------------------------------
% 0.17/0.39 % (25425)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.17/0.39 % (25425)Termination reason: Refutation
% 0.17/0.39
% 0.17/0.39 % (25425)Memory used [KB]: 1302
% 0.17/0.39 % (25425)Time elapsed: 0.027 s
% 0.17/0.39 % (25425)Instructions burned: 55 (million)
% 0.17/0.39 % (25415)Success in time 0.07 s
%------------------------------------------------------------------------------