TSTP Solution File: SWC404+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC404+1 : TPTP v8.1.0. Released v2.4.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 : n024.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 18:40:59 EDT 2022
% Result : Theorem 1.53s 0.59s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 14 unt; 0 def)
% Number of atoms : 617 ( 159 equ)
% Maximal formula atoms : 58 ( 11 avg)
% Number of connectives : 901 ( 337 ~; 295 |; 233 &)
% ( 3 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 270 ( 180 !; 90 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f765,plain,
$false,
inference(avatar_sat_refutation,[],[f440,f758]) ).
fof(f758,plain,
~ spl19_6,
inference(avatar_contradiction_clause,[],[f757]) ).
fof(f757,plain,
( $false
| ~ spl19_6 ),
inference(subsumption_resolution,[],[f756,f216]) ).
fof(f216,plain,
ssItem(sK12),
inference(cnf_transformation,[],[f170]) ).
fof(f170,plain,
( ssList(sK6)
& ssList(sK7)
& ssList(sK8)
& sK9 = sK7
& ssList(sK11)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK11
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(sK10,sK8),sK11)
& ssList(sK10)
& ssList(sK9)
& memberP(sK6,sK12)
& ssItem(sK12)
& ~ memberP(sK7,sK12)
& ( nil != sK8
| nil = sK9 )
& sK6 = sK8 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12])],[f162,f169,f168,f167,f166,f165,f164,f163]) ).
fof(f163,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(X0,X14)
& ssItem(X14)
& ~ memberP(X1,X14) )
& ( nil != X2
| nil = X3 )
& X0 = X2 ) ) ) )
=> ( ssList(sK6)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(X1,X14) )
& ( nil != X2
| nil = X3 )
& sK6 = X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(X1,X14) )
& ( nil != X2
| nil = X3 )
& sK6 = X2 ) ) )
=> ( ssList(sK7)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK7 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
& ( nil != X2
| nil = X3 )
& sK6 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK7 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
& ( nil != X2
| nil = X3 )
& sK6 = X2 ) )
=> ( ssList(sK8)
& ? [X3] :
( sK7 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& app(app(X4,sK8),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
& ( nil != sK8
| nil = X3 )
& sK6 = sK8 ) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
( ? [X3] :
( sK7 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& app(app(X4,sK8),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
& ( nil != sK8
| nil = X3 )
& sK6 = sK8 )
=> ( sK9 = sK7
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(X4,sK8),X5) )
& ssList(X4) )
& ssList(sK9)
& ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
& ( nil != sK8
| nil = sK9 )
& sK6 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f167,plain,
( ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(X4,sK8),X5) )
& ssList(X4) )
=> ( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(sK10,sK8),X5) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
( ? [X5] :
( ssList(X5)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(sK10,sK8),X5) )
=> ( ssList(sK11)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK11
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8 ) ) ) )
& sK9 = app(app(sK10,sK8),sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
( ? [X14] :
( memberP(sK6,X14)
& ssItem(X14)
& ~ memberP(sK7,X14) )
=> ( memberP(sK6,sK12)
& ssItem(sK12)
& ~ memberP(sK7,sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| ~ ssList(X9)
| app(cons(X8,nil),X9) != X2 )
| ~ ssItem(X8) )
| ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4 ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(X0,X14)
& ssItem(X14)
& ~ memberP(X1,X14) )
& ( nil != X2
| nil = X3 )
& X0 = X2 ) ) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ? [X4] :
( ? [X5] :
( ssList(X5)
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| ~ ssList(X13)
| app(cons(X12,nil),X13) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 ) )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ lt(X8,X6)
| ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2 ) ) ) )
& app(app(X4,X2),X5) = X3 )
& ssList(X4) )
& ssList(X3)
& ? [X14] :
( memberP(X0,X14)
& ssItem(X14)
& ~ memberP(X1,X14) )
& ( nil != X2
| nil = X3 )
& X0 = X2 ) ) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X10,X12)
| ~ ssList(X13)
| app(cons(X12,nil),X13) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 ) )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ lt(X8,X6)
| ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2 ) ) ) )
& strictorderedP(X2)
& ssList(X5) )
& ssList(X4) )
& X1 = X3
& ? [X14] :
( memberP(X0,X14)
& ~ memberP(X1,X14)
& ssItem(X14) )
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil != X3
& nil = X2 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( lt(X10,X12)
& ssList(X13)
& app(cons(X12,nil),X13) = X2 ) )
& app(X11,cons(X10,nil)) = X4 ) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(cons(X6,nil),X7) = X5
& ? [X8] :
( ? [X9] :
( app(X9,cons(X8,nil)) = X2
& lt(X8,X6)
& ssList(X9) )
& ssItem(X8) )
& ssList(X7) ) )
| ~ strictorderedP(X2) ) ) )
| X1 != X3
| ! [X14] :
( ssItem(X14)
=> ( ~ memberP(X0,X14)
| memberP(X1,X14) ) )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ? [X12] :
( ssItem(X12)
& ? [X13] :
( lt(X12,X10)
& ssList(X13)
& app(X13,cons(X12,nil)) = X2 ) )
& ssList(X11)
& app(cons(X10,nil),X11) = X5 ) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& lt(X6,X8)
& app(cons(X8,nil),X9) = X2 ) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) ) )
| app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2) ) ) )
| X0 != X2
| ! [X14] :
( ssItem(X14)
=> ( ~ memberP(X0,X14)
| memberP(X1,X14) ) )
| X1 != X3
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ? [X12] :
( ssItem(X12)
& ? [X13] :
( lt(X12,X10)
& ssList(X13)
& app(X13,cons(X12,nil)) = X2 ) )
& ssList(X11)
& app(cons(X10,nil),X11) = X5 ) )
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& lt(X6,X8)
& app(cons(X8,nil),X9) = X2 ) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) ) )
| app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2) ) ) )
| X0 != X2
| ! [X14] :
( ssItem(X14)
=> ( ~ memberP(X0,X14)
| memberP(X1,X14) ) )
| X1 != X3
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f756,plain,
( ~ ssItem(sK12)
| ~ spl19_6 ),
inference(subsumption_resolution,[],[f753,f215]) ).
fof(f215,plain,
~ memberP(sK7,sK12),
inference(cnf_transformation,[],[f170]) ).
fof(f753,plain,
( memberP(sK7,sK12)
| ~ ssItem(sK12)
| ~ spl19_6 ),
inference(resolution,[],[f597,f273]) ).
fof(f273,plain,
memberP(sK8,sK12),
inference(definition_unfolding,[],[f217,f213]) ).
fof(f213,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f170]) ).
fof(f217,plain,
memberP(sK6,sK12),
inference(cnf_transformation,[],[f170]) ).
fof(f597,plain,
( ! [X1] :
( ~ memberP(sK8,X1)
| ~ ssItem(X1)
| memberP(sK7,X1) )
| ~ spl19_6 ),
inference(subsumption_resolution,[],[f596,f219]) ).
fof(f219,plain,
ssList(sK10),
inference(cnf_transformation,[],[f170]) ).
fof(f596,plain,
( ! [X1] :
( memberP(sK7,X1)
| ~ memberP(sK8,X1)
| ~ ssList(sK10)
| ~ ssItem(X1) )
| ~ spl19_6 ),
inference(subsumption_resolution,[],[f578,f226]) ).
fof(f226,plain,
ssList(sK8),
inference(cnf_transformation,[],[f170]) ).
fof(f578,plain,
( ! [X1] :
( memberP(sK7,X1)
| ~ ssItem(X1)
| ~ memberP(sK8,X1)
| ~ ssList(sK8)
| ~ ssList(sK10) )
| ~ spl19_6 ),
inference(duplicate_literal_removal,[],[f575]) ).
fof(f575,plain,
( ! [X1] :
( memberP(sK7,X1)
| ~ ssItem(X1)
| ~ ssList(sK8)
| ~ ssItem(X1)
| ~ ssList(sK10)
| ~ memberP(sK8,X1) )
| ~ spl19_6 ),
inference(resolution,[],[f573,f246]) ).
fof(f246,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ ssList(X1)
| ~ memberP(X2,X0)
| ~ ssItem(X0)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) ) ) ),
inference(flattening,[],[f175]) ).
fof(f175,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) ) ) ),
inference(nnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) ) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).
fof(f573,plain,
( ! [X5] :
( ~ memberP(app(sK10,sK8),X5)
| memberP(sK7,X5)
| ~ ssItem(X5) )
| ~ spl19_6 ),
inference(subsumption_resolution,[],[f572,f356]) ).
fof(f356,plain,
( ssList(app(sK10,sK8))
| ~ spl19_6 ),
inference(avatar_component_clause,[],[f355]) ).
fof(f355,plain,
( spl19_6
<=> ssList(app(sK10,sK8)) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_6])]) ).
fof(f572,plain,
! [X5] :
( ~ memberP(app(sK10,sK8),X5)
| memberP(sK7,X5)
| ~ ssItem(X5)
| ~ ssList(app(sK10,sK8)) ),
inference(subsumption_resolution,[],[f565,f224]) ).
fof(f224,plain,
ssList(sK11),
inference(cnf_transformation,[],[f170]) ).
fof(f565,plain,
! [X5] :
( memberP(sK7,X5)
| ~ ssItem(X5)
| ~ ssList(sK11)
| ~ memberP(app(sK10,sK8),X5)
| ~ ssList(app(sK10,sK8)) ),
inference(superposition,[],[f247,f271]) ).
fof(f271,plain,
sK7 = app(app(sK10,sK8),sK11),
inference(definition_unfolding,[],[f220,f225]) ).
fof(f225,plain,
sK9 = sK7,
inference(cnf_transformation,[],[f170]) ).
fof(f220,plain,
sK9 = app(app(sK10,sK8),sK11),
inference(cnf_transformation,[],[f170]) ).
fof(f247,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ memberP(X1,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f440,plain,
spl19_6,
inference(avatar_contradiction_clause,[],[f439]) ).
fof(f439,plain,
( $false
| spl19_6 ),
inference(subsumption_resolution,[],[f438,f226]) ).
fof(f438,plain,
( ~ ssList(sK8)
| spl19_6 ),
inference(subsumption_resolution,[],[f437,f219]) ).
fof(f437,plain,
( ~ ssList(sK10)
| ~ ssList(sK8)
| spl19_6 ),
inference(resolution,[],[f357,f229]) ).
fof(f229,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f357,plain,
( ~ ssList(app(sK10,sK8))
| spl19_6 ),
inference(avatar_component_clause,[],[f355]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC404+1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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.14/0.35 % Computer : n024.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 : Tue Aug 30 18:56:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.52 % (6208)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.20/0.52 % (6210)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.20/0.52 % (6226)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.20/0.52 % (6202)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.36/0.53 % (6206)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)
% 1.36/0.54 % (6205)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)
% 1.36/0.54 % (6224)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)
% 1.36/0.54 % (6204)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)
% 1.36/0.54 % (6230)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)
% 1.36/0.54 % (6204)Instruction limit reached!
% 1.36/0.54 % (6204)------------------------------
% 1.36/0.54 % (6204)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.54 % (6204)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.54 % (6204)Termination reason: Unknown
% 1.36/0.54 % (6204)Termination phase: Preprocessing 3
% 1.36/0.54
% 1.36/0.54 % (6204)Memory used [KB]: 1663
% 1.36/0.54 % (6204)Time elapsed: 0.003 s
% 1.36/0.54 % (6204)Instructions burned: 4 (million)
% 1.36/0.54 % (6204)------------------------------
% 1.36/0.54 % (6204)------------------------------
% 1.36/0.54 % (6225)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)
% 1.36/0.55 % (6229)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)
% 1.36/0.55 % (6216)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)
% 1.36/0.55 % (6222)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)
% 1.36/0.55 % (6216)Instruction limit reached!
% 1.36/0.55 % (6216)------------------------------
% 1.36/0.55 % (6216)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.36/0.55 % (6221)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)
% 1.36/0.55 % (6216)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.36/0.55 % (6216)Termination reason: Unknown
% 1.36/0.55 % (6216)Termination phase: Preprocessing 3
% 1.36/0.55
% 1.36/0.55 % (6216)Memory used [KB]: 1535
% 1.36/0.55 % (6216)Time elapsed: 0.006 s
% 1.36/0.55 % (6216)Instructions burned: 3 (million)
% 1.36/0.55 % (6216)------------------------------
% 1.36/0.55 % (6216)------------------------------
% 1.36/0.55 % (6217)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)
% 1.53/0.55 % (6203)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)
% 1.53/0.55 % (6212)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)
% 1.53/0.55 % (6217)Instruction limit reached!
% 1.53/0.55 % (6217)------------------------------
% 1.53/0.55 % (6217)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.55 % (6217)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.55 % (6217)Termination reason: Unknown
% 1.53/0.55 % (6217)Termination phase: Property scanning
% 1.53/0.55
% 1.53/0.55 % (6217)Memory used [KB]: 1791
% 1.53/0.55 % (6217)Time elapsed: 0.004 s
% 1.53/0.55 % (6217)Instructions burned: 7 (million)
% 1.53/0.55 % (6217)------------------------------
% 1.53/0.55 % (6217)------------------------------
% 1.53/0.56 % (6214)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)
% 1.53/0.56 % (6213)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)
% 1.53/0.56 % (6209)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)
% 1.53/0.56 % (6231)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)
% 1.53/0.56 % (6211)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)
% 1.53/0.56 % (6206)Instruction limit reached!
% 1.53/0.56 % (6206)------------------------------
% 1.53/0.56 % (6206)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.56 % (6206)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.56 % (6206)Termination reason: Unknown
% 1.53/0.56 % (6206)Termination phase: Saturation
% 1.53/0.56
% 1.53/0.56 % (6206)Memory used [KB]: 6268
% 1.53/0.56 % (6206)Time elapsed: 0.143 s
% 1.53/0.56 % (6206)Instructions burned: 13 (million)
% 1.53/0.56 % (6206)------------------------------
% 1.53/0.56 % (6206)------------------------------
% 1.53/0.56 % (6218)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)
% 1.53/0.56 % (6220)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)
% 1.53/0.56 % (6220)Instruction limit reached!
% 1.53/0.56 % (6220)------------------------------
% 1.53/0.56 % (6220)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.56 % (6220)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.56 % (6220)Termination reason: Unknown
% 1.53/0.56 % (6220)Termination phase: SInE selection
% 1.53/0.56
% 1.53/0.56 % (6220)Memory used [KB]: 1407
% 1.53/0.56 % (6220)Time elapsed: 0.002 s
% 1.53/0.56 % (6220)Instructions burned: 2 (million)
% 1.53/0.56 % (6220)------------------------------
% 1.53/0.56 % (6220)------------------------------
% 1.53/0.56 % (6223)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)
% 1.53/0.56 % (6228)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)
% 1.53/0.57 % (6230)Instruction limit reached!
% 1.53/0.57 % (6230)------------------------------
% 1.53/0.57 % (6230)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.57 % (6230)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.57 % (6230)Termination reason: Unknown
% 1.53/0.57 % (6230)Termination phase: Property scanning
% 1.53/0.57
% 1.53/0.57 % (6230)Memory used [KB]: 1791
% 1.53/0.57 % (6230)Time elapsed: 0.006 s
% 1.53/0.57 % (6230)Instructions burned: 9 (million)
% 1.53/0.57 % (6230)------------------------------
% 1.53/0.57 % (6230)------------------------------
% 1.53/0.57 % (6207)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)
% 1.53/0.57 % (6227)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)
% 1.53/0.57 % (6219)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.53/0.58 % (6219)Instruction limit reached!
% 1.53/0.58 % (6219)------------------------------
% 1.53/0.58 % (6219)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (6219)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (6219)Termination reason: Unknown
% 1.53/0.58 % (6219)Termination phase: Preprocessing 3
% 1.53/0.58
% 1.53/0.58 % (6219)Memory used [KB]: 1663
% 1.53/0.58 % (6219)Time elapsed: 0.004 s
% 1.53/0.58 % (6219)Instructions burned: 5 (million)
% 1.53/0.58 % (6219)------------------------------
% 1.53/0.58 % (6219)------------------------------
% 1.53/0.58 % (6214)Instruction limit reached!
% 1.53/0.58 % (6214)------------------------------
% 1.53/0.58 % (6214)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (6214)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (6214)Termination reason: Unknown
% 1.53/0.58 % (6214)Termination phase: Saturation
% 1.53/0.58
% 1.53/0.58 % (6214)Memory used [KB]: 2046
% 1.53/0.58 % (6214)Time elapsed: 0.167 s
% 1.53/0.58 % (6214)Instructions burned: 18 (million)
% 1.53/0.58 % (6214)------------------------------
% 1.53/0.58 % (6214)------------------------------
% 1.53/0.58 % (6203)Instruction limit reached!
% 1.53/0.58 % (6203)------------------------------
% 1.53/0.58 % (6203)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (6203)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (6203)Termination reason: Unknown
% 1.53/0.58 % (6203)Termination phase: Saturation
% 1.53/0.58
% 1.53/0.58 % (6203)Memory used [KB]: 6396
% 1.53/0.58 % (6203)Time elapsed: 0.008 s
% 1.53/0.58 % (6203)Instructions burned: 13 (million)
% 1.53/0.58 % (6203)------------------------------
% 1.53/0.58 % (6203)------------------------------
% 1.53/0.58 % (6221)Instruction limit reached!
% 1.53/0.58 % (6221)------------------------------
% 1.53/0.58 % (6221)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (6221)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (6221)Termination reason: Unknown
% 1.53/0.58 % (6221)Termination phase: Saturation
% 1.53/0.58
% 1.53/0.58 % (6221)Memory used [KB]: 6396
% 1.53/0.58 % (6221)Time elapsed: 0.166 s
% 1.53/0.58 % (6221)Instructions burned: 13 (million)
% 1.53/0.58 % (6221)------------------------------
% 1.53/0.58 % (6221)------------------------------
% 1.53/0.58 % (6215)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)
% 1.53/0.58 % (6213)Instruction limit reached!
% 1.53/0.58 % (6213)------------------------------
% 1.53/0.58 % (6213)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (6213)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (6213)Termination reason: Unknown
% 1.53/0.58 % (6213)Termination phase: Saturation
% 1.53/0.58
% 1.53/0.58 % (6213)Memory used [KB]: 6140
% 1.53/0.58 % (6213)Time elapsed: 0.005 s
% 1.53/0.58 % (6213)Instructions burned: 7 (million)
% 1.53/0.58 % (6213)------------------------------
% 1.53/0.58 % (6213)------------------------------
% 1.53/0.58 % (6208)First to succeed.
% 1.53/0.59 % (6208)Refutation found. Thanks to Tanya!
% 1.53/0.59 % SZS status Theorem for theBenchmark
% 1.53/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.59 % (6208)------------------------------
% 1.53/0.59 % (6208)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.59 % (6208)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.59 % (6208)Termination reason: Refutation
% 1.53/0.59
% 1.53/0.59 % (6208)Memory used [KB]: 6396
% 1.53/0.59 % (6208)Time elapsed: 0.165 s
% 1.53/0.59 % (6208)Instructions burned: 28 (million)
% 1.53/0.59 % (6208)------------------------------
% 1.53/0.59 % (6208)------------------------------
% 1.53/0.59 % (6201)Success in time 0.227 s
%------------------------------------------------------------------------------