TSTP Solution File: ITP006_2 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : ITP006_2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 31 17:15:45 EDT 2022
% Result : Theorem 1.60s 0.56s
% Output : Refutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 65
% Syntax : Number of formulae : 96 ( 11 unt; 53 typ; 0 def)
% Number of atoms : 701 ( 10 equ)
% Maximal formula atoms : 36 ( 16 avg)
% Number of connectives : 488 ( 149 ~; 128 |; 112 &)
% ( 30 <=>; 69 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 319 ( 319 fml; 0 var)
% Number of types : 4 ( 2 usr)
% Number of type conns : 112 ( 45 >; 67 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 4 prp; 0-4 aty)
% Number of functors : 35 ( 35 usr; 6 con; 0-4 aty)
% Number of variables : 241 ( 192 !; 49 ?; 71 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
del: $tType ).
tff(type_def_6,type,
tp__o: $tType ).
tff(func_def_0,type,
bool: del ).
tff(func_def_1,type,
ind: del ).
tff(func_def_2,type,
arr: ( del * del ) > del ).
tff(func_def_4,type,
k: ( del * $i ) > $i ).
tff(func_def_5,type,
i: del > $i ).
tff(func_def_6,type,
inj__o: tp__o > $i ).
tff(func_def_7,type,
surj__o: $i > tp__o ).
tff(func_def_9,type,
fo__c_2Ebool_2ET: tp__o ).
tff(func_def_10,type,
c_2EquantHeuristics_2EGUESS__FORALL__GAP: ( del * del ) > $i ).
tff(func_def_11,type,
c_2EquantHeuristics_2EGUESS__EXISTS__GAP: ( del * del ) > $i ).
tff(func_def_12,type,
c_2EquantHeuristics_2EGUESS__FORALL__POINT: ( del * del ) > $i ).
tff(func_def_13,type,
c_2EquantHeuristics_2EGUESS__EXISTS__POINT: ( del * del ) > $i ).
tff(func_def_14,type,
c_2EquantHeuristics_2EGUESS__FORALL: ( del * del ) > $i ).
tff(func_def_15,type,
c_2Ebool_2E_3F: del > $i ).
tff(func_def_16,type,
c_2EquantHeuristics_2EGUESS__EXISTS: ( del * del ) > $i ).
tff(func_def_18,type,
fo__c_2Ebool_2EF: tp__o ).
tff(func_def_20,type,
fo__c_2Ebool_2E_5C_2F: ( tp__o * tp__o ) > tp__o ).
tff(func_def_22,type,
fo__c_2Ebool_2E_2F_5C: ( tp__o * tp__o ) > tp__o ).
tff(func_def_23,type,
c_2Emin_2E_3D: del > $i ).
tff(func_def_25,type,
fo__c_2Ebool_2E_7E: tp__o > tp__o ).
tff(func_def_27,type,
fo__c_2Emin_2E_3D_3D_3E: ( tp__o * tp__o ) > tp__o ).
tff(func_def_28,type,
c_2Ebool_2E_21: del > $i ).
tff(func_def_30,type,
sK16: del ).
tff(func_def_31,type,
sK17: del ).
tff(func_def_34,type,
sK20: ( $i * del * $i ) > $i ).
tff(func_def_35,type,
sK21: ( del * $i * $i ) > $i ).
tff(func_def_36,type,
sK22: ( del * $i * $i ) > $i ).
tff(func_def_37,type,
sK23: ( del * del * $i * $i ) > $i ).
tff(func_def_38,type,
sK24: ( $i * $i * del ) > $i ).
tff(func_def_39,type,
sK25: ( $i * $i * del * del ) > $i ).
tff(func_def_40,type,
sK26: ( $i * del * $i * del ) > $i ).
tff(func_def_41,type,
sK27: ( $i * del * $i ) > $i ).
tff(func_def_42,type,
sK28: ( del * $i * $i ) > $i ).
tff(func_def_43,type,
sK29: ( del * del * $i * $i ) > $i ).
tff(func_def_44,type,
sK30: ( del * $i * $i ) > $i ).
tff(pred_def_1,type,
mem: ( $i * del ) > $o ).
tff(pred_def_3,type,
sP0: ( tp__o * tp__o ) > $o ).
tff(pred_def_4,type,
sP1: ( tp__o * tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_5,type,
sP2: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_6,type,
sP3: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_7,type,
sP4: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_8,type,
sP5: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_9,type,
sP6: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_10,type,
sP7: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_11,type,
sP8: ( del * del ) > $o ).
tff(pred_def_12,type,
sP9: ( $i * del * $i * del ) > $o ).
tff(pred_def_13,type,
sP10: ( $i * $i * del * del ) > $o ).
tff(pred_def_14,type,
sP11: ( del * del ) > $o ).
tff(pred_def_15,type,
sP12: ( del * del ) > $o ).
tff(pred_def_16,type,
sP13: ( tp__o * tp__o * tp__o ) > $o ).
tff(pred_def_17,type,
sP14: ( tp__o * tp__o * tp__o ) > $o ).
tff(f452,plain,
$false,
inference(subsumption_resolution,[],[f448,f444]) ).
tff(f444,plain,
~ p(ap(sK18,ap(sK15,sK30(sK16,sK15,sK19)))),
inference(unit_resulting_resolution,[],[f273,f276,f274,f273,f275,f441,f368]) ).
tff(f368,plain,
! [X2: del,X3: $i,X0: del,X1: $i,X6: $i,X4: $i,X5: $i] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5))
| ~ mem(X6,X0)
| ~ mem(X1,arr(X0,X2))
| ~ mem(X4,arr(X0,X2))
| ~ mem(X3,arr(X2,bool))
| ~ mem(X5,arr(X2,bool))
| ~ p(ap(X5,ap(X4,X6))) ),
inference(cnf_transformation,[],[f223]) ).
tff(f223,plain,
! [X0: del,X1,X2: del] :
( ! [X3] :
( ( sP11(X2,X0)
& sP10(X3,X1,X2,X0)
& ! [X4] :
( ! [X5] :
( ( ( ! [X6] :
( ~ mem(X6,X0)
| ~ p(ap(X5,ap(X4,X6))) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5))
| ( mem(sK30(X0,X4,X5),X0)
& p(ap(X5,ap(X4,sK30(X0,X4,X5)))) ) ) )
| ~ mem(X5,arr(X2,bool)) )
| ~ mem(X4,arr(X0,X2)) )
& sP12(X2,X0)
& sP9(X3,X0,X1,X2)
& sP8(X2,X0) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X1,arr(X0,X2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK30])],[f221,f222]) ).
tff(f222,plain,
! [X0: del,X4,X5] :
( ? [X7] :
( mem(X7,X0)
& p(ap(X5,ap(X4,X7))) )
=> ( mem(sK30(X0,X4,X5),X0)
& p(ap(X5,ap(X4,sK30(X0,X4,X5)))) ) ),
introduced(choice_axiom,[]) ).
tff(f221,plain,
! [X0: del,X1,X2: del] :
( ! [X3] :
( ( sP11(X2,X0)
& sP10(X3,X1,X2,X0)
& ! [X4] :
( ! [X5] :
( ( ( ! [X6] :
( ~ mem(X6,X0)
| ~ p(ap(X5,ap(X4,X6))) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5))
| ? [X7] :
( mem(X7,X0)
& p(ap(X5,ap(X4,X7))) ) ) )
| ~ mem(X5,arr(X2,bool)) )
| ~ mem(X4,arr(X0,X2)) )
& sP12(X2,X0)
& sP9(X3,X0,X1,X2)
& sP8(X2,X0) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X1,arr(X0,X2)) ),
inference(rectify,[],[f220]) ).
tff(f220,plain,
! [X1: del,X0,X2: del] :
( ! [X3] :
( ( sP11(X2,X1)
& sP10(X3,X0,X2,X1)
& ! [X10] :
( ! [X11] :
( ( ( ! [X12] :
( ~ mem(X12,X1)
| ~ p(ap(X11,ap(X10,X12))) )
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11))
| ? [X12] :
( mem(X12,X1)
& p(ap(X11,ap(X10,X12))) ) ) )
| ~ mem(X11,arr(X2,bool)) )
| ~ mem(X10,arr(X1,X2)) )
& sP12(X2,X1)
& sP9(X3,X1,X0,X2)
& sP8(X2,X1) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X0,arr(X1,X2)) ),
inference(nnf_transformation,[],[f143]) ).
tff(f143,plain,
! [X1: del,X0,X2: del] :
( ! [X3] :
( ( sP11(X2,X1)
& sP10(X3,X0,X2,X1)
& ! [X10] :
( ! [X11] :
( ( ! [X12] :
( ~ mem(X12,X1)
| ~ p(ap(X11,ap(X10,X12))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11)) )
| ~ mem(X11,arr(X2,bool)) )
| ~ mem(X10,arr(X1,X2)) )
& sP12(X2,X1)
& sP9(X3,X1,X0,X2)
& sP8(X2,X1) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X0,arr(X1,X2)) ),
inference(definition_folding,[],[f118,f142,f141,f140,f139,f138]) ).
tff(f138,plain,
! [X2: del,X1: del] :
( ! [X16] :
( ! [X17] :
( ~ mem(X17,arr(X2,bool))
| ( ! [X18] :
( ~ mem(X18,X2)
| ~ p(ap(X17,X18))
| ? [X19] :
( mem(X19,X1)
& ( ap(X16,X19) = X18 ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X1,X2),X16),X17)) ) )
| ~ mem(X16,arr(X1,X2)) )
| ~ sP8(X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
tff(f139,plain,
! [X3,X1: del,X0,X2: del] :
( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X1,X2),X0),X3))
<=> ! [X20] :
( p(ap(X3,X20))
| ? [X21] :
( mem(X21,X1)
& ~ p(ap(X3,ap(X0,X21))) )
| ~ mem(X20,X2) ) )
| ~ sP9(X3,X1,X0,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
tff(f140,plain,
! [X3,X0,X2: del,X1: del] :
( ( ! [X4] :
( ~ mem(X4,X2)
| ? [X5] :
( mem(X5,X1)
& p(ap(X3,ap(X0,X5))) )
| ~ p(ap(X3,X4)) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X1,X2),X0),X3)) )
| ~ sP10(X3,X0,X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP10])]) ).
tff(f141,plain,
! [X2: del,X1: del] :
( ! [X6] :
( ~ mem(X6,arr(X1,X2))
| ! [X7] :
( ( ! [X8] :
( ? [X9] :
( mem(X9,X1)
& ( ap(X6,X9) = X8 ) )
| ~ mem(X8,X2)
| p(ap(X7,X8)) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X1,X2),X6),X7)) )
| ~ mem(X7,arr(X2,bool)) ) )
| ~ sP11(X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP11])]) ).
tff(f142,plain,
! [X2: del,X1: del] :
( ! [X13] :
( ! [X14] :
( ~ mem(X14,arr(X2,bool))
| ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X1,X2),X13),X14))
<=> ! [X15] :
( p(ap(X14,ap(X13,X15)))
| ~ mem(X15,X1) ) ) )
| ~ mem(X13,arr(X1,X2)) )
| ~ sP12(X2,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP12])]) ).
tff(f118,plain,
! [X1: del,X0,X2: del] :
( ! [X3] :
( ( ! [X6] :
( ~ mem(X6,arr(X1,X2))
| ! [X7] :
( ( ! [X8] :
( ? [X9] :
( mem(X9,X1)
& ( ap(X6,X9) = X8 ) )
| ~ mem(X8,X2)
| p(ap(X7,X8)) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X1,X2),X6),X7)) )
| ~ mem(X7,arr(X2,bool)) ) )
& ( ! [X4] :
( ~ mem(X4,X2)
| ? [X5] :
( mem(X5,X1)
& p(ap(X3,ap(X0,X5))) )
| ~ p(ap(X3,X4)) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X1,X2),X0),X3)) )
& ! [X10] :
( ! [X11] :
( ( ! [X12] :
( ~ mem(X12,X1)
| ~ p(ap(X11,ap(X10,X12))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11)) )
| ~ mem(X11,arr(X2,bool)) )
| ~ mem(X10,arr(X1,X2)) )
& ! [X13] :
( ! [X14] :
( ~ mem(X14,arr(X2,bool))
| ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X1,X2),X13),X14))
<=> ! [X15] :
( p(ap(X14,ap(X13,X15)))
| ~ mem(X15,X1) ) ) )
| ~ mem(X13,arr(X1,X2)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X1,X2),X0),X3))
<=> ! [X20] :
( p(ap(X3,X20))
| ? [X21] :
( mem(X21,X1)
& ~ p(ap(X3,ap(X0,X21))) )
| ~ mem(X20,X2) ) )
& ! [X16] :
( ! [X17] :
( ~ mem(X17,arr(X2,bool))
| ( ! [X18] :
( ~ mem(X18,X2)
| ~ p(ap(X17,X18))
| ? [X19] :
( mem(X19,X1)
& ( ap(X16,X19) = X18 ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X1,X2),X16),X17)) ) )
| ~ mem(X16,arr(X1,X2)) ) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X0,arr(X1,X2)) ),
inference(flattening,[],[f117]) ).
tff(f117,plain,
! [X0,X1: del,X2: del] :
( ! [X3] :
( ( ! [X10] :
( ! [X11] :
( ( ! [X12] :
( ~ mem(X12,X1)
| ~ p(ap(X11,ap(X10,X12))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11)) )
| ~ mem(X11,arr(X2,bool)) )
| ~ mem(X10,arr(X1,X2)) )
& ! [X16] :
( ! [X17] :
( ( ! [X18] :
( ? [X19] :
( mem(X19,X1)
& ( ap(X16,X19) = X18 ) )
| ~ p(ap(X17,X18))
| ~ mem(X18,X2) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X1,X2),X16),X17)) )
| ~ mem(X17,arr(X2,bool)) )
| ~ mem(X16,arr(X1,X2)) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X1,X2),X0),X3))
<=> ! [X4] :
( ? [X5] :
( mem(X5,X1)
& p(ap(X3,ap(X0,X5))) )
| ~ p(ap(X3,X4))
| ~ mem(X4,X2) ) )
& ! [X6] :
( ! [X7] :
( ( ! [X8] :
( ? [X9] :
( mem(X9,X1)
& ( ap(X6,X9) = X8 ) )
| p(ap(X7,X8))
| ~ mem(X8,X2) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X1,X2),X6),X7)) )
| ~ mem(X7,arr(X2,bool)) )
| ~ mem(X6,arr(X1,X2)) )
& ! [X13] :
( ! [X14] :
( ~ mem(X14,arr(X2,bool))
| ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X1,X2),X13),X14))
<=> ! [X15] :
( p(ap(X14,ap(X13,X15)))
| ~ mem(X15,X1) ) ) )
| ~ mem(X13,arr(X1,X2)) )
& ( ! [X20] :
( ? [X21] :
( mem(X21,X1)
& ~ p(ap(X3,ap(X0,X21))) )
| p(ap(X3,X20))
| ~ mem(X20,X2) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X1,X2),X0),X3)) ) )
| ~ mem(X3,arr(X2,bool)) )
| ~ mem(X0,arr(X1,X2)) ),
inference(ennf_transformation,[],[f62]) ).
tff(f62,plain,
! [X0,X1: del,X2: del] :
( mem(X0,arr(X1,X2))
=> ! [X3] :
( mem(X3,arr(X2,bool))
=> ( ! [X10] :
( mem(X10,arr(X1,X2))
=> ! [X11] :
( mem(X11,arr(X2,bool))
=> ( ! [X12] :
( mem(X12,X1)
=> ~ p(ap(X11,ap(X10,X12))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X10),X11)) ) ) )
& ! [X16] :
( mem(X16,arr(X1,X2))
=> ! [X17] :
( mem(X17,arr(X2,bool))
=> ( ! [X18] :
( mem(X18,X2)
=> ( p(ap(X17,X18))
=> ? [X19] :
( mem(X19,X1)
& ( ap(X16,X19) = X18 ) ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X1,X2),X16),X17)) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X1,X2),X0),X3))
<=> ! [X4] :
( mem(X4,X2)
=> ( p(ap(X3,X4))
=> ? [X5] :
( mem(X5,X1)
& p(ap(X3,ap(X0,X5))) ) ) ) )
& ! [X6] :
( mem(X6,arr(X1,X2))
=> ! [X7] :
( mem(X7,arr(X2,bool))
=> ( ! [X8] :
( mem(X8,X2)
=> ( ~ p(ap(X7,X8))
=> ? [X9] :
( mem(X9,X1)
& ( ap(X6,X9) = X8 ) ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X1,X2),X6),X7)) ) ) )
& ! [X13] :
( mem(X13,arr(X1,X2))
=> ! [X14] :
( mem(X14,arr(X2,bool))
=> ( ! [X15] :
( mem(X15,X1)
=> p(ap(X14,ap(X13,X15))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X1,X2),X13),X14)) ) ) )
& ( ! [X20] :
( mem(X20,X2)
=> ( ~ p(ap(X3,X20))
=> ? [X21] :
( mem(X21,X1)
& ~ p(ap(X3,ap(X0,X21))) ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X1,X2),X0),X3)) ) ) ) ),
inference(rectify,[],[f46]) ).
tff(f46,axiom,
! [X21,X8: del,X9: del] :
( mem(X21,arr(X8,X9))
=> ! [X22] :
( mem(X22,arr(X9,bool))
=> ( ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS(X8,X9),X21),X22))
<=> ! [X23] :
( mem(X23,X9)
=> ( p(ap(X22,X23))
=> ? [X24] :
( mem(X24,X8)
& p(ap(X22,ap(X21,X24))) ) ) ) )
& ! [X37] :
( mem(X37,arr(X8,X9))
=> ! [X38] :
( mem(X38,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__GAP(X8,X9),X37),X38))
<=> ! [X39] :
( mem(X39,X9)
=> ( ~ p(ap(X38,X39))
=> ? [X40] :
( mem(X40,X8)
& ( ap(X37,X40) = X39 ) ) ) ) ) ) )
& ! [X30] :
( mem(X30,arr(X8,X9))
=> ! [X31] :
( mem(X31,arr(X9,bool))
=> ( ! [X32] :
( mem(X32,X8)
=> ~ p(ap(X31,ap(X30,X32))) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X8,X9),X30),X31)) ) ) )
& ! [X27] :
( mem(X27,arr(X8,X9))
=> ! [X28] :
( mem(X28,arr(X9,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__POINT(X8,X9),X27),X28))
<=> ! [X29] :
( mem(X29,X8)
=> p(ap(X28,ap(X27,X29))) ) ) ) )
& ! [X33] :
( mem(X33,arr(X8,X9))
=> ! [X34] :
( mem(X34,arr(X9,bool))
=> ( ! [X35] :
( mem(X35,X9)
=> ( p(ap(X34,X35))
=> ? [X36] :
( mem(X36,X8)
& ( ap(X33,X36) = X35 ) ) ) )
<=> p(ap(ap(c_2EquantHeuristics_2EGUESS__EXISTS__GAP(X8,X9),X33),X34)) ) ) )
& ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL(X8,X9),X21),X22))
<=> ! [X25] :
( mem(X25,X9)
=> ( ~ p(ap(X22,X25))
=> ? [X26] :
( mem(X26,X8)
& ~ p(ap(X22,ap(X21,X26))) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__REWRITES) ).
tff(f441,plain,
mem(sK30(sK16,sK15,sK19),sK16),
inference(unit_resulting_resolution,[],[f274,f273,f273,f276,f278,f367]) ).
tff(f367,plain,
! [X2: del,X3: $i,X0: del,X1: $i,X4: $i,X5: $i] :
( ~ mem(X5,arr(X2,bool))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5))
| ~ mem(X1,arr(X0,X2))
| mem(sK30(X0,X4,X5),X0)
| ~ mem(X4,arr(X0,X2))
| ~ mem(X3,arr(X2,bool)) ),
inference(cnf_transformation,[],[f223]) ).
tff(f278,plain,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK19)),
inference(cnf_transformation,[],[f166]) ).
tff(f166,plain,
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK19))
& ! [X5] :
( p(ap(sK18,X5))
| ~ mem(X5,sK17)
| ~ p(ap(sK19,X5)) )
& mem(sK19,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK18))
& mem(sK18,arr(sK17,bool))
& mem(sK15,arr(sK16,sK17)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19])],[f162,f165,f164,f163]) ).
tff(f163,plain,
( ? [X0,X1: del,X2: del] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X4))
& ! [X5] :
( p(ap(X3,X5))
| ~ mem(X5,X2)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(X2,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X3)) )
& mem(X3,arr(X2,bool)) )
& mem(X0,arr(X1,X2)) )
=> ( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X4))
& ! [X5] :
( p(ap(X3,X5))
| ~ mem(X5,sK17)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X3)) )
& mem(X3,arr(sK17,bool)) )
& mem(sK15,arr(sK16,sK17)) ) ),
introduced(choice_axiom,[]) ).
tff(f164,plain,
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X4))
& ! [X5] :
( p(ap(X3,X5))
| ~ mem(X5,sK17)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X3)) )
& mem(X3,arr(sK17,bool)) )
=> ( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X4))
& ! [X5] :
( p(ap(sK18,X5))
| ~ mem(X5,sK17)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK18)) )
& mem(sK18,arr(sK17,bool)) ) ),
introduced(choice_axiom,[]) ).
tff(f165,plain,
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),X4))
& ! [X5] :
( p(ap(sK18,X5))
| ~ mem(X5,sK17)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK18)) )
=> ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK19))
& ! [X5] :
( p(ap(sK18,X5))
| ~ mem(X5,sK17)
| ~ p(ap(sK19,X5)) )
& mem(sK19,arr(sK17,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK18)) ) ),
introduced(choice_axiom,[]) ).
tff(f162,plain,
? [X0,X1: del,X2: del] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X4))
& ! [X5] :
( p(ap(X3,X5))
| ~ mem(X5,X2)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(X2,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X0),X3)) )
& mem(X3,arr(X2,bool)) )
& mem(X0,arr(X1,X2)) ),
inference(rectify,[],[f112]) ).
tff(f112,plain,
? [X2,X0: del,X1: del] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X4))
& ! [X5] :
( p(ap(X3,X5))
| ~ mem(X5,X1)
| ~ p(ap(X4,X5)) )
& mem(X4,arr(X1,bool))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,X1)) ),
inference(flattening,[],[f111]) ).
tff(f111,plain,
? [X2,X1: del,X0: del] :
( ? [X3] :
( ? [X4] :
( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X4))
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
& ! [X5] :
( p(ap(X3,X5))
| ~ p(ap(X4,X5))
| ~ mem(X5,X1) )
& mem(X4,arr(X1,bool)) )
& mem(X3,arr(X1,bool)) )
& mem(X2,arr(X0,X1)) ),
inference(ennf_transformation,[],[f60]) ).
tff(f60,plain,
~ ! [X2,X1: del,X0: del] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,arr(X1,bool))
=> ! [X4] :
( mem(X4,arr(X1,bool))
=> ( ! [X5] :
( mem(X5,X1)
=> ( p(ap(X4,X5))
=> p(ap(X3,X5)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X3))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X1),X2),X4)) ) ) ) ) ),
inference(rectify,[],[f59]) ).
tff(f59,negated_conjecture,
~ ! [X9: del,X8: del,X21] :
( mem(X21,arr(X9,X8))
=> ! [X22] :
( mem(X22,arr(X8,bool))
=> ! [X46] :
( mem(X46,arr(X8,bool))
=> ( ! [X47] :
( mem(X47,X8)
=> ( p(ap(X46,X47))
=> p(ap(X22,X47)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X21),X22))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X21),X46)) ) ) ) ) ),
inference(negated_conjecture,[],[f58]) ).
tff(f58,conjecture,
! [X9: del,X8: del,X21] :
( mem(X21,arr(X9,X8))
=> ! [X22] :
( mem(X22,arr(X8,bool))
=> ! [X46] :
( mem(X46,arr(X8,bool))
=> ( ! [X47] :
( mem(X47,X8)
=> ( p(ap(X46,X47))
=> p(ap(X22,X47)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X21),X22))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X8),X21),X46)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
tff(f275,plain,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(sK16,sK17),sK15),sK18)),
inference(cnf_transformation,[],[f166]) ).
tff(f274,plain,
mem(sK18,arr(sK17,bool)),
inference(cnf_transformation,[],[f166]) ).
tff(f276,plain,
mem(sK19,arr(sK17,bool)),
inference(cnf_transformation,[],[f166]) ).
tff(f273,plain,
mem(sK15,arr(sK16,sK17)),
inference(cnf_transformation,[],[f166]) ).
tff(f448,plain,
p(ap(sK18,ap(sK15,sK30(sK16,sK15,sK19)))),
inference(unit_resulting_resolution,[],[f445,f442,f277]) ).
tff(f277,plain,
! [X5: $i] :
( ~ p(ap(sK19,X5))
| ~ mem(X5,sK17)
| p(ap(sK18,X5)) ),
inference(cnf_transformation,[],[f166]) ).
tff(f442,plain,
p(ap(sK19,ap(sK15,sK30(sK16,sK15,sK19)))),
inference(unit_resulting_resolution,[],[f274,f273,f276,f273,f278,f366]) ).
tff(f366,plain,
! [X2: del,X3: $i,X0: del,X1: $i,X4: $i,X5: $i] :
( ~ mem(X5,arr(X2,bool))
| ~ mem(X4,arr(X0,X2))
| p(ap(X5,ap(X4,sK30(X0,X4,X5))))
| ~ mem(X1,arr(X0,X2))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X0,X2),X4),X5))
| ~ mem(X3,arr(X2,bool)) ),
inference(cnf_transformation,[],[f223]) ).
tff(f445,plain,
mem(ap(sK15,sK30(sK16,sK15,sK19)),sK17),
inference(unit_resulting_resolution,[],[f273,f441,f373]) ).
tff(f373,plain,
! [X2: $i,X3: $i,X0: del,X1: del] :
( ~ mem(X2,arr(X1,X0))
| mem(ap(X2,X3),X0)
| ~ mem(X3,X1) ),
inference(cnf_transformation,[],[f123]) ).
tff(f123,plain,
! [X0: del,X1: del,X2] :
( ~ mem(X2,arr(X1,X0))
| ! [X3] :
( ~ mem(X3,X1)
| mem(ap(X2,X3),X0) ) ),
inference(ennf_transformation,[],[f93]) ).
tff(f93,plain,
! [X0: del,X2,X1: del] :
( mem(X2,arr(X1,X0))
=> ! [X3] :
( mem(X3,X1)
=> mem(ap(X2,X3),X0) ) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X1: del,X0: del,X2] :
( mem(X2,arr(X0,X1))
=> ! [X3] :
( mem(X3,X0)
=> mem(ap(X2,X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_tp) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP006_2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 23:39:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (27296)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (27317)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.51 % (27298)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.19/0.51 % (27294)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.51 % (27294)Instruction limit reached!
% 0.19/0.51 % (27294)------------------------------
% 0.19/0.51 % (27294)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (27294)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (27294)Termination reason: Unknown
% 0.19/0.51 % (27294)Termination phase: Preprocessing 3
% 0.19/0.51
% 0.19/0.51 % (27294)Memory used [KB]: 1663
% 0.19/0.51 % (27294)Time elapsed: 0.003 s
% 0.19/0.51 % (27294)Instructions burned: 4 (million)
% 0.19/0.51 % (27294)------------------------------
% 0.19/0.51 % (27294)------------------------------
% 0.19/0.51 % (27302)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.51 % (27299)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.51 % (27299)Refutation not found, incomplete strategy% (27299)------------------------------
% 0.19/0.51 % (27299)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (27299)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (27299)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (27299)Memory used [KB]: 6012
% 0.19/0.51 % (27299)Time elapsed: 0.102 s
% 0.19/0.51 % (27299)Instructions burned: 2 (million)
% 0.19/0.51 % (27299)------------------------------
% 0.19/0.51 % (27299)------------------------------
% 0.19/0.51 % (27295)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (27316)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.52 % (27296)Refutation not found, incomplete strategy% (27296)------------------------------
% 0.19/0.52 % (27296)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (27296)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (27296)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.52
% 0.19/0.52 % (27296)Memory used [KB]: 6012
% 0.19/0.52 % (27296)Time elapsed: 0.113 s
% 0.19/0.52 % (27296)Instructions burned: 1 (million)
% 0.19/0.52 % (27296)------------------------------
% 0.19/0.52 % (27296)------------------------------
% 0.19/0.52 % (27298)Instruction limit reached!
% 0.19/0.52 % (27298)------------------------------
% 0.19/0.52 % (27298)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (27321)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.19/0.52 % (27292)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.52 % (27305)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.19/0.52 % (27307)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.52 % (27312)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.19/0.52 % (27315)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.52 % (27307)Instruction limit reached!
% 0.19/0.52 % (27307)------------------------------
% 0.19/0.52 % (27307)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (27307)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (27307)Termination reason: Unknown
% 0.19/0.52 % (27307)Termination phase: Preprocessing 3
% 0.19/0.52
% 0.19/0.52 % (27307)Memory used [KB]: 1535
% 0.19/0.52 % (27307)Time elapsed: 0.004 s
% 0.19/0.52 % (27307)Instructions burned: 3 (million)
% 0.19/0.52 % (27307)------------------------------
% 0.19/0.52 % (27307)------------------------------
% 0.19/0.52 % (27293)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52 % (27308)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.52 % (27303)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.52 % (27300)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.53 % (27320)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.53 % (27322)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.19/0.53 % (27308)Instruction limit reached!
% 0.19/0.53 % (27308)------------------------------
% 0.19/0.53 % (27308)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (27293)Instruction limit reached!
% 0.19/0.53 % (27293)------------------------------
% 0.19/0.53 % (27293)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (27293)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (27293)Termination reason: Unknown
% 0.19/0.53 % (27293)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (27293)Memory used [KB]: 1918
% 0.19/0.53 % (27293)Time elapsed: 0.007 s
% 0.19/0.53 % (27293)Instructions burned: 14 (million)
% 0.19/0.53 % (27293)------------------------------
% 0.19/0.53 % (27293)------------------------------
% 0.19/0.53 % (27306)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (27301)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.53 % (27308)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (27308)Termination reason: Unknown
% 0.19/0.53 % (27308)Termination phase: shuffling
% 0.19/0.53
% 0.19/0.53 % (27308)Memory used [KB]: 1663
% 0.19/0.53 % (27308)Time elapsed: 0.005 s
% 0.19/0.53 % (27308)Instructions burned: 7 (million)
% 0.19/0.53 % (27308)------------------------------
% 0.19/0.53 % (27308)------------------------------
% 0.19/0.53 % (27310)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53 % (27310)Instruction limit reached!
% 0.19/0.53 % (27310)------------------------------
% 0.19/0.53 % (27310)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (27310)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (27310)Termination reason: Unknown
% 0.19/0.53 % (27310)Termination phase: Naming
% 0.19/0.53
% 0.19/0.53 % (27310)Memory used [KB]: 1535
% 0.19/0.53 % (27310)Time elapsed: 0.002 s
% 0.19/0.53 % (27310)Instructions burned: 3 (million)
% 0.19/0.53 % (27310)------------------------------
% 0.19/0.53 % (27310)------------------------------
% 0.19/0.53 % (27312)Instruction limit reached!
% 0.19/0.53 % (27312)------------------------------
% 0.19/0.53 % (27312)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (27312)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (27312)Termination reason: Unknown
% 0.19/0.53 % (27312)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (27312)Memory used [KB]: 1663
% 0.19/0.53 % (27312)Time elapsed: 0.006 s
% 0.19/0.53 % (27312)Instructions burned: 11 (million)
% 0.19/0.53 % (27312)------------------------------
% 0.19/0.53 % (27312)------------------------------
% 0.19/0.53 % (27323)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.53 % (27318)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53 % (27314)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.19/0.53 % (27322)Instruction limit reached!
% 0.19/0.53 % (27322)------------------------------
% 0.19/0.53 % (27322)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (27298)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (27298)Termination reason: Unknown
% 0.19/0.54 % (27298)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (27298)Memory used [KB]: 1918
% 0.19/0.54 % (27298)Time elapsed: 0.118 s
% 0.19/0.54 % (27298)Instructions burned: 15 (million)
% 0.19/0.54 % (27298)------------------------------
% 0.19/0.54 % (27298)------------------------------
% 0.19/0.54 % (27309)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54 % (27311)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.54 % (27319)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.54 % (27304)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.54 % (27302)First to succeed.
% 0.19/0.54 % (27304)Instruction limit reached!
% 0.19/0.54 % (27304)------------------------------
% 0.19/0.54 % (27304)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (27305)Instruction limit reached!
% 0.19/0.55 % (27305)------------------------------
% 0.19/0.55 % (27305)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (27303)Instruction limit reached!
% 0.19/0.55 % (27303)------------------------------
% 0.19/0.55 % (27303)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (27322)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (27322)Termination reason: Unknown
% 0.19/0.55 % (27322)Termination phase: Equality proxy
% 0.19/0.55
% 0.19/0.55 % (27322)Memory used [KB]: 1791
% 0.19/0.55 % (27322)Time elapsed: 0.008 s
% 0.19/0.55 % (27322)Instructions burned: 9 (million)
% 0.19/0.55 % (27322)------------------------------
% 0.19/0.55 % (27322)------------------------------
% 0.19/0.55 % (27321)Instruction limit reached!
% 0.19/0.55 % (27321)------------------------------
% 0.19/0.55 % (27321)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55 % (27305)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55 % (27305)Termination reason: Unknown
% 0.19/0.55 % (27305)Termination phase: Saturation
% 0.19/0.55
% 0.19/0.55 % (27305)Memory used [KB]: 1918
% 0.19/0.55 % (27305)Time elapsed: 0.149 s
% 0.19/0.55 % (27305)Instructions burned: 16 (million)
% 0.19/0.55 % (27305)------------------------------
% 0.19/0.55 % (27305)------------------------------
% 1.60/0.55 % (27303)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.55 % (27303)Termination reason: Unknown
% 1.60/0.55 % (27303)Termination phase: Saturation
% 1.60/0.55
% 1.60/0.55 % (27303)Memory used [KB]: 1791
% 1.60/0.55 % (27303)Time elapsed: 0.006 s
% 1.60/0.55 % (27303)Instructions burned: 12 (million)
% 1.60/0.55 % (27303)------------------------------
% 1.60/0.55 % (27303)------------------------------
% 1.60/0.56 % (27304)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.56 % (27304)Termination reason: Unknown
% 1.60/0.56 % (27304)Termination phase: Property scanning
% 1.60/0.56
% 1.60/0.56 % (27304)Memory used [KB]: 1791
% 1.60/0.56 % (27304)Time elapsed: 0.005 s
% 1.60/0.56 % (27304)Instructions burned: 9 (million)
% 1.60/0.56 % (27304)------------------------------
% 1.60/0.56 % (27304)------------------------------
% 1.60/0.56 % (27302)Refutation found. Thanks to Tanya!
% 1.60/0.56 % SZS status Theorem for theBenchmark
% 1.60/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.60/0.56 % (27302)------------------------------
% 1.60/0.56 % (27302)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.60/0.56 % (27302)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.60/0.56 % (27302)Termination reason: Refutation
% 1.60/0.56
% 1.60/0.56 % (27302)Memory used [KB]: 6652
% 1.60/0.56 % (27302)Time elapsed: 0.132 s
% 1.60/0.56 % (27302)Instructions burned: 22 (million)
% 1.60/0.56 % (27302)------------------------------
% 1.60/0.56 % (27302)------------------------------
% 1.60/0.56 % (27285)Success in time 0.202 s
%------------------------------------------------------------------------------