TSTP Solution File: LCL776_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL776_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:23 EDT 2024
% Result : Theorem 0.67s 0.84s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 88
% Syntax : Number of formulae : 114 ( 22 unt; 81 typ; 0 def)
% Number of atoms : 54 ( 24 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 13 |; 0 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 172 ( 66 >; 106 *; 0 +; 0 <<)
% Number of predicates : 24 ( 22 usr; 1 prp; 0-6 aty)
% Number of functors : 56 ( 56 usr; 9 con; 0-5 aty)
% Number of variables : 133 ( 81 !; 0 ?; 133 :)
% ( 52 !>; 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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_size: dB > nat ).
tff(func_def_7,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_8,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_10,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_12,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_13,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_14,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_15,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_16,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_17,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_18,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_19,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_20,type,
fFalse: bool ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
i: nat ).
tff(func_def_23,type,
r: dB ).
tff(func_def_24,type,
s: dB ).
tff(func_def_25,type,
ss: list(dB) ).
tff(func_def_26,type,
sK17: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_27,type,
sK18: ( dB * list(dB) * dB ) > dB ).
tff(func_def_28,type,
sK19: ( dB * dB * list(dB) ) > dB ).
tff(func_def_29,type,
sK20: ( dB * dB * list(dB) ) > list(dB) ).
tff(func_def_30,type,
sK21: ( dB * list(dB) * dB ) > dB ).
tff(func_def_31,type,
sK22: ( dB * dB * dB ) > dB ).
tff(func_def_32,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_33,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_34,type,
sK25: ( dB * dB * list(dB) * dB ) > list(dB) ).
tff(func_def_35,type,
sK26:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_36,type,
sK27:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_37,type,
sK28:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_38,type,
sK29:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_39,type,
sK30:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_40,type,
sK31:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_41,type,
sK32:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_42,type,
sK33:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_43,type,
sK34:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_44,type,
sK35:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_45,type,
sK36:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_46,type,
sK37:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_47,type,
sK38:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_48,type,
sK39:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_49,type,
sK40:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_50,type,
sK41:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > X0 ) ).
tff(func_def_51,type,
sK42:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_52,type,
sK43: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_53,type,
sK44: ( dB * dB ) > dB ).
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 * dB * list(dB) ) > $o ).
tff(pred_def_7,type,
sP1: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_8,type,
sP2: ( dB * dB * list(dB) ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB * dB ) > $o ).
tff(pred_def_10,type,
sP4: ( dB * dB * dB ) > $o ).
tff(pred_def_11,type,
sP5: ( dB * dB * dB * list(dB) ) > $o ).
tff(pred_def_12,type,
sP6: ( dB * dB * list(dB) * dB ) > $o ).
tff(pred_def_13,type,
sP7:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_14,type,
sP8:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_15,type,
sP9:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * list(X0) ) > $o ) ).
tff(pred_def_16,type,
sP10:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > $o ) ).
tff(pred_def_17,type,
sP11:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_18,type,
sP12:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_19,type,
sP13:
!>[X0: $tType] : ( ( X0 * fun(X0,fun(X0,bool)) * list(X0) * list(X0) ) > $o ) ).
tff(pred_def_20,type,
sP14:
!>[X0: $tType] : ( ( X0 * X0 * list(X0) * list(X0) * fun(X0,fun(X0,bool)) ) > $o ) ).
tff(pred_def_21,type,
sP15:
!>[X0: $tType] : ( ( list(X0) * list(X0) * X0 * X0 * fun(X0,fun(X0,bool)) ) > $o ) ).
tff(pred_def_22,type,
sP16:
!>[X0: $tType] : ( ( list(X0) * list(X0) * fun(X0,fun(X0,bool)) * X0 * X0 ) > $o ) ).
tff(f621,plain,
$false,
inference(subsumption_resolution,[],[f620,f599]) ).
tff(f599,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),append(dB,cons(dB,s,ss),cons(dB,var(i),nil(dB)))))),
inference(forward_demodulation,[],[f598,f571]) ).
tff(f571,plain,
! [X0: $tType,X1: list(X0),X4: list(X0),X5: X0] : ( cons(X0,X5,append(X0,X4,X1)) = append(X0,cons(X0,X5,X4),X1) ),
inference(equality_resolution,[],[f570]) ).
tff(f570,plain,
! [X0: $tType,X3: list(X0),X1: list(X0),X4: list(X0),X5: X0] :
( ( append(X0,X3,X1) = cons(X0,X5,append(X0,X4,X1)) )
| ( cons(X0,X5,X4) != X3 ) ),
inference(equality_resolution,[],[f466]) ).
tff(f466,plain,
! [X0: $tType,X2: list(X0),X3: list(X0),X1: list(X0),X4: list(X0),X5: X0] :
( ( append(X0,X3,X1) = cons(X0,X5,X2) )
| ( append(X0,X4,X1) != X2 )
| ( cons(X0,X5,X4) != X3 ) ),
inference(cnf_transformation,[],[f202]) ).
tff(f202,plain,
! [X0: $tType,X1: list(X0),X2: list(X0),X3: list(X0),X4: list(X0),X5: X0] :
( ( append(X0,X3,X1) = cons(X0,X5,X2) )
| ( append(X0,X4,X1) != X2 )
| ( cons(X0,X5,X4) != X3 ) ),
inference(flattening,[],[f201]) ).
tff(f201,plain,
! [X0: $tType,X1: list(X0),X2: list(X0),X3: list(X0),X4: list(X0),X5: X0] :
( ( append(X0,X3,X1) = cons(X0,X5,X2) )
| ( append(X0,X4,X1) != X2 )
| ( cons(X0,X5,X4) != X3 ) ),
inference(ennf_transformation,[],[f151]) ).
tff(f151,plain,
! [X0: $tType,X1: list(X0),X2: list(X0),X3: list(X0),X4: list(X0),X5: X0] :
( ( cons(X0,X5,X4) = X3 )
=> ( ( append(X0,X4,X1) = X2 )
=> ( append(X0,X3,X1) = cons(X0,X5,X2) ) ) ),
inference(rectify,[],[f36]) ).
tff(f36,axiom,
! [X0: $tType,X30: list(X0),X32: list(X0),X31: list(X0),X44: list(X0),X41: X0] :
( ( cons(X0,X41,X44) = X31 )
=> ( ( append(X0,X44,X30) = X32 )
=> ( append(X0,X31,X30) = cons(X0,X41,X32) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',fact_35_Cons__eq__appendI) ).
tff(f598,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,append(dB,ss,cons(dB,var(i),nil(dB))))))),
inference(forward_demodulation,[],[f372,f423]) ).
tff(f423,plain,
! [X1: $tType,X0: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(cnf_transformation,[],[f132]) ).
tff(f132,plain,
! [X0: $tType,X1: $tType,X2: list(X1),X3: X1,X4: X0,X5: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X5,X4,cons(X1,X3,X2)) = foldl(X0,X1,X5,aa(X1,X0,aa(X0,fun(X1,X0),X5,X4),X3),X2) ),
inference(rectify,[],[f40]) ).
tff(f40,axiom,
! [X0: $tType,X1: $tType,X16: list(X1),X15: X1,X28: X0,X42: fun(X0,fun(X1,X0))] : ( foldl(X0,X1,X42,X28,cons(X1,X15,X16)) = foldl(X0,X1,X42,aa(X1,X0,aa(X0,fun(X1,X0),X42,X28),X15),X16) ),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',fact_39_foldl__Cons) ).
tff(f372,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(cnf_transformation,[],[f109]) ).
tff(f109,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(flattening,[],[f108]) ).
tff(f108,negated_conjecture,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(negated_conjecture,[],[f107]) ).
tff(f107,conjecture,
pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',conj_4) ).
tff(f620,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),append(dB,cons(dB,s,ss),cons(dB,var(i),nil(dB)))))),
inference(forward_demodulation,[],[f619,f571]) ).
tff(f619,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,abs(r),cons(dB,s,append(dB,ss,cons(dB,var(i),nil(dB))))))),
inference(forward_demodulation,[],[f616,f423]) ).
tff(f616,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(r)),s),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(unit_resulting_resolution,[],[f370,f597,f388]) ).
tff(f388,plain,
! [X2: dB,X0: list(dB),X1: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(cnf_transformation,[],[f191]) ).
tff(f191,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(flattening,[],[f190]) ).
tff(f190,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0)))
| ~ pp(aa(dB,bool,it,X1))
| ~ pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0))) ),
inference(ennf_transformation,[],[f113]) ).
tff(f113,plain,
! [X0: list(dB),X1: dB,X2: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X2,X1,zero_zero(nat)),X0)))
=> ( pp(aa(dB,bool,it,X1))
=> pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X2)),X1),X0))) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X7: list(dB),X8: dB,X9: dB] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X9,X8,zero_zero(nat)),X7)))
=> ( pp(aa(dB,bool,it,X8))
=> pp(aa(dB,bool,it,foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X9)),X8),X7))) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',fact_2_Beta) ).
tff(f597,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),append(dB,ss,cons(dB,var(i),nil(dB)))))),
inference(forward_demodulation,[],[f369,f399]) ).
tff(f399,plain,
! [X2: dB,X0: dB,X1: list(dB)] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(cnf_transformation,[],[f121]) ).
tff(f121,plain,
! [X0: dB,X1: list(dB),X2: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X2,X1)),X0) = foldl(dB,dB,app,X2,append(dB,X1,cons(dB,X0,nil(dB)))) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X20: dB,X17: list(dB),X18: dB] : ( aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,X18,X17)),X20) = foldl(dB,dB,app,X18,append(dB,X17,cons(dB,X20,nil(dB)))) ),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',fact_10_app__last) ).
tff(f369,plain,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
inference(cnf_transformation,[],[f104]) ).
tff(f104,axiom,
pp(aa(dB,bool,it,aa(dB,dB,aa(dB,fun(dB,dB),app,foldl(dB,dB,app,subst(r,s,zero_zero(nat)),ss)),var(i)))),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',conj_1) ).
tff(f370,plain,
pp(aa(dB,bool,it,s)),
inference(cnf_transformation,[],[f105]) ).
tff(f105,axiom,
pp(aa(dB,bool,it,s)),
file('/export/starexec/sandbox2/tmp/tmp.0cFcs2jVh2/Vampire---4.8_17262',conj_2) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL776_5 : TPTP v8.1.2. Released v6.0.0.
% 0.07/0.15 % 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.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:55:02 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF1_THM_EQU_NAR problem
% 0.15/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.0cFcs2jVh2/Vampire---4.8_17262
% 0.65/0.82 % (17532)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.65/0.82 % (17535)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.65/0.82 % (17534)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 (2995ds/34Mi)
% 0.65/0.82 % (17537)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 (2995ds/56Mi)
% 0.65/0.82 % (17536)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 (2995ds/83Mi)
% 0.65/0.82 % (17530)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 (2995ds/34Mi)
% 0.65/0.83 % (17533)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.67/0.83 % (17536)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.67/0.83 % (17536)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.67/0.83 % (17535)Refutation not found, incomplete strategy% (17535)------------------------------
% 0.67/0.83 % (17535)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.83 % (17535)Termination reason: Refutation not found, incomplete strategy
% 0.67/0.83
% 0.67/0.83 % (17535)Memory used [KB]: 1285
% 0.67/0.83 % (17535)Time elapsed: 0.010 s
% 0.67/0.83 % (17535)Instructions burned: 16 (million)
% 0.67/0.83 % (17537)Refutation not found, incomplete strategy% (17537)------------------------------
% 0.67/0.83 % (17537)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.83 % (17537)Termination reason: Refutation not found, incomplete strategy
% 0.67/0.83
% 0.67/0.83 % (17537)Memory used [KB]: 1295
% 0.67/0.83 % (17537)Time elapsed: 0.010 s
% 0.67/0.83 % (17537)Instructions burned: 17 (million)
% 0.67/0.83 % (17535)------------------------------
% 0.67/0.83 % (17535)------------------------------
% 0.67/0.83 % (17537)------------------------------
% 0.67/0.83 % (17537)------------------------------
% 0.67/0.84 % (17539)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 (2995ds/50Mi)
% 0.67/0.84 % (17536)First to succeed.
% 0.67/0.84 % (17534)Refutation not found, incomplete strategy% (17534)------------------------------
% 0.67/0.84 % (17534)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.84 % (17534)Termination reason: Refutation not found, incomplete strategy
% 0.67/0.84
% 0.67/0.84 % (17534)Memory used [KB]: 1425
% 0.67/0.84 % (17534)Time elapsed: 0.015 s
% 0.67/0.84 % (17534)Instructions burned: 27 (million)
% 0.67/0.84 % (17531)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 (2995ds/51Mi)
% 0.67/0.84 % (17534)------------------------------
% 0.67/0.84 % (17534)------------------------------
% 0.67/0.84 % (17536)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17472"
% 0.67/0.84 % (17536)Refutation found. Thanks to Tanya!
% 0.67/0.84 % SZS status Theorem for Vampire---4
% 0.67/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.67/0.84 % (17536)------------------------------
% 0.67/0.84 % (17536)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.67/0.84 % (17536)Termination reason: Refutation
% 0.67/0.84
% 0.67/0.84 % (17536)Memory used [KB]: 1445
% 0.67/0.84 % (17536)Time elapsed: 0.016 s
% 0.67/0.84 % (17536)Instructions burned: 28 (million)
% 0.67/0.84 % (17472)Success in time 0.485 s
% 0.67/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------