TSTP Solution File: COM081_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : COM081_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 : n006.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 04:46:36 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 75
% Syntax : Number of formulae : 100 ( 5 unt; 66 typ; 0 def)
% Number of atoms : 83 ( 11 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 37 ~; 28 |; 4 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 74 ( 46 >; 28 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 4 prp; 0-5 aty)
% Number of functors : 55 ( 55 usr; 7 con; 0-6 aty)
% Number of variables : 96 ( 26 !; 13 ?; 96 :)
% ( 57 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
fm: $tType > $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
atom: $tType ).
tff(type_def_11,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_12,type,
product_prod: ( $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,
n_lists:
!>[X0: $tType] : ( ( nat * list(X0) ) > list(list(X0)) ) ).
tff(func_def_5,type,
product:
!>[X0: $tType,X1: $tType] : ( ( list(X0) * list(X1) ) > list(product_prod(X0,X1)) ) ).
tff(func_def_6,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_7,type,
iprod:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > X0 ) ).
tff(func_def_8,type,
zipwith0:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * list(X0) * list(X1) ) > list(X2) ) ).
tff(func_def_9,type,
concat:
!>[X0: $tType] : ( list(list(X0)) > list(X0) ) ).
tff(func_def_10,type,
dropWhile:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_13,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_14,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) ) > fun(list(X1),X0) ) ).
tff(func_def_15,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : fun(fun(X0,X1),fun(list(X0),list(X1))) ).
tff(func_def_18,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_19,type,
remdups:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_20,type,
set:
!>[X0: $tType] : ( list(X0) > fun(X0,bool) ) ).
tff(func_def_21,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_22,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_23,type,
transpose:
!>[X0: $tType] : ( list(list(X0)) > list(list(X0)) ) ).
tff(func_def_24,type,
transpose_rel:
!>[X0: $tType] : fun(list(list(X0)),fun(list(list(X0)),bool)) ).
tff(func_def_25,type,
list_conj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_26,type,
list_disj:
!>[X0: $tType] : ( list(fm(X0)) > fm(X0) ) ).
tff(func_def_27,type,
suc: nat > nat ).
tff(func_def_28,type,
i_Z: fun(atom,fun(list(int),bool)) ).
tff(func_def_29,type,
asubst: ( int * list(int) * atom ) > atom ).
tff(func_def_30,type,
divisor: atom > int ).
tff(func_def_31,type,
lbounds: list(atom) > list(product_prod(int,list(int))) ).
tff(func_def_32,type,
qEpres896714165pres_1: list(atom) > fm(atom) ).
tff(func_def_33,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_34,type,
fFalse: bool ).
tff(func_def_35,type,
fTrue: bool ).
tff(func_def_36,type,
as: list(atom) ).
tff(func_def_37,type,
xs: list(int) ).
tff(func_def_38,type,
sK0: int > atom ).
tff(func_def_39,type,
sK1:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_40,type,
sK2:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_41,type,
sK3:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_42,type,
sK4: ( list(int) * list(fm(atom)) ) > fm(atom) ).
tff(func_def_43,type,
sK5: ( list(int) * list(fm(atom)) ) > fm(atom) ).
tff(func_def_44,type,
sK6: int ).
tff(func_def_45,type,
sK7: int ).
tff(func_def_46,type,
sK8:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK9:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK10:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK11:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK12:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
ring:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
interpret:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(list(X1),bool)) * fm(X0) * list(X1) ) > $o ) ).
tff(pred_def_5,type,
accp:
!>[X0: $tType] : ( ( fun(X0,fun(X0,bool)) * X0 ) > $o ) ).
tff(pred_def_6,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_7,type,
pp: bool > $o ).
tff(f235,plain,
$false,
inference(avatar_sat_refutation,[],[f210,f214,f230,f234]) ).
tff(f234,plain,
~ spl13_2,
inference(avatar_contradiction_clause,[],[f233]) ).
tff(f233,plain,
( $false
| ~ spl13_2 ),
inference(subsumption_resolution,[],[f232,f169]) ).
tff(f169,plain,
! [X0: int] : member(atom,sK0(X0),set(atom,as)),
inference(cnf_transformation,[],[f141]) ).
tff(f141,plain,
! [X0: int] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0(X0)),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
& member(atom,sK0(X0),set(atom,as)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f129,f140]) ).
tff(f140,plain,
! [X0: int] :
( ? [X1: atom] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
& member(atom,X1,set(atom,as)) )
=> ( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0(X0)),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
& member(atom,sK0(X0),set(atom,as)) ) ),
introduced(choice_axiom,[]) ).
tff(f129,plain,
! [X0: int] :
? [X1: atom] :
( ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
& member(atom,X1,set(atom,as)) ),
inference(ennf_transformation,[],[f110]) ).
tff(f110,plain,
~ ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ),
inference(rectify,[],[f109]) ).
tff(f109,negated_conjecture,
~ ? [X13: int] :
! [X62: atom] :
( member(atom,X62,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X62),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X13),xs))) ),
inference(negated_conjecture,[],[f108]) ).
tff(f108,conjecture,
? [X13: int] :
! [X62: atom] :
( member(atom,X62,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X62),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X13),xs))) ),
file('/export/starexec/sandbox2/tmp/tmp.j0IK0vfuS6/Vampire---4.8_17822',conj_0) ).
tff(f232,plain,
( ~ member(atom,sK0(sK6),set(atom,as))
| ~ spl13_2 ),
inference(resolution,[],[f209,f170]) ).
tff(f170,plain,
! [X0: int] : ~ pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,sK0(X0)),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))),
inference(cnf_transformation,[],[f141]) ).
tff(f209,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK6),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f208]) ).
tff(f208,plain,
( spl13_2
<=> ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK6),xs)))
| ~ member(atom,X1,set(atom,as)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_2])]) ).
tff(f230,plain,
~ spl13_3,
inference(avatar_contradiction_clause,[],[f229]) ).
tff(f229,plain,
( $false
| ~ spl13_3 ),
inference(subsumption_resolution,[],[f228,f169]) ).
tff(f228,plain,
( ~ member(atom,sK0(sK7),set(atom,as))
| ~ spl13_3 ),
inference(resolution,[],[f213,f170]) ).
tff(f213,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK7),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f212]) ).
tff(f212,plain,
( spl13_3
<=> ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK7),xs)))
| ~ member(atom,X1,set(atom,as)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_3])]) ).
tff(f214,plain,
( spl13_1
| spl13_3 ),
inference(avatar_split_clause,[],[f185,f212,f204]) ).
tff(f204,plain,
( spl13_1
<=> ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_1])]) ).
tff(f185,plain,
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK7),xs)))
| ~ member(atom,X1,set(atom,as))
| ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
inference(cnf_transformation,[],[f158]) ).
tff(f158,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK7),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f135,f157]) ).
tff(f157,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
=> ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK7),xs)))
| ~ member(atom,X1,set(atom,as)) ) ),
introduced(choice_axiom,[]) ).
tff(f135,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) = nil(product_prod(int,list(int))) ) ),
inference(ennf_transformation,[],[f117]) ).
tff(f117,plain,
( ( lbounds(as) != nil(product_prod(int,list(int))) )
=> ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
( ( lbounds(as) != nil(product_prod(int,list(int))) )
=> ? [X4: int] :
! [X5: atom] :
( member(atom,X5,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X5),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X4),xs))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.j0IK0vfuS6/Vampire---4.8_17822',fact_0__096lbounds_Aas_A_126_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096) ).
tff(f210,plain,
( ~ spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f184,f208,f204]) ).
tff(f184,plain,
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK6),xs)))
| ~ member(atom,X1,set(atom,as))
| ( lbounds(as) != nil(product_prod(int,list(int))) ) ),
inference(cnf_transformation,[],[f156]) ).
tff(f156,plain,
( ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK6),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) != nil(product_prod(int,list(int))) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f134,f155]) ).
tff(f155,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
=> ! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),sK6),xs)))
| ~ member(atom,X1,set(atom,as)) ) ),
introduced(choice_axiom,[]) ).
tff(f134,plain,
( ? [X0: int] :
! [X1: atom] :
( pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs)))
| ~ member(atom,X1,set(atom,as)) )
| ( lbounds(as) != nil(product_prod(int,list(int))) ) ),
inference(ennf_transformation,[],[f116]) ).
tff(f116,plain,
( ( lbounds(as) = nil(product_prod(int,list(int))) )
=> ? [X0: int] :
! [X1: atom] :
( member(atom,X1,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X1),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X0),xs))) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
( ( lbounds(as) = nil(product_prod(int,list(int))) )
=> ? [X4: int] :
! [X5: atom] :
( member(atom,X5,set(atom,as))
=> pp(aa(list(int),bool,aa(atom,fun(list(int),bool),i_Z,X5),aa(list(int),list(int),aa(int,fun(list(int),list(int)),cons(int),X4),xs))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.j0IK0vfuS6/Vampire---4.8_17822',fact_1__096lbounds_Aas_A_061_A_091_093_A_061_061_062_AEX_Ax_O_AALL_Aa_058set_Aas_O_AI_092_060_094isub_062Z_Aa_A_Ix_A_D_Axs_J_096) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM081_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/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 : n006.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 21:24:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF1_THM_EQU_NAR problem
% 0.14/0.36 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.j0IK0vfuS6/Vampire---4.8_17822
% 0.60/0.75 % (18024)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.60/0.75 % (18023)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.60/0.75 % (18023)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.75 % (18019)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.60/0.75 % (18020)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.60/0.75 % (18021)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.60/0.75 % (18018)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.60/0.75 % (18022)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.60/0.75 % (18017)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.60/0.76 % (18023)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.76 % (18022)Refutation not found, incomplete strategy% (18022)------------------------------
% 0.60/0.76 % (18022)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (18022)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (18022)Memory used [KB]: 1098
% 0.60/0.76 % (18022)Time elapsed: 0.004 s
% 0.60/0.76 % (18022)Instructions burned: 5 (million)
% 0.60/0.76 % (18023)Refutation not found, incomplete strategy% (18023)------------------------------
% 0.60/0.76 % (18023)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (18022)------------------------------
% 0.60/0.76 % (18022)------------------------------
% 0.60/0.76 % (18023)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.76
% 0.60/0.76 % (18023)Memory used [KB]: 1223
% 0.60/0.76 % (18023)Time elapsed: 0.005 s
% 0.60/0.76 % (18023)Instructions burned: 16 (million)
% 0.60/0.76 % (18023)------------------------------
% 0.60/0.76 % (18023)------------------------------
% 0.60/0.76 % (18025)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.60/0.76 % (18019)First to succeed.
% 0.60/0.76 % (18026)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.60/0.76 % (18019)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17986"
% 0.60/0.76 % (18019)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (18019)------------------------------
% 0.60/0.76 % (18019)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.76 % (18019)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (18019)Memory used [KB]: 1209
% 0.60/0.76 % (18019)Time elapsed: 0.009 s
% 0.60/0.76 % (18019)Instructions burned: 13 (million)
% 0.60/0.76 % (17986)Success in time 0.398 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------