TSTP Solution File: SWW672_2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWW672_2 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n014.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 : Wed Aug 31 19:09:28 EDT 2022
% Result : Theorem 1.84s 0.59s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 90
% Syntax : Number of formulae : 134 ( 12 unt; 74 typ; 0 def)
% Number of atoms : 635 ( 214 equ)
% Maximal formula atoms : 60 ( 10 avg)
% Number of connectives : 776 ( 201 ~; 118 |; 354 &)
% ( 18 <=>; 85 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 11 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 110 ( 12 atm; 26 fun; 38 num; 34 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 104 ( 43 >; 61 *; 0 +; 0 <<)
% Number of predicates : 17 ( 13 usr; 3 prp; 0-6 aty)
% Number of functors : 60 ( 57 usr; 27 con; 0-4 aty)
% Number of variables : 382 ( 197 !; 185 ?; 382 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool1: $tType ).
tff(type_def_8,type,
tuple02: $tType ).
tff(type_def_9,type,
vertex1: $tType ).
tff(type_def_10,type,
set_vertex: $tType ).
tff(func_def_0,type,
witness1: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool: ty ).
tff(func_def_4,type,
true1: bool1 ).
tff(func_def_5,type,
false1: bool1 ).
tff(func_def_6,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(func_def_7,type,
tuple0: ty ).
tff(func_def_8,type,
tuple03: tuple02 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
set: ty > ty ).
tff(func_def_13,type,
empty: ty > uni ).
tff(func_def_14,type,
add: ( ty * uni * uni ) > uni ).
tff(func_def_15,type,
remove: ( ty * uni * uni ) > uni ).
tff(func_def_16,type,
union: ( ty * uni * uni ) > uni ).
tff(func_def_17,type,
inter: ( ty * uni * uni ) > uni ).
tff(func_def_18,type,
diff: ( ty * uni * uni ) > uni ).
tff(func_def_19,type,
choose: ( ty * uni ) > uni ).
tff(func_def_20,type,
cardinal1: ( ty * uni ) > $int ).
tff(func_def_23,type,
vertex: ty ).
tff(func_def_24,type,
succ1: vertex1 > set_vertex ).
tff(func_def_25,type,
t2tb: set_vertex > uni ).
tff(func_def_26,type,
tb2t: uni > set_vertex ).
tff(func_def_27,type,
t2tb1: vertex1 > uni ).
tff(func_def_28,type,
tb2t1: uni > vertex1 ).
tff(func_def_29,type,
ref: ty > ty ).
tff(func_def_30,type,
mk_ref: ( ty * uni ) > uni ).
tff(func_def_31,type,
contents: ( ty * uni ) > uni ).
tff(func_def_33,type,
sK2: ( ty * uni ) > uni ).
tff(func_def_34,type,
sK3: ( $int * vertex1 * vertex1 ) > vertex1 ).
tff(func_def_35,type,
sK4: ( $int * vertex1 * vertex1 ) > vertex1 ).
tff(func_def_36,type,
sK5: ( $int * vertex1 * vertex1 ) > vertex1 ).
tff(func_def_37,type,
sK6: ( $int * vertex1 * vertex1 ) > $int ).
tff(func_def_38,type,
sK7: ( $int * vertex1 * vertex1 ) > vertex1 ).
tff(func_def_39,type,
sK8: ( vertex1 * $int * vertex1 ) > $int ).
tff(func_def_40,type,
sK9: ( vertex1 * $int * vertex1 ) > vertex1 ).
tff(func_def_41,type,
sK10: ( $int * vertex1 * vertex1 ) > $int ).
tff(func_def_42,type,
sK11: set_vertex > vertex1 ).
tff(func_def_43,type,
sK12: set_vertex > vertex1 ).
tff(func_def_44,type,
sK13: vertex1 ).
tff(func_def_45,type,
sK14: $int ).
tff(func_def_46,type,
sK15: set_vertex ).
tff(func_def_47,type,
sK16: vertex1 ).
tff(func_def_48,type,
sK17: set_vertex ).
tff(func_def_49,type,
sK18: set_vertex ).
tff(func_def_50,type,
sK19: bool1 ).
tff(func_def_51,type,
sK20: vertex1 ).
tff(func_def_52,type,
sK21: set_vertex ).
tff(func_def_53,type,
sK22: set_vertex ).
tff(func_def_54,type,
sK23: set_vertex ).
tff(func_def_55,type,
sK24: bool1 ).
tff(func_def_56,type,
sK25: set_vertex ).
tff(func_def_57,type,
sK26: set_vertex ).
tff(func_def_58,type,
sK27: $int ).
tff(func_def_59,type,
sK28: vertex1 ).
tff(func_def_60,type,
sK29: ( uni * uni * ty ) > uni ).
tff(func_def_61,type,
sK30: ( set_vertex * vertex1 ) > vertex1 ).
tff(pred_def_1,type,
sort1: ( ty * uni ) > $o ).
tff(pred_def_3,type,
mem: ( ty * uni * uni ) > $o ).
tff(pred_def_4,type,
infix_eqeq: ( ty * uni * uni ) > $o ).
tff(pred_def_5,type,
subset: ( ty * uni * uni ) > $o ).
tff(pred_def_6,type,
is_empty: ( ty * uni ) > $o ).
tff(pred_def_7,type,
path1: ( vertex1 * vertex1 * $int ) > $o ).
tff(pred_def_8,type,
shortest_path1: ( vertex1 * vertex1 * $int ) > $o ).
tff(pred_def_10,type,
inv1: ( vertex1 * vertex1 * set_vertex * set_vertex * set_vertex * $int ) > $o ).
tff(pred_def_11,type,
closure1: ( set_vertex * set_vertex * set_vertex * vertex1 ) > $o ).
tff(pred_def_12,type,
sP0: ( $int * vertex1 * vertex1 ) > $o ).
tff(pred_def_13,type,
sP1: ( set_vertex * vertex1 * $int ) > $o ).
tff(f571,plain,
$false,
inference(avatar_sat_refutation,[],[f331,f334,f570]) ).
tff(f570,plain,
~ spl31_5,
inference(avatar_contradiction_clause,[],[f569]) ).
tff(f569,plain,
( $false
| ~ spl31_5 ),
inference(subsumption_resolution,[],[f559,f361]) ).
tff(f361,plain,
mem(vertex,t2tb1(sK30(sK23,sK28)),t2tb(succ1(sK28))),
inference(unit_resulting_resolution,[],[f333,f299]) ).
tff(f299,plain,
! [X2: set_vertex,X3: vertex1,X0: set_vertex,X1: set_vertex] :
( closure1(X0,X2,X1,X3)
| mem(vertex,t2tb1(sK30(X0,X3)),t2tb(succ1(X3))) ),
inference(cnf_transformation,[],[f211]) ).
tff(f211,plain,
! [X0: set_vertex,X1: set_vertex,X2: set_vertex,X3: vertex1] :
( ( closure1(X0,X2,X1,X3)
| ( mem(vertex,t2tb1(X3),t2tb(X0))
& ~ mem(vertex,t2tb1(X3),t2tb(X2))
& mem(vertex,t2tb1(sK30(X0,X3)),t2tb(succ1(X3)))
& ~ mem(vertex,t2tb1(sK30(X0,X3)),t2tb(X0))
& ~ mem(vertex,t2tb1(X3),t2tb(X1)) ) )
& ( ~ mem(vertex,t2tb1(X3),t2tb(X0))
| mem(vertex,t2tb1(X3),t2tb(X2))
| ! [X5: vertex1] :
( ~ mem(vertex,t2tb1(X5),t2tb(succ1(X3)))
| mem(vertex,t2tb1(X5),t2tb(X0)) )
| mem(vertex,t2tb1(X3),t2tb(X1))
| ~ closure1(X0,X2,X1,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK30])],[f209,f210]) ).
tff(f210,plain,
! [X0: set_vertex,X3: vertex1] :
( ? [X4: vertex1] :
( mem(vertex,t2tb1(X4),t2tb(succ1(X3)))
& ~ mem(vertex,t2tb1(X4),t2tb(X0)) )
=> ( mem(vertex,t2tb1(sK30(X0,X3)),t2tb(succ1(X3)))
& ~ mem(vertex,t2tb1(sK30(X0,X3)),t2tb(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f209,plain,
! [X0: set_vertex,X1: set_vertex,X2: set_vertex,X3: vertex1] :
( ( closure1(X0,X2,X1,X3)
| ( mem(vertex,t2tb1(X3),t2tb(X0))
& ~ mem(vertex,t2tb1(X3),t2tb(X2))
& ? [X4: vertex1] :
( mem(vertex,t2tb1(X4),t2tb(succ1(X3)))
& ~ mem(vertex,t2tb1(X4),t2tb(X0)) )
& ~ mem(vertex,t2tb1(X3),t2tb(X1)) ) )
& ( ~ mem(vertex,t2tb1(X3),t2tb(X0))
| mem(vertex,t2tb1(X3),t2tb(X2))
| ! [X5: vertex1] :
( ~ mem(vertex,t2tb1(X5),t2tb(succ1(X3)))
| mem(vertex,t2tb1(X5),t2tb(X0)) )
| mem(vertex,t2tb1(X3),t2tb(X1))
| ~ closure1(X0,X2,X1,X3) ) ),
inference(rectify,[],[f208]) ).
tff(f208,plain,
! [X2: set_vertex,X0: set_vertex,X3: set_vertex,X1: vertex1] :
( ( closure1(X2,X3,X0,X1)
| ( mem(vertex,t2tb1(X1),t2tb(X2))
& ~ mem(vertex,t2tb1(X1),t2tb(X3))
& ? [X4: vertex1] :
( mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
& ~ mem(vertex,t2tb1(X4),t2tb(X2)) )
& ~ mem(vertex,t2tb1(X1),t2tb(X0)) ) )
& ( ~ mem(vertex,t2tb1(X1),t2tb(X2))
| mem(vertex,t2tb1(X1),t2tb(X3))
| ! [X4: vertex1] :
( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
| mem(vertex,t2tb1(X4),t2tb(X2)) )
| mem(vertex,t2tb1(X1),t2tb(X0))
| ~ closure1(X2,X3,X0,X1) ) ),
inference(flattening,[],[f207]) ).
tff(f207,plain,
! [X2: set_vertex,X0: set_vertex,X3: set_vertex,X1: vertex1] :
( ( closure1(X2,X3,X0,X1)
| ( mem(vertex,t2tb1(X1),t2tb(X2))
& ~ mem(vertex,t2tb1(X1),t2tb(X3))
& ? [X4: vertex1] :
( mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
& ~ mem(vertex,t2tb1(X4),t2tb(X2)) )
& ~ mem(vertex,t2tb1(X1),t2tb(X0)) ) )
& ( ~ mem(vertex,t2tb1(X1),t2tb(X2))
| mem(vertex,t2tb1(X1),t2tb(X3))
| ! [X4: vertex1] :
( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
| mem(vertex,t2tb1(X4),t2tb(X2)) )
| mem(vertex,t2tb1(X1),t2tb(X0))
| ~ closure1(X2,X3,X0,X1) ) ),
inference(nnf_transformation,[],[f120]) ).
tff(f120,plain,
! [X2: set_vertex,X0: set_vertex,X3: set_vertex,X1: vertex1] :
( closure1(X2,X3,X0,X1)
<=> ( ~ mem(vertex,t2tb1(X1),t2tb(X2))
| mem(vertex,t2tb1(X1),t2tb(X3))
| ! [X4: vertex1] :
( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
| mem(vertex,t2tb1(X4),t2tb(X2)) )
| mem(vertex,t2tb1(X1),t2tb(X0)) ) ),
inference(flattening,[],[f119]) ).
tff(f119,plain,
! [X3: set_vertex,X2: set_vertex,X1: vertex1,X0: set_vertex] :
( ( ! [X4: vertex1] :
( ~ mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
| mem(vertex,t2tb1(X4),t2tb(X2)) )
| mem(vertex,t2tb1(X1),t2tb(X0))
| mem(vertex,t2tb1(X1),t2tb(X3))
| ~ mem(vertex,t2tb1(X1),t2tb(X2)) )
<=> closure1(X2,X3,X0,X1) ),
inference(ennf_transformation,[],[f97]) ).
tff(f97,plain,
! [X3: set_vertex,X2: set_vertex,X1: vertex1,X0: set_vertex] :
( ( mem(vertex,t2tb1(X1),t2tb(X2))
=> ( ~ mem(vertex,t2tb1(X1),t2tb(X3))
=> ( ~ mem(vertex,t2tb1(X1),t2tb(X0))
=> ! [X4: vertex1] :
( mem(vertex,t2tb1(X4),t2tb(succ1(X1)))
=> mem(vertex,t2tb1(X4),t2tb(X2)) ) ) ) )
<=> closure1(X2,X3,X0,X1) ),
inference(rectify,[],[f58]) ).
tff(f58,axiom,
! [X24: set_vertex,X1: vertex1,X22: set_vertex,X23: set_vertex] :
( ( mem(vertex,t2tb1(X1),t2tb(X22))
=> ( ~ mem(vertex,t2tb1(X1),t2tb(X23))
=> ( ~ mem(vertex,t2tb1(X1),t2tb(X24))
=> ! [X7: vertex1] :
( mem(vertex,t2tb1(X7),t2tb(succ1(X1)))
=> mem(vertex,t2tb1(X7),t2tb(X22)) ) ) ) )
<=> closure1(X22,X23,X24,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',closure_def) ).
tff(f333,plain,
~ closure1(sK23,sK22,sK26,sK28),
inference(backward_demodulation,[],[f272,f274]) ).
tff(f274,plain,
sK22 = sK25,
inference(cnf_transformation,[],[f197]) ).
tff(f197,plain,
( ( is_empty(vertex,t2tb(sK17))
| ~ is_empty(vertex,t2tb(sK15)) )
& shortest_path1(sK16,sK20,sK14)
& ( tb2t(remove(vertex,t2tb1(sK20),t2tb(sK15))) = sK21 )
& ( sK20 != sK13 )
& ( true1 = sK24 )
& ( sK22 = sK25 )
& ( tb2t(empty(vertex)) = sK26 )
& ~ closure1(sK23,sK25,sK26,sK28)
& ( $sum(sK14,1) = sK27 )
& ( ( true1 = sK24 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != sK24 ) )
& inv1(sK16,sK13,sK23,sK21,sK22,sK14)
& subset(vertex,t2tb(succ1(sK20)),t2tb(sK23))
& ! [X16: vertex1] : closure1(sK23,sK21,sK22,X16)
& ! [X17: vertex1] :
( ( sK20 = X17 )
| closure1(sK18,sK21,sK17,X17) )
& inv1(sK16,sK13,sK18,sK21,sK17,sK14)
& mem(vertex,t2tb1(sK20),t2tb(sK15))
& ~ is_empty(vertex,t2tb(sK15))
& ( is_empty(vertex,t2tb(sK15))
| ( true1 != sK19 ) )
& ( ( true1 = sK19 )
| ~ is_empty(vertex,t2tb(sK15)) )
& ( true1 != sK19 )
& ! [X18: vertex1] : closure1(sK18,sK15,sK17,X18)
& inv1(sK16,sK13,sK18,sK15,sK17,sK14)
& ~ $less(sK14,0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13,sK14,sK15,sK16,sK17,sK18,sK19,sK20,sK21,sK22,sK23,sK24,sK25,sK26,sK27,sK28])],[f187,f196,f195,f194,f193,f192,f191,f190,f189,f188]) ).
tff(f188,plain,
( ? [X0: vertex1,X1: $int,X2: set_vertex,X3: vertex1,X4: set_vertex,X5: set_vertex] :
( ( is_empty(vertex,t2tb(X4))
| ~ is_empty(vertex,t2tb(X2)) )
& ? [X6: bool1] :
( ? [X7: vertex1,X8: set_vertex] :
( shortest_path1(X3,X7,X1)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(X2))) = X8 )
& ( X0 != X7 )
& ? [X9: set_vertex,X10: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(X1,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(X3,X0,X10,X8,X9,X1)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(X5,X8,X4,X17) )
& inv1(X3,X0,X5,X8,X4,X1)
& mem(vertex,t2tb1(X7),t2tb(X2)) )
& ~ is_empty(vertex,t2tb(X2))
& ( is_empty(vertex,t2tb(X2))
| ( true1 != X6 ) )
& ( ( true1 = X6 )
| ~ is_empty(vertex,t2tb(X2)) )
& ( true1 != X6 ) )
& ! [X18: vertex1] : closure1(X5,X2,X4,X18)
& inv1(X3,X0,X5,X2,X4,X1)
& ~ $less(X1,0) )
=> ( ( is_empty(vertex,t2tb(sK17))
| ~ is_empty(vertex,t2tb(sK15)) )
& ? [X6: bool1] :
( ? [X8: set_vertex,X7: vertex1] :
( shortest_path1(sK16,X7,sK14)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK15))) = X8 )
& ( sK13 != X7 )
& ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,X8,X9,sK14)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(sK18,X8,sK17,X17) )
& inv1(sK16,sK13,sK18,X8,sK17,sK14)
& mem(vertex,t2tb1(X7),t2tb(sK15)) )
& ~ is_empty(vertex,t2tb(sK15))
& ( is_empty(vertex,t2tb(sK15))
| ( true1 != X6 ) )
& ( ( true1 = X6 )
| ~ is_empty(vertex,t2tb(sK15)) )
& ( true1 != X6 ) )
& ! [X18: vertex1] : closure1(sK18,sK15,sK17,X18)
& inv1(sK16,sK13,sK18,sK15,sK17,sK14)
& ~ $less(sK14,0) ) ),
introduced(choice_axiom,[]) ).
tff(f189,plain,
( ? [X6: bool1] :
( ? [X8: set_vertex,X7: vertex1] :
( shortest_path1(sK16,X7,sK14)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK15))) = X8 )
& ( sK13 != X7 )
& ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,X8,X9,sK14)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(sK18,X8,sK17,X17) )
& inv1(sK16,sK13,sK18,X8,sK17,sK14)
& mem(vertex,t2tb1(X7),t2tb(sK15)) )
& ~ is_empty(vertex,t2tb(sK15))
& ( is_empty(vertex,t2tb(sK15))
| ( true1 != X6 ) )
& ( ( true1 = X6 )
| ~ is_empty(vertex,t2tb(sK15)) )
& ( true1 != X6 ) )
=> ( ? [X8: set_vertex,X7: vertex1] :
( shortest_path1(sK16,X7,sK14)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK15))) = X8 )
& ( sK13 != X7 )
& ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,X8,X9,sK14)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(sK18,X8,sK17,X17) )
& inv1(sK16,sK13,sK18,X8,sK17,sK14)
& mem(vertex,t2tb1(X7),t2tb(sK15)) )
& ~ is_empty(vertex,t2tb(sK15))
& ( is_empty(vertex,t2tb(sK15))
| ( true1 != sK19 ) )
& ( ( true1 = sK19 )
| ~ is_empty(vertex,t2tb(sK15)) )
& ( true1 != sK19 ) ) ),
introduced(choice_axiom,[]) ).
tff(f190,plain,
( ? [X8: set_vertex,X7: vertex1] :
( shortest_path1(sK16,X7,sK14)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(sK15))) = X8 )
& ( sK13 != X7 )
& ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,X8,X9,sK14)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(sK18,X8,sK17,X17) )
& inv1(sK16,sK13,sK18,X8,sK17,sK14)
& mem(vertex,t2tb1(X7),t2tb(sK15)) )
=> ( shortest_path1(sK16,sK20,sK14)
& ( tb2t(remove(vertex,t2tb1(sK20),t2tb(sK15))) = sK21 )
& ( sK20 != sK13 )
& ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,sK21,X9,sK14)
& subset(vertex,t2tb(succ1(sK20)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,sK21,X9,X16) )
& ! [X17: vertex1] :
( ( sK20 = X17 )
| closure1(sK18,sK21,sK17,X17) )
& inv1(sK16,sK13,sK18,sK21,sK17,sK14)
& mem(vertex,t2tb1(sK20),t2tb(sK15)) ) ),
introduced(choice_axiom,[]) ).
tff(f191,plain,
( ? [X10: set_vertex,X9: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,X10,sK21,X9,sK14)
& subset(vertex,t2tb(succ1(sK20)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,sK21,X9,X16) )
=> ( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( sK22 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != X11 ) ) )
& inv1(sK16,sK13,sK23,sK21,sK22,sK14)
& subset(vertex,t2tb(succ1(sK20)),t2tb(sK23))
& ! [X16: vertex1] : closure1(sK23,sK21,sK22,X16) ) ),
introduced(choice_axiom,[]) ).
tff(f192,plain,
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( sK22 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != X11 ) ) )
=> ( ( true1 = sK24 )
& ? [X12: set_vertex] :
( ( sK22 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
& ( ( true1 = sK24 )
| ~ is_empty(vertex,t2tb(sK21)) )
& ( is_empty(vertex,t2tb(sK21))
| ( true1 != sK24 ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f193,plain,
( ? [X12: set_vertex] :
( ( sK22 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,X12,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) )
=> ( ( sK22 = sK25 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,sK25,X13,X15)
& ( $sum(sK14,1) = X14 ) ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f194,plain,
( ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,sK25,X13,X15)
& ( $sum(sK14,1) = X14 ) ) )
=> ( ( tb2t(empty(vertex)) = sK26 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,sK25,sK26,X15)
& ( $sum(sK14,1) = X14 ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f195,plain,
( ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(sK23,sK25,sK26,X15)
& ( $sum(sK14,1) = X14 ) )
=> ( ? [X15: vertex1] : ~ closure1(sK23,sK25,sK26,X15)
& ( $sum(sK14,1) = sK27 ) ) ),
introduced(choice_axiom,[]) ).
tff(f196,plain,
( ? [X15: vertex1] : ~ closure1(sK23,sK25,sK26,X15)
=> ~ closure1(sK23,sK25,sK26,sK28) ),
introduced(choice_axiom,[]) ).
tff(f187,plain,
? [X0: vertex1,X1: $int,X2: set_vertex,X3: vertex1,X4: set_vertex,X5: set_vertex] :
( ( is_empty(vertex,t2tb(X4))
| ~ is_empty(vertex,t2tb(X2)) )
& ? [X6: bool1] :
( ? [X7: vertex1,X8: set_vertex] :
( shortest_path1(X3,X7,X1)
& ( tb2t(remove(vertex,t2tb1(X7),t2tb(X2))) = X8 )
& ( X0 != X7 )
& ? [X9: set_vertex,X10: set_vertex] :
( ? [X11: bool1] :
( ( true1 = X11 )
& ? [X12: set_vertex] :
( ( X9 = X12 )
& ? [X13: set_vertex] :
( ( tb2t(empty(vertex)) = X13 )
& ? [X14: $int] :
( ? [X15: vertex1] : ~ closure1(X10,X12,X13,X15)
& ( $sum(X1,1) = X14 ) ) ) )
& ( ( true1 = X11 )
| ~ is_empty(vertex,t2tb(X8)) )
& ( is_empty(vertex,t2tb(X8))
| ( true1 != X11 ) ) )
& inv1(X3,X0,X10,X8,X9,X1)
& subset(vertex,t2tb(succ1(X7)),t2tb(X10))
& ! [X16: vertex1] : closure1(X10,X8,X9,X16) )
& ! [X17: vertex1] :
( ( X7 = X17 )
| closure1(X5,X8,X4,X17) )
& inv1(X3,X0,X5,X8,X4,X1)
& mem(vertex,t2tb1(X7),t2tb(X2)) )
& ~ is_empty(vertex,t2tb(X2))
& ( is_empty(vertex,t2tb(X2))
| ( true1 != X6 ) )
& ( ( true1 = X6 )
| ~ is_empty(vertex,t2tb(X2)) )
& ( true1 != X6 ) )
& ! [X18: vertex1] : closure1(X5,X2,X4,X18)
& inv1(X3,X0,X5,X2,X4,X1)
& ~ $less(X1,0) ),
inference(rectify,[],[f186]) ).
tff(f186,plain,
? [X3: vertex1,X2: $int,X0: set_vertex,X4: vertex1,X5: set_vertex,X1: set_vertex] :
( ( is_empty(vertex,t2tb(X5))
| ~ is_empty(vertex,t2tb(X0)) )
& ? [X7: bool1] :
( ? [X8: vertex1,X9: set_vertex] :
( shortest_path1(X4,X8,X2)
& ( tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 )
& ( X3 != X8 )
& ? [X11: set_vertex,X12: set_vertex] :
( ? [X14: bool1] :
( ( true1 = X14 )
& ? [X15: set_vertex] :
( ( X11 = X15 )
& ? [X16: set_vertex] :
( ( tb2t(empty(vertex)) = X16 )
& ? [X17: $int] :
( ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18)
& ( $sum(X2,1) = X17 ) ) ) )
& ( ( true1 = X14 )
| ~ is_empty(vertex,t2tb(X9)) )
& ( is_empty(vertex,t2tb(X9))
| ( true1 != X14 ) ) )
& inv1(X4,X3,X12,X9,X11,X2)
& subset(vertex,t2tb(succ1(X8)),t2tb(X12))
& ! [X13: vertex1] : closure1(X12,X9,X11,X13) )
& ! [X10: vertex1] :
( ( X8 = X10 )
| closure1(X1,X9,X5,X10) )
& inv1(X4,X3,X1,X9,X5,X2)
& mem(vertex,t2tb1(X8),t2tb(X0)) )
& ~ is_empty(vertex,t2tb(X0))
& ( is_empty(vertex,t2tb(X0))
| ( true1 != X7 ) )
& ( ( true1 = X7 )
| ~ is_empty(vertex,t2tb(X0)) )
& ( true1 != X7 ) )
& ! [X6: vertex1] : closure1(X1,X0,X5,X6)
& inv1(X4,X3,X1,X0,X5,X2)
& ~ $less(X2,0) ),
inference(flattening,[],[f185]) ).
tff(f185,plain,
? [X3: vertex1,X2: $int,X0: set_vertex,X4: vertex1,X5: set_vertex,X1: set_vertex] :
( ( is_empty(vertex,t2tb(X5))
| ~ is_empty(vertex,t2tb(X0)) )
& ? [X7: bool1] :
( ? [X8: vertex1,X9: set_vertex] :
( shortest_path1(X4,X8,X2)
& ( tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 )
& ( X3 != X8 )
& ? [X11: set_vertex,X12: set_vertex] :
( ? [X14: bool1] :
( ( true1 = X14 )
& ? [X15: set_vertex] :
( ( X11 = X15 )
& ? [X16: set_vertex] :
( ( tb2t(empty(vertex)) = X16 )
& ? [X17: $int] :
( ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18)
& ( $sum(X2,1) = X17 ) ) ) )
& ( ( true1 = X14 )
| ~ is_empty(vertex,t2tb(X9)) )
& ( is_empty(vertex,t2tb(X9))
| ( true1 != X14 ) ) )
& inv1(X4,X3,X12,X9,X11,X2)
& subset(vertex,t2tb(succ1(X8)),t2tb(X12))
& ! [X13: vertex1] : closure1(X12,X9,X11,X13) )
& ! [X10: vertex1] :
( ( X8 = X10 )
| closure1(X1,X9,X5,X10) )
& inv1(X4,X3,X1,X9,X5,X2)
& mem(vertex,t2tb1(X8),t2tb(X0)) )
& ~ is_empty(vertex,t2tb(X0))
& ( is_empty(vertex,t2tb(X0))
| ( true1 != X7 ) )
& ( ( true1 = X7 )
| ~ is_empty(vertex,t2tb(X0)) )
& ( true1 != X7 ) )
& ! [X6: vertex1] : closure1(X1,X0,X5,X6)
& inv1(X4,X3,X1,X0,X5,X2)
& ~ $less(X2,0) ),
inference(nnf_transformation,[],[f143]) ).
tff(f143,plain,
? [X3: vertex1,X2: $int,X0: set_vertex,X4: vertex1,X5: set_vertex,X1: set_vertex] :
( ( is_empty(vertex,t2tb(X5))
| ~ is_empty(vertex,t2tb(X0)) )
& ? [X7: bool1] :
( ? [X8: vertex1,X9: set_vertex] :
( shortest_path1(X4,X8,X2)
& ( tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 )
& ( X3 != X8 )
& ? [X11: set_vertex,X12: set_vertex] :
( ? [X14: bool1] :
( ( true1 = X14 )
& ? [X15: set_vertex] :
( ( X11 = X15 )
& ? [X16: set_vertex] :
( ( tb2t(empty(vertex)) = X16 )
& ? [X17: $int] :
( ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18)
& ( $sum(X2,1) = X17 ) ) ) )
& ( ( true1 = X14 )
<=> is_empty(vertex,t2tb(X9)) ) )
& inv1(X4,X3,X12,X9,X11,X2)
& subset(vertex,t2tb(succ1(X8)),t2tb(X12))
& ! [X13: vertex1] : closure1(X12,X9,X11,X13) )
& ! [X10: vertex1] :
( ( X8 = X10 )
| closure1(X1,X9,X5,X10) )
& inv1(X4,X3,X1,X9,X5,X2)
& mem(vertex,t2tb1(X8),t2tb(X0)) )
& ~ is_empty(vertex,t2tb(X0))
& ( is_empty(vertex,t2tb(X0))
<=> ( true1 = X7 ) )
& ( true1 != X7 ) )
& ! [X6: vertex1] : closure1(X1,X0,X5,X6)
& inv1(X4,X3,X1,X0,X5,X2)
& ~ $less(X2,0) ),
inference(flattening,[],[f142]) ).
tff(f142,plain,
? [X1: set_vertex,X3: vertex1,X2: $int,X4: vertex1,X5: set_vertex,X0: set_vertex] :
( ? [X7: bool1] :
( ? [X9: set_vertex,X8: vertex1] :
( ? [X12: set_vertex,X11: set_vertex] :
( ? [X14: bool1] :
( ? [X15: set_vertex] :
( ( X11 = X15 )
& ? [X16: set_vertex] :
( ( tb2t(empty(vertex)) = X16 )
& ? [X17: $int] :
( ? [X18: vertex1] : ~ closure1(X12,X15,X16,X18)
& ( $sum(X2,1) = X17 ) ) ) )
& ( true1 = X14 )
& ( ( true1 = X14 )
<=> is_empty(vertex,t2tb(X9)) ) )
& ! [X13: vertex1] : closure1(X12,X9,X11,X13)
& inv1(X4,X3,X12,X9,X11,X2)
& subset(vertex,t2tb(succ1(X8)),t2tb(X12)) )
& inv1(X4,X3,X1,X9,X5,X2)
& shortest_path1(X4,X8,X2)
& ! [X10: vertex1] :
( ( X8 = X10 )
| closure1(X1,X9,X5,X10) )
& ( X3 != X8 )
& ( tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 )
& mem(vertex,t2tb1(X8),t2tb(X0)) )
& ~ is_empty(vertex,t2tb(X0))
& ( true1 != X7 )
& ( is_empty(vertex,t2tb(X0))
<=> ( true1 = X7 ) ) )
& ( is_empty(vertex,t2tb(X5))
| ~ is_empty(vertex,t2tb(X0)) )
& inv1(X4,X3,X1,X0,X5,X2)
& ~ $less(X2,0)
& ! [X6: vertex1] : closure1(X1,X0,X5,X6) ),
inference(ennf_transformation,[],[f86]) ).
tff(f86,plain,
~ ! [X1: set_vertex,X3: vertex1,X2: $int,X4: vertex1,X5: set_vertex,X0: set_vertex] :
( ( ( is_empty(vertex,t2tb(X0))
=> is_empty(vertex,t2tb(X5)) )
& inv1(X4,X3,X1,X0,X5,X2)
& ~ $less(X2,0)
& ! [X6: vertex1] : closure1(X1,X0,X5,X6) )
=> ! [X7: bool1] :
( ( is_empty(vertex,t2tb(X0))
<=> ( true1 = X7 ) )
=> ( ( true1 != X7 )
=> ( ~ is_empty(vertex,t2tb(X0))
=> ! [X9: set_vertex,X8: vertex1] :
( ( ( tb2t(remove(vertex,t2tb1(X8),t2tb(X0))) = X9 )
& mem(vertex,t2tb1(X8),t2tb(X0)) )
=> ( ( X3 != X8 )
=> ( ( inv1(X4,X3,X1,X9,X5,X2)
& shortest_path1(X4,X8,X2)
& ! [X10: vertex1] :
( ( X8 != X10 )
=> closure1(X1,X9,X5,X10) ) )
=> ! [X12: set_vertex,X11: set_vertex] :
( ( ! [X13: vertex1] : closure1(X12,X9,X11,X13)
& inv1(X4,X3,X12,X9,X11,X2)
& subset(vertex,t2tb(succ1(X8)),t2tb(X12)) )
=> ! [X14: bool1] :
( ( ( true1 = X14 )
<=> is_empty(vertex,t2tb(X9)) )
=> ( ( true1 = X14 )
=> ! [X15: set_vertex] :
( ( X11 = X15 )
=> ! [X16: set_vertex] :
( ( tb2t(empty(vertex)) = X16 )
=> ! [X17: $int] :
( ( $sum(X2,1) = X17 )
=> ! [X18: vertex1] : closure1(X12,X15,X16,X18) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f61]) ).
tff(f61,plain,
~ ! [X23: set_vertex,X22: set_vertex,X25: $int,X21: vertex1,X10: vertex1,X24: set_vertex] :
( ( ( is_empty(vertex,t2tb(X23))
=> is_empty(vertex,t2tb(X24)) )
& inv1(X10,X21,X22,X23,X24,X25)
& ! [X1: vertex1] : closure1(X22,X23,X24,X1)
& ~ $less(X25,0) )
=> ! [X26: bool1] :
( ( ( true1 = X26 )
<=> is_empty(vertex,t2tb(X23)) )
=> ( ( true1 != X26 )
=> ( ~ is_empty(vertex,t2tb(X23))
=> ! [X12: vertex1,X27: set_vertex] :
( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
& mem(vertex,t2tb1(X12),t2tb(X23)) )
=> ( ( X12 != X21 )
=> ( ( inv1(X10,X21,X22,X27,X24,X25)
& ! [X1: vertex1] :
( ( X1 != X12 )
=> closure1(X22,X27,X24,X1) )
& shortest_path1(X10,X12,X25) )
=> ! [X28: set_vertex,X29: set_vertex] :
( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
& subset(vertex,t2tb(succ1(X12)),t2tb(X29))
& inv1(X10,X21,X29,X27,X28,X25) )
=> ! [X30: bool1] :
( ( is_empty(vertex,t2tb(X27))
<=> ( true1 = X30 ) )
=> ( ( true1 = X30 )
=> ! [X31: set_vertex] :
( ( X28 = X31 )
=> ! [X32: set_vertex] :
( ( tb2t(empty(vertex)) = X32 )
=> ! [X33: $int] :
( ( $sum(X25,1) = X33 )
=> ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f60]) ).
tff(f60,negated_conjecture,
~ ! [X23: set_vertex,X22: set_vertex,X25: $int,X21: vertex1,X10: vertex1,X24: set_vertex] :
( ( ( is_empty(vertex,t2tb(X23))
=> is_empty(vertex,t2tb(X24)) )
& inv1(X10,X21,X22,X23,X24,X25)
& ! [X1: vertex1] : closure1(X22,X23,X24,X1)
& $lesseq(0,X25) )
=> ! [X26: bool1] :
( ( ( true1 = X26 )
<=> is_empty(vertex,t2tb(X23)) )
=> ( ( true1 != X26 )
=> ( ~ is_empty(vertex,t2tb(X23))
=> ! [X12: vertex1,X27: set_vertex] :
( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
& mem(vertex,t2tb1(X12),t2tb(X23)) )
=> ( ( X12 != X21 )
=> ( ( inv1(X10,X21,X22,X27,X24,X25)
& ! [X1: vertex1] :
( ( X1 != X12 )
=> closure1(X22,X27,X24,X1) )
& shortest_path1(X10,X12,X25) )
=> ! [X28: set_vertex,X29: set_vertex] :
( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
& subset(vertex,t2tb(succ1(X12)),t2tb(X29))
& inv1(X10,X21,X29,X27,X28,X25) )
=> ! [X30: bool1] :
( ( is_empty(vertex,t2tb(X27))
<=> ( true1 = X30 ) )
=> ( ( true1 = X30 )
=> ! [X31: set_vertex] :
( ( X28 = X31 )
=> ! [X32: set_vertex] :
( ( tb2t(empty(vertex)) = X32 )
=> ! [X33: $int] :
( ( $sum(X25,1) = X33 )
=> ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f59]) ).
tff(f59,conjecture,
! [X23: set_vertex,X22: set_vertex,X25: $int,X21: vertex1,X10: vertex1,X24: set_vertex] :
( ( ( is_empty(vertex,t2tb(X23))
=> is_empty(vertex,t2tb(X24)) )
& inv1(X10,X21,X22,X23,X24,X25)
& ! [X1: vertex1] : closure1(X22,X23,X24,X1)
& $lesseq(0,X25) )
=> ! [X26: bool1] :
( ( ( true1 = X26 )
<=> is_empty(vertex,t2tb(X23)) )
=> ( ( true1 != X26 )
=> ( ~ is_empty(vertex,t2tb(X23))
=> ! [X12: vertex1,X27: set_vertex] :
( ( ( tb2t(remove(vertex,t2tb1(X12),t2tb(X23))) = X27 )
& mem(vertex,t2tb1(X12),t2tb(X23)) )
=> ( ( X12 != X21 )
=> ( ( inv1(X10,X21,X22,X27,X24,X25)
& ! [X1: vertex1] :
( ( X1 != X12 )
=> closure1(X22,X27,X24,X1) )
& shortest_path1(X10,X12,X25) )
=> ! [X28: set_vertex,X29: set_vertex] :
( ( ! [X1: vertex1] : closure1(X29,X27,X28,X1)
& subset(vertex,t2tb(succ1(X12)),t2tb(X29))
& inv1(X10,X21,X29,X27,X28,X25) )
=> ! [X30: bool1] :
( ( is_empty(vertex,t2tb(X27))
<=> ( true1 = X30 ) )
=> ( ( true1 = X30 )
=> ! [X31: set_vertex] :
( ( X28 = X31 )
=> ! [X32: set_vertex] :
( ( tb2t(empty(vertex)) = X32 )
=> ! [X33: $int] :
( ( $sum(X25,1) = X33 )
=> ! [X1: vertex1] : closure1(X29,X31,X32,X1) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_bfs) ).
tff(f272,plain,
~ closure1(sK23,sK25,sK26,sK28),
inference(cnf_transformation,[],[f197]) ).
tff(f559,plain,
( ~ mem(vertex,t2tb1(sK30(sK23,sK28)),t2tb(succ1(sK28)))
| ~ spl31_5 ),
inference(unit_resulting_resolution,[],[f266,f363,f348,f364,f362,f296]) ).
tff(f296,plain,
! [X2: set_vertex,X3: vertex1,X0: set_vertex,X1: set_vertex,X5: vertex1] :
( ~ mem(vertex,t2tb1(X5),t2tb(succ1(X3)))
| ~ mem(vertex,t2tb1(X3),t2tb(X0))
| mem(vertex,t2tb1(X3),t2tb(X1))
| mem(vertex,t2tb1(X3),t2tb(X2))
| mem(vertex,t2tb1(X5),t2tb(X0))
| ~ closure1(X0,X2,X1,X3) ),
inference(cnf_transformation,[],[f211]) ).
tff(f362,plain,
~ mem(vertex,t2tb1(sK30(sK23,sK28)),t2tb(sK23)),
inference(unit_resulting_resolution,[],[f333,f298]) ).
tff(f298,plain,
! [X2: set_vertex,X3: vertex1,X0: set_vertex,X1: set_vertex] :
( ~ mem(vertex,t2tb1(sK30(X0,X3)),t2tb(X0))
| closure1(X0,X2,X1,X3) ),
inference(cnf_transformation,[],[f211]) ).
tff(f364,plain,
mem(vertex,t2tb1(sK28),t2tb(sK23)),
inference(unit_resulting_resolution,[],[f333,f301]) ).
tff(f301,plain,
! [X2: set_vertex,X3: vertex1,X0: set_vertex,X1: set_vertex] :
( mem(vertex,t2tb1(X3),t2tb(X0))
| closure1(X0,X2,X1,X3) ),
inference(cnf_transformation,[],[f211]) ).
tff(f348,plain,
( ! [X0: uni] : ~ mem(vertex,X0,t2tb(sK21))
| ~ spl31_5 ),
inference(unit_resulting_resolution,[],[f330,f213]) ).
tff(f213,plain,
! [X3: uni,X0: ty,X1: uni] :
( ~ mem(X0,X3,X1)
| ~ is_empty(X0,X1) ),
inference(cnf_transformation,[],[f155]) ).
tff(f155,plain,
! [X0: ty,X1: uni] :
( ( ( mem(X0,sK2(X0,X1),X1)
& sort1(X0,sK2(X0,X1)) )
| is_empty(X0,X1) )
& ( ~ is_empty(X0,X1)
| ! [X3: uni] : ~ mem(X0,X3,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f153,f154]) ).
tff(f154,plain,
! [X0: ty,X1: uni] :
( ? [X2: uni] :
( mem(X0,X2,X1)
& sort1(X0,X2) )
=> ( mem(X0,sK2(X0,X1),X1)
& sort1(X0,sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f153,plain,
! [X0: ty,X1: uni] :
( ( ? [X2: uni] :
( mem(X0,X2,X1)
& sort1(X0,X2) )
| is_empty(X0,X1) )
& ( ~ is_empty(X0,X1)
| ! [X3: uni] : ~ mem(X0,X3,X1) ) ),
inference(rectify,[],[f141]) ).
tff(f141,plain,
! [X1: ty,X0: uni] :
( ( ? [X2: uni] :
( mem(X1,X2,X0)
& sort1(X1,X2) )
| is_empty(X1,X0) )
& ( ~ is_empty(X1,X0)
| ! [X3: uni] : ~ mem(X1,X3,X0) ) ),
inference(ennf_transformation,[],[f116]) ).
tff(f116,plain,
! [X1: ty,X0: uni] :
( ( is_empty(X1,X0)
=> ! [X3: uni] : ~ mem(X1,X3,X0) )
& ( ! [X2: uni] :
( sort1(X1,X2)
=> ~ mem(X1,X2,X0) )
=> is_empty(X1,X0) ) ),
inference(rectify,[],[f15]) ).
tff(f15,axiom,
! [X10: uni,X0: ty] :
( ( ! [X1: uni] :
( sort1(X0,X1)
=> ~ mem(X0,X1,X10) )
=> is_empty(X0,X10) )
& ( is_empty(X0,X10)
=> ! [X1: uni] : ~ mem(X0,X1,X10) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',is_empty_def) ).
tff(f330,plain,
( is_empty(vertex,t2tb(sK21))
| ~ spl31_5 ),
inference(avatar_component_clause,[],[f328]) ).
tff(f328,plain,
( spl31_5
<=> is_empty(vertex,t2tb(sK21)) ),
introduced(avatar_definition,[new_symbols(naming,[spl31_5])]) ).
tff(f363,plain,
~ mem(vertex,t2tb1(sK28),t2tb(sK22)),
inference(unit_resulting_resolution,[],[f333,f300]) ).
tff(f300,plain,
! [X2: set_vertex,X3: vertex1,X0: set_vertex,X1: set_vertex] :
( ~ mem(vertex,t2tb1(X3),t2tb(X2))
| closure1(X0,X2,X1,X3) ),
inference(cnf_transformation,[],[f211]) ).
tff(f266,plain,
! [X16: vertex1] : closure1(sK23,sK21,sK22,X16),
inference(cnf_transformation,[],[f197]) ).
tff(f334,plain,
spl31_4,
inference(avatar_split_clause,[],[f275,f324]) ).
tff(f324,plain,
( spl31_4
<=> ( true1 = sK24 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl31_4])]) ).
tff(f275,plain,
true1 = sK24,
inference(cnf_transformation,[],[f197]) ).
tff(f331,plain,
( ~ spl31_4
| spl31_5 ),
inference(avatar_split_clause,[],[f269,f328,f324]) ).
tff(f269,plain,
( is_empty(vertex,t2tb(sK21))
| ( true1 != sK24 ) ),
inference(cnf_transformation,[],[f197]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW672=2 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 21:00:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.51 % (7343)lrs+1_1:10_av=off:drc=off:nwc=2.0:sp=reverse_frequency:thsq=on:thsqc=64:thsql=off:i=47:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/47Mi)
% 0.19/0.51 % (7323)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.19/0.51 % (7322)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52 % (7322)Instruction limit reached!
% 0.19/0.52 % (7322)------------------------------
% 0.19/0.52 % (7322)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (7322)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (7322)Termination reason: Unknown
% 0.19/0.52 % (7322)Termination phase: Including theory axioms
% 0.19/0.52
% 0.19/0.52 % (7322)Memory used [KB]: 1023
% 0.19/0.52 % (7322)Time elapsed: 0.003 s
% 0.19/0.52 % (7322)Instructions burned: 4 (million)
% 0.19/0.52 % (7322)------------------------------
% 0.19/0.52 % (7322)------------------------------
% 0.19/0.52 % (7335)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52 % (7333)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.52 % (7335)Instruction limit reached!
% 0.19/0.52 % (7335)------------------------------
% 0.19/0.52 % (7335)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (7335)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (7335)Termination reason: Unknown
% 0.19/0.52 % (7335)Termination phase: Property scanning
% 0.19/0.52
% 0.19/0.52 % (7335)Memory used [KB]: 1023
% 0.19/0.52 % (7335)Time elapsed: 0.003 s
% 0.19/0.52 % (7335)Instructions burned: 2 (million)
% 0.19/0.52 % (7335)------------------------------
% 0.19/0.52 % (7335)------------------------------
% 0.19/0.52 % (7324)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.52 % (7331)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.52 % (7325)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.19/0.52 % (7331)Instruction limit reached!
% 0.19/0.52 % (7331)------------------------------
% 0.19/0.52 % (7331)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (7331)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (7331)Termination reason: Unknown
% 0.19/0.52 % (7331)Termination phase: Including theory axioms
% 0.19/0.52
% 0.19/0.52 % (7331)Memory used [KB]: 1023
% 0.19/0.52 % (7331)Time elapsed: 0.003 s
% 0.19/0.52 % (7331)Instructions burned: 3 (million)
% 0.19/0.52 % (7331)------------------------------
% 0.19/0.52 % (7331)------------------------------
% 0.19/0.52 % (7346)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.19/0.52 % (7344)lrs+1002_1:1_br=off:canc=force:drc=off:s2a=on:sos=on:sp=reverse_frequency:urr=on:i=42:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/42Mi)
% 0.19/0.53 % (7345)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.19/0.53 % (7320)lrs+1010_1:1_aac=none:bce=on:nicw=on:nm=0:plsq=on:plsql=on:sac=on:sos=on:sp=frequency:spb=units:to=lpo:i=34:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/34Mi)
% 0.19/0.53 % (7341)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.19/0.53 % (7321)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53 % (7332)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.19/0.53 % (7347)dis+1011_1:1_bd=off:canc=force:ev=cautious:nwc=5.0:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.19/0.53 % (7336)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.53 % (7321)Instruction limit reached!
% 0.19/0.53 % (7321)------------------------------
% 0.19/0.53 % (7321)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (7321)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (7321)Termination reason: Unknown
% 0.19/0.53 % (7328)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53 % (7326)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.19/0.53 % (7328)Instruction limit reached!
% 0.19/0.53 % (7328)------------------------------
% 0.19/0.53 % (7328)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (7328)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (7328)Termination reason: Unknown
% 0.19/0.53 % (7328)Termination phase: Property scanning
% 0.19/0.53
% 0.19/0.53 % (7328)Memory used [KB]: 1023
% 0.19/0.53 % (7328)Time elapsed: 0.003 s
% 0.19/0.53 % (7328)Instructions burned: 2 (million)
% 0.19/0.53 % (7328)------------------------------
% 0.19/0.53 % (7328)------------------------------
% 0.19/0.53 % (7334)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.53 % (7338)lrs+10_1:1_sd=10:sos=all:ss=axioms:st=5.0:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.54 % (7319)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59848Mi)
% 0.19/0.54 % (7338)Instruction limit reached!
% 0.19/0.54 % (7338)------------------------------
% 0.19/0.54 % (7338)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (7338)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (7338)Termination reason: Unknown
% 0.19/0.54 % (7338)Termination phase: Preprocessing 1
% 0.19/0.54
% 0.19/0.54 % (7338)Memory used [KB]: 1023
% 0.19/0.54 % (7338)Time elapsed: 0.003 s
% 0.19/0.54 % (7338)Instructions burned: 3 (million)
% 0.19/0.54 % (7338)------------------------------
% 0.19/0.54 % (7338)------------------------------
% 0.19/0.54 % (7330)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.19/0.54 % (7337)lrs+10_1:1_ss=axioms:st=5.0:tha=off:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.54 % (7324)Instruction limit reached!
% 0.19/0.54 % (7324)------------------------------
% 0.19/0.54 % (7324)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (7324)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (7324)Termination reason: Unknown
% 0.19/0.54 % (7324)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (7324)Memory used [KB]: 5884
% 0.19/0.54 % (7324)Time elapsed: 0.143 s
% 0.19/0.54 % (7324)Instructions burned: 16 (million)
% 0.19/0.54 % (7324)------------------------------
% 0.19/0.54 % (7324)------------------------------
% 0.19/0.54 % (7330)Instruction limit reached!
% 0.19/0.54 % (7330)------------------------------
% 0.19/0.54 % (7330)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (7330)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (7330)Termination reason: Unknown
% 0.19/0.54 % (7330)Termination phase: Naming
% 0.19/0.54
% 0.19/0.54 % (7330)Memory used [KB]: 1023
% 0.19/0.54 % (7330)Time elapsed: 0.004 s
% 0.19/0.54 % (7330)Instructions burned: 5 (million)
% 0.19/0.54 % (7330)------------------------------
% 0.19/0.54 % (7330)------------------------------
% 0.19/0.54 % (7323)Instruction limit reached!
% 0.19/0.54 % (7323)------------------------------
% 0.19/0.54 % (7323)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (7342)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54 % (7329)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.19/0.54 % (7323)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (7323)Termination reason: Unknown
% 0.19/0.54 % (7323)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (7323)Memory used [KB]: 6012
% 0.19/0.54 % (7323)Time elapsed: 0.131 s
% 0.19/0.54 % (7323)Instructions burned: 37 (million)
% 0.19/0.54 % (7323)------------------------------
% 0.19/0.54 % (7323)------------------------------
% 0.19/0.54 % (7332)Instruction limit reached!
% 0.19/0.54 % (7332)------------------------------
% 0.19/0.54 % (7332)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (7332)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (7332)Termination reason: Unknown
% 0.19/0.54 % (7332)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (7332)Memory used [KB]: 5884
% 0.19/0.54 % (7332)Time elapsed: 0.136 s
% 0.19/0.54 % (7332)Instructions burned: 21 (million)
% 0.19/0.54 % (7332)------------------------------
% 0.19/0.54 % (7332)------------------------------
% 0.19/0.54 % (7348)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=41:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/41Mi)
% 0.19/0.55 % (7327)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.19/0.55 % (7339)dis+1002_1:5_av=off:nwc=2.0:sos=all:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.55 % (7340)dis+10_1:64_nwc=1.4:rp=on:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.19/0.55 % (7321)Termination phase: Property scanning
% 0.19/0.55
% 0.19/0.55 % (7321)Memory used [KB]: 1279
% 0.19/0.55 % (7321)Time elapsed: 0.005 s
% 0.19/0.55 % (7321)Instructions burned: 9 (million)
% 0.19/0.55 % (7321)------------------------------
% 0.19/0.55 % (7321)------------------------------
% 0.19/0.55 % (7334)Instruction limit reached!
% 0.19/0.55 % (7334)------------------------------
% 0.19/0.55 % (7334)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (7334)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (7334)Termination reason: Unknown
% 0.19/0.55 % (7334)Termination phase: Including theory axioms
% 0.19/0.55
% 0.19/0.55 % (7334)Memory used [KB]: 1023
% 0.19/0.55 % (7334)Time elapsed: 0.002 s
% 0.19/0.55 % (7334)Instructions burned: 3 (million)
% 0.19/0.55 % (7334)------------------------------
% 0.19/0.55 % (7334)------------------------------
% 0.19/0.56 % (7347)Instruction limit reached!
% 0.19/0.56 % (7347)------------------------------
% 0.19/0.56 % (7347)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (7347)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (7347)Termination reason: Unknown
% 0.19/0.56 % (7347)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (7347)Memory used [KB]: 5884
% 0.19/0.56 % (7347)Time elapsed: 0.167 s
% 0.19/0.56 % (7347)Instructions burned: 22 (million)
% 0.19/0.56 % (7347)------------------------------
% 0.19/0.56 % (7347)------------------------------
% 0.19/0.56 % (7343)Instruction limit reached!
% 0.19/0.56 % (7343)------------------------------
% 0.19/0.56 % (7343)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (7343)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (7343)Termination reason: Unknown
% 0.19/0.56 % (7343)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (7343)Memory used [KB]: 1535
% 0.19/0.56 % (7343)Time elapsed: 0.158 s
% 0.19/0.56 % (7343)Instructions burned: 47 (million)
% 0.19/0.56 % (7343)------------------------------
% 0.19/0.56 % (7343)------------------------------
% 0.19/0.57 % (7346)Instruction limit reached!
% 0.19/0.57 % (7346)------------------------------
% 0.19/0.57 % (7346)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (7346)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (7346)Termination reason: Unknown
% 0.19/0.57 % (7346)Termination phase: Saturation
% 0.19/0.57
% 0.19/0.57 % (7346)Memory used [KB]: 5884
% 0.19/0.57 % (7346)Time elapsed: 0.188 s
% 0.19/0.57 % (7346)Instructions burned: 22 (million)
% 0.19/0.57 % (7346)------------------------------
% 0.19/0.57 % (7346)------------------------------
% 0.19/0.57 % (7339)Instruction limit reached!
% 0.19/0.57 % (7339)------------------------------
% 0.19/0.57 % (7339)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (7339)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (7339)Termination reason: Unknown
% 0.19/0.57 % (7339)Termination phase: Saturation
% 0.19/0.57
% 0.19/0.57 % (7337)Instruction limit reached!
% 0.19/0.57 % (7337)------------------------------
% 0.19/0.57 % (7337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57 % (7337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57 % (7337)Termination reason: Unknown
% 0.19/0.57 % (7337)Termination phase: Saturation
% 0.19/0.57
% 0.19/0.57 % (7337)Memory used [KB]: 5884
% 0.19/0.57 % (7337)Time elapsed: 0.166 s
% 0.19/0.57 % (7337)Instructions burned: 16 (million)
% 0.19/0.57 % (7337)------------------------------
% 0.19/0.57 % (7337)------------------------------
% 0.19/0.57 % (7339)Memory used [KB]: 1407
% 0.19/0.57 % (7339)Time elapsed: 0.186 s
% 0.19/0.57 % (7339)Instructions burned: 15 (million)
% 0.19/0.57 % (7339)------------------------------
% 0.19/0.57 % (7339)------------------------------
% 0.19/0.57 % (7325)First to succeed.
% 0.19/0.58 % (7340)Instruction limit reached!
% 0.19/0.58 % (7340)------------------------------
% 0.19/0.58 % (7340)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.58 % (7326)Instruction limit reached!
% 1.84/0.58 % (7326)------------------------------
% 1.84/0.58 % (7326)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.59 % (7320)Instruction limit reached!
% 1.84/0.59 % (7320)------------------------------
% 1.84/0.59 % (7320)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.59 % (7344)Instruction limit reached!
% 1.84/0.59 % (7344)------------------------------
% 1.84/0.59 % (7344)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.59 % (7327)Instruction limit reached!
% 1.84/0.59 % (7327)------------------------------
% 1.84/0.59 % (7327)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.59 % (7325)Refutation found. Thanks to Tanya!
% 1.84/0.59 % SZS status Theorem for theBenchmark
% 1.84/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.84/0.59 % (7325)------------------------------
% 1.84/0.59 % (7325)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.84/0.59 % (7325)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.84/0.59 % (7325)Termination reason: Refutation
% 1.84/0.59
% 1.84/0.59 % (7325)Memory used [KB]: 6268
% 1.84/0.59 % (7325)Time elapsed: 0.184 s
% 1.84/0.59 % (7325)Instructions burned: 26 (million)
% 1.84/0.59 % (7325)------------------------------
% 1.84/0.59 % (7325)------------------------------
% 1.84/0.59 % (7318)Success in time 0.235 s
%------------------------------------------------------------------------------