TSTP Solution File: LCL829_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL829_5 : TPTP v8.1.2. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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:42:48 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 84
% Syntax : Number of formulae : 99 ( 10 unt; 79 typ; 0 def)
% Number of atoms : 75 ( 23 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 86 ( 31 ~; 28 |; 24 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 107 ( 50 >; 57 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 65 ( 65 usr; 14 con; 0-6 aty)
% Number of variables : 125 ( 38 !; 12 ?; 125 :)
% ( 75 !>; 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(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(pred_def_11,type,
sQ15_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f347,plain,
$false,
inference(subsumption_resolution,[],[f202,f320]) ).
tff(f320,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(subsumption_resolution,[],[f317,f241]) ).
tff(f241,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(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/tmp/tmp.0fWvNQfYCs/Vampire---4.8_27951',fact_4__096IT_A_Ia_091u_Pi_093_J_096) ).
tff(f317,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))
| ~ 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(resolution,[],[f242,f187]) ).
tff(f187,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(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(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,[],[f116]) ).
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/tmp/tmp.0fWvNQfYCs/Vampire---4.8_27951',conj_0) ).
tff(f242,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))
| ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3)) ),
inference(equality_resolution,[],[f197]) ).
tff(f197,plain,
! [X0: $tType,X2: fun(X0,bool),X3: X0,X1: list(X0),X4: list(X0)] :
( listsp(X0,X2,X1)
| ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) ),
inference(cnf_transformation,[],[f160]) ).
tff(f160,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ( listsp(X0,X2,sK1(X0,X1,X2))
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f158,f159]) ).
tff(f159,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 ) )
=> ( listsp(X0,X2,sK1(X0,X1,X2))
& pp(aa(X0,bool,X2,sK0(X0,X1,X2)))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),sK0(X0,X1,X2)),sK1(X0,X1,X2)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f158,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X5),X6) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(rectify,[],[f157]) ).
tff(f157,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(flattening,[],[f156]) ).
tff(f156,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f124]) ).
tff(f124,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( listsp(X0,X2,X1)
<=> ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X3),X4) = X1 ) )
| ( nil(X0) = X1 ) ) ),
inference(rectify,[],[f56]) ).
tff(f56,axiom,
! [X0: $tType,X13: list(X0),X8: fun(X0,bool)] :
( listsp(X0,X8,X13)
<=> ( ? [X43: X0,X44: list(X0)] :
( listsp(X0,X8,X44)
& pp(aa(X0,bool,X8,X43))
& ( aa(list(X0),list(X0),aa(X0,fun(list(X0),list(X0)),cons(X0),X43),X44) = X13 ) )
| ( nil(X0) = X13 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0fWvNQfYCs/Vampire---4.8_27951',fact_55_listsp_Osimps) ).
tff(f202,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(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/tmp/tmp.0fWvNQfYCs/Vampire---4.8_27951',fact_5_Cons_I3_J) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL829_5 : TPTP v8.1.2. Released v6.0.0.
% 0.11/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n018.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 : Fri May 3 13:47:01 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF1_THM_EQU_NAR problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.0fWvNQfYCs/Vampire---4.8_27951
% 0.56/0.74 % (28061)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.74 % (28063)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.74 % (28064)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.74 % (28065)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.74 % (28062)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.56/0.74 % (28068)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.56/0.74 % (28067)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.74 % (28069)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.56/0.74 % (28068)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.56/0.75 % (28069)Refutation not found, incomplete strategy% (28069)------------------------------
% 0.56/0.75 % (28069)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (28069)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (28069)Memory used [KB]: 1134
% 0.56/0.75 % (28069)Time elapsed: 0.006 s
% 0.56/0.75 % (28069)Instructions burned: 10 (million)
% 0.56/0.75 % (28061)First to succeed.
% 0.56/0.75 % (28069)------------------------------
% 0.56/0.75 % (28069)------------------------------
% 0.56/0.75 % (28067)Refutation not found, incomplete strategy% (28067)------------------------------
% 0.56/0.75 % (28067)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (28067)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (28067)Memory used [KB]: 1189
% 0.56/0.75 % (28067)Time elapsed: 0.006 s
% 0.56/0.75 % (28067)Instructions burned: 11 (million)
% 0.56/0.75 % (28067)------------------------------
% 0.56/0.75 % (28067)------------------------------
% 0.56/0.75 % (28068)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.56/0.75 % (28061)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28059"
% 0.56/0.75 % (28061)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (28061)------------------------------
% 0.56/0.75 % (28061)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (28061)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (28061)Memory used [KB]: 1175
% 0.56/0.75 % (28061)Time elapsed: 0.007 s
% 0.56/0.75 % (28061)Instructions burned: 17 (million)
% 0.56/0.75 % (28059)Success in time 0.383 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------