%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL829_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 11:56:47 AM UTC 2026
% Result : Theorem 2.74s 1.26s
% Output : Refutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 64 ( 19 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 77 ( 31 ~; 27 |; 18 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 65 ( 65 usr; 14 con; 0-6 aty)
% Number of variables : 40 ( 32 !; 8 ?; 40 :)
% 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(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( 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,
combk:
!>[X0: $tType,X1: $tType] : fun(X0,fun(X1,X0)) ).
tff(func_def_4,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_5,type,
n_lists:
!>[X0: $tType] : ( ( nat * list(X0) ) > list(list(X0)) ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
it: fun(dB,bool) ).
tff(func_def_8,type,
var: nat > dB ).
tff(func_def_9,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_10,type,
dB_rec:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).
tff(func_def_11,type,
dB_size: dB > nat ).
tff(func_def_12,type,
lift: fun(dB,fun(nat,dB)) ).
tff(func_def_13,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_14,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_15,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_16,type,
concat:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_17,type,
filter:
!>[X0: $tType] : ( fun(X0,bool) > fun(list(X0),list(X0)) ) ).
tff(func_def_18,type,
hd:
!>[X0: $tType] : fun(list(X0),X0) ).
tff(func_def_19,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_21,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_22,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) ) > fun(list(X1),X0) ) ).
tff(func_def_23,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_24,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_25,type,
map:
!>[X0: $tType,X1: $tType] : fun(fun(X0,X1),fun(list(X0),list(X1))) ).
tff(func_def_26,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_27,type,
monoid_add_listsum:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_28,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_29,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_30,type,
tl:
!>[X0: $tType] : fun(list(X0),list(X0)) ).
tff(func_def_31,type,
transpose:
!>[X0: $tType] : ( list(list(X0)) > list(list(X0)) ) ).
tff(func_def_32,type,
transpose_rel:
!>[X0: $tType] : fun(list(list(X0)),fun(list(list(X0)),bool)) ).
tff(func_def_33,type,
suc: nat > nat ).
tff(func_def_34,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_35,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_36,type,
fFalse: bool ).
tff(func_def_37,type,
fNot: fun(bool,bool) ).
tff(func_def_38,type,
fTrue: bool ).
tff(func_def_39,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_40,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_41,type,
a: dB ).
tff(func_def_42,type,
as: list(dB) ).
tff(func_def_43,type,
i: nat ).
tff(func_def_44,type,
n: nat ).
tff(func_def_45,type,
t: dB ).
tff(func_def_46,type,
u: dB ).
tff(func_def_47,type,
ua: dB ).
tff(func_def_48,type,
sK0:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_49,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_50,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_51,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_52,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_53,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_54,type,
sK6:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_55,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_56,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_57,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_58,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > X0 ) ).
tff(func_def_59,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * X1 * list(X0) * fun(X0,X1) ) > list(X0) ) ).
tff(func_def_60,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > X1 ) ).
tff(func_def_61,type,
sK13:
!>[X0: $tType,X1: $tType] : ( ( list(X1) * fun(X1,X0) * list(X0) * X0 ) > list(X1) ) ).
tff(func_def_62,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
equal_equal:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_4,type,
listMem:
!>[X0: $tType] : ( ( X0 * list(X0) ) > $o ) ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
member1:
!>[X0: $tType] : ( ( list(X0) * X0 ) > $o ) ).
tff(pred_def_7,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_8,type,
accp:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * X0 ) > $o ) ).
tff(pred_def_9,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_10,type,
pp: bool > $o ).
tff(f5,axiom,
pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__096IT_A_Ia_091u_Pi_093_J_096) ).
tff(f6,axiom,
listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_5_Cons_I3_J) ).
tff(f56,axiom,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( listsp(X0,X2,X1)
<=> ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_55_listsp_Osimps) ).
tff(f116,conjecture,
listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f117,negated_conjecture,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
inference(negated_conjecture,[status(cth)],[f116]) ).
tff(f118,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
inference(flattening,[],[f117]) ).
tff(f124,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) )
| ~ listsp(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f56]) ).
tff(f125,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X3: X0,X4: list(X0)] :
( ( X1 = aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) )
& pp(aa(X0,bool,X2,X3))
& listsp(X0,X2,X4) )
| ~ listsp(X0,X2,X1) ) ),
inference(flattening,[],[f124]) ).
tff(f126,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ? [X5: X0,X6: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 )
& pp(aa(X0,bool,X2,X5))
& listsp(X0,X2,X6) )
| ~ listsp(X0,X2,X1) ) ),
inference(rectify,[],[f125]) ).
tff(f127,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ( nil(X0) != X1 )
& ! [X3: X0,X4: list(X0)] :
( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ) ) )
& ( ( X1 = nil(X0) )
| ( ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 )
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& listsp(X0,X2,sK1(X0,X1,X2)) )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X5,sK0(X0,X1,X2)),skolemize(X6,sK1(X0,X1,X2))],[f126]) ).
tff(f146,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(dB,fun(list(dB),list(dB)),cons(dB),aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)),aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as))),
inference(cnf_transformation,[],[f118]) ).
tff(f151,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X1: list(X0),X4: list(X0)] :
( listsp(X0,X2,X1)
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 )
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ),
inference(cnf_transformation,[],[f127]) ).
tff(f187,plain,
pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i))),
inference(cnf_transformation,[],[f5]) ).
tff(f188,plain,
listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)),
inference(cnf_transformation,[],[f6]) ).
tff(f194,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X4: list(X0)] :
( listsp(X0,X2,aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4))
| ~ pp(aa(X0,bool,X2,X3))
| ~ listsp(X0,X2,X4) ),
inference(equality_resolution,[],[f151]) ).
tff(f216,plain,
( ~ pp(aa(dB,bool,it,aa(nat,dB,aa(dB,fun(nat,dB),aa(dB,fun(dB,fun(nat,dB)),subst,a),u),i)))
| ~ listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)) ),
inference(resolution,[],[f194,f146]) ).
tff(f219,plain,
~ listsp(dB,it,aa(list(dB),list(dB),aa(fun(dB,dB),fun(list(dB),list(dB)),map(dB,dB),aa(nat,fun(dB,dB),combc(dB,nat,dB,aa(dB,fun(dB,fun(nat,dB)),combc(dB,dB,fun(nat,dB),subst),u)),i)),as)),
inference(forward_subsumption_resolution,[],[f216,f187]) ).
tff(f254,plain,
$false,
inference(forward_subsumption_resolution,[],[f188,f219]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL829_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 16:58:17 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.26 % (1011868)Detected formulas, will run a generic FOF schedule.
% 2.74/1.26 % (1011878)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2023428416:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.74/1.26 % (1011884)dis-21_1_sil=8000:lcm=predicate:random_seed=872996712:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.74/1.26 % (1011883)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=306926928:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.74/1.26 % (1011879)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=4007486427:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.74/1.26 % (1011881)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2716043499:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.74/1.26 % (1011882)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3433671877:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.74/1.26 % (1011880)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=4184007067:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.74/1.26 % (1011881)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.74/1.26 % (1011881)Refutation not found, incomplete strategy
% 2.74/1.26 % (1011881)------------------------------
% 2.74/1.26 % (1011881)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.26 % (1011881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.26 % (1011881)CaDiCaL version: 2.1.3
% 2.74/1.26 % (1011881)Termination reason: Refutation not found, incomplete strategy
% 2.74/1.26 % (1011881)Time elapsed: 0.006 s
% 2.74/1.26 % (1011880)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 2.74/1.26 % (1011881)Peak memory usage: 88 MB
% 2.74/1.26 % (1011881)Instructions burned: 9 (million)
% 2.74/1.26 % (1011882)First to succeed.
% 2.74/1.26 % (1011884)Also succeeded, but the first one will report.
% 2.74/1.26 % (1011882)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1011868"
% 2.74/1.26 % (1011883)Instruction limit reached!
% 2.74/1.26 % (1011883)------------------------------
% 2.74/1.26 % (1011883)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.26 % (1011883)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.26 % (1011883)CaDiCaL version: 2.1.3
% 2.74/1.26 % (1011883)Termination reason: Instruction limit
% 2.74/1.26 % (1011883)Termination phase: Saturation
% 2.74/1.26 % (1011883)Time elapsed: 0.096 s
% 2.74/1.26 % (1011883)Peak memory usage: 89 MB
% 2.74/1.26 % (1011883)Instructions burned: 139 (million)
% 2.74/1.26 % Exception at run slice level
% 2.74/1.26 User error: GNN currently only supports monomorphic FOL.
% 2.74/1.26 % (1011892)lrs+10_1_sil=8000:sp=occurrence:random_seed=4181097518:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.74/1.26 % (1011892)Also succeeded, but the first one will report.
% 2.74/1.26 % (1011893)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2699498536:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2996 on theBenchmark for (2996ds/157Mi)
% 2.74/1.26 % (1011881)------------------------------
% 2.74/1.26 % (1011881)------------------------------
% 2.74/1.26 % (1011893)Also succeeded, but the first one will report.
% 2.74/1.26 % (1011882)Refutation found. Thanks to Tanya!
% 2.74/1.26 % SZS status Theorem for theBenchmark
% 2.74/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 3.50/1.45 % (1011882)------------------------------
% 3.50/1.45 % (1011882)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.50/1.45 % (1011882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.50/1.45 % (1011882)CaDiCaL version: 2.1.3
% 3.50/1.45 % (1011882)Termination reason: Refutation
% 3.50/1.45 % (1011882)Time elapsed: 0.010 s
% 3.50/1.45 % (1011882)Peak memory usage: 88 MB
% 3.50/1.45 % (1011882)Instructions burned: 15 (million)
% 3.50/1.45 % (1011882)------------------------------
% 3.50/1.45 % (1011882)------------------------------
% 3.50/1.45 % (1011868)Success in time 0.413 s
% 3.50/1.45 % Vampire exiting
%------------------------------------------------------------------------------