TSTP Solution File: SWW626_2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWW626_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 : n022.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:08:55 EDT 2022
% Result : Theorem 1.57s 0.58s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 66
% Syntax : Number of formulae : 104 ( 21 unt; 55 typ; 0 def)
% Number of atoms : 467 ( 71 equ)
% Maximal formula atoms : 58 ( 9 avg)
% Number of connectives : 607 ( 189 ~; 64 |; 273 &)
% ( 0 <=>; 81 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 9 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 448 ( 92 atm; 114 fun; 234 num; 8 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 67 ( 34 >; 33 *; 0 +; 0 <<)
% Number of predicates : 9 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 50 ( 44 usr; 18 con; 0-5 aty)
% Number of variables : 219 ( 175 !; 44 ?; 219 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(type_def_9,type,
elt: $tType ).
tff(type_def_10,type,
list_elt: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
list: ty > ty ).
tff(func_def_13,type,
nil: ty > uni ).
tff(func_def_14,type,
cons: ( ty * uni * uni ) > uni ).
tff(func_def_15,type,
match_list: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_16,type,
cons_proj_1: ( ty * uni ) > uni ).
tff(func_def_17,type,
cons_proj_2: ( ty * uni ) > uni ).
tff(func_def_18,type,
length: ( ty * uni ) > $int ).
tff(func_def_21,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(func_def_22,type,
num_occ: ( ty * uni * uni ) > $int ).
tff(func_def_23,type,
reverse: ( ty * uni ) > uni ).
tff(func_def_24,type,
elt1: ty ).
tff(func_def_25,type,
t2tb: list_elt > uni ).
tff(func_def_26,type,
tb2t: uni > list_elt ).
tff(func_def_27,type,
t2tb1: elt > uni ).
tff(func_def_28,type,
tb2t1: uni > elt ).
tff(func_def_29,type,
rev_append: ( ty * uni * uni ) > uni ).
tff(func_def_30,type,
prefix: ( ty * $int * uni ) > uni ).
tff(func_def_32,type,
abs: $int > $int ).
tff(func_def_34,type,
div: ( $int * $int ) > $int ).
tff(func_def_35,type,
mod: ( $int * $int ) > $int ).
tff(func_def_38,type,
sK0: ( list_elt * elt ) > elt ).
tff(func_def_39,type,
sK1: ( list_elt * list_elt ) > elt ).
tff(func_def_40,type,
sK2: ( list_elt * list_elt ) > elt ).
tff(func_def_41,type,
sK3: list_elt > elt ).
tff(func_def_42,type,
sK4: list_elt > elt ).
tff(func_def_43,type,
sK5: list_elt > list_elt ).
tff(func_def_44,type,
sK6: list_elt > elt ).
tff(func_def_45,type,
sK7: ( elt * list_elt ) > elt ).
tff(func_def_46,type,
sK8: list_elt ).
tff(func_def_47,type,
sK9: $int ).
tff(func_def_48,type,
sK10: list_elt ).
tff(func_def_49,type,
sK11: list_elt ).
tff(func_def_50,type,
sK12: list_elt ).
tff(func_def_51,type,
sK13: list_elt ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(pred_def_3,type,
mem: ( ty * uni * uni ) > $o ).
tff(pred_def_5,type,
permut: ( ty * uni * uni ) > $o ).
tff(pred_def_6,type,
le: ( elt * elt ) > $o ).
tff(pred_def_7,type,
sorted: list_elt > $o ).
tff(f568,plain,
$false,
inference(subsumption_resolution,[],[f567,f458]) ).
tff(f458,plain,
~ permut(elt1,infix_plpl(elt1,t2tb(sK11),t2tb(sK12)),prefix(elt1,sK9,t2tb(sK8))),
inference(unit_resulting_resolution,[],[f394,f424,f341]) ).
tff(f341,plain,
! [X2: uni,X3: ty,X0: uni,X1: uni] :
( ~ permut(X3,X2,X0)
| ~ permut(X3,X1,X2)
| permut(X3,X1,X0) ),
inference(cnf_transformation,[],[f262]) ).
tff(f262,plain,
! [X0: uni,X1: uni,X2: uni,X3: ty] :
( permut(X3,X1,X0)
| ~ permut(X3,X2,X0)
| ~ permut(X3,X1,X2) ),
inference(rectify,[],[f208]) ).
tff(f208,plain,
! [X3: uni,X1: uni,X2: uni,X0: ty] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(flattening,[],[f207]) ).
tff(f207,plain,
! [X2: uni,X1: uni,X0: ty,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f167]) ).
tff(f167,plain,
! [X2: uni,X1: uni,X0: ty,X3: uni] :
( permut(X0,X1,X2)
=> ( permut(X0,X2,X3)
=> permut(X0,X1,X3) ) ),
inference(rectify,[],[f45]) ).
tff(f45,axiom,
! [X0: ty,X14: uni,X13: uni,X15: uni] :
( permut(X0,X14,X13)
=> ( permut(X0,X13,X15)
=> permut(X0,X14,X15) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permut_trans) ).
tff(f424,plain,
permut(elt1,t2tb(sK13),infix_plpl(elt1,t2tb(sK11),t2tb(sK12))),
inference(forward_demodulation,[],[f423,f316]) ).
tff(f316,plain,
! [X0: uni,X1: ty] : ( infix_plpl(X1,nil(X1),X0) = X0 ),
inference(cnf_transformation,[],[f242]) ).
tff(f242,plain,
! [X0: uni,X1: ty] :
( ( infix_plpl(X1,nil(X1),X0) = X0 )
& ! [X2: uni,X3: uni] : ( cons(X1,X3,infix_plpl(X1,X2,X0)) = infix_plpl(X1,cons(X1,X3,X2),X0) ) ),
inference(rectify,[],[f160]) ).
tff(f160,plain,
! [X1: uni,X0: ty] :
( ( infix_plpl(X0,nil(X0),X1) = X1 )
& ! [X3: uni,X2: uni] : ( infix_plpl(X0,cons(X0,X2,X3),X1) = cons(X0,X2,infix_plpl(X0,X3,X1)) ) ),
inference(rectify,[],[f24]) ).
tff(f24,axiom,
! [X0: ty,X13: uni] :
( ( infix_plpl(X0,nil(X0),X13) = X13 )
& ! [X1: uni,X2: uni] : ( infix_plpl(X0,cons(X0,X1,X2),X13) = cons(X0,X1,infix_plpl(X0,X2,X13)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infix_plpl_def) ).
tff(f423,plain,
permut(elt1,t2tb(sK13),infix_plpl(elt1,nil(elt1),infix_plpl(elt1,t2tb(sK11),t2tb(sK12)))),
inference(forward_demodulation,[],[f393,f353]) ).
tff(f353,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( infix_plpl(X0,infix_plpl(X0,X3,X1),X2) = infix_plpl(X0,X3,infix_plpl(X0,X1,X2)) ),
inference(cnf_transformation,[],[f272]) ).
tff(f272,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] : ( infix_plpl(X0,infix_plpl(X0,X3,X1),X2) = infix_plpl(X0,X3,infix_plpl(X0,X1,X2)) ),
inference(rectify,[],[f177]) ).
tff(f177,plain,
! [X1: ty,X2: uni,X3: uni,X0: uni] : ( infix_plpl(X1,X0,infix_plpl(X1,X2,X3)) = infix_plpl(X1,infix_plpl(X1,X0,X2),X3) ),
inference(rectify,[],[f25]) ).
tff(f25,axiom,
! [X14: uni,X0: ty,X13: uni,X15: uni] : ( infix_plpl(X0,X14,infix_plpl(X0,X13,X15)) = infix_plpl(X0,infix_plpl(X0,X14,X13),X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',append_assoc) ).
tff(f393,plain,
permut(elt1,t2tb(sK13),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12))),
inference(cnf_transformation,[],[f299]) ).
tff(f299,plain,
( ( 3 != sK9 )
& ~ $less(div(sK9,2),0)
& ~ $less(sK9,2)
& ( 2 != sK9 )
& ~ $less(length(elt1,t2tb(sK8)),sK9)
& ( 0 != 2 )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ( sK8 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),t2tb(sK10))) )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ( tb2t(prefix(elt1,sK9,t2tb(sK8))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))) )
& ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& sorted(sK11)
& sorted(sK12)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK11))
| le(X5,X6) )
& ~ permut(elt1,t2tb(sK13),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(sK13),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(sK13))))
& permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(sK12)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(sK12))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(sK11),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(sK11)
& ~ $less(div(sK9,2),2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13])],[f293,f298,f297,f296,f295,f294]) ).
tff(f294,plain,
( ? [X0: list_elt,X1: $int] :
( ( 3 != X1 )
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ( 0 != 2 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ? [X2: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(prefix(elt1,X1,t2tb(X0))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))) )
& ? [X3: list_elt] :
( ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,X1,t2tb(X0)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3) )
& ~ $less(div(X1,2),2) ) )
=> ( ( 3 != sK9 )
& ~ $less(div(sK9,2),0)
& ~ $less(sK9,2)
& ( 2 != sK9 )
& ~ $less(length(elt1,t2tb(sK8)),sK9)
& ( 0 != 2 )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ? [X2: list_elt] :
( ( sK8 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),t2tb(X2))) )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ( tb2t(prefix(elt1,sK9,t2tb(sK8))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(X2)))) )
& ? [X3: list_elt] :
( ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(X2)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(X3) )
& ~ $less(div(sK9,2),2) ) ) ),
introduced(choice_axiom,[]) ).
tff(f295,plain,
( ? [X2: list_elt] :
( ( sK8 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),t2tb(X2))) )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ( tb2t(prefix(elt1,sK9,t2tb(sK8))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(X2)))) )
& ? [X3: list_elt] :
( ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(X2)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(X3) )
& ~ $less(div(sK9,2),2) )
=> ( ( sK8 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),t2tb(sK10))) )
& ~ $less(length(elt1,t2tb(sK8)),div(sK9,2))
& ( tb2t(prefix(elt1,sK9,t2tb(sK8))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))) )
& ? [X3: list_elt] :
( ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(X3) )
& ~ $less(div(sK9,2),2) ) ),
introduced(choice_axiom,[]) ).
tff(f296,plain,
( ? [X3: list_elt] :
( ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(X3) )
=> ( ~ $less($sum(sK9,$uminus(div(sK9,2))),2)
& ? [X4: list_elt] :
( sorted(sK11)
& sorted(X4)
& ! [X6: elt,X5: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK11))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK9,$uminus(div(sK9,2))))
& permut(elt1,t2tb(sK11),prefix(elt1,div(sK9,2),t2tb(sK8)))
& sorted(sK11) ) ),
introduced(choice_axiom,[]) ).
tff(f297,plain,
( ? [X4: list_elt] :
( sorted(sK11)
& sorted(X4)
& ! [X6: elt,X5: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK11))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ( sorted(sK11)
& sorted(sK12)
& ! [X6: elt,X5: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK11))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))
& sorted(sK12)
& ! [X9: elt,X8: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(sK12))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) ) ),
introduced(choice_axiom,[]) ).
tff(f298,plain,
( ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
=> ( ~ permut(elt1,t2tb(sK13),prefix(elt1,sK9,t2tb(sK8)))
& permut(elt1,t2tb(sK13),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(sK13)))) ) ),
introduced(choice_axiom,[]) ).
tff(f293,plain,
? [X0: list_elt,X1: $int] :
( ( 3 != X1 )
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ( 0 != 2 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ? [X2: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(prefix(elt1,X1,t2tb(X0))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))) )
& ? [X3: list_elt] :
( ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X3))
| le(X5,X6) )
& ? [X7: list_elt] :
( ~ permut(elt1,t2tb(X7),prefix(elt1,X1,t2tb(X0)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X7)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& sorted(X4)
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X9),nil(elt1))
| le(X9,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3) )
& ~ $less(div(X1,2),2) ) ),
inference(rectify,[],[f198]) ).
tff(f198,plain,
? [X0: list_elt,X1: $int] :
( ( 3 != X1 )
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ( 0 != 2 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ? [X2: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(prefix(elt1,X1,t2tb(X0))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))) )
& ? [X3: list_elt] :
( ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ? [X4: list_elt] :
( sorted(X3)
& sorted(X4)
& ! [X6: elt,X5: elt] :
( ~ mem(elt1,t2tb1(X6),nil(elt1))
| ~ mem(elt1,t2tb1(X5),t2tb(X3))
| le(X6,X5) )
& ? [X9: list_elt] :
( ~ permut(elt1,t2tb(X9),prefix(elt1,X1,t2tb(X0)))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X9)))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& sorted(X4)
& ! [X8: elt,X7: elt] :
( ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X7),nil(elt1))
| le(X7,X8) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3) )
& ~ $less(div(X1,2),2) ) ),
inference(flattening,[],[f197]) ).
tff(f197,plain,
? [X0: list_elt,X1: $int] :
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X9: list_elt] :
( ~ permut(elt1,t2tb(X9),prefix(elt1,X1,t2tb(X0)))
& sorted(tb2t(reverse(elt1,t2tb(X9))))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
& sorted(X3)
& ! [X5: elt,X6: elt] :
( le(X6,X5)
| ~ mem(elt1,t2tb1(X5),t2tb(X3))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X7: elt,X8: elt] :
( le(X7,X8)
| ~ mem(elt1,t2tb1(X8),t2tb(X4))
| ~ mem(elt1,t2tb1(X7),nil(elt1)) )
& sorted(X4)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2))) )
& ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& sorted(X3)
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0))) )
& ~ $less(div(X1,2),2)
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(prefix(elt1,X1,t2tb(X0))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))) )
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 ) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ~ $less(div(X1,2),0)
& ( 0 != 2 )
& ( 3 != X1 )
& ( 2 != X1 )
& ~ $less(X1,2)
& ~ $less(length(elt1,t2tb(X0)),X1) ),
inference(ennf_transformation,[],[f140]) ).
tff(f140,plain,
~ ! [X0: list_elt,X1: $int] :
( ( ~ $less(X1,2)
& ~ $less(length(elt1,t2tb(X0)),X1) )
=> ( ( 2 != X1 )
=> ( ( 3 != X1 )
=> ( ( 0 != 2 )
=> ( ( ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ~ $less(div(X1,2),0) )
=> ! [X2: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
=> ( ( tb2t(prefix(elt1,X1,t2tb(X0))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))) )
=> ( ( ~ $less(div(X1,2),2)
& ~ $less(length(elt1,t2tb(X0)),div(X1,2)) )
=> ! [X3: list_elt] :
( ( sorted(X3)
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0))) )
=> ( ( ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2)))) )
=> ! [X4: list_elt] :
( ( sorted(X4)
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2))) )
=> ( ( sorted(X3)
& ! [X5: elt,X6: elt] :
( mem(elt1,t2tb1(X6),nil(elt1))
=> ( mem(elt1,t2tb1(X5),t2tb(X3))
=> le(X6,X5) ) )
& ! [X7: elt,X8: elt] :
( mem(elt1,t2tb1(X7),nil(elt1))
=> ( mem(elt1,t2tb1(X8),t2tb(X4))
=> le(X7,X8) ) )
& sorted(X4)
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ! [X9: list_elt] :
( ( sorted(tb2t(reverse(elt1,t2tb(X9))))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
=> permut(elt1,t2tb(X9),prefix(elt1,X1,t2tb(X0))) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f116]) ).
tff(f116,plain,
~ ! [X12: list_elt,X24: $int] :
( ( ~ $less(length(elt1,t2tb(X12)),X24)
& ~ $less(X24,2) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( ~ $less(div(X24,2),0)
& ~ $less(length(elt1,t2tb(X12)),div(X24,2)) )
=> ! [X13: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),t2tb(X13))) = X12 )
=> ( ( tb2t(prefix(elt1,X24,t2tb(X12))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),prefix(elt1,$sum(X24,$uminus(div(X24,2))),t2tb(X13)))) )
=> ( ( ~ $less(div(X24,2),2)
& ~ $less(length(elt1,t2tb(X12)),div(X24,2)) )
=> ! [X25: list_elt] :
( ( permut(elt1,t2tb(X25),prefix(elt1,div(X24,2),t2tb(X12)))
& sorted(X25) )
=> ( ( ~ $less(length(elt1,t2tb(X13)),$sum(X24,$uminus(div(X24,2))))
& ~ $less($sum(X24,$uminus(div(X24,2))),2) )
=> ! [X26: list_elt] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$sum(X24,$uminus(div(X24,2))),t2tb(X13)))
& sorted(X26) )
=> ( ( sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ! [X27: list_elt] :
( ( permut(elt1,t2tb(X27),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X25)),t2tb(X26)))
& sorted(tb2t(reverse(elt1,t2tb(X27)))) )
=> permut(elt1,t2tb(X27),prefix(elt1,X24,t2tb(X12))) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(theory_normalization,[],[f102]) ).
tff(f102,negated_conjecture,
~ ! [X12: list_elt,X24: $int] :
( ( $lesseq(X24,length(elt1,t2tb(X12)))
& $lesseq(2,X24) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( $lesseq(0,div(X24,2))
& $lesseq(div(X24,2),length(elt1,t2tb(X12))) )
=> ! [X13: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),t2tb(X13))) = X12 )
=> ( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))) = tb2t(prefix(elt1,X24,t2tb(X12))) )
=> ( ( $lesseq(2,div(X24,2))
& $lesseq(div(X24,2),length(elt1,t2tb(X12))) )
=> ! [X25: list_elt] :
( ( permut(elt1,t2tb(X25),prefix(elt1,div(X24,2),t2tb(X12)))
& sorted(X25) )
=> ( ( $lesseq($difference(X24,div(X24,2)),length(elt1,t2tb(X13)))
& $lesseq(2,$difference(X24,div(X24,2))) )
=> ! [X26: list_elt] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))
& sorted(X26) )
=> ( ( sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ! [X27: list_elt] :
( ( permut(elt1,t2tb(X27),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X25)),t2tb(X26)))
& sorted(tb2t(reverse(elt1,t2tb(X27)))) )
=> permut(elt1,t2tb(X27),prefix(elt1,X24,t2tb(X12))) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f101]) ).
tff(f101,conjecture,
! [X12: list_elt,X24: $int] :
( ( $lesseq(X24,length(elt1,t2tb(X12)))
& $lesseq(2,X24) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( $lesseq(0,div(X24,2))
& $lesseq(div(X24,2),length(elt1,t2tb(X12))) )
=> ! [X13: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),t2tb(X13))) = X12 )
=> ( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X24,2),t2tb(X12)),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))) = tb2t(prefix(elt1,X24,t2tb(X12))) )
=> ( ( $lesseq(2,div(X24,2))
& $lesseq(div(X24,2),length(elt1,t2tb(X12))) )
=> ! [X25: list_elt] :
( ( permut(elt1,t2tb(X25),prefix(elt1,div(X24,2),t2tb(X12)))
& sorted(X25) )
=> ( ( $lesseq($difference(X24,div(X24,2)),length(elt1,t2tb(X13)))
& $lesseq(2,$difference(X24,div(X24,2))) )
=> ! [X26: list_elt] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))
& sorted(X26) )
=> ( ( sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ! [X27: list_elt] :
( ( permut(elt1,t2tb(X27),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X25)),t2tb(X26)))
& sorted(tb2t(reverse(elt1,t2tb(X27)))) )
=> permut(elt1,t2tb(X27),prefix(elt1,X24,t2tb(X12))) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_rev_sort) ).
tff(f394,plain,
~ permut(elt1,t2tb(sK13),prefix(elt1,sK9,t2tb(sK8))),
inference(cnf_transformation,[],[f299]) ).
tff(f567,plain,
permut(elt1,infix_plpl(elt1,t2tb(sK11),t2tb(sK12)),prefix(elt1,sK9,t2tb(sK8))),
inference(backward_demodulation,[],[f534,f566]) ).
tff(f566,plain,
infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10))) = prefix(elt1,sK9,t2tb(sK8)),
inference(forward_demodulation,[],[f565,f317]) ).
tff(f317,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(cnf_transformation,[],[f195]) ).
tff(f195,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(rectify,[],[f59]) ).
tff(f59,axiom,
! [X19: uni] : ( t2tb(tb2t(X19)) = X19 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bridgeR) ).
tff(f565,plain,
infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10))) = t2tb(tb2t(prefix(elt1,sK9,t2tb(sK8)))),
inference(superposition,[],[f317,f399]) ).
tff(f399,plain,
tb2t(prefix(elt1,sK9,t2tb(sK8))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))),
inference(cnf_transformation,[],[f299]) ).
tff(f534,plain,
permut(elt1,infix_plpl(elt1,t2tb(sK11),t2tb(sK12)),infix_plpl(elt1,prefix(elt1,div(sK9,2),t2tb(sK8)),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10)))),
inference(unit_resulting_resolution,[],[f386,f391,f333]) ).
tff(f333,plain,
! [X2: uni,X3: uni,X0: uni,X1: uni,X4: ty] :
( permut(X4,infix_plpl(X4,X2,X0),infix_plpl(X4,X1,X3))
| ~ permut(X4,X2,X1)
| ~ permut(X4,X0,X3) ),
inference(cnf_transformation,[],[f256]) ).
tff(f256,plain,
! [X0: uni,X1: uni,X2: uni,X3: uni,X4: ty] :
( ~ permut(X4,X0,X3)
| permut(X4,infix_plpl(X4,X2,X0),infix_plpl(X4,X1,X3))
| ~ permut(X4,X2,X1) ),
inference(rectify,[],[f225]) ).
tff(f225,plain,
! [X4: uni,X1: uni,X3: uni,X0: uni,X2: ty] :
( ~ permut(X2,X4,X0)
| permut(X2,infix_plpl(X2,X3,X4),infix_plpl(X2,X1,X0))
| ~ permut(X2,X3,X1) ),
inference(flattening,[],[f224]) ).
tff(f224,plain,
! [X3: uni,X4: uni,X2: ty,X1: uni,X0: uni] :
( permut(X2,infix_plpl(X2,X3,X4),infix_plpl(X2,X1,X0))
| ~ permut(X2,X4,X0)
| ~ permut(X2,X3,X1) ),
inference(ennf_transformation,[],[f168]) ).
tff(f168,plain,
! [X3: uni,X4: uni,X2: ty,X1: uni,X0: uni] :
( permut(X2,X3,X1)
=> ( permut(X2,X4,X0)
=> permut(X2,infix_plpl(X2,X3,X4),infix_plpl(X2,X1,X0)) ) ),
inference(rectify,[],[f50]) ).
tff(f50,axiom,
! [X17: uni,X16: uni,X0: ty,X14: uni,X13: uni] :
( permut(X0,X14,X16)
=> ( permut(X0,X13,X17)
=> permut(X0,infix_plpl(X0,X14,X13),infix_plpl(X0,X16,X17)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',permut_append) ).
tff(f391,plain,
permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK9,$uminus(div(sK9,2))),t2tb(sK10))),
inference(cnf_transformation,[],[f299]) ).
tff(f386,plain,
permut(elt1,t2tb(sK11),prefix(elt1,div(sK9,2),t2tb(sK8))),
inference(cnf_transformation,[],[f299]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW626=2 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 21:01:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.50 % (2764)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.21/0.50 % (2786)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.21/0.51 % (2762)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.21/0.51 % (2776)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.21/0.51 % (2764)Instruction limit reached!
% 0.21/0.51 % (2764)------------------------------
% 0.21/0.51 % (2764)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (2763)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.21/0.51 % (2780)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.21/0.51 % (2772)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.21/0.51 % (2771)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.21/0.51 % (2762)Instruction limit reached!
% 0.21/0.51 % (2762)------------------------------
% 0.21/0.51 % (2762)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (2762)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (2762)Termination reason: Unknown
% 0.21/0.51 % (2762)Termination phase: Property scanning
% 0.21/0.51
% 0.21/0.51 % (2762)Memory used [KB]: 1023
% 0.21/0.51 % (2762)Time elapsed: 0.003 s
% 0.21/0.51 % (2762)Instructions burned: 2 (million)
% 0.21/0.51 % (2762)------------------------------
% 0.21/0.51 % (2762)------------------------------
% 0.21/0.51 % (2771)Instruction limit reached!
% 0.21/0.51 % (2771)------------------------------
% 0.21/0.51 % (2771)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (2771)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (2771)Termination reason: Unknown
% 0.21/0.51 % (2771)Termination phase: Property scanning
% 0.21/0.51
% 0.21/0.51 % (2771)Memory used [KB]: 1023
% 0.21/0.51 % (2771)Time elapsed: 0.004 s
% 0.21/0.51 % (2771)Instructions burned: 3 (million)
% 0.21/0.51 % (2771)------------------------------
% 0.21/0.51 % (2771)------------------------------
% 0.21/0.52 % (2760)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.21/0.52 % (2759)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.21/0.52 % (2761)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.21/0.52 % (2761)Instruction limit reached!
% 0.21/0.52 % (2761)------------------------------
% 0.21/0.52 % (2761)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (2761)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (2761)Termination reason: Unknown
% 0.21/0.52 % (2761)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (2761)Memory used [KB]: 1151
% 0.21/0.52 % (2761)Time elapsed: 0.004 s
% 0.21/0.52 % (2761)Instructions burned: 8 (million)
% 0.21/0.52 % (2761)------------------------------
% 0.21/0.52 % (2761)------------------------------
% 0.21/0.52 % (2769)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.21/0.53 % (2787)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.21/0.53 % (2765)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.21/0.53 % (2764)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (2764)Termination reason: Unknown
% 0.21/0.53 % (2764)Termination phase: Saturation
% 0.21/0.53
% 0.21/0.53 % (2764)Memory used [KB]: 5756
% 0.21/0.53 % (2764)Time elapsed: 0.007 s
% 0.21/0.53 % (2764)Instructions burned: 15 (million)
% 0.21/0.53 % (2764)------------------------------
% 0.21/0.53 % (2764)------------------------------
% 0.21/0.53 % (2770)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)
% 1.36/0.53 % (2786)Instruction limit reached!
% 1.36/0.53 % (2786)------------------------------
% 1.36/0.53 % (2786)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.53 % (2786)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.53 % (2786)Termination reason: Unknown
% 1.36/0.53 % (2786)Termination phase: Saturation
% 1.36/0.53
% 1.36/0.53 % (2786)Memory used [KB]: 5884
% 1.36/0.53 % (2786)Time elapsed: 0.132 s
% 1.36/0.53 % (2786)Instructions burned: 21 (million)
% 1.36/0.53 % (2786)------------------------------
% 1.36/0.53 % (2786)------------------------------
% 1.36/0.53 % (2779)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)
% 1.36/0.53 % (2785)lrs+1_3:1_ep=RSTC:sos=on:urr=on:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 1.36/0.53 % (2783)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)
% 1.36/0.53 % (2774)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)
% 1.36/0.54 % (2778)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)
% 1.36/0.54 % (2778)Instruction limit reached!
% 1.36/0.54 % (2778)------------------------------
% 1.36/0.54 % (2778)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2778)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (2778)Termination reason: Unknown
% 1.36/0.54 % (2778)Termination phase: Property scanning
% 1.36/0.54
% 1.36/0.54 % (2778)Memory used [KB]: 1023
% 1.36/0.54 % (2778)Time elapsed: 0.004 s
% 1.36/0.54 % (2778)Instructions burned: 3 (million)
% 1.36/0.54 % (2778)------------------------------
% 1.36/0.54 % (2778)------------------------------
% 1.36/0.54 % (2767)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)
% 1.36/0.54 % (2774)Instruction limit reached!
% 1.36/0.54 % (2774)------------------------------
% 1.36/0.54 % (2774)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2781)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)
% 1.36/0.54 % (2782)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)
% 1.36/0.54 % (2788)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)
% 1.36/0.54 % (2777)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)
% 1.36/0.54 % (2768)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)
% 1.36/0.54 % (2770)Instruction limit reached!
% 1.36/0.54 % (2770)------------------------------
% 1.36/0.54 % (2770)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2784)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)
% 1.36/0.54 % (2774)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (2774)Termination reason: Unknown
% 1.36/0.54 % (2774)Termination phase: Property scanning
% 1.36/0.54
% 1.36/0.54 % (2774)Memory used [KB]: 1023
% 1.36/0.54 % (2774)Time elapsed: 0.003 s
% 1.36/0.54 % (2774)Instructions burned: 4 (million)
% 1.36/0.54 % (2774)------------------------------
% 1.36/0.54 % (2774)------------------------------
% 1.36/0.54 % (2766)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)
% 1.36/0.54 % (2768)Instruction limit reached!
% 1.36/0.54 % (2768)------------------------------
% 1.36/0.54 % (2768)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2780)Instruction limit reached!
% 1.36/0.54 % (2780)------------------------------
% 1.36/0.54 % (2780)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2773)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)
% 1.36/0.54 % (2772)Instruction limit reached!
% 1.36/0.54 % (2772)------------------------------
% 1.36/0.54 % (2772)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (2772)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (2772)Termination reason: Unknown
% 1.36/0.54 % (2772)Termination phase: Saturation
% 1.36/0.54
% 1.36/0.54 % (2772)Memory used [KB]: 5884
% 1.36/0.54 % (2772)Time elapsed: 0.150 s
% 1.36/0.54 % (2772)Instructions burned: 22 (million)
% 1.36/0.54 % (2772)------------------------------
% 1.36/0.54 % (2772)------------------------------
% 1.36/0.54 % (2780)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (2780)Termination reason: Unknown
% 1.36/0.54 % (2780)Termination phase: Saturation
% 1.36/0.54
% 1.36/0.54 % (2780)Memory used [KB]: 5884
% 1.36/0.54 % (2780)Time elapsed: 0.132 s
% 1.36/0.54 % (2780)Instructions burned: 22 (million)
% 1.36/0.54 % (2780)------------------------------
% 1.36/0.54 % (2780)------------------------------
% 1.36/0.55 % (2775)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.36/0.55 % (2775)Instruction limit reached!
% 1.36/0.55 % (2775)------------------------------
% 1.36/0.55 % (2775)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.55 % (2775)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.55 % (2775)Termination reason: Unknown
% 1.36/0.55 % (2775)Termination phase: Property scanning
% 1.36/0.55
% 1.36/0.55 % (2775)Memory used [KB]: 1023
% 1.36/0.55 % (2775)Time elapsed: 0.004 s
% 1.36/0.55 % (2775)Instructions burned: 3 (million)
% 1.36/0.55 % (2775)------------------------------
% 1.36/0.55 % (2775)------------------------------
% 1.57/0.55 % (2768)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.55 % (2768)Termination reason: Unknown
% 1.57/0.55 % (2768)Termination phase: Property scanning
% 1.57/0.55
% 1.57/0.55 % (2768)Memory used [KB]: 1023
% 1.57/0.55 % (2768)Time elapsed: 0.003 s
% 1.57/0.55 % (2768)Instructions burned: 2 (million)
% 1.57/0.55 % (2768)------------------------------
% 1.57/0.55 % (2768)------------------------------
% 1.57/0.55 % (2777)Instruction limit reached!
% 1.57/0.55 % (2777)------------------------------
% 1.57/0.55 % (2777)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.55 % (2777)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.55 % (2777)Termination reason: Unknown
% 1.57/0.55 % (2777)Termination phase: Saturation
% 1.57/0.55
% 1.57/0.55 % (2777)Memory used [KB]: 5884
% 1.57/0.55 % (2777)Time elapsed: 0.009 s
% 1.57/0.55 % (2777)Instructions burned: 16 (million)
% 1.57/0.55 % (2777)------------------------------
% 1.57/0.55 % (2777)------------------------------
% 1.57/0.55 % (2770)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.55 % (2770)Termination reason: Unknown
% 1.57/0.55 % (2770)Termination phase: SInE selection
% 1.57/0.55
% 1.57/0.55 % (2770)Memory used [KB]: 1023
% 1.57/0.55 % (2770)Time elapsed: 0.004 s
% 1.57/0.55 % (2770)Instructions burned: 6 (million)
% 1.57/0.55 % (2770)------------------------------
% 1.57/0.55 % (2770)------------------------------
% 1.57/0.55 % (2787)Instruction limit reached!
% 1.57/0.55 % (2787)------------------------------
% 1.57/0.55 % (2787)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.55 % (2787)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.55 % (2787)Termination reason: Unknown
% 1.57/0.55 % (2787)Termination phase: Saturation
% 1.57/0.55
% 1.57/0.55 % (2787)Memory used [KB]: 5884
% 1.57/0.55 % (2787)Time elapsed: 0.155 s
% 1.57/0.55 % (2787)Instructions burned: 22 (million)
% 1.57/0.55 % (2787)------------------------------
% 1.57/0.55 % (2787)------------------------------
% 1.57/0.56 % (2779)Instruction limit reached!
% 1.57/0.56 % (2779)------------------------------
% 1.57/0.56 % (2779)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.56 % (2779)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.56 % (2779)Termination reason: Unknown
% 1.57/0.56 % (2779)Termination phase: Saturation
% 1.57/0.56
% 1.57/0.56 % (2779)Memory used [KB]: 1407
% 1.57/0.56 % (2779)Time elapsed: 0.009 s
% 1.57/0.56 % (2779)Instructions burned: 15 (million)
% 1.57/0.56 % (2779)------------------------------
% 1.57/0.56 % (2779)------------------------------
% 1.57/0.57 % (2769)Instruction limit reached!
% 1.57/0.57 % (2769)------------------------------
% 1.57/0.57 % (2769)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.57 % (2769)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.57 % (2769)Termination reason: Unknown
% 1.57/0.57 % (2769)Termination phase: Saturation
% 1.57/0.57
% 1.57/0.57 % (2769)Memory used [KB]: 6140
% 1.57/0.57 % (2769)Time elapsed: 0.167 s
% 1.57/0.57 % (2769)Instructions burned: 36 (million)
% 1.57/0.57 % (2769)------------------------------
% 1.57/0.57 % (2769)------------------------------
% 1.57/0.57 % (2760)Instruction limit reached!
% 1.57/0.57 % (2760)------------------------------
% 1.57/0.57 % (2760)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.57 % (2760)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.57 % (2760)Termination reason: Unknown
% 1.57/0.57 % (2760)Termination phase: Saturation
% 1.57/0.57
% 1.57/0.57 % (2760)Memory used [KB]: 6268
% 1.57/0.57 % (2760)Time elapsed: 0.149 s
% 1.57/0.57 % (2760)Instructions burned: 34 (million)
% 1.57/0.57 % (2760)------------------------------
% 1.57/0.57 % (2760)------------------------------
% 1.57/0.57 % (2765)First to succeed.
% 1.57/0.58 % (2765)Refutation found. Thanks to Tanya!
% 1.57/0.58 % SZS status Theorem for theBenchmark
% 1.57/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.57/0.58 % (2765)------------------------------
% 1.57/0.58 % (2765)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.58 % (2765)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.58 % (2765)Termination reason: Refutation
% 1.57/0.58
% 1.57/0.58 % (2765)Memory used [KB]: 6268
% 1.57/0.58 % (2765)Time elapsed: 0.159 s
% 1.57/0.58 % (2765)Instructions burned: 27 (million)
% 1.57/0.58 % (2765)------------------------------
% 1.57/0.58 % (2765)------------------------------
% 1.57/0.58 % (2754)Success in time 0.221 s
%------------------------------------------------------------------------------