TSTP Solution File: LCL818_5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL818_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 : n005.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:54:02 EDT 2024
% Result : Theorem 253.33s 36.49s
% Output : Refutation 253.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 84
% Syntax : Number of formulae : 108 ( 20 unt; 78 typ; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 21 ~; 11 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 88 ( 39 >; 49 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 71 ( 71 usr; 26 con; 0-6 aty)
% Number of variables : 89 ( 48 !; 0 ?; 89 :)
% ( 41 !>; 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,
fun1: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,X1),fun1(fun1(X2,X0),fun1(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun1(X0,fun1(X1,X2)) * X1 ) > fun1(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun1(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun1(fun1(X0,fun1(X1,X2)),fun1(fun1(X0,X1),fun1(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun1(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun1(dB,fun1(dB,dB)) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_size: dB > nat ).
tff(func_def_10,type,
lift: fun1(dB,fun1(nat,dB)) ).
tff(func_def_11,type,
subst: fun1(dB,fun1(dB,fun1(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,fun1(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun1(X0,fun1(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun1(X1,fun1(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun1(X0,bool)) > fun1(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun1(X0,bool) * fun1(list(X0),bool) ) > fun1(list(X0),bool) ) ).
tff(func_def_19,type,
collect:
!>[X0: $tType] : ( fun1(X0,bool) > fun1(X0,bool) ) ).
tff(func_def_20,type,
shift:
!>[X0: $tType] : ( ( fun1(nat,X0) * nat * X0 ) > fun1(nat,X0) ) ).
tff(func_def_21,type,
fun: fun1(type,fun1(type,type)) ).
tff(func_def_22,type,
typing: fun1(nat,type) > fun1(dB,fun1(type,bool)) ).
tff(func_def_23,type,
typings: ( fun1(nat,type) * list(dB) ) > fun1(list(type),bool) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun1(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fEx:
!>[X0: $tType] : fun1(fun1(X0,bool),bool) ).
tff(func_def_26,type,
fFalse: bool ).
tff(func_def_27,type,
fTrue: bool ).
tff(func_def_28,type,
fconj: fun1(bool,fun1(bool,bool)) ).
tff(func_def_29,type,
fequal:
!>[X0: $tType] : fun1(X0,fun1(X0,bool)) ).
tff(func_def_30,type,
member:
!>[X0: $tType] : fun1(X0,fun1(fun1(X0,bool),bool)) ).
tff(func_def_31,type,
t2: type ).
tff(func_def_32,type,
t: type ).
tff(func_def_33,type,
t_a: type ).
tff(func_def_34,type,
t1: 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: fun1(nat,type) ).
tff(func_def_39,type,
ea: fun1(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,
t3: dB ).
tff(func_def_45,type,
u: dB ).
tff(func_def_46,type,
ua: dB ).
tff(func_def_47,type,
sK0: type ).
tff(func_def_48,type,
sK1: list(type) ).
tff(func_def_49,type,
sK2: dB > dB ).
tff(func_def_50,type,
sK3: dB > dB ).
tff(func_def_51,type,
sK4: dB > list(dB) ).
tff(func_def_52,type,
sK5: dB > dB ).
tff(func_def_53,type,
sK6: dB > list(dB) ).
tff(func_def_54,type,
sK7: dB > nat ).
tff(func_def_55,type,
sK8: ( dB * fun1(nat,type) ) > type ).
tff(func_def_56,type,
sK9: ( dB * fun1(nat,type) ) > type ).
tff(func_def_57,type,
sK10: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_58,type,
sK11: ( type * dB * fun1(nat,type) ) > type ).
tff(func_def_59,type,
sK12: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_60,type,
sK13: ( type * list(dB) * dB * fun1(nat,type) ) > list(type) ).
tff(func_def_61,type,
sK14: ( type * list(dB) * nat * fun1(nat,type) ) > list(type) ).
tff(func_def_62,type,
sK15: ( type * dB * dB * fun1(nat,type) ) > type ).
tff(func_def_63,type,
sK16:
!>[X0: $tType,X1: $tType] : ( ( fun1(X1,X0) * fun1(X1,X0) ) > X1 ) ).
tff(func_def_64,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > X0 ) ).
tff(func_def_65,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun1(X0,X1) ) > list(X0) ) ).
tff(func_def_66,type,
sK19:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_67,type,
sK20:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun1(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_68,type,
sK21: ( type * type * list(dB) * fun1(nat,type) ) > list(type) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
listsp:
!>[X0: $tType] : ( ( fun1(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
pp: bool > $o ).
tff(f9467,plain,
$false,
inference(subsumption_resolution,[],[f9466,f780]) ).
tff(f780,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),t1),u)),
inference(superposition,[],[f306,f436]) ).
tff(f436,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f188]) ).
tff(f188,plain,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun1(X0,fun1(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun1(X2,X1),X5,X3),X4) ),
inference(rectify,[],[f105]) ).
tff(f105,axiom,
! [X0: $tType,X2: $tType,X1: $tType,X85: X0,X86: X1,X84: fun1(X0,fun1(X1,X2))] : ( aa(X0,X2,combc(X0,X1,X2,X84,X86),X85) = aa(X1,X2,aa(X0,fun1(X1,X2),X84,X85),X86) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f306,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t1)),
inference(cnf_transformation,[],[f6]) ).
tff(f6,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),t1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_5_uT) ).
tff(f9466,plain,
~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),t1),u)),
inference(forward_demodulation,[],[f9446,f772]) ).
tff(f772,plain,
t1 = aa(type,type,combc(type,type,type,fun,foldr(type,type,fun,ts,t)),t2),
inference(superposition,[],[f436,f309]) ).
tff(f309,plain,
aa(type,type,aa(type,fun1(type,type),fun,t2),foldr(type,type,fun,ts,t)) = t1,
inference(cnf_transformation,[],[f11]) ).
tff(f11,axiom,
aa(type,type,aa(type,fun1(type,type),fun,t2),foldr(type,type,fun,ts,t)) = t1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_10_T) ).
tff(f9446,plain,
~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),aa(type,type,combc(type,type,type,fun,foldr(type,type,fun,ts,t)),t2)),u)),
inference(resolution,[],[f2635,f974]) ).
tff(f974,plain,
pp(aa(dB,bool,combc(dB,type,bool,typing(e),t2),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u))),
inference(forward_demodulation,[],[f963,f436]) ).
tff(f963,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)),t2)),
inference(superposition,[],[f317,f436]) ).
tff(f317,plain,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)),t2)),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)),t2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096e_A_092_060turnstile_062_Aa_091u_Pi_093_A_058_AT_H_H_096) ).
tff(f2635,plain,
! [X0: type] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),X0),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),aa(type,type,combc(type,type,type,fun,foldr(type,type,fun,ts,t)),X0)),u)) ),
inference(forward_demodulation,[],[f2634,f436]) ).
tff(f2634,plain,
! [X0: type] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),aa(type,type,aa(type,fun1(type,type),fun,X0),foldr(type,type,fun,ts,t))),u))
| ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),X0),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u))) ),
inference(forward_demodulation,[],[f2633,f436]) ).
tff(f2633,plain,
! [X0: type] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),X0),aa(dB,dB,combc(dB,nat,dB,aa(dB,fun1(dB,fun1(nat,dB)),subst,a),i),u)))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,X0),foldr(type,type,fun,ts,t)))) ),
inference(forward_demodulation,[],[f2632,f436]) ).
tff(f2632,plain,
! [X0: type] :
( ~ pp(aa(dB,bool,combc(dB,type,bool,typing(e),X0),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,X0),foldr(type,type,fun,ts,t)))) ),
inference(forward_demodulation,[],[f2617,f436]) ).
tff(f2617,plain,
! [X0: type] :
( ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i)),X0))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),u),aa(type,type,aa(type,fun1(type,type),fun,X0),foldr(type,type,fun,ts,t)))) ),
inference(resolution,[],[f432,f296]) ).
tff(f296,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(cnf_transformation,[],[f117]) ).
tff(f117,plain,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(flattening,[],[f116]) ).
tff(f116,negated_conjecture,
~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
inference(negated_conjecture,[],[f115]) ).
tff(f115,conjecture,
pp(aa(type,bool,aa(dB,fun1(type,bool),typing(e),aa(dB,dB,aa(dB,fun1(dB,dB),app,u),aa(nat,dB,aa(dB,fun1(nat,dB),aa(dB,fun1(dB,fun1(nat,dB)),subst,a),u),i))),foldr(type,type,fun,ts,t))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f432,plain,
! [X2: type,X3: dB,X0: dB,X1: type,X4: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(cnf_transformation,[],[f232]) ).
tff(f232,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(flattening,[],[f231]) ).
tff(f231,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X0),X2))
| ~ pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1))) ),
inference(ennf_transformation,[],[f186]) ).
tff(f186,plain,
! [X0: dB,X1: type,X2: type,X3: dB,X4: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X3),aa(type,type,aa(type,fun1(type,type),fun,X2),X1)))
=> ( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),X0),X2))
=> pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X4),aa(dB,dB,aa(dB,fun1(dB,dB),app,X3),X0)),X1)) ) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X4: dB,X5: type,X6: type,X7: dB,X8: fun1(nat,type)] :
( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X8),X7),aa(type,type,aa(type,fun1(type,type),fun,X6),X5)))
=> ( pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X8),X4),X6))
=> pp(aa(type,bool,aa(dB,fun1(type,bool),typing(X8),aa(dB,dB,aa(dB,fun1(dB,dB),app,X7),X4)),X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_7_App) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : LCL818_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n005.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 13:14:10 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 % (18540)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.34 % (18543)WARNING: value z3 for option sas not known
% 0.16/0.34 % (18543)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.16/0.34 % (18547)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.16/0.34 % (18544)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.34 % (18542)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.34 % (18545)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.16/0.34 % (18541)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.34 % (18546)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.16/0.35 % (18547)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.35 % Exception at run slice level
% 0.16/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.35 % Exception at run slice level
% 0.16/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.35 % Exception at run slice level
% 0.16/0.35 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.36 % (18549)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.16/0.36 % (18548)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.16/0.36 % (18550)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.16/0.37 % (18549)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.37 % (18548)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.37 % Exception at run slice level
% 0.16/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.39 % (18551)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)
% 249.29/35.89 % (18551)Time limit reached!
% 249.29/35.89 % (18551)------------------------------
% 249.29/35.89 % (18551)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 249.29/35.89 % (18551)Termination reason: Time limit
% 249.29/35.89 % (18551)Termination phase: Saturation
% 249.29/35.89
% 249.29/35.89 % (18551)Memory used [KB]: 59716
% 249.29/35.89 % (18551)Time elapsed: 35.500 s
% 249.29/35.89 % (18551)Instructions burned: 134937 (million)
% 249.29/35.89 % (18551)------------------------------
% 249.29/35.89 % (18551)------------------------------
% 249.29/35.90 % (19723)WARNING: value z3 for option sas not known
% 249.29/35.90 % (19723)ott-11_10:1_aac=none:add=off:afr=on:amm=off:anc=all_dependent:bd=off:fsd=off:fde=none:gsp=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sas=z3:sp=occurrence_186 on theBenchmark for (186ds/0Mi)
% 249.29/35.91 % (19723)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 253.33/36.49 % (19723)First to succeed.
% 253.33/36.49 % (19723)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18540"
% 253.33/36.49 % (19723)Refutation found. Thanks to Tanya!
% 253.33/36.49 % SZS status Theorem for theBenchmark
% 253.33/36.49 % SZS output start Proof for theBenchmark
% See solution above
% 253.33/36.49 % (19723)------------------------------
% 253.33/36.49 % (19723)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 253.33/36.49 % (19723)Termination reason: Refutation
% 253.33/36.49
% 253.33/36.49 % (19723)Memory used [KB]: 6720
% 253.33/36.49 % (19723)Time elapsed: 0.586 s
% 253.33/36.49 % (19723)Instructions burned: 1482 (million)
% 253.33/36.49 % (18540)Success in time 36.187 s
%------------------------------------------------------------------------------