TSTP Solution File: SWW626_2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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 : Tue May 21 07:27:33 EDT 2024
% Result : Theorem 157.05s 22.83s
% Output : Refutation 157.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 81
% Syntax : Number of formulae : 122 ( 24 unt; 69 typ; 0 def)
% Number of atoms : 470 ( 68 equ)
% Maximal formula atoms : 58 ( 8 avg)
% Number of connectives : 605 ( 188 ~; 62 |; 272 &)
% ( 0 <=>; 83 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 452 ( 92 atm; 116 fun; 236 num; 8 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 102 ( 48 >; 54 *; 0 +; 0 <<)
% Number of predicates : 18 ( 14 usr; 1 prp; 0-4 aty)
% Number of functors : 55 ( 49 usr; 18 con; 0-5 aty)
% Number of variables : 214 ( 170 !; 44 ?; 214 :)
% 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,
sK8: $int ).
tff(func_def_39,type,
sK9: list_elt ).
tff(func_def_40,type,
sK10: list_elt ).
tff(func_def_41,type,
sK11: list_elt ).
tff(func_def_42,type,
sK12: list_elt ).
tff(func_def_43,type,
sK13: list_elt ).
tff(func_def_44,type,
sK14: list_elt > elt ).
tff(func_def_45,type,
sK15: list_elt > elt ).
tff(func_def_46,type,
sK16: list_elt > list_elt ).
tff(func_def_47,type,
sK17: list_elt > elt ).
tff(func_def_48,type,
sK18: ( list_elt * list_elt ) > elt ).
tff(func_def_49,type,
sK19: ( list_elt * list_elt ) > elt ).
tff(func_def_50,type,
sK20: ( list_elt * elt ) > elt ).
tff(func_def_51,type,
sK21: ( list_elt * list_elt ) > elt ).
tff(func_def_52,type,
sK22: ( list_elt * list_elt ) > elt ).
tff(func_def_53,type,
sK23: ( list_elt * elt ) > elt ).
tff(func_def_54,type,
sK24: ( ty * uni * uni ) > uni ).
tff(func_def_55,type,
sK25: ( uni * uni * ty ) > uni ).
tff(func_def_56,type,
sK26: ( uni * uni * ty ) > uni ).
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(pred_def_8,type,
sP0: list_elt > $o ).
tff(pred_def_9,type,
sP1: ( uni * uni * ty * uni ) > $o ).
tff(pred_def_10,type,
sP2: ( uni * ty * uni * uni ) > $o ).
tff(pred_def_11,type,
sP3: ( uni * ty ) > $o ).
tff(pred_def_12,type,
sP4: ( list_elt * list_elt ) > $o ).
tff(pred_def_13,type,
sP5: ( list_elt * list_elt ) > $o ).
tff(pred_def_14,type,
sP6: ( list_elt * elt ) > $o ).
tff(pred_def_15,type,
sP7: ( uni * uni * ty ) > $o ).
tff(pred_def_16,type,
sP27: ( elt * list_elt ) > $o ).
tff(f1088538,plain,
$false,
inference(subsumption_resolution,[],[f1088537,f433160]) ).
tff(f433160,plain,
~ permut(elt1,prefix(elt1,sK8,t2tb(sK9)),infix_plpl(elt1,t2tb(sK11),t2tb(sK12))),
inference(unit_resulting_resolution,[],[f2695,f97563,f520]) ).
tff(f520,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] :
( ~ permut(X0,X2,X3)
| permut(X0,X1,X3)
| ~ permut(X0,X1,X2) ),
inference(cnf_transformation,[],[f284]) ).
tff(f284,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(flattening,[],[f283]) ).
tff(f283,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f219]) ).
tff(f219,plain,
! [X0: ty,X1: uni,X2: uni,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/sandbox/benchmark/theBenchmark.p',permut_trans) ).
tff(f97563,plain,
permut(elt1,infix_plpl(elt1,t2tb(sK11),t2tb(sK12)),t2tb(sK13)),
inference(forward_demodulation,[],[f97562,f419]) ).
tff(f419,plain,
! [X0: ty,X1: uni] : ( infix_plpl(X0,nil(X0),X1) = X1 ),
inference(cnf_transformation,[],[f163]) ).
tff(f163,plain,
! [X0: ty,X1: uni] :
( ! [X2: uni,X3: uni] : ( infix_plpl(X0,cons(X0,X2,X3),X1) = cons(X0,X2,infix_plpl(X0,X3,X1)) )
& ( infix_plpl(X0,nil(X0),X1) = X1 ) ),
inference(rectify,[],[f24]) ).
tff(f24,axiom,
! [X0: ty,X13: uni] :
( ! [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/sandbox/benchmark/theBenchmark.p',infix_plpl_def) ).
tff(f97562,plain,
permut(elt1,infix_plpl(elt1,nil(elt1),infix_plpl(elt1,t2tb(sK11),t2tb(sK12))),t2tb(sK13)),
inference(forward_demodulation,[],[f97556,f510]) ).
tff(f510,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] : ( infix_plpl(X0,X1,infix_plpl(X0,X2,X3)) = infix_plpl(X0,infix_plpl(X0,X1,X2),X3) ),
inference(cnf_transformation,[],[f209]) ).
tff(f209,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] : ( infix_plpl(X0,X1,infix_plpl(X0,X2,X3)) = infix_plpl(X0,infix_plpl(X0,X1,X2),X3) ),
inference(rectify,[],[f25]) ).
tff(f25,axiom,
! [X0: ty,X14: uni,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/sandbox/benchmark/theBenchmark.p',append_assoc) ).
tff(f97556,plain,
permut(elt1,infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)),t2tb(sK13)),
inference(unit_resulting_resolution,[],[f379,f498]) ).
tff(f498,plain,
! [X2: uni,X0: ty,X1: uni] :
( ~ permut(X0,X1,X2)
| permut(X0,X2,X1) ),
inference(cnf_transformation,[],[f270]) ).
tff(f270,plain,
! [X0: ty,X1: uni,X2: uni] :
( permut(X0,X2,X1)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f200]) ).
tff(f200,plain,
! [X0: ty,X1: uni,X2: uni] :
( permut(X0,X1,X2)
=> permut(X0,X2,X1) ),
inference(rectify,[],[f44]) ).
tff(f44,axiom,
! [X0: ty,X14: uni,X13: uni] :
( permut(X0,X14,X13)
=> permut(X0,X13,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',permut_sym) ).
tff(f379,plain,
permut(elt1,t2tb(sK13),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12))),
inference(cnf_transformation,[],[f311]) ).
tff(f311,plain,
( ~ permut(elt1,t2tb(sK13),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(sK13),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(sK13))))
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(sK12))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK11))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(sK12)
& sorted(sK11)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(sK12)
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(sK11),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(sK11)
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),2)
& ( tb2t(prefix(elt1,sK8,t2tb(sK9))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))) )
& ( sK9 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),t2tb(sK10))) )
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),0)
& ( 0 != 2 )
& ( 3 != sK8 )
& ( 2 != sK8 )
& ~ $less(length(elt1,t2tb(sK9)),sK8)
& ~ $less(sK8,2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11,sK12,sK13])],[f305,f310,f309,f308,f307,f306]) ).
tff(f306,plain,
( ? [X0: $int,X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,X0,t2tb(X1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X0,$uminus(div(X0,2))))
& ~ $less($sum(X0,$uminus(div(X0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(X0,2),t2tb(X1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),2)
& ( tb2t(prefix(elt1,X0,t2tb(X1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))) )
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),t2tb(X2))) = X1 ) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),0)
& ( 0 != 2 )
& ( 3 != X0 )
& ( 2 != X0 )
& ~ $less(length(elt1,t2tb(X1)),X0)
& ~ $less(X0,2) )
=> ( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),2)
& ( tb2t(prefix(elt1,sK8,t2tb(sK9))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(X2)))) )
& ( sK9 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),t2tb(X2))) ) )
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),0)
& ( 0 != 2 )
& ( 3 != sK8 )
& ( 2 != sK8 )
& ~ $less(length(elt1,t2tb(sK9)),sK8)
& ~ $less(sK8,2) ) ),
introduced(choice_axiom,[]) ).
tff(f307,plain,
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),2)
& ( tb2t(prefix(elt1,sK8,t2tb(sK9))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(X2)))) )
& ( sK9 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),t2tb(X2))) ) )
=> ( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK9)),div(sK8,2))
& ~ $less(div(sK8,2),2)
& ( tb2t(prefix(elt1,sK8,t2tb(sK9))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))) )
& ( sK9 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),t2tb(sK10))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f308,plain,
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(X3) )
=> ( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X9: elt,X8: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK11))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(sK11)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK10)),$sum(sK8,$uminus(div(sK8,2))))
& ~ $less($sum(sK8,$uminus(div(sK8,2))),2)
& permut(elt1,t2tb(sK11),prefix(elt1,div(sK8,2),t2tb(sK9)))
& sorted(sK11) ) ),
introduced(choice_axiom,[]) ).
tff(f309,plain,
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X9: elt,X8: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK11))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(sK11)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(X4) )
=> ( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X7: elt,X6: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(sK12))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X9: elt,X8: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK11))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(sK12)
& sorted(sK11)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))
& sorted(sK12) ) ),
introduced(choice_axiom,[]) ).
tff(f310,plain,
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK8,t2tb(sK9)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK11)),t2tb(sK12)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
=> ( ~ permut(elt1,t2tb(sK13),prefix(elt1,sK8,t2tb(sK9)))
& 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(f305,plain,
? [X0: $int,X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,X0,t2tb(X1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(X4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(X3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X0,$uminus(div(X0,2))))
& ~ $less($sum(X0,$uminus(div(X0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(X0,2),t2tb(X1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),2)
& ( tb2t(prefix(elt1,X0,t2tb(X1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))) )
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),t2tb(X2))) = X1 ) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),0)
& ( 0 != 2 )
& ( 3 != X0 )
& ( 2 != X0 )
& ~ $less(length(elt1,t2tb(X1)),X0)
& ~ $less(X0,2) ),
inference(rectify,[],[f226]) ).
tff(f226,plain,
? [X0: $int,X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X9: list_elt] :
( ~ permut(elt1,t2tb(X9),prefix(elt1,X0,t2tb(X1)))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X9)))) )
& ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X6),t2tb(X4))
| ~ mem(elt1,t2tb1(X5),nil(elt1)) )
& ! [X7: elt,X8: elt] :
( le(X7,X8)
| ~ mem(elt1,t2tb1(X8),t2tb(X3))
| ~ mem(elt1,t2tb1(X7),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X0,$uminus(div(X0,2))))
& ~ $less($sum(X0,$uminus(div(X0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(X0,2),t2tb(X1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),2)
& ( tb2t(prefix(elt1,X0,t2tb(X1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))) )
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),t2tb(X2))) = X1 ) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),0)
& ( 0 != 2 )
& ( 3 != X0 )
& ( 2 != X0 )
& ~ $less(length(elt1,t2tb(X1)),X0)
& ~ $less(X0,2) ),
inference(flattening,[],[f225]) ).
tff(f225,plain,
? [X0: $int,X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X9: list_elt] :
( ~ permut(elt1,t2tb(X9),prefix(elt1,X0,t2tb(X1)))
& permut(elt1,t2tb(X9),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(X3)),t2tb(X4)))
& sorted(tb2t(reverse(elt1,t2tb(X9)))) )
& ! [X5: elt,X6: elt] :
( le(X5,X6)
| ~ mem(elt1,t2tb1(X6),t2tb(X4))
| ~ mem(elt1,t2tb1(X5),nil(elt1)) )
& ! [X7: elt,X8: elt] :
( le(X7,X8)
| ~ mem(elt1,t2tb1(X8),t2tb(X3))
| ~ mem(elt1,t2tb1(X7),nil(elt1)) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(X0,$uminus(div(X0,2))))
& ~ $less($sum(X0,$uminus(div(X0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(X0,2),t2tb(X1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),2)
& ( tb2t(prefix(elt1,X0,t2tb(X1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))) )
& ( tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),t2tb(X2))) = X1 ) )
& ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),0)
& ( 0 != 2 )
& ( 3 != X0 )
& ( 2 != X0 )
& ~ $less(length(elt1,t2tb(X1)),X0)
& ~ $less(X0,2) ),
inference(ennf_transformation,[],[f140]) ).
tff(f140,plain,
~ ! [X0: $int,X1: list_elt] :
( ( ~ $less(length(elt1,t2tb(X1)),X0)
& ~ $less(X0,2) )
=> ( ( 2 != X0 )
=> ( ( 3 != X0 )
=> ( ( 0 != 2 )
=> ( ( ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),0) )
=> ! [X2: list_elt] :
( ( tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),t2tb(X2))) = X1 )
=> ( ( tb2t(prefix(elt1,X0,t2tb(X1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(X0,2),t2tb(X1)),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))) )
=> ( ( ~ $less(length(elt1,t2tb(X1)),div(X0,2))
& ~ $less(div(X0,2),2) )
=> ! [X3: list_elt] :
( ( permut(elt1,t2tb(X3),prefix(elt1,div(X0,2),t2tb(X1)))
& sorted(X3) )
=> ( ( ~ $less(length(elt1,t2tb(X2)),$sum(X0,$uminus(div(X0,2))))
& ~ $less($sum(X0,$uminus(div(X0,2))),2) )
=> ! [X4: list_elt] :
( ( permut(elt1,t2tb(X4),prefix(elt1,$sum(X0,$uminus(div(X0,2))),t2tb(X2)))
& sorted(X4) )
=> ( ( ! [X5: elt,X6: elt] :
( mem(elt1,t2tb1(X5),nil(elt1))
=> ( mem(elt1,t2tb1(X6),t2tb(X4))
=> le(X5,X6) ) )
& ! [X7: elt,X8: elt] :
( mem(elt1,t2tb1(X7),nil(elt1))
=> ( mem(elt1,t2tb1(X8),t2tb(X3))
=> le(X7,X8) ) )
& sorted(X4)
& sorted(X3)
& sorted(tb2t(reverse(elt1,nil(elt1)))) )
=> ! [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,X0,t2tb(X1))) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f103]) ).
tff(f103,plain,
~ ! [X24: $int,X12: list_elt] :
( ( ~ $less(length(elt1,t2tb(X12)),X24)
& ~ $less(X24,2) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( ~ $less(length(elt1,t2tb(X12)),div(X24,2))
& ~ $less(div(X24,2),0) )
=> ! [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] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$sum(X24,$uminus(div(X24,2))),t2tb(X13)))
& sorted(X26) )
=> ( ( ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& sorted(X26)
& sorted(X25)
& 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,
~ ! [X24: $int,X12: list_elt] :
( ( $lesseq(X24,length(elt1,t2tb(X12)))
& $lesseq(2,X24) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( $lesseq(div(X24,2),length(elt1,t2tb(X12)))
& $lesseq(0,div(X24,2)) )
=> ! [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] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))
& sorted(X26) )
=> ( ( ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& sorted(X26)
& sorted(X25)
& 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,
! [X24: $int,X12: list_elt] :
( ( $lesseq(X24,length(elt1,t2tb(X12)))
& $lesseq(2,X24) )
=> ( ( 2 != X24 )
=> ( ( 3 != X24 )
=> ( ( 0 != 2 )
=> ( ( $lesseq(div(X24,2),length(elt1,t2tb(X12)))
& $lesseq(0,div(X24,2)) )
=> ! [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] :
( ( permut(elt1,t2tb(X26),prefix(elt1,$difference(X24,div(X24,2)),t2tb(X13)))
& sorted(X26) )
=> ( ( ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X26))
=> le(X1,X7) ) )
& ! [X1: elt,X7: elt] :
( mem(elt1,t2tb1(X1),nil(elt1))
=> ( mem(elt1,t2tb1(X7),t2tb(X25))
=> le(X1,X7) ) )
& sorted(X26)
& sorted(X25)
& 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/sandbox/benchmark/theBenchmark.p',wP_parameter_rev_sort) ).
tff(f2695,plain,
~ permut(elt1,prefix(elt1,sK8,t2tb(sK9)),t2tb(sK13)),
inference(unit_resulting_resolution,[],[f380,f498]) ).
tff(f380,plain,
~ permut(elt1,t2tb(sK13),prefix(elt1,sK8,t2tb(sK9))),
inference(cnf_transformation,[],[f311]) ).
tff(f1088537,plain,
permut(elt1,prefix(elt1,sK8,t2tb(sK9)),infix_plpl(elt1,t2tb(sK11),t2tb(sK12))),
inference(forward_demodulation,[],[f1088503,f196894]) ).
tff(f196894,plain,
prefix(elt1,sK8,t2tb(sK9)) = infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10))),
inference(forward_demodulation,[],[f196893,f391]) ).
tff(f391,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(cnf_transformation,[],[f148]) ).
tff(f148,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(rectify,[],[f59]) ).
tff(f59,axiom,
! [X19: uni] : ( t2tb(tb2t(X19)) = X19 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bridgeR) ).
tff(f196893,plain,
infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10))) = t2tb(tb2t(prefix(elt1,sK8,t2tb(sK9)))),
inference(superposition,[],[f391,f364]) ).
tff(f364,plain,
tb2t(prefix(elt1,sK8,t2tb(sK9))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)))),
inference(cnf_transformation,[],[f311]) ).
tff(f1088503,plain,
permut(elt1,infix_plpl(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10))),infix_plpl(elt1,t2tb(sK11),t2tb(sK12))),
inference(unit_resulting_resolution,[],[f19130,f96266,f526]) ).
tff(f526,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni,X4: uni] :
( ~ permut(X0,X2,X4)
| permut(X0,infix_plpl(X0,X1,X2),infix_plpl(X0,X3,X4))
| ~ permut(X0,X1,X3) ),
inference(cnf_transformation,[],[f288]) ).
tff(f288,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni,X4: uni] :
( permut(X0,infix_plpl(X0,X1,X2),infix_plpl(X0,X3,X4))
| ~ permut(X0,X2,X4)
| ~ permut(X0,X1,X3) ),
inference(flattening,[],[f287]) ).
tff(f287,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni,X4: uni] :
( permut(X0,infix_plpl(X0,X1,X2),infix_plpl(X0,X3,X4))
| ~ permut(X0,X2,X4)
| ~ permut(X0,X1,X3) ),
inference(ennf_transformation,[],[f223]) ).
tff(f223,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni,X4: uni] :
( permut(X0,X1,X3)
=> ( permut(X0,X2,X4)
=> permut(X0,infix_plpl(X0,X1,X2),infix_plpl(X0,X3,X4)) ) ),
inference(rectify,[],[f50]) ).
tff(f50,axiom,
! [X0: ty,X14: uni,X13: uni,X16: 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/sandbox/benchmark/theBenchmark.p',permut_append) ).
tff(f96266,plain,
permut(elt1,prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10)),t2tb(sK12)),
inference(unit_resulting_resolution,[],[f372,f498]) ).
tff(f372,plain,
permut(elt1,t2tb(sK12),prefix(elt1,$sum(sK8,$uminus(div(sK8,2))),t2tb(sK10))),
inference(cnf_transformation,[],[f311]) ).
tff(f19130,plain,
permut(elt1,prefix(elt1,div(sK8,2),t2tb(sK9)),t2tb(sK11)),
inference(unit_resulting_resolution,[],[f368,f498]) ).
tff(f368,plain,
permut(elt1,t2tb(sK11),prefix(elt1,div(sK8,2),t2tb(sK9))),
inference(cnf_transformation,[],[f311]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.33 % Computer : n007.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 : Sat May 18 20:53:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 % (23018)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.35 % (23023)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.12/0.35 % (23021)WARNING: value z3 for option sas not known
% 0.12/0.35 % (23024)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.12/0.35 % (23019)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.12/0.35 % (23020)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.12/0.35 % (23022)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.12/0.35 % (23021)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.35 % (23025)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.12/0.36 % (23020)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23019)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23019)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23019)------------------------------
% 0.12/0.36 % (23019)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23019)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23019)Memory used [KB]: 1028
% 0.12/0.36 % (23019)Time elapsed: 0.007 s
% 0.12/0.36 % (23019)Instructions burned: 15 (million)
% 0.12/0.36 % (23020)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23020)------------------------------
% 0.12/0.36 % (23020)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23020)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23020)Memory used [KB]: 1028
% 0.12/0.36 % (23020)Time elapsed: 0.008 s
% 0.12/0.36 % (23020)Instructions burned: 15 (million)
% 0.12/0.36 % (23019)------------------------------
% 0.12/0.36 % (23019)------------------------------
% 0.12/0.36 % (23020)------------------------------
% 0.12/0.36 % (23020)------------------------------
% 0.12/0.36 % (23022)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.36 % (23022)Terminated due to inappropriate strategy.
% 0.12/0.36 % (23022)------------------------------
% 0.12/0.36 % (23022)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (23022)Termination reason: Inappropriate
% 0.12/0.36
% 0.12/0.36 % (23022)Memory used [KB]: 1030
% 0.12/0.36 % (23022)Time elapsed: 0.008 s
% 0.12/0.36 % (23022)Instructions burned: 15 (million)
% 0.12/0.36 % (23022)------------------------------
% 0.12/0.36 % (23022)------------------------------
% 0.12/0.37 % (23026)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.12/0.37 % (23027)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.12/0.37 % (23028)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.12/0.38 % (23026)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.12/0.38 % (23026)Terminated due to inappropriate strategy.
% 0.12/0.38 % (23026)------------------------------
% 0.12/0.38 % (23026)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.38 % (23026)Termination reason: Inappropriate
% 0.12/0.38
% 0.12/0.38 % (23026)Memory used [KB]: 1030
% 0.12/0.38 % (23026)Time elapsed: 0.007 s
% 0.12/0.38 % (23026)Instructions burned: 14 (million)
% 0.12/0.38 % (23026)------------------------------
% 0.12/0.38 % (23026)------------------------------
% 0.18/0.39 % (23029)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on theBenchmark for (354ds/0Mi)
% 156.58/22.80 % (23025)First to succeed.
% 156.58/22.81 % (23025)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23018"
% 157.05/22.83 % (23025)Refutation found. Thanks to Tanya!
% 157.05/22.83 % SZS status Theorem for theBenchmark
% 157.05/22.83 % SZS output start Proof for theBenchmark
% See solution above
% 157.05/22.83 % (23025)------------------------------
% 157.05/22.83 % (23025)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 157.05/22.83 % (23025)Termination reason: Refutation
% 157.05/22.83
% 157.05/22.83 % (23025)Memory used [KB]: 185351
% 157.05/22.83 % (23025)Time elapsed: 22.463 s
% 157.05/22.83 % (23025)Instructions burned: 45804 (million)
% 157.05/22.83 % (23018)Success in time 22.483 s
%------------------------------------------------------------------------------