TSTP Solution File: SWW626_2 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n008.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 : Mon Jun 24 18:35:17 EDT 2024
% Result : Theorem 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 49 ( 21 unt; 0 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 : 27 ( 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 : 0 ( 0 >; 0 *; 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: ( elt * list_elt ) > elt ).
tff(func_def_39,type,
sK1: list_elt ).
tff(func_def_40,type,
sK2: $int ).
tff(func_def_41,type,
sK3: list_elt ).
tff(func_def_42,type,
sK4: list_elt ).
tff(func_def_43,type,
sK5: list_elt ).
tff(func_def_44,type,
sK6: list_elt ).
tff(func_def_45,type,
sK7: ( list_elt * list_elt ) > elt ).
tff(func_def_46,type,
sK8: ( list_elt * list_elt ) > elt ).
tff(func_def_47,type,
sK9: ( elt * list_elt ) > elt ).
tff(func_def_48,type,
sK10: list_elt > elt ).
tff(func_def_49,type,
sK11: list_elt > list_elt ).
tff(func_def_50,type,
sK12: list_elt > elt ).
tff(func_def_51,type,
sK13: list_elt > 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(f556,plain,
$false,
inference(subsumption_resolution,[],[f555,f429]) ).
tff(f429,plain,
~ permut(elt1,infix_plpl(elt1,t2tb(sK4),t2tb(sK5)),prefix(elt1,sK2,t2tb(sK1))),
inference(unit_resulting_resolution,[],[f354,f420,f308]) ).
tff(f308,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] :
( ~ permut(X0,X2,X1)
| ~ permut(X0,X1,X3)
| permut(X0,X2,X3) ),
inference(cnf_transformation,[],[f245]) ).
tff(f245,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( ~ permut(X0,X2,X1)
| ~ permut(X0,X1,X3)
| permut(X0,X2,X3) ),
inference(rectify,[],[f233]) ).
tff(f233,plain,
! [X3: ty,X1: uni,X2: uni,X0: uni] :
( ~ permut(X3,X2,X1)
| ~ permut(X3,X1,X0)
| permut(X3,X2,X0) ),
inference(flattening,[],[f232]) ).
tff(f232,plain,
! [X2: uni,X0: uni,X1: uni,X3: ty] :
( permut(X3,X2,X0)
| ~ permut(X3,X1,X0)
| ~ permut(X3,X2,X1) ),
inference(ennf_transformation,[],[f145]) ).
tff(f145,plain,
! [X2: uni,X0: uni,X1: uni,X3: ty] :
( permut(X3,X2,X1)
=> ( permut(X3,X1,X0)
=> permut(X3,X2,X0) ) ),
inference(rectify,[],[f45]) ).
tff(f45,axiom,
! [X15: uni,X13: uni,X14: uni,X0: ty] :
( permut(X0,X14,X13)
=> ( permut(X0,X13,X15)
=> permut(X0,X14,X15) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f420,plain,
permut(elt1,t2tb(sK6),infix_plpl(elt1,t2tb(sK4),t2tb(sK5))),
inference(forward_demodulation,[],[f419,f309]) ).
tff(f309,plain,
! [X0: ty,X1: uni] : ( infix_plpl(X0,nil(X0),X1) = X1 ),
inference(cnf_transformation,[],[f246]) ).
tff(f246,plain,
! [X0: ty,X1: uni] :
( ! [X2: uni,X3: uni] : ( infix_plpl(X0,cons(X0,X3,X2),X1) = cons(X0,X3,infix_plpl(X0,X2,X1)) )
& ( infix_plpl(X0,nil(X0),X1) = X1 ) ),
inference(rectify,[],[f167]) ).
tff(f167,plain,
! [X1: ty,X0: uni] :
( ! [X3: uni,X2: uni] : ( infix_plpl(X1,cons(X1,X2,X3),X0) = cons(X1,X2,infix_plpl(X1,X3,X0)) )
& ( infix_plpl(X1,nil(X1),X0) = X0 ) ),
inference(rectify,[],[f24]) ).
tff(f24,axiom,
! [X13: uni,X0: ty] :
( ! [X1: uni,X2: uni] : ( infix_plpl(X0,cons(X0,X1,X2),X13) = cons(X0,X1,infix_plpl(X0,X2,X13)) )
& ( infix_plpl(X0,nil(X0),X13) = X13 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown) ).
tff(f419,plain,
permut(elt1,t2tb(sK6),infix_plpl(elt1,nil(elt1),infix_plpl(elt1,t2tb(sK4),t2tb(sK5)))),
inference(forward_demodulation,[],[f353,f406]) ).
tff(f406,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( infix_plpl(X0,X2,infix_plpl(X0,X3,X1)) = infix_plpl(X0,infix_plpl(X0,X2,X3),X1) ),
inference(cnf_transformation,[],[f297]) ).
tff(f297,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] : ( infix_plpl(X0,X2,infix_plpl(X0,X3,X1)) = infix_plpl(X0,infix_plpl(X0,X2,X3),X1) ),
inference(rectify,[],[f177]) ).
tff(f177,plain,
! [X2: ty,X0: uni,X1: uni,X3: uni] : ( infix_plpl(X2,X1,infix_plpl(X2,X3,X0)) = infix_plpl(X2,infix_plpl(X2,X1,X3),X0) ),
inference(rectify,[],[f25]) ).
tff(f25,axiom,
! [X15: uni,X14: uni,X0: ty,X13: 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',unknown) ).
tff(f353,plain,
permut(elt1,t2tb(sK6),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(sK5))),
inference(cnf_transformation,[],[f267]) ).
tff(f267,plain,
( ( 0 != 2 )
& ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK5)) )
& sorted(tb2t(reverse(elt1,t2tb(sK6))))
& ~ permut(elt1,t2tb(sK6),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(sK6),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(sK5)))
& permut(elt1,t2tb(sK5),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(sK4))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(sK5)
& sorted(sK5)
& sorted(sK4)
& permut(elt1,t2tb(sK4),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(sK4)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(sK3)),$sum(sK2,$uminus(div(sK2,2))))
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),t2tb(sK3))) )
& ~ $less(div(sK2,2),2)
& ( tb2t(prefix(elt1,sK2,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( 3 != sK2 )
& ~ $less(length(elt1,t2tb(sK1)),sK2)
& ~ $less(div(sK2,2),0)
& ~ $less(sK2,2)
& ( 2 != sK2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6])],[f261,f266,f265,f264,f263,f262]) ).
tff(f262,plain,
( ? [X0: list_elt,X1: $int] :
( ( 0 != 2 )
& ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ 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))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3)
& ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2)))) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(div(X1,2),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)))) ) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( 3 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 ) )
=> ( ( 0 != 2 )
& ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(X2)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(X3)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(sK2,$uminus(div(sK2,2)))) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),t2tb(X2))) )
& ~ $less(div(sK2,2),2)
& ( tb2t(prefix(elt1,sK2,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(X2)))) ) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( 3 != sK2 )
& ~ $less(length(elt1,t2tb(sK1)),sK2)
& ~ $less(div(sK2,2),0)
& ~ $less(sK2,2)
& ( 2 != sK2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f263,plain,
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(X2)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(X3)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(sK2,$uminus(div(sK2,2)))) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),t2tb(X2))) )
& ~ $less(div(sK2,2),2)
& ( tb2t(prefix(elt1,sK2,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(X2)))) ) )
=> ( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(X3)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(sK3)),$sum(sK2,$uminus(div(sK2,2)))) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK2,2))
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),t2tb(sK3))) )
& ~ $less(div(sK2,2),2)
& ( tb2t(prefix(elt1,sK2,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f264,plain,
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(X3)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(sK3)),$sum(sK2,$uminus(div(sK2,2)))) )
=> ( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X9: elt,X8: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(sK4))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(sK4) )
& permut(elt1,t2tb(sK4),prefix(elt1,div(sK2,2),t2tb(sK1)))
& sorted(sK4)
& ~ $less($sum(sK2,$uminus(div(sK2,2))),2)
& ~ $less(length(elt1,t2tb(sK3)),$sum(sK2,$uminus(div(sK2,2)))) ) ),
introduced(choice_axiom,[]) ).
tff(f265,plain,
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(X4))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X9: elt,X8: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(sK4))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(sK4) )
=> ( ! [X6: elt,X5: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(sK5)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(sK5))) )
& permut(elt1,t2tb(sK5),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))
& ! [X9: elt,X8: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(sK4))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(sK5)
& sorted(sK5)
& sorted(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f266,plain,
( ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ permut(elt1,t2tb(X7),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(X7),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(sK5))) )
=> ( sorted(tb2t(reverse(elt1,t2tb(sK6))))
& ~ permut(elt1,t2tb(sK6),prefix(elt1,sK2,t2tb(sK1)))
& permut(elt1,t2tb(sK6),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK4)),t2tb(sK5))) ) ),
introduced(choice_axiom,[]) ).
tff(f261,plain,
? [X0: list_elt,X1: $int] :
( ( 0 != 2 )
& ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X5),nil(elt1))
| ~ mem(elt1,t2tb1(X6),t2tb(X4)) )
& ? [X7: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X7))))
& ~ 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))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& ! [X8: elt,X9: elt] :
( ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X9) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3)
& ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2)))) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(div(X1,2),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)))) ) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( 3 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 ) ),
inference(rectify,[],[f218]) ).
tff(f218,plain,
? [X0: list_elt,X1: $int] :
( ( 0 != 2 )
& ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ! [X6: elt,X5: elt] :
( le(X6,X5)
| ~ mem(elt1,t2tb1(X6),nil(elt1))
| ~ mem(elt1,t2tb1(X5),t2tb(X4)) )
& ? [X9: list_elt] :
( sorted(tb2t(reverse(elt1,t2tb(X9))))
& ~ 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))) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& ! [X8: elt,X7: elt] :
( ~ mem(elt1,t2tb1(X7),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1))
| le(X8,X7) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X4)
& sorted(X4)
& sorted(X3) )
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0)))
& sorted(X3)
& ~ $less($sum(X1,$uminus(div(X1,2))),2)
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2)))) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X1,2),t2tb(X0)),t2tb(X2))) = X0 )
& ~ $less(div(X1,2),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)))) ) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ( 3 != X1 )
& ~ $less(length(elt1,t2tb(X0)),X1)
& ~ $less(div(X1,2),0)
& ~ $less(X1,2)
& ( 2 != X1 ) ),
inference(flattening,[],[f217]) ).
tff(f217,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)))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X9)))) )
& sorted(tb2t(reverse(elt1,nil(elt1))))
& ! [X8: elt,X7: elt] :
( le(X8,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( le(X6,X5)
| ~ mem(elt1,t2tb1(X5),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& ~ $less($sum(X1,$uminus(div(X1,2))),2)
& sorted(X3)
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0))) )
& ~ $less(length(elt1,t2tb(X0)),div(X1,2))
& ~ $less(div(X1,2),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(length(elt1,t2tb(X0)),div(X1,2))
& ~ $less(div(X1,2),2) )
=> ! [X3: list_elt] :
( ( sorted(X3)
& permut(elt1,t2tb(X3),prefix(elt1,div(X1,2),t2tb(X0))) )
=> ( ( ~ $less(length(elt1,t2tb(X2)),$sum(X1,$uminus(div(X1,2))))
& ~ $less($sum(X1,$uminus(div(X1,2))),2) )
=> ! [X4: list_elt] :
( ( permut(elt1,t2tb(X4),prefix(elt1,$sum(X1,$uminus(div(X1,2))),t2tb(X2)))
& sorted(X4) )
=> ( ( sorted(tb2t(reverse(elt1,nil(elt1))))
& ! [X8: elt,X7: elt] :
( mem(elt1,t2tb1(X8),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X3))
=> le(X8,X7) ) )
& sorted(X3)
& sorted(X4)
& ! [X5: elt,X6: elt] :
( mem(elt1,t2tb1(X6),nil(elt1))
=> ( mem(elt1,t2tb1(X5),t2tb(X4))
=> le(X6,X5) ) ) )
=> ! [X9: list_elt] :
( ( 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(X9),prefix(elt1,X1,t2tb(X0))) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f117]) ).
tff(f117,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(length(elt1,t2tb(X12)),div(X24,2))
& ~ $less(div(X24,2),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] :
( ( sorted(X26)
& permut(elt1,t2tb(X26),prefix(elt1,$sum(X24,$uminus(div(X24,2))),t2tb(X13))) )
=> ( ( sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) ) )
=> ! [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(div(X24,2),length(elt1,t2tb(X12)))
& $lesseq(2,div(X24,2)) )
=> ! [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] :
( ( sorted(X26)
& permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13))) )
=> ( ( sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) ) )
=> ! [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(div(X24,2),length(elt1,t2tb(X12)))
& $lesseq(2,div(X24,2)) )
=> ! [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] :
( ( sorted(X26)
& permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13))) )
=> ( ( sorted(tb2t(reverse(elt1,nil(elt1))))
& sorted(X25)
& sorted(X26)
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X7: elt,X1: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) ) )
=> ! [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',unknown) ).
tff(f354,plain,
~ permut(elt1,t2tb(sK6),prefix(elt1,sK2,t2tb(sK1))),
inference(cnf_transformation,[],[f267]) ).
tff(f555,plain,
permut(elt1,infix_plpl(elt1,t2tb(sK4),t2tb(sK5)),prefix(elt1,sK2,t2tb(sK1))),
inference(backward_demodulation,[],[f521,f554]) ).
tff(f554,plain,
prefix(elt1,sK2,t2tb(sK1)) = infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3))),
inference(forward_demodulation,[],[f553,f381]) ).
tff(f381,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(cnf_transformation,[],[f182]) ).
tff(f182,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',unknown) ).
tff(f553,plain,
infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3))) = t2tb(tb2t(prefix(elt1,sK2,t2tb(sK1)))),
inference(superposition,[],[f381,f339]) ).
tff(f339,plain,
tb2t(prefix(elt1,sK2,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))),
inference(cnf_transformation,[],[f267]) ).
tff(f521,plain,
permut(elt1,infix_plpl(elt1,t2tb(sK4),t2tb(sK5)),infix_plpl(elt1,prefix(elt1,div(sK2,2),t2tb(sK1)),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3)))),
inference(unit_resulting_resolution,[],[f346,f352,f325]) ).
tff(f325,plain,
! [X2: uni,X3: ty,X0: uni,X1: uni,X4: uni] :
( permut(X3,infix_plpl(X3,X2,X0),infix_plpl(X3,X1,X4))
| ~ permut(X3,X2,X1)
| ~ permut(X3,X0,X4) ),
inference(cnf_transformation,[],[f257]) ).
tff(f257,plain,
! [X0: uni,X1: uni,X2: uni,X3: ty,X4: uni] :
( permut(X3,infix_plpl(X3,X2,X0),infix_plpl(X3,X1,X4))
| ~ permut(X3,X0,X4)
| ~ permut(X3,X2,X1) ),
inference(rectify,[],[f224]) ).
tff(f224,plain,
! [X1: uni,X2: uni,X3: uni,X0: ty,X4: uni] :
( permut(X0,infix_plpl(X0,X3,X1),infix_plpl(X0,X2,X4))
| ~ permut(X0,X1,X4)
| ~ permut(X0,X3,X2) ),
inference(flattening,[],[f223]) ).
tff(f223,plain,
! [X0: ty,X3: uni,X2: uni,X1: uni,X4: uni] :
( permut(X0,infix_plpl(X0,X3,X1),infix_plpl(X0,X2,X4))
| ~ permut(X0,X1,X4)
| ~ permut(X0,X3,X2) ),
inference(ennf_transformation,[],[f150]) ).
tff(f150,plain,
! [X0: ty,X3: uni,X2: uni,X1: uni,X4: uni] :
( permut(X0,X3,X2)
=> ( permut(X0,X1,X4)
=> permut(X0,infix_plpl(X0,X3,X1),infix_plpl(X0,X2,X4)) ) ),
inference(rectify,[],[f50]) ).
tff(f50,axiom,
! [X0: ty,X13: uni,X16: uni,X14: uni,X17: 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',unknown) ).
tff(f352,plain,
permut(elt1,t2tb(sK5),prefix(elt1,$sum(sK2,$uminus(div(sK2,2))),t2tb(sK3))),
inference(cnf_transformation,[],[f267]) ).
tff(f346,plain,
permut(elt1,t2tb(sK4),prefix(elt1,div(sK2,2),t2tb(sK1))),
inference(cnf_transformation,[],[f267]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% 0.07/0.11 % Command : run_vampire %s %d THM
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jun 19 09:10:39 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.34 This is a TF0_THM_EQU_ARI problem
% 0.11/0.34 Running first-order theorem proving
% 0.11/0.34 Running /export/starexec/sandbox2/solver/bin/vampire --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.39 % (25484)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25479)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25483)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25482)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25485)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25480)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.40 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.40 % (25481)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.40 % (25482)Instruction limit reached!
% 0.19/0.40 % (25482)------------------------------
% 0.19/0.40 % (25482)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.40 % (25482)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.40 % (25482)Termination reason: Time limit
% 0.19/0.40 % (25482)Termination phase: Property scanning
% 0.19/0.40
% 0.19/0.40 % (25482)Memory used [KB]: 859
% 0.19/0.40 % (25482)Time elapsed: 0.003 s
% 0.19/0.40 % (25482)Instructions burned: 3 (million)
% 0.19/0.40 % (25484)Instruction limit reached!
% 0.19/0.40 % (25484)------------------------------
% 0.19/0.40 % (25484)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.40 % (25484)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.40 % (25484)Termination reason: Time limit
% 0.19/0.40 % (25484)Termination phase: Saturation
% 0.19/0.40
% 0.19/0.40 % (25484)Memory used [KB]: 1111
% 0.19/0.40 % (25484)Time elapsed: 0.010 s
% 0.19/0.40 % (25484)Instructions burned: 15 (million)
% 0.19/0.40 % (25481)Instruction limit reached!
% 0.19/0.40 % (25481)------------------------------
% 0.19/0.40 % (25481)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.40 % (25481)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.40 % (25481)Termination reason: Time limit
% 0.19/0.40 % (25481)Termination phase: Clausification
% 0.19/0.40
% 0.19/0.40 % (25481)Memory used [KB]: 1083
% 0.19/0.40 % (25481)Time elapsed: 0.006 s
% 0.19/0.40 % (25481)Instructions burned: 9 (million)
% 0.19/0.42 % (25485)First to succeed.
% 0.19/0.42 % (25485)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25478"
% 0.19/0.42 % (25480)Instruction limit reached!
% 0.19/0.42 % (25480)------------------------------
% 0.19/0.42 % (25480)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.42 % (25480)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.42 % (25480)Termination reason: Time limit
% 0.19/0.42 % (25480)Termination phase: Saturation
% 0.19/0.42
% 0.19/0.42 % (25480)Memory used [KB]: 1490
% 0.19/0.42 % (25480)Time elapsed: 0.021 s
% 0.19/0.42 % (25480)Instructions burned: 34 (million)
% 0.19/0.42 % (25478)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.42 % (25485)Refutation found. Thanks to Tanya!
% 0.19/0.42 % SZS status Theorem for theBenchmark
% 0.19/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.42 % (25485)------------------------------
% 0.19/0.42 % (25485)Version: Vampire 4.9 (commit 18c118a85 on 2024-06-08 21:14:20 +0100)
% 0.19/0.42 % (25485)Linked with Z3 4.12.3.0 79bbbf76d0c123481c8ca05cd3a98939270074d3 z3-4.8.4-7980-g79bbbf76d
% 0.19/0.42 % (25485)Termination reason: Refutation
% 0.19/0.42
% 0.19/0.42 % (25485)Memory used [KB]: 1357
% 0.19/0.42 % (25485)Time elapsed: 0.019 s
% 0.19/0.42 % (25485)Instructions burned: 35 (million)
% 0.19/0.42 % (25485)------------------------------
% 0.19/0.42 % (25485)------------------------------
% 0.19/0.42 % (25478)Success in time 0.074 s
%------------------------------------------------------------------------------