TSTP Solution File: SWW626_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.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:01:50 EDT 2024
% Result : Theorem 1.10s 0.98s
% Output : Refutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 112
% Syntax : Number of formulae : 163 ( 45 unt; 84 typ; 0 def)
% Number of atoms : 504 ( 88 equ)
% Maximal formula atoms : 58 ( 6 avg)
% Number of connectives : 620 ( 195 ~; 70 |; 272 &)
% ( 0 <=>; 83 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 5 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 439 ( 92 atm; 110 fun; 229 num; 8 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 77 ( 38 >; 39 *; 0 +; 0 <<)
% Number of predicates : 9 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 79 ( 73 usr; 43 con; 0-5 aty)
% Number of variables : 208 ( 164 !; 44 ?; 208 :)
% 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: $int ).
tff(func_def_39,type,
sK1: list_elt ).
tff(func_def_40,type,
sK2: list_elt ).
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 * list_elt ) > elt ).
tff(func_def_45,type,
sK7: ( list_elt * list_elt ) > elt ).
tff(func_def_46,type,
sK8: ( list_elt * elt ) > elt ).
tff(func_def_47,type,
sK9: ( list_elt * list_elt ) > elt ).
tff(func_def_48,type,
sK10: ( list_elt * list_elt ) > elt ).
tff(func_def_49,type,
sK11: ( elt * list_elt ) > elt ).
tff(func_def_50,type,
sK12: ( ty * uni * uni ) > uni ).
tff(func_def_51,type,
sK13: ( ty * uni * uni ) > uni ).
tff(func_def_52,type,
sK14: list_elt > elt ).
tff(func_def_53,type,
sK15: list_elt > elt ).
tff(func_def_54,type,
sK16: list_elt > list_elt ).
tff(func_def_55,type,
sK17: list_elt > elt ).
tff(func_def_56,type,
sF18: uni ).
tff(func_def_57,type,
sF19: uni ).
tff(func_def_58,type,
sF20: uni ).
tff(func_def_59,type,
sF21: uni ).
tff(func_def_60,type,
sF22: uni ).
tff(func_def_61,type,
sF23: uni ).
tff(func_def_62,type,
sF24: uni ).
tff(func_def_63,type,
sF25: uni ).
tff(func_def_64,type,
sF26: uni ).
tff(func_def_65,type,
sF27: list_elt ).
tff(func_def_66,type,
sF28: uni ).
tff(func_def_67,type,
sF29: list_elt ).
tff(func_def_68,type,
sF30: $int ).
tff(func_def_69,type,
sF31: $int ).
tff(func_def_70,type,
sF32: $int ).
tff(func_def_71,type,
sF33: uni ).
tff(func_def_72,type,
sF34: uni ).
tff(func_def_73,type,
sF35: $int ).
tff(func_def_74,type,
sF36: uni ).
tff(func_def_75,type,
sF37: $int ).
tff(func_def_76,type,
sF38: list_elt ).
tff(func_def_77,type,
sF39: uni ).
tff(func_def_78,type,
sF40: list_elt ).
tff(func_def_79,type,
sF41: uni ).
tff(func_def_80,type,
sF42: 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(f3920,plain,
$false,
inference(subsumption_resolution,[],[f3919,f409]) ).
tff(f409,plain,
~ permut(elt1,sF18,sF20),
inference(definition_folding,[],[f304,f408,f407,f406]) ).
tff(f406,plain,
t2tb(sK5) = sF18,
introduced(function_definition,[new_symbols(definition,[sF18])]) ).
tff(f407,plain,
t2tb(sK1) = sF19,
introduced(function_definition,[new_symbols(definition,[sF19])]) ).
tff(f408,plain,
prefix(elt1,sK0,sF19) = sF20,
introduced(function_definition,[new_symbols(definition,[sF20])]) ).
tff(f304,plain,
~ permut(elt1,t2tb(sK5),prefix(elt1,sK0,t2tb(sK1))),
inference(cnf_transformation,[],[f252]) ).
tff(f252,plain,
( ~ permut(elt1,t2tb(sK5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(sK5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),t2tb(sK4)))
& sorted(tb2t(reverse(elt1,t2tb(sK5))))
& ! [X6: elt,X7: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(sK4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X8: elt,X9: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(sK4)
& sorted(sK3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(sK4),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(sK4)
& ~ $less(length(elt1,t2tb(sK2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(sK3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(sK3)
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),2)
& ( tb2t(prefix(elt1,sK0,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))) )
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),t2tb(sK2))) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),0)
& ( 0 != 2 )
& ( 3 != sK0 )
& ( 2 != sK0 )
& ~ $less(length(elt1,t2tb(sK1)),sK0)
& ~ $less(sK0,2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f246,f251,f250,f249,f248,f247]) ).
tff(f247,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,sK0,t2tb(sK1)))
& 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(sK0,$uminus(div(sK0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),2)
& ( tb2t(prefix(elt1,sK0,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(X2)))) )
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),t2tb(X2))) ) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),0)
& ( 0 != 2 )
& ( 3 != sK0 )
& ( 2 != sK0 )
& ~ $less(length(elt1,t2tb(sK1)),sK0)
& ~ $less(sK0,2) ) ),
introduced(choice_axiom,[]) ).
tff(f248,plain,
( ? [X2: list_elt] :
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& 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(sK0,$uminus(div(sK0,2))),t2tb(X2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(X2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),2)
& ( tb2t(prefix(elt1,sK0,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(X2)))) )
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),t2tb(X2))) ) )
=> ( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& 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(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(X3) )
& ~ $less(length(elt1,t2tb(sK1)),div(sK0,2))
& ~ $less(div(sK0,2),2)
& ( tb2t(prefix(elt1,sK0,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))) )
& ( sK1 = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),t2tb(sK2))) ) ) ),
introduced(choice_axiom,[]) ).
tff(f249,plain,
( ? [X3: list_elt] :
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& 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(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(X3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(X3) )
=> ( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),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(sK3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(sK3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(X4) )
& ~ $less(length(elt1,t2tb(sK2)),$sum(sK0,$uminus(div(sK0,2))))
& ~ $less($sum(sK0,$uminus(div(sK0,2))),2)
& permut(elt1,t2tb(sK3),prefix(elt1,div(sK0,2),t2tb(sK1)))
& sorted(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f250,plain,
( ? [X4: list_elt] :
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),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(sK3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(X4)
& sorted(sK3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(X4),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(X4) )
=> ( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),t2tb(sK4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
& ! [X7: elt,X6: elt] :
( le(X6,X7)
| ~ mem(elt1,t2tb1(X7),t2tb(sK4))
| ~ mem(elt1,t2tb1(X6),nil(elt1)) )
& ! [X9: elt,X8: elt] :
( le(X8,X9)
| ~ mem(elt1,t2tb1(X9),t2tb(sK3))
| ~ mem(elt1,t2tb1(X8),nil(elt1)) )
& sorted(sK4)
& sorted(sK3)
& sorted(tb2t(reverse(elt1,nil(elt1))))
& permut(elt1,t2tb(sK4),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))
& sorted(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f251,plain,
( ? [X5: list_elt] :
( ~ permut(elt1,t2tb(X5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(X5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),t2tb(sK4)))
& sorted(tb2t(reverse(elt1,t2tb(X5)))) )
=> ( ~ permut(elt1,t2tb(sK5),prefix(elt1,sK0,t2tb(sK1)))
& permut(elt1,t2tb(sK5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),t2tb(sK4)))
& sorted(tb2t(reverse(elt1,t2tb(sK5)))) ) ),
introduced(choice_axiom,[]) ).
tff(f246,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,[],[f200]) ).
tff(f200,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,[],[f199]) ).
tff(f199,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,[],[f121]) ).
tff(f121,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/sandbox2/benchmark/theBenchmark.p',wP_parameter_rev_sort) ).
tff(f3919,plain,
permut(elt1,sF18,sF20),
inference(resolution,[],[f3821,f342]) ).
tff(f342,plain,
! [X2: uni,X0: ty,X1: uni] :
( ~ permut(X0,X1,X2)
| permut(X0,X2,X1) ),
inference(cnf_transformation,[],[f219]) ).
tff(f219,plain,
! [X0: ty,X1: uni,X2: uni] :
( permut(X0,X2,X1)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f158]) ).
tff(f158,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/sandbox2/benchmark/theBenchmark.p',permut_sym) ).
tff(f3821,plain,
permut(elt1,sF20,sF18),
inference(resolution,[],[f3796,f1349]) ).
tff(f1349,plain,
! [X0: uni] :
( ~ permut(elt1,X0,sF25)
| permut(elt1,X0,sF18) ),
inference(resolution,[],[f341,f574]) ).
tff(f574,plain,
permut(elt1,sF25,sF18),
inference(resolution,[],[f342,f415]) ).
tff(f415,plain,
permut(elt1,sF18,sF25),
inference(definition_folding,[],[f303,f414,f413,f412,f411,f410,f406]) ).
tff(f410,plain,
nil(elt1) = sF21,
introduced(function_definition,[new_symbols(definition,[sF21])]) ).
tff(f411,plain,
t2tb(sK3) = sF22,
introduced(function_definition,[new_symbols(definition,[sF22])]) ).
tff(f412,plain,
infix_plpl(elt1,sF21,sF22) = sF23,
introduced(function_definition,[new_symbols(definition,[sF23])]) ).
tff(f413,plain,
t2tb(sK4) = sF24,
introduced(function_definition,[new_symbols(definition,[sF24])]) ).
tff(f414,plain,
infix_plpl(elt1,sF23,sF24) = sF25,
introduced(function_definition,[new_symbols(definition,[sF25])]) ).
tff(f303,plain,
permut(elt1,t2tb(sK5),infix_plpl(elt1,infix_plpl(elt1,nil(elt1),t2tb(sK3)),t2tb(sK4))),
inference(cnf_transformation,[],[f252]) ).
tff(f341,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] :
( ~ permut(X0,X2,X3)
| permut(X0,X1,X3)
| ~ permut(X0,X1,X2) ),
inference(cnf_transformation,[],[f218]) ).
tff(f218,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(flattening,[],[f217]) ).
tff(f217,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f157]) ).
tff(f157,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/sandbox2/benchmark/theBenchmark.p',permut_trans) ).
tff(f3796,plain,
permut(elt1,sF20,sF25),
inference(subsumption_resolution,[],[f3795,f576]) ).
tff(f576,plain,
permut(elt1,sF36,sF22),
inference(resolution,[],[f342,f434]) ).
tff(f434,plain,
permut(elt1,sF22,sF36),
inference(definition_folding,[],[f292,f433,f407,f424,f411]) ).
tff(f424,plain,
div(sK0,2) = sF30,
introduced(function_definition,[new_symbols(definition,[sF30])]) ).
tff(f433,plain,
prefix(elt1,sF30,sF19) = sF36,
introduced(function_definition,[new_symbols(definition,[sF36])]) ).
tff(f292,plain,
permut(elt1,t2tb(sK3),prefix(elt1,div(sK0,2),t2tb(sK1))),
inference(cnf_transformation,[],[f252]) ).
tff(f3795,plain,
( permut(elt1,sF20,sF25)
| ~ permut(elt1,sF36,sF22) ),
inference(subsumption_resolution,[],[f3779,f575]) ).
tff(f575,plain,
permut(elt1,sF34,sF24),
inference(resolution,[],[f342,f429]) ).
tff(f429,plain,
permut(elt1,sF24,sF34),
inference(definition_folding,[],[f296,f428,f427,f426,f425,f424,f413]) ).
tff(f425,plain,
$uminus(sF30) = sF31,
introduced(function_definition,[new_symbols(definition,[sF31])]) ).
tff(f426,plain,
$sum(sK0,sF31) = sF32,
introduced(function_definition,[new_symbols(definition,[sF32])]) ).
tff(f427,plain,
t2tb(sK2) = sF33,
introduced(function_definition,[new_symbols(definition,[sF33])]) ).
tff(f428,plain,
prefix(elt1,sF32,sF33) = sF34,
introduced(function_definition,[new_symbols(definition,[sF34])]) ).
tff(f296,plain,
permut(elt1,t2tb(sK4),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2))),
inference(cnf_transformation,[],[f252]) ).
tff(f3779,plain,
( permut(elt1,sF20,sF25)
| ~ permut(elt1,sF34,sF24)
| ~ permut(elt1,sF36,sF22) ),
inference(superposition,[],[f2123,f544]) ).
tff(f544,plain,
sF25 = infix_plpl(elt1,sF22,sF24),
inference(superposition,[],[f414,f540]) ).
tff(f540,plain,
sF22 = sF23,
inference(superposition,[],[f537,f412]) ).
tff(f537,plain,
! [X0: uni] : ( infix_plpl(elt1,sF21,X0) = X0 ),
inference(superposition,[],[f358,f410]) ).
tff(f358,plain,
! [X0: ty,X1: uni] : ( infix_plpl(X0,nil(X0),X1) = X1 ),
inference(cnf_transformation,[],[f169]) ).
tff(f169,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/sandbox2/benchmark/theBenchmark.p',infix_plpl_def) ).
tff(f2123,plain,
! [X0: uni,X1: uni] :
( permut(elt1,sF20,infix_plpl(elt1,X0,X1))
| ~ permut(elt1,sF34,X1)
| ~ permut(elt1,sF36,X0) ),
inference(forward_demodulation,[],[f2102,f473]) ).
tff(f473,plain,
sF20 = sF39,
inference(forward_demodulation,[],[f472,f466]) ).
tff(f466,plain,
sF20 = t2tb(sF38),
inference(superposition,[],[f379,f438]) ).
tff(f438,plain,
tb2t(sF20) = sF38,
introduced(function_definition,[new_symbols(definition,[sF38])]) ).
tff(f379,plain,
! [X0: uni] : ( t2tb(tb2t(X0)) = X0 ),
inference(cnf_transformation,[],[f184]) ).
tff(f184,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(f472,plain,
sF39 = t2tb(sF38),
inference(forward_demodulation,[],[f469,f441]) ).
tff(f441,plain,
sF38 = sF40,
inference(definition_folding,[],[f288,f440,f439,f428,f427,f426,f425,f424,f433,f407,f424,f438,f408,f407]) ).
tff(f439,plain,
infix_plpl(elt1,sF36,sF34) = sF39,
introduced(function_definition,[new_symbols(definition,[sF39])]) ).
tff(f440,plain,
tb2t(sF39) = sF40,
introduced(function_definition,[new_symbols(definition,[sF40])]) ).
tff(f288,plain,
tb2t(prefix(elt1,sK0,t2tb(sK1))) = tb2t(infix_plpl(elt1,prefix(elt1,div(sK0,2),t2tb(sK1)),prefix(elt1,$sum(sK0,$uminus(div(sK0,2))),t2tb(sK2)))),
inference(cnf_transformation,[],[f252]) ).
tff(f469,plain,
sF39 = t2tb(sF40),
inference(superposition,[],[f379,f440]) ).
tff(f2102,plain,
! [X0: uni,X1: uni] :
( permut(elt1,sF39,infix_plpl(elt1,X0,X1))
| ~ permut(elt1,sF34,X1)
| ~ permut(elt1,sF36,X0) ),
inference(superposition,[],[f336,f439]) ).
tff(f336,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni,X4: uni] :
( permut(X0,infix_plpl(X0,X1,X2),infix_plpl(X0,X3,X4))
| ~ permut(X0,X2,X4)
| ~ permut(X0,X1,X3) ),
inference(cnf_transformation,[],[f215]) ).
tff(f215,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,[],[f214]) ).
tff(f214,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,[],[f152]) ).
tff(f152,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/sandbox2/benchmark/theBenchmark.p',permut_append) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW626_2 : TPTP v8.2.0. Released v6.1.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 20:53:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TF0_THM_EQU_ARI problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.84 % (22250)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.84 % (22255)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.84 % (22251)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.84 % (22252)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.84 % (22253)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.84 % (22256)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.84 % (22254)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.84 % (22257)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.86 % (22250)Instruction limit reached!
% 0.60/0.86 % (22250)------------------------------
% 0.60/0.86 % (22250)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.86 % (22250)Termination reason: Unknown
% 0.60/0.86 % (22250)Termination phase: Saturation
% 0.60/0.86
% 0.60/0.86 % (22250)Memory used [KB]: 1435
% 0.60/0.86 % (22250)Time elapsed: 0.021 s
% 0.60/0.86 % (22250)Instructions burned: 34 (million)
% 0.60/0.86 % (22250)------------------------------
% 0.60/0.86 % (22250)------------------------------
% 0.60/0.86 % (22253)Instruction limit reached!
% 0.60/0.86 % (22253)------------------------------
% 0.60/0.86 % (22253)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.86 % (22253)Termination reason: Unknown
% 0.60/0.86 % (22253)Termination phase: Saturation
% 0.60/0.86 % (22254)Instruction limit reached!
% 0.60/0.86 % (22254)------------------------------
% 0.60/0.86 % (22254)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.86 % (22254)Termination reason: Unknown
% 0.60/0.86 % (22254)Termination phase: Saturation
% 0.60/0.86
% 0.60/0.86 % (22254)Memory used [KB]: 1581
% 0.60/0.86 % (22254)Time elapsed: 0.021 s
% 0.60/0.86 % (22254)Instructions burned: 34 (million)
% 0.60/0.86 % (22254)------------------------------
% 0.60/0.86 % (22254)------------------------------
% 0.60/0.86
% 0.60/0.86 % (22253)Memory used [KB]: 1451
% 0.60/0.86 % (22253)Time elapsed: 0.021 s
% 0.60/0.86 % (22253)Instructions burned: 33 (million)
% 0.60/0.86 % (22253)------------------------------
% 0.60/0.86 % (22253)------------------------------
% 0.73/0.86 % (22261)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.73/0.86 % (22262)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2995ds/50Mi)
% 0.73/0.86 % (22263)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.73/0.86 % (22255)Instruction limit reached!
% 0.73/0.86 % (22255)------------------------------
% 0.73/0.86 % (22255)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.86 % (22255)Termination reason: Unknown
% 0.73/0.86 % (22255)Termination phase: Saturation
% 0.73/0.86
% 0.73/0.86 % (22255)Memory used [KB]: 1613
% 0.73/0.86 % (22255)Time elapsed: 0.026 s
% 0.73/0.86 % (22255)Instructions burned: 45 (million)
% 0.73/0.86 % (22255)------------------------------
% 0.73/0.86 % (22255)------------------------------
% 0.73/0.87 % (22266)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2994ds/52Mi)
% 0.73/0.87 % (22251)Instruction limit reached!
% 0.73/0.87 % (22251)------------------------------
% 0.73/0.87 % (22251)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.87 % (22251)Termination reason: Unknown
% 0.73/0.87 % (22251)Termination phase: Saturation
% 0.73/0.87
% 0.73/0.87 % (22251)Memory used [KB]: 1672
% 0.73/0.87 % (22251)Time elapsed: 0.032 s
% 0.73/0.87 % (22251)Instructions burned: 51 (million)
% 0.73/0.87 % (22251)------------------------------
% 0.73/0.87 % (22251)------------------------------
% 0.73/0.87 % (22257)Instruction limit reached!
% 0.73/0.87 % (22257)------------------------------
% 0.73/0.87 % (22257)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.87 % (22257)Termination reason: Unknown
% 0.73/0.87 % (22257)Termination phase: Saturation
% 0.73/0.87
% 0.73/0.87 % (22257)Memory used [KB]: 1597
% 0.73/0.87 % (22257)Time elapsed: 0.033 s
% 0.73/0.87 % (22257)Instructions burned: 56 (million)
% 0.73/0.87 % (22257)------------------------------
% 0.73/0.87 % (22257)------------------------------
% 0.73/0.87 % (22268)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2994ds/518Mi)
% 0.73/0.88 % (22269)lrs+1011_87677:1048576_sil=8000:sos=on:spb=non_intro:nwc=10.0:kmz=on:i=42:ep=RS:nm=0:ins=1:uhcvi=on:rawr=on:fde=unused:afp=2000:afq=1.444:plsq=on:nicw=on_0 on theBenchmark for (2994ds/42Mi)
% 0.73/0.88 % (22256)Instruction limit reached!
% 0.73/0.88 % (22256)------------------------------
% 0.73/0.88 % (22256)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88 % (22256)Termination reason: Unknown
% 0.73/0.88 % (22256)Termination phase: Saturation
% 0.73/0.88
% 0.73/0.88 % (22256)Memory used [KB]: 1976
% 0.73/0.88 % (22256)Time elapsed: 0.046 s
% 0.73/0.88 % (22256)Instructions burned: 84 (million)
% 0.73/0.88 % (22256)------------------------------
% 0.73/0.88 % (22256)------------------------------
% 0.73/0.88 % (22252)Instruction limit reached!
% 0.73/0.88 % (22252)------------------------------
% 0.73/0.88 % (22252)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88 % (22252)Termination reason: Unknown
% 0.73/0.88 % (22252)Termination phase: Saturation
% 0.73/0.88
% 0.73/0.88 % (22252)Memory used [KB]: 1698
% 0.73/0.88 % (22252)Time elapsed: 0.048 s
% 0.73/0.88 % (22252)Instructions burned: 79 (million)
% 0.73/0.88 % (22252)------------------------------
% 0.73/0.88 % (22252)------------------------------
% 0.73/0.89 % (22270)dis+1011_1258907:1048576_bsr=unit_only:to=lpo:drc=off:sil=2000:tgt=full:fde=none:sp=frequency:spb=goal:rnwc=on:nwc=6.70083:sac=on:newcnf=on:st=2:i=243:bs=unit_only:sd=3:afp=300:awrs=decay:awrsf=218:nm=16:ins=3:afq=3.76821:afr=on:ss=axioms:sgt=5:rawr=on:add=off:bsd=on_0 on theBenchmark for (2994ds/243Mi)
% 0.73/0.89 % (22271)lrs+1011_2:9_sil=2000:lsd=10:newcnf=on:i=117:sd=2:awrs=decay:ss=included:amm=off:ep=R_0 on theBenchmark for (2994ds/117Mi)
% 0.73/0.89 % (22262)Instruction limit reached!
% 0.73/0.89 % (22262)------------------------------
% 0.73/0.89 % (22262)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.89 % (22262)Termination reason: Unknown
% 0.73/0.89 % (22262)Termination phase: Saturation
% 0.73/0.89
% 0.73/0.89 % (22262)Memory used [KB]: 1701
% 0.73/0.89 % (22262)Time elapsed: 0.030 s
% 0.73/0.89 % (22262)Instructions burned: 50 (million)
% 0.73/0.89 % (22262)------------------------------
% 0.73/0.89 % (22262)------------------------------
% 0.92/0.89 % (22272)dis+1011_11:1_sil=2000:avsq=on:i=143:avsqr=1,16:ep=RS:rawr=on:aac=none:lsd=100:mep=off:fde=none:newcnf=on:bsr=unit_only_0 on theBenchmark for (2994ds/143Mi)
% 0.92/0.89 % (22261)Instruction limit reached!
% 0.92/0.89 % (22261)------------------------------
% 0.92/0.89 % (22261)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.92/0.89 % (22261)Termination reason: Unknown
% 0.92/0.89 % (22261)Termination phase: Saturation
% 0.92/0.89
% 0.92/0.89 % (22266)Instruction limit reached!
% 0.92/0.89 % (22266)------------------------------
% 0.92/0.89 % (22266)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.92/0.89 % (22266)Termination reason: Unknown
% 0.92/0.89 % (22266)Termination phase: Saturation
% 0.92/0.89
% 0.92/0.89 % (22266)Memory used [KB]: 1660
% 0.92/0.89 % (22266)Time elapsed: 0.030 s
% 0.92/0.89 % (22266)Instructions burned: 53 (million)
% 0.92/0.89 % (22266)------------------------------
% 0.92/0.89 % (22266)------------------------------
% 0.92/0.89 % (22261)Memory used [KB]: 1864
% 0.92/0.89 % (22261)Time elapsed: 0.035 s
% 0.92/0.89 % (22261)Instructions burned: 56 (million)
% 0.92/0.89 % (22261)------------------------------
% 0.92/0.89 % (22261)------------------------------
% 0.92/0.90 % (22269)Instruction limit reached!
% 0.92/0.90 % (22269)------------------------------
% 0.92/0.90 % (22269)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.92/0.90 % (22269)Termination reason: Unknown
% 0.92/0.90 % (22269)Termination phase: Saturation
% 0.92/0.90
% 0.92/0.90 % (22273)lrs+1011_1:2_to=lpo:sil=8000:plsqc=1:plsq=on:plsqr=326,59:sp=weighted_frequency:plsql=on:nwc=10.0:newcnf=on:i=93:awrs=converge:awrsf=200:bd=off:ins=1:rawr=on:alpa=false:avsq=on:avsqr=1,16_0 on theBenchmark for (2994ds/93Mi)
% 0.92/0.90 % (22269)Memory used [KB]: 1482
% 0.92/0.90 % (22269)Time elapsed: 0.025 s
% 0.92/0.90 % (22269)Instructions burned: 42 (million)
% 0.92/0.90 % (22269)------------------------------
% 0.92/0.90 % (22269)------------------------------
% 0.92/0.90 % (22274)lrs+1666_1:1_sil=4000:sp=occurrence:sos=on:urr=on:newcnf=on:i=62:amm=off:ep=R:erd=off:nm=0:plsq=on:plsqr=14,1_0 on theBenchmark for (2994ds/62Mi)
% 0.92/0.90 % (22275)lrs+21_2461:262144_anc=none:drc=off:sil=2000:sp=occurrence:nwc=6.0:updr=off:st=3.0:i=32:sd=2:afp=4000:erml=3:nm=14:afq=2.0:uhcvi=on:ss=included:er=filter:abs=on:nicw=on:ile=on:sims=off:s2a=on:s2agt=50:s2at=-1.0:plsq=on:plsql=on:plsqc=2:plsqr=1,32:newcnf=on:bd=off:to=lpo_0 on theBenchmark for (2994ds/32Mi)
% 0.92/0.92 % (22275)Instruction limit reached!
% 0.92/0.92 % (22275)------------------------------
% 0.92/0.92 % (22275)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.92/0.92 % (22275)Termination reason: Unknown
% 0.92/0.92 % (22275)Termination phase: Saturation
% 0.92/0.92
% 0.92/0.92 % (22275)Memory used [KB]: 1406
% 0.92/0.92 % (22275)Time elapsed: 0.020 s
% 0.92/0.92 % (22275)Instructions burned: 32 (million)
% 0.92/0.92 % (22275)------------------------------
% 0.92/0.92 % (22275)------------------------------
% 0.92/0.92 % (22280)dis+1011_1:1_sil=16000:nwc=7.0:s2agt=64:s2a=on:i=1919:ss=axioms:sgt=8:lsd=50:sd=7_0 on theBenchmark for (2994ds/1919Mi)
% 1.06/0.93 % (22274)Instruction limit reached!
% 1.06/0.93 % (22274)------------------------------
% 1.06/0.93 % (22274)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.06/0.93 % (22274)Termination reason: Unknown
% 1.06/0.93 % (22274)Termination phase: Saturation
% 1.06/0.93
% 1.06/0.93 % (22274)Memory used [KB]: 1826
% 1.06/0.93 % (22274)Time elapsed: 0.034 s
% 1.06/0.93 % (22274)Instructions burned: 64 (million)
% 1.06/0.93 % (22274)------------------------------
% 1.06/0.93 % (22274)------------------------------
% 1.10/0.93 % (22283)ott-32_5:1_sil=4000:sp=occurrence:urr=full:rp=on:nwc=5.0:newcnf=on:st=5.0:s2pl=on:i=55:sd=2:ins=2:ss=included:rawr=on:anc=none:sos=on:s2agt=8:spb=intro:ep=RS:avsq=on:avsqr=27,155:lma=on_0 on theBenchmark for (2994ds/55Mi)
% 1.10/0.95 % (22273)Instruction limit reached!
% 1.10/0.95 % (22273)------------------------------
% 1.10/0.95 % (22273)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.10/0.95 % (22273)Termination reason: Unknown
% 1.10/0.95 % (22273)Termination phase: Saturation
% 1.10/0.95
% 1.10/0.95 % (22273)Memory used [KB]: 2010
% 1.10/0.95 % (22273)Time elapsed: 0.052 s
% 1.10/0.95 % (22273)Instructions burned: 94 (million)
% 1.10/0.95 % (22273)------------------------------
% 1.10/0.95 % (22273)------------------------------
% 1.10/0.95 % (22286)lrs-1011_1:1_sil=2000:sos=on:urr=on:i=53:sd=1:bd=off:ins=3:av=off:ss=axioms:sgt=16:gsp=on:lsd=10_0 on theBenchmark for (2994ds/53Mi)
% 1.10/0.95 % (22271)Instruction limit reached!
% 1.10/0.95 % (22271)------------------------------
% 1.10/0.95 % (22271)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.10/0.95 % (22271)Termination reason: Unknown
% 1.10/0.95 % (22271)Termination phase: Saturation
% 1.10/0.95
% 1.10/0.95 % (22271)Memory used [KB]: 2369
% 1.10/0.95 % (22271)Time elapsed: 0.067 s
% 1.10/0.95 % (22271)Instructions burned: 118 (million)
% 1.10/0.95 % (22271)------------------------------
% 1.10/0.95 % (22271)------------------------------
% 1.10/0.96 % (22287)lrs+1011_6929:65536_anc=all_dependent:sil=2000:fde=none:plsqc=1:plsq=on:plsqr=19,8:plsql=on:nwc=3.0:i=46:afp=4000:ep=R:nm=3:fsr=off:afr=on:aer=off:gsp=on_0 on theBenchmark for (2994ds/46Mi)
% 1.10/0.97 % (22283)Instruction limit reached!
% 1.10/0.97 % (22283)------------------------------
% 1.10/0.97 % (22283)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.10/0.97 % (22283)Termination reason: Unknown
% 1.10/0.97 % (22283)Termination phase: Saturation
% 1.10/0.97
% 1.10/0.97 % (22283)Memory used [KB]: 2109
% 1.10/0.97 % (22283)Time elapsed: 0.035 s
% 1.10/0.97 % (22283)Instructions burned: 55 (million)
% 1.10/0.97 % (22283)------------------------------
% 1.10/0.97 % (22283)------------------------------
% 1.10/0.97 % (22263)First to succeed.
% 1.10/0.97 % (22288)dis+10_3:31_sil=2000:sp=frequency:abs=on:acc=on:lcm=reverse:nwc=3.0:alpa=random:st=3.0:i=102:sd=1:nm=4:ins=1:aer=off:ss=axioms_0 on theBenchmark for (2994ds/102Mi)
% 1.10/0.97 % (22263)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22193"
% 1.10/0.97 % (22272)Instruction limit reached!
% 1.10/0.97 % (22272)------------------------------
% 1.10/0.97 % (22272)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.10/0.97 % (22272)Termination reason: Unknown
% 1.10/0.97 % (22272)Termination phase: Saturation
% 1.10/0.97
% 1.10/0.97 % (22272)Memory used [KB]: 2065
% 1.10/0.97 % (22272)Time elapsed: 0.083 s
% 1.10/0.97 % (22272)Instructions burned: 144 (million)
% 1.10/0.97 % (22272)------------------------------
% 1.10/0.97 % (22272)------------------------------
% 1.10/0.98 % (22263)Refutation found. Thanks to Tanya!
% 1.10/0.98 % SZS status Theorem for theBenchmark
% 1.10/0.98 % SZS output start Proof for theBenchmark
% See solution above
% 1.10/0.98 % (22263)------------------------------
% 1.10/0.98 % (22263)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.10/0.98 % (22263)Termination reason: Refutation
% 1.10/0.98
% 1.10/0.98 % (22263)Memory used [KB]: 2388
% 1.10/0.98 % (22263)Time elapsed: 0.114 s
% 1.10/0.98 % (22263)Instructions burned: 198 (million)
% 1.10/0.98 % (22193)Success in time 0.607 s
% 1.10/0.98 % Vampire---4.8 exiting
%------------------------------------------------------------------------------