TSTP Solution File: LCL787_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL787_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 : n012.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:29 EDT 2024
% Result : Theorem 0.53s 0.73s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 80
% Syntax : Number of formulae : 105 ( 12 unt; 72 typ; 0 def)
% Number of atoms : 70 ( 2 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 72 ( 35 ~; 22 |; 4 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 71 ( 35 >; 36 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 63 ( 63 usr; 24 con; 0-5 aty)
% Number of variables : 84 ( 39 !; 2 ?; 84 :)
% ( 43 !>; 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,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,X1),fun(fun(X2,X0),fun(X2,X1))) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combi:
!>[X0: $tType] : fun(X0,X0) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : fun(fun(X0,fun(X1,X2)),fun(fun(X0,X1),fun(X0,X2))) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
it: fun(dB,bool) ).
tff(func_def_6,type,
abs: dB > dB ).
tff(func_def_7,type,
app: fun(dB,fun(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: fun(dB,fun(nat,dB)) ).
tff(func_def_11,type,
subst: fun(dB,fun(dB,fun(nat,dB))) ).
tff(func_def_12,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_13,type,
foldr:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X1)) * list(X0) * X1 ) > X1 ) ).
tff(func_def_14,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_15,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_16,type,
listset:
!>[X0: $tType] : ( list(fun(X0,bool)) > fun(list(X0),bool) ) ).
tff(func_def_17,type,
map:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * list(X0) ) > list(X1) ) ).
tff(func_def_18,type,
set_Cons:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(list(X0),bool) ) > fun(list(X0),bool) ) ).
tff(func_def_19,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_20,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_21,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_22,type,
shift:
!>[X0: $tType] : ( ( fun(nat,X0) * nat * X0 ) > fun(nat,X0) ) ).
tff(func_def_23,type,
atom: nat > type ).
tff(func_def_24,type,
fun1: fun(type,fun(type,type)) ).
tff(func_def_25,type,
type_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(type,fun(type,X0)) * type ) > X0 ) ).
tff(func_def_26,type,
type_size: type > nat ).
tff(func_def_27,type,
typing: fun(nat,type) > fun(dB,fun(type,bool)) ).
tff(func_def_28,type,
typings: ( fun(nat,type) * list(dB) ) > fun(list(type),bool) ).
tff(func_def_29,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_30,type,
fEx:
!>[X0: $tType] : fun(fun(X0,bool),bool) ).
tff(func_def_31,type,
fFalse: bool ).
tff(func_def_32,type,
fTrue: bool ).
tff(func_def_33,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_34,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_35,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_36,type,
t1: type ).
tff(func_def_37,type,
t_a: type ).
tff(func_def_38,type,
t: type ).
tff(func_def_39,type,
ts: list(type) ).
tff(func_def_40,type,
a: dB ).
tff(func_def_41,type,
as: list(dB) ).
tff(func_def_42,type,
e: fun(nat,type) ).
tff(func_def_43,type,
ea: fun(nat,type) ).
tff(func_def_44,type,
i: nat ).
tff(func_def_45,type,
ia: nat ).
tff(func_def_46,type,
n: nat ).
tff(func_def_47,type,
rs: list(dB) ).
tff(func_def_48,type,
t2: dB ).
tff(func_def_49,type,
u: dB ).
tff(func_def_50,type,
ua: dB ).
tff(func_def_51,type,
sK0: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_52,type,
sK1: ( type * list(dB) * dB * fun(nat,type) ) > list(type) ).
tff(func_def_53,type,
sK2: ( type * list(dB) * nat * fun(nat,type) ) > list(type) ).
tff(func_def_54,type,
sK3: ( type * type * list(dB) * fun(nat,type) ) > list(type) ).
tff(func_def_55,type,
sK4: ( type * dB * dB * fun(nat,type) ) > type ).
tff(func_def_56,type,
sK5:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_57,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_58,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_59,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_60,type,
sK9: list(type) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
pp: bool > $o ).
tff(pred_def_6,type,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f332,plain,
$false,
inference(avatar_sat_refutation,[],[f325,f326,f331]) ).
tff(f331,plain,
~ spl11_1,
inference(avatar_contradiction_clause,[],[f330]) ).
tff(f330,plain,
( $false
| ~ spl11_1 ),
inference(subsumption_resolution,[],[f329,f268]) ).
tff(f268,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a)),foldr(type,type,fun1,ts,t1))),
inference(definition_unfolding,[],[f238,f239]) ).
tff(f239,plain,
n = i,
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
n = i,
file('/export/starexec/sandbox2/tmp/tmp.NejgEYPEV7/Vampire---4.8_7561',fact_1_True) ).
tff(f238,plain,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a)),foldr(type,type,fun1,ts,t1))),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(n)),a)),foldr(type,type,fun1,ts,t1))),
file('/export/starexec/sandbox2/tmp/tmp.NejgEYPEV7/Vampire---4.8_7561',fact_3_headT) ).
tff(f329,plain,
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a)),foldr(type,type,fun1,ts,t1)))
| ~ spl11_1 ),
inference(duplicate_literal_removal,[],[f328]) ).
tff(f328,plain,
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a)),foldr(type,type,fun1,ts,t1)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),a)),foldr(type,type,fun1,ts,t1)))
| ~ spl11_1 ),
inference(resolution,[],[f327,f230]) ).
tff(f230,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: dB] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),sK4(X0,X1,X2,X3)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(cnf_transformation,[],[f194]) ).
tff(f194,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),sK4(X0,X1,X2,X3)))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,sK4(X0,X1,X2,X3)),X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f167,f193]) ).
tff(f193,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ? [X4: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),X4))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,X4),X0))) )
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),sK4(X0,X1,X2,X3)))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,sK4(X0,X1,X2,X3)),X0))) ) ),
introduced(choice_axiom,[]) ).
tff(f167,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( ? [X4: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),X4))
& pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,X4),X0))) )
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(ennf_transformation,[],[f132]) ).
tff(f132,plain,
! [X0: type,X1: dB,X2: dB,X3: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0))
=> ~ ! [X4: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,X4),X0)))
=> ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X1),X4)) ) ),
inference(rectify,[],[f31]) ).
tff(f31,axiom,
! [X4: type,X19: dB,X16: dB,X8: fun(nat,type)] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X8),aa(dB,dB,aa(dB,fun(dB,dB),app,X16),X19)),X4))
=> ~ ! [X41: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X8),X16),aa(type,type,aa(type,fun(type,type),fun1,X41),X4)))
=> ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X8),X19),X41)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NejgEYPEV7/Vampire---4.8_7561',fact_30_typing__elims_I2_J) ).
tff(f327,plain,
( ! [X0: dB] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),sK4(foldr(type,type,fun1,ts,t1),X0,var(i),shift(type,e,i,t))))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),aa(dB,dB,aa(dB,fun(dB,dB),app,var(i)),X0)),foldr(type,type,fun1,ts,t1))) )
| ~ spl11_1 ),
inference(resolution,[],[f320,f229]) ).
tff(f229,plain,
! [X2: dB,X3: fun(nat,type),X0: type,X1: dB] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),X2),aa(type,type,aa(type,fun(type,type),fun1,sK4(X0,X1,X2,X3)),X0)))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(X3),aa(dB,dB,aa(dB,fun(dB,dB),app,X2),X1)),X0)) ),
inference(cnf_transformation,[],[f194]) ).
tff(f320,plain,
( ! [X0: type] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(i)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1))))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0)) )
| ~ spl11_1 ),
inference(avatar_component_clause,[],[f319]) ).
tff(f319,plain,
( spl11_1
<=> ! [X0: type] :
( ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(i)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
tff(f326,plain,
~ spl11_2,
inference(avatar_split_clause,[],[f211,f322]) ).
tff(f322,plain,
( spl11_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
tff(f211,plain,
~ thesis,
inference(cnf_transformation,[],[f119]) ).
tff(f119,plain,
~ thesis,
inference(flattening,[],[f117]) ).
tff(f117,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f116]) ).
tff(f116,conjecture,
thesis,
file('/export/starexec/sandbox2/tmp/tmp.NejgEYPEV7/Vampire---4.8_7561',conj_1) ).
tff(f325,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f267,f322,f319]) ).
tff(f267,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(i)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(definition_unfolding,[],[f210,f239]) ).
tff(f210,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(cnf_transformation,[],[f156]) ).
tff(f156,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(flattening,[],[f155]) ).
tff(f155,plain,
! [X0: type] :
( thesis
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
| ~ pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1)))) ),
inference(ennf_transformation,[],[f118]) ).
tff(f118,plain,
! [X0: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X0),foldr(type,type,fun1,ts,t1))))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X0))
=> thesis ) ),
inference(rectify,[],[f115]) ).
tff(f115,axiom,
! [X93: type] :
( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),var(n)),aa(type,type,aa(type,fun(type,type),fun1,X93),foldr(type,type,fun1,ts,t1))))
=> ( pp(aa(type,bool,aa(dB,fun(type,bool),typing(shift(type,e,i,t)),a),X93))
=> thesis ) ),
file('/export/starexec/sandbox2/tmp/tmp.NejgEYPEV7/Vampire---4.8_7561',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL787_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/0.10 % 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.10/0.30 % Computer : n012.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 13:25:10 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TF1_THM_EQU_NAR problem
% 0.10/0.30 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.NejgEYPEV7/Vampire---4.8_7561
% 0.53/0.72 % (7672)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.53/0.72 % (7673)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.53/0.72 % (7670)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.53/0.72 % (7674)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.53/0.72 % (7669)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.53/0.72 % (7671)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.53/0.72 % (7675)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.53/0.72 % (7676)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.53/0.72 % (7675)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.53/0.73 % (7676)First to succeed.
% 0.53/0.73 % (7672)Also succeeded, but the first one will report.
% 0.53/0.73 % (7676)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7668"
% 0.53/0.73 % (7676)Refutation found. Thanks to Tanya!
% 0.53/0.73 % SZS status Theorem for Vampire---4
% 0.53/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.73 % (7676)------------------------------
% 0.53/0.73 % (7676)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.73 % (7676)Termination reason: Refutation
% 0.53/0.73
% 0.53/0.73 % (7676)Memory used [KB]: 1246
% 0.53/0.73 % (7676)Time elapsed: 0.007 s
% 0.53/0.73 % (7676)Instructions burned: 15 (million)
% 0.53/0.73 % (7668)Success in time 0.417 s
% 0.53/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------