TSTP Solution File: SWW629_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW629_2 : TPTP v8.1.2. 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 : Wed May 1 04:20:23 EDT 2024
% Result : Theorem 0.71s 0.91s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 77
% Syntax : Number of formulae : 121 ( 9 unt; 61 typ; 0 def)
% Number of atoms : 556 ( 194 equ)
% Maximal formula atoms : 50 ( 9 avg)
% Number of connectives : 602 ( 106 ~; 99 |; 334 &)
% ( 9 <=>; 54 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 8 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 68 ( 10 atm; 16 fun; 42 num; 0 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 72 ( 36 >; 36 *; 0 +; 0 <<)
% Number of predicates : 13 ( 10 usr; 5 prp; 0-3 aty)
% Number of functors : 52 ( 49 usr; 21 con; 0-5 aty)
% Number of variables : 209 ( 90 !; 118 ?; 209 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool1: $tType ).
tff(type_def_8,type,
tuple02: $tType ).
tff(type_def_9,type,
elt1: $tType ).
tff(type_def_10,type,
list_elt: $tType ).
tff(func_def_0,type,
witness1: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool: ty ).
tff(func_def_4,type,
true1: bool1 ).
tff(func_def_5,type,
false1: bool1 ).
tff(func_def_6,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(func_def_7,type,
tuple0: ty ).
tff(func_def_8,type,
tuple03: tuple02 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
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_list1: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_16,type,
cons_proj_11: ( ty * uni ) > uni ).
tff(func_def_17,type,
cons_proj_21: ( ty * uni ) > uni ).
tff(func_def_18,type,
length2: ( ty * uni ) > $int ).
tff(func_def_21,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(func_def_22,type,
num_occ1: ( ty * uni * uni ) > $int ).
tff(func_def_23,type,
reverse: ( ty * uni ) > uni ).
tff(func_def_24,type,
t: ty > ty ).
tff(func_def_25,type,
mk_t: ( ty * uni ) > uni ).
tff(func_def_26,type,
elts: ( ty * uni ) > uni ).
tff(func_def_27,type,
length3: ( ty * uni ) > $int ).
tff(func_def_28,type,
elt: ty ).
tff(func_def_29,type,
t2tb: list_elt > uni ).
tff(func_def_30,type,
tb2t: uni > list_elt ).
tff(func_def_31,type,
t2tb1: elt1 > uni ).
tff(func_def_32,type,
tb2t1: uni > elt1 ).
tff(func_def_34,type,
sK0: list_elt ).
tff(func_def_35,type,
sK1: list_elt ).
tff(func_def_36,type,
sK2: list_elt ).
tff(func_def_37,type,
sK3: list_elt ).
tff(func_def_38,type,
sK4: list_elt ).
tff(func_def_39,type,
sK5: list_elt ).
tff(func_def_40,type,
sK6: bool1 ).
tff(func_def_41,type,
sK7: list_elt ).
tff(func_def_42,type,
sK8: list_elt ).
tff(func_def_43,type,
sK9: list_elt ).
tff(func_def_44,type,
sK10: ( ty * uni * uni ) > uni ).
tff(func_def_45,type,
sK11: ( list_elt * list_elt ) > elt1 ).
tff(func_def_46,type,
sK12: ( list_elt * list_elt ) > elt1 ).
tff(func_def_47,type,
sK13: ( elt1 * list_elt ) > elt1 ).
tff(func_def_48,type,
sK14: list_elt > elt1 ).
tff(func_def_49,type,
sK15: list_elt > elt1 ).
tff(func_def_50,type,
sK16: list_elt > list_elt ).
tff(func_def_51,type,
sK17: list_elt > elt1 ).
tff(func_def_52,type,
sK18: ( ty * uni * uni ) > uni ).
tff(func_def_53,type,
sK19: ( ty * uni * uni ) > uni ).
tff(pred_def_1,type,
sort1: ( 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,
le1: ( elt1 * elt1 ) > $o ).
tff(pred_def_7,type,
sorted1: list_elt > $o ).
tff(pred_def_8,type,
sQ20_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f579,plain,
$false,
inference(avatar_sat_refutation,[],[f360,f361,f557,f564,f578]) ).
tff(f578,plain,
spl21_9,
inference(avatar_contradiction_clause,[],[f577]) ).
tff(f577,plain,
( $false
| spl21_9 ),
inference(subsumption_resolution,[],[f576,f208]) ).
tff(f208,plain,
permut(elt,t2tb(sK8),t2tb(sK3)),
inference(cnf_transformation,[],[f170]) ).
tff(f170,plain,
( ( ~ permut(elt,t2tb(sK9),t2tb(sK0))
| ~ sorted1(sK9) )
& permut(elt,t2tb(sK9),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
& sorted1(sK9)
& sorted1(sK8)
& sorted1(sK7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(sK8),t2tb(sK3))
& sorted1(sK8)
& permut(elt,t2tb(sK7),t2tb(sK4))
& sorted1(sK7)
& permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK0))
& ( tb2t(nil(elt)) = sK5 )
& ( true1 = sK6 )
& ( ( true1 = sK6 )
| ( tb2t(nil(elt)) != sK5 ) )
& ( ( tb2t(nil(elt)) = sK5 )
| ( true1 != sK6 ) )
& ( ( ( length2(elt,t2tb(sK4)) = $sum(length2(elt,t2tb(sK3)),1) )
& ( 0 = length2(elt,t2tb(sK5)) ) )
| ( length2(elt,t2tb(sK4)) = length2(elt,t2tb(sK3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK5)),t2tb(sK0))
& ( tb2t(nil(elt)) = sK2 )
& ( tb2t(nil(elt)) = sK1 )
& $less(1,length2(elt,t2tb(sK0))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8,sK9])],[f161,f169,f168,f167,f166,f165,f164,f163,f162]) ).
tff(f162,plain,
( ? [X0: list_elt] :
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt,X4: list_elt,X5: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(X0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(X0))) )
=> ( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(sK0))) ) ),
introduced(choice_axiom,[]) ).
tff(f163,plain,
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
=> ( ? [X2: list_elt] :
( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = sK1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f164,plain,
( ? [X2: list_elt] :
( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
& ( tb2t(nil(elt)) = X2 ) )
=> ( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
& ( tb2t(nil(elt)) = sK2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f165,plain,
( ? [X5: list_elt,X4: list_elt,X3: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(sK0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(sK0)) )
=> ( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(sK4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK0))
& ( tb2t(nil(elt)) = sK5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != sK5 ) )
& ( ( tb2t(nil(elt)) = sK5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(sK4)) = $sum(length2(elt,t2tb(sK3)),1) )
& ( 0 = length2(elt,t2tb(sK5)) ) )
| ( length2(elt,t2tb(sK4)) = length2(elt,t2tb(sK3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK5)),t2tb(sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f166,plain,
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(sK4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK0))
& ( tb2t(nil(elt)) = sK5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != sK5 ) )
& ( ( tb2t(nil(elt)) = sK5 )
| ( true1 != X6 ) ) )
=> ( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(sK4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK0))
& ( tb2t(nil(elt)) = sK5 )
& ( true1 = sK6 )
& ( ( true1 = sK6 )
| ( tb2t(nil(elt)) != sK5 ) )
& ( ( tb2t(nil(elt)) = sK5 )
| ( true1 != sK6 ) ) ) ),
introduced(choice_axiom,[]) ).
tff(f167,plain,
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(sK4))
& sorted1(X7) )
=> ( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(sK7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(sK7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
& permut(elt,t2tb(sK7),t2tb(sK4))
& sorted1(sK7) ) ),
introduced(choice_axiom,[]) ).
tff(f168,plain,
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(sK7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(sK7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(X8),t2tb(sK3))
& sorted1(X8) )
=> ( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
& sorted1(X9) )
& sorted1(sK8)
& sorted1(sK7)
& ( tb2t(nil(elt)) = sK5 )
& permut(elt,t2tb(sK8),t2tb(sK3))
& sorted1(sK8) ) ),
introduced(choice_axiom,[]) ).
tff(f169,plain,
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(sK0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
& sorted1(X9) )
=> ( ( ~ permut(elt,t2tb(sK9),t2tb(sK0))
| ~ sorted1(sK9) )
& permut(elt,t2tb(sK9),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
& sorted1(sK9) ) ),
introduced(choice_axiom,[]) ).
tff(f161,plain,
? [X0: list_elt] :
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt,X4: list_elt,X5: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(X0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(X0))) ),
inference(flattening,[],[f160]) ).
tff(f160,plain,
? [X0: list_elt] :
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt,X4: list_elt,X5: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(X0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
| ( tb2t(nil(elt)) != X5 ) )
& ( ( tb2t(nil(elt)) = X5 )
| ( true1 != X6 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(X0))) ),
inference(nnf_transformation,[],[f136]) ).
tff(f136,plain,
? [X0: list_elt] :
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt,X4: list_elt,X5: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(X0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
<=> ( tb2t(nil(elt)) = X5 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(X0))) ),
inference(flattening,[],[f135]) ).
tff(f135,plain,
? [X0: list_elt] :
( ? [X1: list_elt] :
( ? [X2: list_elt] :
( ? [X3: list_elt,X4: list_elt,X5: list_elt] :
( ? [X6: bool1] :
( ? [X7: list_elt] :
( ? [X8: list_elt] :
( ? [X9: list_elt] :
( ( ~ permut(elt,t2tb(X9),t2tb(X0))
| ~ sorted1(X9) )
& permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
& sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 )
& permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
& permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
& permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
& ( tb2t(nil(elt)) = X5 )
& ( true1 = X6 )
& ( ( true1 = X6 )
<=> ( tb2t(nil(elt)) = X5 ) ) )
& ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
& ( tb2t(nil(elt)) = X2 ) )
& ( tb2t(nil(elt)) = X1 ) )
& $less(1,length2(elt,t2tb(X0))) ),
inference(ennf_transformation,[],[f96]) ).
tff(f96,plain,
~ ! [X0: list_elt] :
( $less(1,length2(elt,t2tb(X0)))
=> ! [X1: list_elt] :
( ( tb2t(nil(elt)) = X1 )
=> ! [X2: list_elt] :
( ( tb2t(nil(elt)) = X2 )
=> ! [X3: list_elt,X4: list_elt,X5: list_elt] :
( ( ( ( ( length2(elt,t2tb(X4)) = $sum(length2(elt,t2tb(X3)),1) )
& ( 0 = length2(elt,t2tb(X5)) ) )
| ( length2(elt,t2tb(X4)) = length2(elt,t2tb(X3)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X5)),t2tb(X0)) )
=> ! [X6: bool1] :
( ( ( true1 = X6 )
<=> ( tb2t(nil(elt)) = X5 ) )
=> ( ( true1 = X6 )
=> ( ( tb2t(nil(elt)) = X5 )
=> ( permut(elt,infix_plpl(elt,t2tb(X4),t2tb(X3)),t2tb(X0))
=> ! [X7: list_elt] :
( ( permut(elt,t2tb(X7),t2tb(X4))
& sorted1(X7) )
=> ! [X8: list_elt] :
( ( permut(elt,t2tb(X8),t2tb(X3))
& sorted1(X8) )
=> ( ( sorted1(X8)
& sorted1(X7)
& ( tb2t(nil(elt)) = X5 ) )
=> ! [X9: list_elt] :
( ( permut(elt,t2tb(X9),infix_plpl(elt,t2tb(X7),t2tb(X8)))
& sorted1(X9) )
=> ( permut(elt,t2tb(X9),t2tb(X0))
& sorted1(X9) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(rectify,[],[f75]) ).
tff(f75,negated_conjecture,
~ ! [X18: list_elt] :
( $less(1,length2(elt,t2tb(X18)))
=> ! [X21: list_elt] :
( ( tb2t(nil(elt)) = X21 )
=> ! [X22: list_elt] :
( ( tb2t(nil(elt)) = X22 )
=> ! [X23: list_elt,X24: list_elt,X25: list_elt] :
( ( ( ( ( length2(elt,t2tb(X24)) = $sum(length2(elt,t2tb(X23)),1) )
& ( 0 = length2(elt,t2tb(X25)) ) )
| ( length2(elt,t2tb(X24)) = length2(elt,t2tb(X23)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X24),t2tb(X23)),t2tb(X25)),t2tb(X18)) )
=> ! [X26: bool1] :
( ( ( true1 = X26 )
<=> ( tb2t(nil(elt)) = X25 ) )
=> ( ( true1 = X26 )
=> ( ( tb2t(nil(elt)) = X25 )
=> ( permut(elt,infix_plpl(elt,t2tb(X24),t2tb(X23)),t2tb(X18))
=> ! [X27: list_elt] :
( ( permut(elt,t2tb(X27),t2tb(X24))
& sorted1(X27) )
=> ! [X28: list_elt] :
( ( permut(elt,t2tb(X28),t2tb(X23))
& sorted1(X28) )
=> ( ( sorted1(X28)
& sorted1(X27)
& ( tb2t(nil(elt)) = X25 ) )
=> ! [X29: list_elt] :
( ( permut(elt,t2tb(X29),infix_plpl(elt,t2tb(X27),t2tb(X28)))
& sorted1(X29) )
=> ( permut(elt,t2tb(X29),t2tb(X18))
& sorted1(X29) ) ) ) ) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f74]) ).
tff(f74,conjecture,
! [X18: list_elt] :
( $less(1,length2(elt,t2tb(X18)))
=> ! [X21: list_elt] :
( ( tb2t(nil(elt)) = X21 )
=> ! [X22: list_elt] :
( ( tb2t(nil(elt)) = X22 )
=> ! [X23: list_elt,X24: list_elt,X25: list_elt] :
( ( ( ( ( length2(elt,t2tb(X24)) = $sum(length2(elt,t2tb(X23)),1) )
& ( 0 = length2(elt,t2tb(X25)) ) )
| ( length2(elt,t2tb(X24)) = length2(elt,t2tb(X23)) ) )
& permut(elt,infix_plpl(elt,infix_plpl(elt,t2tb(X24),t2tb(X23)),t2tb(X25)),t2tb(X18)) )
=> ! [X26: bool1] :
( ( ( true1 = X26 )
<=> ( tb2t(nil(elt)) = X25 ) )
=> ( ( true1 = X26 )
=> ( ( tb2t(nil(elt)) = X25 )
=> ( permut(elt,infix_plpl(elt,t2tb(X24),t2tb(X23)),t2tb(X18))
=> ! [X27: list_elt] :
( ( permut(elt,t2tb(X27),t2tb(X24))
& sorted1(X27) )
=> ! [X28: list_elt] :
( ( permut(elt,t2tb(X28),t2tb(X23))
& sorted1(X28) )
=> ( ( sorted1(X28)
& sorted1(X27)
& ( tb2t(nil(elt)) = X25 ) )
=> ! [X29: list_elt] :
( ( permut(elt,t2tb(X29),infix_plpl(elt,t2tb(X27),t2tb(X28)))
& sorted1(X29) )
=> ( permut(elt,t2tb(X29),t2tb(X18))
& sorted1(X29) ) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NZcEcckxfg/Vampire---4.8_2389',wP_parameter_mergesort) ).
tff(f576,plain,
( ~ permut(elt,t2tb(sK8),t2tb(sK3))
| spl21_9 ),
inference(resolution,[],[f556,f232]) ).
tff(f232,plain,
! [X2: uni,X0: ty,X1: uni] :
( permut(X0,X2,X1)
| ~ permut(X0,X1,X2) ),
inference(cnf_transformation,[],[f148]) ).
tff(f148,plain,
! [X0: ty,X1: uni,X2: uni] :
( permut(X0,X2,X1)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f112]) ).
tff(f112,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/tmp/tmp.NZcEcckxfg/Vampire---4.8_2389',permut_sym) ).
tff(f556,plain,
( ~ permut(elt,t2tb(sK3),t2tb(sK8))
| spl21_9 ),
inference(avatar_component_clause,[],[f554]) ).
tff(f554,plain,
( spl21_9
<=> permut(elt,t2tb(sK3),t2tb(sK8)) ),
introduced(avatar_definition,[new_symbols(naming,[spl21_9])]) ).
tff(f564,plain,
spl21_8,
inference(avatar_contradiction_clause,[],[f563]) ).
tff(f563,plain,
( $false
| spl21_8 ),
inference(subsumption_resolution,[],[f562,f206]) ).
tff(f206,plain,
permut(elt,t2tb(sK7),t2tb(sK4)),
inference(cnf_transformation,[],[f170]) ).
tff(f562,plain,
( ~ permut(elt,t2tb(sK7),t2tb(sK4))
| spl21_8 ),
inference(resolution,[],[f552,f232]) ).
tff(f552,plain,
( ~ permut(elt,t2tb(sK4),t2tb(sK7))
| spl21_8 ),
inference(avatar_component_clause,[],[f550]) ).
tff(f550,plain,
( spl21_8
<=> permut(elt,t2tb(sK4),t2tb(sK7)) ),
introduced(avatar_definition,[new_symbols(naming,[spl21_8])]) ).
tff(f557,plain,
( ~ spl21_8
| ~ spl21_9
| spl21_2 ),
inference(avatar_split_clause,[],[f546,f357,f554,f550]) ).
tff(f357,plain,
( spl21_2
<=> permut(elt,t2tb(sK9),t2tb(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl21_2])]) ).
tff(f546,plain,
( ~ permut(elt,t2tb(sK3),t2tb(sK8))
| ~ permut(elt,t2tb(sK4),t2tb(sK7))
| spl21_2 ),
inference(resolution,[],[f526,f226]) ).
tff(f226,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,[],[f144]) ).
tff(f144,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,[],[f143]) ).
tff(f143,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,[],[f106]) ).
tff(f106,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/tmp/tmp.NZcEcckxfg/Vampire---4.8_2389',permut_append) ).
tff(f526,plain,
( ~ permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
| spl21_2 ),
inference(resolution,[],[f498,f204]) ).
tff(f204,plain,
permut(elt,infix_plpl(elt,t2tb(sK4),t2tb(sK3)),t2tb(sK0)),
inference(cnf_transformation,[],[f170]) ).
tff(f498,plain,
( ! [X0: uni] :
( ~ permut(elt,X0,t2tb(sK0))
| ~ permut(elt,X0,infix_plpl(elt,t2tb(sK7),t2tb(sK8))) )
| spl21_2 ),
inference(resolution,[],[f459,f232]) ).
tff(f459,plain,
( ! [X0: uni] :
( ~ permut(elt,t2tb(sK0),X0)
| ~ permut(elt,X0,infix_plpl(elt,t2tb(sK7),t2tb(sK8))) )
| spl21_2 ),
inference(resolution,[],[f447,f231]) ).
tff(f231,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(cnf_transformation,[],[f147]) ).
tff(f147,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(flattening,[],[f146]) ).
tff(f146,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X1,X3)
| ~ permut(X0,X2,X3)
| ~ permut(X0,X1,X2) ),
inference(ennf_transformation,[],[f111]) ).
tff(f111,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/tmp/tmp.NZcEcckxfg/Vampire---4.8_2389',permut_trans) ).
tff(f447,plain,
( ~ permut(elt,t2tb(sK0),infix_plpl(elt,t2tb(sK7),t2tb(sK8)))
| spl21_2 ),
inference(forward_literal_rewriting,[],[f443,f232]) ).
tff(f443,plain,
( ~ permut(elt,infix_plpl(elt,t2tb(sK7),t2tb(sK8)),t2tb(sK0))
| spl21_2 ),
inference(resolution,[],[f441,f213]) ).
tff(f213,plain,
permut(elt,t2tb(sK9),infix_plpl(elt,t2tb(sK7),t2tb(sK8))),
inference(cnf_transformation,[],[f170]) ).
tff(f441,plain,
( ! [X0: uni] :
( ~ permut(elt,t2tb(sK9),X0)
| ~ permut(elt,X0,t2tb(sK0)) )
| spl21_2 ),
inference(resolution,[],[f231,f359]) ).
tff(f359,plain,
( ~ permut(elt,t2tb(sK9),t2tb(sK0))
| spl21_2 ),
inference(avatar_component_clause,[],[f357]) ).
tff(f361,plain,
spl21_1,
inference(avatar_split_clause,[],[f212,f353]) ).
tff(f353,plain,
( spl21_1
<=> sorted1(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl21_1])]) ).
tff(f212,plain,
sorted1(sK9),
inference(cnf_transformation,[],[f170]) ).
tff(f360,plain,
( ~ spl21_1
| ~ spl21_2 ),
inference(avatar_split_clause,[],[f214,f357,f353]) ).
tff(f214,plain,
( ~ permut(elt,t2tb(sK9),t2tb(sK0))
| ~ sorted1(sK9) ),
inference(cnf_transformation,[],[f170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWW629_2 : TPTP v8.1.2. Released v6.1.0.
% 0.15/0.15 % 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.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 17:52:18 EDT 2024
% 0.22/0.36 % CPUTime :
% 0.22/0.36 This is a TF0_THM_EQU_ARI problem
% 0.22/0.37 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/tmp/tmp.NZcEcckxfg/Vampire---4.8_2389
% 0.71/0.89 % (2597)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 Vampire---4 for (2994ds/34Mi)
% 0.71/0.89 % (2598)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 Vampire---4 for (2994ds/51Mi)
% 0.71/0.89 % (2600)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.71/0.89 % (2599)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.71/0.89 % (2601)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 Vampire---4 for (2994ds/34Mi)
% 0.71/0.89 % (2602)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.71/0.89 % (2603)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 Vampire---4 for (2994ds/83Mi)
% 0.71/0.89 % (2604)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2994ds/56Mi)
% 0.71/0.90 % (2597)First to succeed.
% 0.71/0.91 % (2597)Refutation found. Thanks to Tanya!
% 0.71/0.91 % SZS status Theorem for Vampire---4
% 0.71/0.91 % SZS output start Proof for Vampire---4
% See solution above
% 0.71/0.91 % (2597)------------------------------
% 0.71/0.91 % (2597)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.71/0.91 % (2597)Termination reason: Refutation
% 0.71/0.91
% 0.71/0.91 % (2597)Memory used [KB]: 1304
% 0.71/0.91 % (2597)Time elapsed: 0.018 s
% 0.71/0.91 % (2597)Instructions burned: 31 (million)
% 0.71/0.91 % (2597)------------------------------
% 0.71/0.91 % (2597)------------------------------
% 0.71/0.91 % (2559)Success in time 0.524 s
% 0.71/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------