TSTP Solution File: SWC343+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC343+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 : n009.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:35 EDT 2022
% Result : Theorem 1.57s 0.56s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of formulae : 115 ( 7 unt; 0 def)
% Number of atoms : 866 ( 296 equ)
% Maximal formula atoms : 60 ( 7 avg)
% Number of connectives : 1205 ( 454 ~; 450 |; 264 &)
% ( 10 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 254 ( 144 !; 110 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f360,plain,
$false,
inference(avatar_sat_refutation,[],[f291,f295,f303,f307,f311,f315,f316,f320,f321,f322,f323,f324,f325,f326,f327,f328,f359]) ).
fof(f359,plain,
( ~ spl19_2
| ~ spl19_4
| ~ spl19_5
| ~ spl19_7
| ~ spl19_8
| ~ spl19_9
| ~ spl19_10 ),
inference(avatar_contradiction_clause,[],[f358]) ).
fof(f358,plain,
( $false
| ~ spl19_2
| ~ spl19_4
| ~ spl19_5
| ~ spl19_7
| ~ spl19_8
| ~ spl19_9
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f357,f343]) ).
fof(f343,plain,
( lt(sK13(sK15),sK11(sK15))
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f342,f217]) ).
fof(f217,plain,
ssList(sK15),
inference(cnf_transformation,[],[f169]) ).
fof(f169,plain,
( ssList(sK7)
& ssList(sK9)
& ssList(sK10)
& ( nil = sK10
| nil != sK9 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ( ssList(sK12(X4))
& app(cons(sK11(X4),nil),sK12(X4)) = X4
& ssList(sK14(X4))
& sK7 = app(sK14(X4),cons(sK13(X4),nil))
& lt(sK13(X4),sK11(X4))
& ssItem(sK13(X4))
& ssItem(sK11(X4)) ) )
| ( nil = sK7
& nil != sK8 ) )
& app(sK9,sK15) = sK10
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != sK15 ) )
& ssList(sK15)
& sK8 = sK10
& sK7 = sK9
& ssList(sK8) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15])],[f159,f168,f167,f166,f165,f164,f163,f162,f161,f160]) ).
fof(f160,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(X0,X4) != X1
| ~ strictorderedP(X0)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X0
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = X0
& nil != X1 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) )
=> ( ssList(sK7)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(sK7,X4) != X1
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != X1 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& X1 = X3
& sK7 = X2 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f161,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(sK7,X4) != X1
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != X1 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& X1 = X3
& sK7 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != sK8 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& sK8 = X3
& sK7 = X2 ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f162,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != sK8 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& sK8 = X3
& sK7 = X2 ) )
=> ( ssList(sK9)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != sK9 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != sK8 ) )
& ? [X9] :
( app(sK9,X9) = X3
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& sK8 = X3
& sK7 = sK9 ) ) ),
introduced(choice_axiom,[]) ).
fof(f163,plain,
( ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != sK9 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != sK8 ) )
& ? [X9] :
( app(sK9,X9) = X3
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& sK8 = X3
& sK7 = sK9 )
=> ( ssList(sK10)
& ( nil = sK10
| nil != sK9 )
& ( ! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = sK7
& nil != sK8 ) )
& ? [X9] :
( sK10 = app(sK9,X9)
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& sK8 = sK10
& sK7 = sK9 ) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) )
=> ( ? [X6] :
( ssList(X6)
& app(cons(sK11(X4),nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,sK11(X4)) )
& ssItem(X7) ) )
& ssItem(sK11(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f165,plain,
! [X4] :
( ? [X6] :
( ssList(X6)
& app(cons(sK11(X4),nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,sK11(X4)) )
& ssItem(X7) ) )
=> ( ssList(sK12(X4))
& app(cons(sK11(X4),nil),sK12(X4)) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,sK11(X4)) )
& ssItem(X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f166,plain,
! [X4] :
( ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = sK7
& lt(X7,sK11(X4)) )
& ssItem(X7) )
=> ( ? [X8] :
( ssList(X8)
& sK7 = app(X8,cons(sK13(X4),nil))
& lt(sK13(X4),sK11(X4)) )
& ssItem(sK13(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f167,plain,
! [X4] :
( ? [X8] :
( ssList(X8)
& sK7 = app(X8,cons(sK13(X4),nil))
& lt(sK13(X4),sK11(X4)) )
=> ( ssList(sK14(X4))
& sK7 = app(sK14(X4),cons(sK13(X4),nil))
& lt(sK13(X4),sK11(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f168,plain,
( ? [X9] :
( sK10 = app(sK9,X9)
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
=> ( app(sK9,sK15) = sK10
& strictorderedP(sK9)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK9 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != sK15 ) )
& ssList(sK15) ) ),
introduced(choice_axiom,[]) ).
fof(f159,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X4] :
( app(X0,X4) != X1
| ~ strictorderedP(X0)
| ~ ssList(X4)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X0
& lt(X7,X5) )
& ssItem(X7) ) )
& ssItem(X5) ) )
| ( nil = X0
& nil != X1 ) )
& ? [X9] :
( app(X2,X9) = X3
& strictorderedP(X2)
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2 )
| ~ ssItem(X12) )
| ~ ssList(X11)
| app(cons(X10,nil),X11) != X9 ) )
& ssList(X9) )
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(rectify,[],[f117]) ).
fof(f117,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil = X3
| nil != X2 )
& ( ! [X9] :
( app(X0,X9) != X1
| ~ strictorderedP(X0)
| ~ ssList(X9)
| ? [X10] :
( ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X0
& lt(X12,X10) )
& ssItem(X12) ) )
& ssItem(X10) ) )
| ( nil = X0
& nil != X1 ) )
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& ssList(X4) )
& X1 = X3
& X0 = X2 ) )
& ssList(X1) ) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) )
| ~ ssList(X6)
| app(cons(X5,nil),X6) != X4 ) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ( ! [X9] :
( app(X0,X9) != X1
| ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X0
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X0)
| ~ ssList(X9) )
| ( nil = X0
& nil != X1 ) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( app(X8,cons(X7,nil)) = X2
& lt(X7,X5)
& ssList(X8) ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ( ? [X9] :
( app(X0,X9) = X1
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X0 ) ) )
| app(cons(X10,nil),X11) != X9 ) ) )
& strictorderedP(X0)
& ssList(X9) )
& ( nil != X0
| nil = X1 ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( app(X8,cons(X7,nil)) = X2
& lt(X7,X5)
& ssList(X8) ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ( ? [X9] :
( app(X0,X9) = X1
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X0 ) ) )
| app(cons(X10,nil),X11) != X9 ) ) )
& strictorderedP(X0)
& ssList(X9) )
& ( nil != X0
| nil = X1 ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f342,plain,
( ~ ssList(sK15)
| lt(sK13(sK15),sK11(sK15))
| ~ spl19_9 ),
inference(trivial_inequality_removal,[],[f341]) ).
fof(f341,plain,
( sK10 != sK10
| ~ ssList(sK15)
| lt(sK13(sK15),sK11(sK15))
| ~ spl19_9 ),
inference(superposition,[],[f314,f220]) ).
fof(f220,plain,
app(sK9,sK15) = sK10,
inference(cnf_transformation,[],[f169]) ).
fof(f314,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| lt(sK13(X4),sK11(X4))
| ~ ssList(X4) )
| ~ spl19_9 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f313,plain,
( spl19_9
<=> ! [X4] :
( lt(sK13(X4),sK11(X4))
| ~ ssList(X4)
| app(sK9,X4) != sK10 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_9])]) ).
fof(f357,plain,
( ~ lt(sK13(sK15),sK11(sK15))
| ~ spl19_2
| ~ spl19_4
| ~ spl19_5
| ~ spl19_7
| ~ spl19_8
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f356,f331]) ).
fof(f331,plain,
( ssItem(sK13(sK15))
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f330,f217]) ).
fof(f330,plain,
( ssItem(sK13(sK15))
| ~ ssList(sK15)
| ~ spl19_2 ),
inference(trivial_inequality_removal,[],[f329]) ).
fof(f329,plain,
( ssItem(sK13(sK15))
| ~ ssList(sK15)
| sK10 != sK10
| ~ spl19_2 ),
inference(superposition,[],[f286,f220]) ).
fof(f286,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| ssItem(sK13(X4))
| ~ ssList(X4) )
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f285]) ).
fof(f285,plain,
( spl19_2
<=> ! [X4] :
( ~ ssList(X4)
| ssItem(sK13(X4))
| app(sK9,X4) != sK10 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_2])]) ).
fof(f356,plain,
( ~ ssItem(sK13(sK15))
| ~ lt(sK13(sK15),sK11(sK15))
| ~ spl19_4
| ~ spl19_5
| ~ spl19_7
| ~ spl19_8
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f355,f337]) ).
fof(f337,plain,
( ssList(sK14(sK15))
| ~ spl19_7 ),
inference(subsumption_resolution,[],[f336,f217]) ).
fof(f336,plain,
( ~ ssList(sK15)
| ssList(sK14(sK15))
| ~ spl19_7 ),
inference(trivial_inequality_removal,[],[f335]) ).
fof(f335,plain,
( sK10 != sK10
| ssList(sK14(sK15))
| ~ ssList(sK15)
| ~ spl19_7 ),
inference(superposition,[],[f306,f220]) ).
fof(f306,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| ssList(sK14(X4))
| ~ ssList(X4) )
| ~ spl19_7 ),
inference(avatar_component_clause,[],[f305]) ).
fof(f305,plain,
( spl19_7
<=> ! [X4] :
( ~ ssList(X4)
| app(sK9,X4) != sK10
| ssList(sK14(X4)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_7])]) ).
fof(f355,plain,
( ~ ssList(sK14(sK15))
| ~ lt(sK13(sK15),sK11(sK15))
| ~ ssItem(sK13(sK15))
| ~ spl19_4
| ~ spl19_5
| ~ spl19_8
| ~ spl19_10 ),
inference(trivial_inequality_removal,[],[f354]) ).
fof(f354,plain,
( sK9 != sK9
| ~ lt(sK13(sK15),sK11(sK15))
| ~ ssItem(sK13(sK15))
| ~ ssList(sK14(sK15))
| ~ spl19_4
| ~ spl19_5
| ~ spl19_8
| ~ spl19_10 ),
inference(superposition,[],[f353,f346]) ).
fof(f346,plain,
( app(sK14(sK15),cons(sK13(sK15),nil)) = sK9
| ~ spl19_4 ),
inference(subsumption_resolution,[],[f345,f217]) ).
fof(f345,plain,
( app(sK14(sK15),cons(sK13(sK15),nil)) = sK9
| ~ ssList(sK15)
| ~ spl19_4 ),
inference(trivial_inequality_removal,[],[f344]) ).
fof(f344,plain,
( sK10 != sK10
| app(sK14(sK15),cons(sK13(sK15),nil)) = sK9
| ~ ssList(sK15)
| ~ spl19_4 ),
inference(superposition,[],[f294,f220]) ).
fof(f294,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| ~ ssList(X4)
| app(sK14(X4),cons(sK13(X4),nil)) = sK9 )
| ~ spl19_4 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f293,plain,
( spl19_4
<=> ! [X4] :
( app(sK9,X4) != sK10
| ~ ssList(X4)
| app(sK14(X4),cons(sK13(X4),nil)) = sK9 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_4])]) ).
fof(f353,plain,
( ! [X0,X1] :
( app(X1,cons(X0,nil)) != sK9
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ lt(X0,sK11(sK15)) )
| ~ spl19_5
| ~ spl19_8
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f352,f340]) ).
fof(f340,plain,
( ssItem(sK11(sK15))
| ~ spl19_8 ),
inference(subsumption_resolution,[],[f339,f217]) ).
fof(f339,plain,
( ~ ssList(sK15)
| ssItem(sK11(sK15))
| ~ spl19_8 ),
inference(trivial_inequality_removal,[],[f338]) ).
fof(f338,plain,
( ssItem(sK11(sK15))
| ~ ssList(sK15)
| sK10 != sK10
| ~ spl19_8 ),
inference(superposition,[],[f310,f220]) ).
fof(f310,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| ssItem(sK11(X4))
| ~ ssList(X4) )
| ~ spl19_8 ),
inference(avatar_component_clause,[],[f309]) ).
fof(f309,plain,
( spl19_8
<=> ! [X4] :
( app(sK9,X4) != sK10
| ~ ssList(X4)
| ssItem(sK11(X4)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_8])]) ).
fof(f352,plain,
( ! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssItem(sK11(sK15))
| ~ lt(X0,sK11(sK15))
| app(X1,cons(X0,nil)) != sK9 )
| ~ spl19_5
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f351,f334]) ).
fof(f334,plain,
( ssList(sK12(sK15))
| ~ spl19_5 ),
inference(subsumption_resolution,[],[f333,f217]) ).
fof(f333,plain,
( ~ ssList(sK15)
| ssList(sK12(sK15))
| ~ spl19_5 ),
inference(trivial_inequality_removal,[],[f332]) ).
fof(f332,plain,
( ~ ssList(sK15)
| ssList(sK12(sK15))
| sK10 != sK10
| ~ spl19_5 ),
inference(superposition,[],[f298,f220]) ).
fof(f298,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| ~ ssList(X4)
| ssList(sK12(X4)) )
| ~ spl19_5 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f297,plain,
( spl19_5
<=> ! [X4] :
( ssList(sK12(X4))
| app(sK9,X4) != sK10
| ~ ssList(X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_5])]) ).
fof(f351,plain,
( ! [X0,X1] :
( ~ ssList(sK12(sK15))
| ~ ssList(X1)
| ~ ssItem(sK11(sK15))
| app(X1,cons(X0,nil)) != sK9
| ~ lt(X0,sK11(sK15))
| ~ ssItem(X0) )
| ~ spl19_10 ),
inference(trivial_inequality_removal,[],[f350]) ).
fof(f350,plain,
( ! [X0,X1] :
( ~ lt(X0,sK11(sK15))
| sK15 != sK15
| app(X1,cons(X0,nil)) != sK9
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(sK12(sK15))
| ~ ssItem(sK11(sK15)) )
| ~ spl19_10 ),
inference(superposition,[],[f218,f349]) ).
fof(f349,plain,
( app(cons(sK11(sK15),nil),sK12(sK15)) = sK15
| ~ spl19_10 ),
inference(subsumption_resolution,[],[f348,f217]) ).
fof(f348,plain,
( app(cons(sK11(sK15),nil),sK12(sK15)) = sK15
| ~ ssList(sK15)
| ~ spl19_10 ),
inference(trivial_inequality_removal,[],[f347]) ).
fof(f347,plain,
( sK10 != sK10
| ~ ssList(sK15)
| app(cons(sK11(sK15),nil),sK12(sK15)) = sK15
| ~ spl19_10 ),
inference(superposition,[],[f319,f220]) ).
fof(f319,plain,
( ! [X4] :
( app(sK9,X4) != sK10
| app(cons(sK11(X4),nil),sK12(X4)) = X4
| ~ ssList(X4) )
| ~ spl19_10 ),
inference(avatar_component_clause,[],[f318]) ).
fof(f318,plain,
( spl19_10
<=> ! [X4] :
( app(cons(sK11(X4),nil),sK12(X4)) = X4
| app(sK9,X4) != sK10
| ~ ssList(X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_10])]) ).
fof(f218,plain,
! [X10,X11,X12,X13] :
( app(cons(X10,nil),X11) != sK15
| ~ ssItem(X12)
| ~ ssList(X13)
| ~ ssList(X11)
| app(X13,cons(X12,nil)) != sK9
| ~ ssItem(X10)
| ~ lt(X12,X10) ),
inference(cnf_transformation,[],[f169]) ).
fof(f328,plain,
( spl19_9
| ~ spl19_3
| ~ spl19_6 ),
inference(avatar_split_clause,[],[f266,f300,f288,f313]) ).
fof(f288,plain,
( spl19_3
<=> strictorderedP(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_3])]) ).
fof(f300,plain,
( spl19_6
<=> nil = sK10 ),
introduced(avatar_definition,[new_symbols(naming,[spl19_6])]) ).
fof(f266,plain,
! [X4] :
( nil != sK10
| ~ strictorderedP(sK9)
| ~ ssList(X4)
| app(sK9,X4) != sK10
| lt(sK13(X4),sK11(X4)) ),
inference(definition_unfolding,[],[f225,f215,f216,f215,f216]) ).
fof(f216,plain,
sK8 = sK10,
inference(cnf_transformation,[],[f169]) ).
fof(f215,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f169]) ).
fof(f225,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| lt(sK13(X4),sK11(X4))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f327,plain,
( ~ spl19_3
| ~ spl19_6
| spl19_4 ),
inference(avatar_split_clause,[],[f264,f293,f300,f288]) ).
fof(f264,plain,
! [X4] :
( ~ ssList(X4)
| nil != sK10
| app(sK14(X4),cons(sK13(X4),nil)) = sK9
| app(sK9,X4) != sK10
| ~ strictorderedP(sK9) ),
inference(definition_unfolding,[],[f227,f215,f216,f215,f215,f216]) ).
fof(f227,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| sK7 = app(sK14(X4),cons(sK13(X4),nil))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f326,plain,
( spl19_1
| ~ spl19_3
| spl19_8 ),
inference(avatar_split_clause,[],[f269,f309,f288,f281]) ).
fof(f281,plain,
( spl19_1
<=> nil = sK9 ),
introduced(avatar_definition,[new_symbols(naming,[spl19_1])]) ).
fof(f269,plain,
! [X4] :
( ssItem(sK11(X4))
| app(sK9,X4) != sK10
| ~ strictorderedP(sK9)
| nil = sK9
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f222,f215,f216,f215,f215]) ).
fof(f222,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssItem(sK11(X4))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f325,plain,
( spl19_6
| ~ spl19_1 ),
inference(avatar_split_clause,[],[f235,f281,f300]) ).
fof(f235,plain,
( nil != sK9
| nil = sK10 ),
inference(cnf_transformation,[],[f169]) ).
fof(f324,plain,
( ~ spl19_3
| ~ spl19_6
| spl19_2 ),
inference(avatar_split_clause,[],[f268,f285,f300,f288]) ).
fof(f268,plain,
! [X4] :
( ssItem(sK13(X4))
| nil != sK10
| app(sK9,X4) != sK10
| ~ strictorderedP(sK9)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f223,f215,f216,f215,f216]) ).
fof(f223,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssItem(sK13(X4))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f323,plain,
( ~ spl19_3
| ~ spl19_6
| spl19_10 ),
inference(avatar_split_clause,[],[f260,f318,f300,f288]) ).
fof(f260,plain,
! [X4] :
( ~ ssList(X4)
| nil != sK10
| app(cons(sK11(X4),nil),sK12(X4)) = X4
| app(sK9,X4) != sK10
| ~ strictorderedP(sK9) ),
inference(definition_unfolding,[],[f231,f215,f216,f215,f216]) ).
fof(f231,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| app(cons(sK11(X4),nil),sK12(X4)) = X4
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f322,plain,
( spl19_1
| ~ spl19_3
| spl19_5 ),
inference(avatar_split_clause,[],[f257,f297,f288,f281]) ).
fof(f257,plain,
! [X4] :
( ssList(sK12(X4))
| ~ strictorderedP(sK9)
| ~ ssList(X4)
| nil = sK9
| app(sK9,X4) != sK10 ),
inference(definition_unfolding,[],[f234,f215,f216,f215,f215]) ).
fof(f234,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssList(sK12(X4))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f321,plain,
spl19_3,
inference(avatar_split_clause,[],[f219,f288]) ).
fof(f219,plain,
strictorderedP(sK9),
inference(cnf_transformation,[],[f169]) ).
fof(f320,plain,
( ~ spl19_3
| spl19_1
| spl19_10 ),
inference(avatar_split_clause,[],[f259,f318,f281,f288]) ).
fof(f259,plain,
! [X4] :
( app(cons(sK11(X4),nil),sK12(X4)) = X4
| nil = sK9
| ~ ssList(X4)
| ~ strictorderedP(sK9)
| app(sK9,X4) != sK10 ),
inference(definition_unfolding,[],[f232,f215,f216,f215,f215]) ).
fof(f232,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| app(cons(sK11(X4),nil),sK12(X4)) = X4
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f316,plain,
( ~ spl19_6
| spl19_7
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f262,f288,f305,f300]) ).
fof(f262,plain,
! [X4] :
( ~ strictorderedP(sK9)
| app(sK9,X4) != sK10
| nil != sK10
| ~ ssList(X4)
| ssList(sK14(X4)) ),
inference(definition_unfolding,[],[f229,f215,f216,f215,f216]) ).
fof(f229,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssList(sK14(X4))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f315,plain,
( spl19_1
| spl19_9
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f265,f288,f313,f281]) ).
fof(f265,plain,
! [X4] :
( ~ strictorderedP(sK9)
| lt(sK13(X4),sK11(X4))
| app(sK9,X4) != sK10
| nil = sK9
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f226,f215,f216,f215,f215]) ).
fof(f226,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| lt(sK13(X4),sK11(X4))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f311,plain,
( ~ spl19_3
| ~ spl19_6
| spl19_8 ),
inference(avatar_split_clause,[],[f270,f309,f300,f288]) ).
fof(f270,plain,
! [X4] :
( app(sK9,X4) != sK10
| ssItem(sK11(X4))
| ~ ssList(X4)
| nil != sK10
| ~ strictorderedP(sK9) ),
inference(definition_unfolding,[],[f221,f215,f216,f215,f216]) ).
fof(f221,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssItem(sK11(X4))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f307,plain,
( spl19_1
| spl19_7
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f261,f288,f305,f281]) ).
fof(f261,plain,
! [X4] :
( ~ strictorderedP(sK9)
| ~ ssList(X4)
| nil = sK9
| ssList(sK14(X4))
| app(sK9,X4) != sK10 ),
inference(definition_unfolding,[],[f230,f215,f216,f215,f215]) ).
fof(f230,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssList(sK14(X4))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f303,plain,
( spl19_5
| ~ spl19_3
| ~ spl19_6 ),
inference(avatar_split_clause,[],[f258,f300,f288,f297]) ).
fof(f258,plain,
! [X4] :
( nil != sK10
| ~ strictorderedP(sK9)
| ssList(sK12(X4))
| ~ ssList(X4)
| app(sK9,X4) != sK10 ),
inference(definition_unfolding,[],[f233,f215,f216,f215,f216]) ).
fof(f233,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssList(sK12(X4))
| nil != sK8 ),
inference(cnf_transformation,[],[f169]) ).
fof(f295,plain,
( spl19_4
| spl19_1
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f263,f288,f281,f293]) ).
fof(f263,plain,
! [X4] :
( ~ strictorderedP(sK9)
| nil = sK9
| app(sK9,X4) != sK10
| app(sK14(X4),cons(sK13(X4),nil)) = sK9
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f228,f215,f216,f215,f215,f215]) ).
fof(f228,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| sK7 = app(sK14(X4),cons(sK13(X4),nil))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
fof(f291,plain,
( spl19_1
| spl19_2
| ~ spl19_3 ),
inference(avatar_split_clause,[],[f267,f288,f285,f281]) ).
fof(f267,plain,
! [X4] :
( ~ strictorderedP(sK9)
| ~ ssList(X4)
| app(sK9,X4) != sK10
| ssItem(sK13(X4))
| nil = sK9 ),
inference(definition_unfolding,[],[f224,f215,f216,f215,f215]) ).
fof(f224,plain,
! [X4] :
( app(sK7,X4) != sK8
| ~ strictorderedP(sK7)
| ~ ssList(X4)
| ssItem(sK13(X4))
| nil = sK7 ),
inference(cnf_transformation,[],[f169]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC343+1 : TPTP v8.1.0. Released v2.4.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 : n009.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 : Tue Aug 30 18:46:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (18489)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.51 % (18497)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 % (18489)Instruction limit reached!
% 0.19/0.52 % (18489)------------------------------
% 0.19/0.52 % (18489)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (18505)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 % (18489)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (18489)Termination reason: Unknown
% 0.19/0.52 % (18489)Termination phase: Saturation
% 0.19/0.52
% 0.19/0.52 % (18489)Memory used [KB]: 6140
% 0.19/0.52 % (18489)Time elapsed: 0.110 s
% 0.19/0.52 % (18489)Instructions burned: 8 (million)
% 0.19/0.52 % (18489)------------------------------
% 0.19/0.52 % (18489)------------------------------
% 0.19/0.52 % (18485)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.52 % (18484)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.53 % (18507)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 % (18482)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.53 % (18497)Instruction limit reached!
% 0.19/0.53 % (18497)------------------------------
% 0.19/0.53 % (18497)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (18497)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (18497)Termination reason: Unknown
% 0.19/0.53 % (18497)Termination phase: Saturation
% 0.19/0.53
% 0.19/0.53 % (18497)Memory used [KB]: 6268
% 0.19/0.53 % (18497)Time elapsed: 0.126 s
% 0.19/0.53 % (18497)Instructions burned: 11 (million)
% 0.19/0.53 % (18497)------------------------------
% 0.19/0.53 % (18497)------------------------------
% 0.19/0.53 % (18481)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.53 % (18487)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.53 % (18490)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.53 % (18495)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.53 % (18492)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.54 % (18482)First to succeed.
% 0.19/0.54 % (18492)Instruction limit reached!
% 0.19/0.54 % (18492)------------------------------
% 0.19/0.54 % (18492)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (18492)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (18492)Termination reason: Unknown
% 0.19/0.54 % (18492)Termination phase: Naming
% 0.19/0.54
% 0.19/0.54 % (18492)Memory used [KB]: 1535
% 0.19/0.54 % (18492)Time elapsed: 0.003 s
% 0.19/0.54 % (18492)Instructions burned: 3 (million)
% 0.19/0.54 % (18492)------------------------------
% 0.19/0.54 % (18492)------------------------------
% 1.33/0.54 % (18500)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.33/0.54 % (18488)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.33/0.54 % (18480)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.33/0.54 % (18480)Instruction limit reached!
% 1.33/0.54 % (18480)------------------------------
% 1.33/0.54 % (18480)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.54 % (18480)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.54 % (18480)Termination reason: Unknown
% 1.33/0.54 % (18480)Termination phase: Preprocessing 3
% 1.33/0.54
% 1.33/0.54 % (18480)Memory used [KB]: 1535
% 1.33/0.54 % (18480)Time elapsed: 0.003 s
% 1.33/0.54 % (18480)Instructions burned: 3 (million)
% 1.33/0.54 % (18480)------------------------------
% 1.33/0.54 % (18480)------------------------------
% 1.33/0.54 % (18499)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.33/0.54 % (18503)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.33/0.54 % (18478)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.33/0.55 % (18504)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.33/0.55 % (18491)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.33/0.55 % (18502)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)
% 1.33/0.55 % (18505)Instruction limit reached!
% 1.33/0.55 % (18505)------------------------------
% 1.33/0.55 % (18505)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.55 % (18505)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.55 % (18505)Termination reason: Unknown
% 1.33/0.55 % (18505)Termination phase: Saturation
% 1.33/0.55
% 1.33/0.55 % (18505)Memory used [KB]: 6652
% 1.33/0.55 % (18505)Time elapsed: 0.134 s
% 1.33/0.55 % (18505)Instructions burned: 25 (million)
% 1.33/0.55 % (18505)------------------------------
% 1.33/0.55 % (18505)------------------------------
% 1.33/0.55 % (18496)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.33/0.55 % (18496)Instruction limit reached!
% 1.33/0.55 % (18496)------------------------------
% 1.33/0.55 % (18496)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.55 % (18498)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.33/0.55 % (18496)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.55 % (18496)Termination reason: Unknown
% 1.33/0.55 % (18496)Termination phase: Naming
% 1.33/0.55
% 1.33/0.55 % (18496)Memory used [KB]: 1535
% 1.33/0.55 % (18496)Time elapsed: 0.002 s
% 1.33/0.55 % (18496)Instructions burned: 2 (million)
% 1.33/0.55 % (18496)------------------------------
% 1.33/0.55 % (18496)------------------------------
% 1.33/0.55 % (18479)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.33/0.55 % (18483)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.57/0.55 % (18494)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.57/0.55 % (18486)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)
% 1.57/0.56 % (18479)Instruction limit reached!
% 1.57/0.56 % (18479)------------------------------
% 1.57/0.56 % (18479)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.56 % (18482)Refutation found. Thanks to Tanya!
% 1.57/0.56 % SZS status Theorem for theBenchmark
% 1.57/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.57/0.56 % (18482)------------------------------
% 1.57/0.56 % (18482)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.56 % (18482)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.56 % (18482)Termination reason: Refutation
% 1.57/0.56
% 1.57/0.56 % (18482)Memory used [KB]: 6268
% 1.57/0.56 % (18482)Time elapsed: 0.136 s
% 1.57/0.56 % (18482)Instructions burned: 8 (million)
% 1.57/0.56 % (18482)------------------------------
% 1.57/0.56 % (18482)------------------------------
% 1.57/0.56 % (18477)Success in time 0.205 s
%------------------------------------------------------------------------------