TSTP Solution File: SWC402+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC402+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_sat --cores 0 -t %d %s
% Computer : n012.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:43:38 EDT 2022
% Result : Theorem 2.23s 0.64s
% Output : Refutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 14
% Syntax : Number of formulae : 73 ( 24 unt; 0 def)
% Number of atoms : 643 ( 170 equ)
% Maximal formula atoms : 58 ( 8 avg)
% Number of connectives : 920 ( 350 ~; 311 |; 228 &)
% ( 4 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 285 ( 197 !; 88 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1726,plain,
$false,
inference(subsumption_resolution,[],[f1725,f957]) ).
fof(f957,plain,
ssList(sK15(sK29,sF60)),
inference(subsumption_resolution,[],[f956,f467]) ).
fof(f467,plain,
ssList(sK29),
inference(cnf_transformation,[],[f297]) ).
fof(f297,plain,
( ssList(sK29)
& ssList(sK30)
& ssList(sK31)
& ssList(sK32)
& ssList(sK33)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK33
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(sK32,sK30),sK33) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| sK32 != app(X11,cons(X10,nil)) )
| ~ ssItem(X10) )
& ~ memberP(sK29,sK34)
& memberP(sK28,sK34)
& ssItem(sK34)
& sK30 = sK28
& ( nil = sK31
| nil != sK30 )
& sK29 = sK31
& ssList(sK28) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28,sK29,sK30,sK31,sK32,sK33,sK34])],[f289,f296,f295,f294,f293,f292,f291,f290]) ).
fof(f290,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(X1,X14)
& memberP(X0,X14)
& ssItem(X14) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(X1,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK28 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3 ) ) )
& ssList(sK28) ) ),
introduced(choice_axiom,[]) ).
fof(f291,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(X1,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK28 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3 ) ) )
=> ( ssList(sK29)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK28 = X2
& ( nil = X3
| nil != X2 )
& sK29 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK28 = X2
& ( nil = X3
| nil != X2 )
& sK29 = X3 ) )
=> ( ssList(sK30)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(X4,sK30),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK30 = sK28
& ( nil = X3
| nil != sK30 )
& sK29 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f293,plain,
( ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(X4,sK30),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK30 = sK28
& ( nil = X3
| nil != sK30 )
& sK29 = X3 )
=> ( ssList(sK31)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(X4,sK30),X5) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
& sK30 = sK28
& ( nil = sK31
| nil != sK30 )
& sK29 = sK31 ) ),
introduced(choice_axiom,[]) ).
fof(f294,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(X4,sK30),X5) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
=> ( ssList(sK32)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(sK32,sK30),X5) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| sK32 != app(X11,cons(X10,nil)) )
| ~ ssItem(X10) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f295,plain,
( ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(sK32,sK30),X5) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| sK32 != app(X11,cons(X10,nil)) )
| ~ ssItem(X10) ) )
=> ( ssList(sK33)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK33
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| sK30 != app(X9,cons(X8,nil))
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(sK30)
& app(app(sK32,sK30),sK33) = sK31
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| sK30 != app(cons(X12,nil),X13)
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| sK32 != app(X11,cons(X10,nil)) )
| ~ ssItem(X10) ) ) ),
introduced(choice_axiom,[]) ).
fof(f296,plain,
( ? [X14] :
( ~ memberP(sK29,X14)
& memberP(sK28,X14)
& ssItem(X14) )
=> ( ~ memberP(sK29,sK34)
& memberP(sK28,sK34)
& ssItem(sK34) ) ),
introduced(choice_axiom,[]) ).
fof(f289,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ leq(X8,X6) ) ) ) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(cons(X12,nil),X13) != X2
| ~ leq(X10,X12) ) )
| ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4 )
| ~ ssItem(X10) ) ) )
& ? [X14] :
( ~ memberP(X1,X14)
& memberP(X0,X14)
& ssItem(X14) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3 ) ) )
& ssList(X0) ),
inference(rectify,[],[f179]) ).
fof(f179,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( app(cons(X7,nil),X8) != X6
| ~ ssList(X8)
| ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ~ ssList(X10)
| app(X10,cons(X9,nil)) != X2
| ~ leq(X9,X7) ) ) ) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ ssItem(X13)
| ! [X14] :
( ~ ssList(X14)
| app(cons(X13,nil),X14) != X2
| ~ leq(X11,X13) ) )
| ~ ssList(X12)
| app(X12,cons(X11,nil)) != X5 )
| ~ ssItem(X11) ) ) )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3 ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( memberP(X1,X4)
| ~ ssItem(X4)
| ~ memberP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| ? [X7] :
( ? [X8] :
( ssList(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( leq(X9,X7)
& app(X10,cons(X9,nil)) = X2
& ssList(X10) ) )
& app(cons(X7,nil),X8) = X6 )
& ssItem(X7) )
| ? [X11] :
( ssItem(X11)
& ? [X12] :
( ? [X13] :
( ssItem(X13)
& ? [X14] :
( ssList(X14)
& app(cons(X13,nil),X14) = X2
& leq(X11,X13) ) )
& ssList(X12)
& app(X12,cons(X11,nil)) = X5 ) )
| app(app(X5,X2),X6) != X3
| ~ totalorderedP(X2) ) )
| X1 != X3
| ( nil != X3
& nil = X2 )
| X0 != X2
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ! [X14] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ? [X12] :
( ? [X13] :
( ssList(X13)
& leq(X12,X10)
& app(X13,cons(X12,nil)) = X2 )
& ssItem(X12) )
& ssList(X11)
& app(cons(X10,nil),X11) = X5 ) )
| app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ~ ssList(X5)
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& ssList(X7)
& app(X7,cons(X6,nil)) = X4 )
& ssItem(X6) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ! [X14] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ssItem(X10)
& ? [X11] :
( ? [X12] :
( ? [X13] :
( ssList(X13)
& leq(X12,X10)
& app(X13,cons(X12,nil)) = X2 )
& ssItem(X12) )
& ssList(X11)
& app(cons(X10,nil),X11) = X5 ) )
| app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ~ ssList(X5)
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& ssList(X7)
& app(X7,cons(X6,nil)) = X4 )
& ssItem(X6) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f956,plain,
( ssList(sK15(sK29,sF60))
| ~ ssList(sK29) ),
inference(subsumption_resolution,[],[f948,f699]) ).
fof(f699,plain,
ssList(sF60),
inference(subsumption_resolution,[],[f698,f464]) ).
fof(f464,plain,
ssList(sK32),
inference(cnf_transformation,[],[f297]) ).
fof(f698,plain,
( ssList(sF60)
| ~ ssList(sK32) ),
inference(subsumption_resolution,[],[f693,f604]) ).
fof(f604,plain,
ssList(sK28),
inference(forward_demodulation,[],[f466,f455]) ).
fof(f455,plain,
sK30 = sK28,
inference(cnf_transformation,[],[f297]) ).
fof(f466,plain,
ssList(sK30),
inference(cnf_transformation,[],[f297]) ).
fof(f693,plain,
( ssList(sF60)
| ~ ssList(sK28)
| ~ ssList(sK32) ),
inference(superposition,[],[f523,f613]) ).
fof(f613,plain,
sF60 = app(sK32,sK28),
inference(forward_demodulation,[],[f594,f455]) ).
fof(f594,plain,
sF60 = app(sK32,sK30),
introduced(function_definition,[]) ).
fof(f523,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f221]) ).
fof(f221,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f948,plain,
( ssList(sK15(sK29,sF60))
| ~ ssList(sF60)
| ~ ssList(sK29) ),
inference(resolution,[],[f403,f725]) ).
fof(f725,plain,
frontsegP(sK29,sF60),
inference(subsumption_resolution,[],[f724,f699]) ).
fof(f724,plain,
( frontsegP(sK29,sF60)
| ~ ssList(sF60) ),
inference(subsumption_resolution,[],[f721,f463]) ).
fof(f463,plain,
ssList(sK33),
inference(cnf_transformation,[],[f297]) ).
fof(f721,plain,
( ~ ssList(sK33)
| ~ ssList(sF60)
| frontsegP(sK29,sF60) ),
inference(superposition,[],[f612,f611]) ).
fof(f611,plain,
sK29 = app(sF60,sK33),
inference(forward_demodulation,[],[f595,f608]) ).
fof(f608,plain,
sF61 = sK29,
inference(backward_demodulation,[],[f596,f453]) ).
fof(f453,plain,
sK29 = sK31,
inference(cnf_transformation,[],[f297]) ).
fof(f596,plain,
sF61 = sK31,
inference(definition_folding,[],[f460,f595,f594]) ).
fof(f460,plain,
app(app(sK32,sK30),sK33) = sK31,
inference(cnf_transformation,[],[f297]) ).
fof(f595,plain,
sF61 = app(sF60,sK33),
introduced(function_definition,[]) ).
fof(f612,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f572,f523]) ).
fof(f572,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X1)
| ~ ssList(app(X1,X3))
| ~ ssList(X3) ),
inference(equality_resolution,[],[f401]) ).
fof(f401,plain,
! [X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(X0,X1)
| ~ ssList(X3)
| app(X1,X3) != X0 ),
inference(cnf_transformation,[],[f258]) ).
fof(f258,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( ssList(sK15(X0,X1))
& app(X1,sK15(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f256,f257]) ).
fof(f257,plain,
! [X0,X1] :
( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
=> ( ssList(sK15(X0,X1))
& app(X1,sK15(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) ) ) ),
inference(rectify,[],[f255]) ).
fof(f255,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) ) ) ) ),
inference(nnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f403,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ssList(sK15(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f258]) ).
fof(f1725,plain,
~ ssList(sK15(sK29,sF60)),
inference(subsumption_resolution,[],[f1723,f458]) ).
fof(f458,plain,
~ memberP(sK29,sK34),
inference(cnf_transformation,[],[f297]) ).
fof(f1723,plain,
( memberP(sK29,sK34)
| ~ ssList(sK15(sK29,sF60)) ),
inference(superposition,[],[f1444,f1329]) ).
fof(f1329,plain,
sK29 = app(sF60,sK15(sK29,sF60)),
inference(subsumption_resolution,[],[f1328,f699]) ).
fof(f1328,plain,
( ~ ssList(sF60)
| sK29 = app(sF60,sK15(sK29,sF60)) ),
inference(subsumption_resolution,[],[f1323,f467]) ).
fof(f1323,plain,
( ~ ssList(sK29)
| ~ ssList(sF60)
| sK29 = app(sF60,sK15(sK29,sF60)) ),
inference(resolution,[],[f402,f725]) ).
fof(f402,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK15(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f258]) ).
fof(f1444,plain,
! [X0] :
( memberP(app(sF60,X0),sK34)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f1443,f456]) ).
fof(f456,plain,
ssItem(sK34),
inference(cnf_transformation,[],[f297]) ).
fof(f1443,plain,
! [X0] :
( memberP(app(sF60,X0),sK34)
| ~ ssItem(sK34)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f1435,f699]) ).
fof(f1435,plain,
! [X0] :
( ~ ssList(X0)
| memberP(app(sF60,X0),sK34)
| ~ ssList(sF60)
| ~ ssItem(sK34) ),
inference(resolution,[],[f1388,f425]) ).
fof(f425,plain,
! [X2,X0,X1] :
( ~ memberP(X1,X0)
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| memberP(app(X1,X2),X0) ),
inference(cnf_transformation,[],[f271]) ).
fof(f271,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ! [X2] :
( ~ ssList(X2)
| ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) ) )
| ~ ssList(X1) ) ),
inference(flattening,[],[f270]) ).
fof(f270,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ! [X2] :
( ~ ssList(X2)
| ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ! [X2] :
( ~ ssList(X2)
| ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) )
| ~ ssList(X1) ) ),
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/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f1388,plain,
memberP(sF60,sK34),
inference(subsumption_resolution,[],[f1387,f464]) ).
fof(f1387,plain,
( memberP(sF60,sK34)
| ~ ssList(sK32) ),
inference(superposition,[],[f1373,f613]) ).
fof(f1373,plain,
! [X0] :
( memberP(app(X0,sK28),sK34)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f1372,f604]) ).
fof(f1372,plain,
! [X0] :
( ~ ssList(sK28)
| memberP(app(X0,sK28),sK34)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f1366,f456]) ).
fof(f1366,plain,
! [X0] :
( memberP(app(X0,sK28),sK34)
| ~ ssItem(sK34)
| ~ ssList(sK28)
| ~ ssList(X0) ),
inference(resolution,[],[f424,f457]) ).
fof(f457,plain,
memberP(sK28,sK34),
inference(cnf_transformation,[],[f297]) ).
fof(f424,plain,
! [X2,X0,X1] :
( ~ memberP(X2,X0)
| ~ ssItem(X0)
| memberP(app(X1,X2),X0)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f271]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC402+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n012.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:53:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (1282)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.50 % (1297)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.50 % (1292)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.50 % (1284)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.50 % (1289)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (1276)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (1281)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.51 % (1272)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.51 % (1273)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (1283)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.52 % (1270)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.53 % (1285)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.53 % (1295)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.53 % (1274)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (1294)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53 % (1296)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.53 % (1275)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.53 % (1271)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (1277)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 % (1299)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.54 % (1293)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.54 % (1287)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.54 % (1288)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.54 % (1286)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 % (1298)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.54 TRYING [2]
% 0.20/0.55 % (1279)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 % (1291)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.55 % (1278)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.55 % (1280)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.55 % (1290)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.55 % (1278)Instruction limit reached!
% 0.20/0.55 % (1278)------------------------------
% 0.20/0.55 % (1278)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (1278)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (1278)Termination reason: Unknown
% 0.20/0.55 % (1278)Termination phase: Naming
% 0.20/0.55
% 0.20/0.55 % (1278)Memory used [KB]: 1151
% 0.20/0.55 % (1278)Time elapsed: 0.002 s
% 0.20/0.55 % (1278)Instructions burned: 3 (million)
% 0.20/0.55 % (1278)------------------------------
% 0.20/0.55 % (1278)------------------------------
% 0.20/0.56 % (1277)Instruction limit reached!
% 0.20/0.56 % (1277)------------------------------
% 0.20/0.56 % (1277)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (1277)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (1277)Termination reason: Unknown
% 0.20/0.56 % (1277)Termination phase: Function definition elimination
% 0.20/0.56
% 0.20/0.56 % (1277)Memory used [KB]: 1279
% 0.20/0.56 % (1277)Time elapsed: 0.006 s
% 0.20/0.56 % (1277)Instructions burned: 8 (million)
% 0.20/0.56 % (1277)------------------------------
% 0.20/0.56 % (1277)------------------------------
% 0.20/0.56 % (1271)Refutation not found, incomplete strategy% (1271)------------------------------
% 0.20/0.56 % (1271)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (1271)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (1271)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.56
% 0.20/0.56 % (1271)Memory used [KB]: 6140
% 0.20/0.56 % (1271)Time elapsed: 0.157 s
% 0.20/0.56 % (1271)Instructions burned: 25 (million)
% 0.20/0.56 % (1271)------------------------------
% 0.20/0.56 % (1271)------------------------------
% 0.20/0.57 % (1276)Instruction limit reached!
% 0.20/0.57 % (1276)------------------------------
% 0.20/0.57 % (1276)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.57 % (1276)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.57 % (1276)Termination reason: Unknown
% 0.20/0.57 % (1276)Termination phase: Finite model building constraint generation
% 0.20/0.57
% 0.20/0.57 % (1276)Memory used [KB]: 7164
% 0.20/0.57 % (1276)Time elapsed: 0.121 s
% 0.20/0.57 % (1276)Instructions burned: 52 (million)
% 0.20/0.57 % (1276)------------------------------
% 0.20/0.57 % (1276)------------------------------
% 0.20/0.57 TRYING [1]
% 0.20/0.57 TRYING [2]
% 0.20/0.59 % (1272)Instruction limit reached!
% 0.20/0.59 % (1272)------------------------------
% 0.20/0.59 % (1272)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.59 % (1272)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.59 % (1272)Termination reason: Unknown
% 0.20/0.59 % (1272)Termination phase: Saturation
% 0.20/0.59
% 0.20/0.59 % (1272)Memory used [KB]: 1791
% 0.20/0.59 % (1272)Time elapsed: 0.175 s
% 0.20/0.59 % (1272)Instructions burned: 37 (million)
% 0.20/0.59 % (1272)------------------------------
% 0.20/0.59 % (1272)------------------------------
% 0.20/0.59 TRYING [1]
% 0.20/0.60 % (1284)Instruction limit reached!
% 0.20/0.60 % (1284)------------------------------
% 0.20/0.60 % (1284)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60 % (1284)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.60 % (1284)Termination reason: Unknown
% 0.20/0.60 % (1284)Termination phase: Saturation
% 0.20/0.60
% 0.20/0.60 % (1284)Memory used [KB]: 7164
% 0.20/0.60 % (1284)Time elapsed: 0.075 s
% 0.20/0.60 % (1284)Instructions burned: 68 (million)
% 0.20/0.60 % (1284)------------------------------
% 0.20/0.60 % (1284)------------------------------
% 0.20/0.60 TRYING [2]
% 1.91/0.61 TRYING [3]
% 1.91/0.61 % (1275)Instruction limit reached!
% 1.91/0.61 % (1275)------------------------------
% 1.91/0.61 % (1275)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.91/0.61 % (1275)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.91/0.61 % (1275)Termination reason: Unknown
% 1.91/0.61 % (1275)Termination phase: Saturation
% 1.91/0.61
% 1.91/0.61 % (1275)Memory used [KB]: 6268
% 1.91/0.61 % (1275)Time elapsed: 0.219 s
% 1.91/0.61 % (1275)Instructions burned: 48 (million)
% 1.91/0.61 % (1275)------------------------------
% 1.91/0.61 % (1275)------------------------------
% 1.91/0.61 % (1297)First to succeed.
% 1.91/0.62 % (1274)Instruction limit reached!
% 1.91/0.62 % (1274)------------------------------
% 1.91/0.62 % (1274)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.91/0.62 % (1274)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.91/0.62 % (1274)Termination reason: Unknown
% 1.91/0.62 % (1274)Termination phase: Saturation
% 1.91/0.62
% 1.91/0.62 % (1274)Memory used [KB]: 6652
% 1.91/0.62 % (1274)Time elapsed: 0.222 s
% 1.91/0.62 % (1274)Instructions burned: 52 (million)
% 1.91/0.62 % (1274)------------------------------
% 1.91/0.62 % (1274)------------------------------
% 1.91/0.62 % (1273)Instruction limit reached!
% 1.91/0.62 % (1273)------------------------------
% 1.91/0.62 % (1273)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.91/0.62 % (1273)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.91/0.62 % (1273)Termination reason: Unknown
% 1.91/0.62 % (1273)Termination phase: Saturation
% 1.91/0.62
% 1.91/0.62 % (1273)Memory used [KB]: 6652
% 1.91/0.62 % (1273)Time elapsed: 0.204 s
% 1.91/0.62 % (1273)Instructions burned: 53 (million)
% 1.91/0.62 % (1273)------------------------------
% 1.91/0.62 % (1273)------------------------------
% 2.15/0.62 % (1279)Instruction limit reached!
% 2.15/0.62 % (1279)------------------------------
% 2.15/0.62 % (1279)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.15/0.62 % (1279)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.15/0.62 % (1279)Termination reason: Unknown
% 2.15/0.62 % (1279)Termination phase: Saturation
% 2.15/0.62
% 2.15/0.62 % (1279)Memory used [KB]: 2174
% 2.15/0.62 % (1279)Time elapsed: 0.233 s
% 2.15/0.62 % (1279)Instructions burned: 51 (million)
% 2.15/0.62 % (1279)------------------------------
% 2.15/0.62 % (1279)------------------------------
% 2.15/0.62 % (1287)Instruction limit reached!
% 2.15/0.62 % (1287)------------------------------
% 2.15/0.62 % (1287)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.15/0.63 % (1287)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.15/0.63 % (1287)Termination reason: Unknown
% 2.15/0.63 % (1287)Termination phase: Finite model building constraint generation
% 2.15/0.63
% 2.15/0.63 % (1287)Memory used [KB]: 7547
% 2.15/0.63 % (1287)Time elapsed: 0.215 s
% 2.15/0.63 % (1287)Instructions burned: 59 (million)
% 2.15/0.63 % (1287)------------------------------
% 2.15/0.63 % (1287)------------------------------
% 2.15/0.63 % (1280)Instruction limit reached!
% 2.15/0.63 % (1280)------------------------------
% 2.15/0.63 % (1280)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.15/0.63 % (1280)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.15/0.63 % (1280)Termination reason: Unknown
% 2.15/0.63 % (1280)Termination phase: Saturation
% 2.15/0.63
% 2.15/0.63 % (1280)Memory used [KB]: 6780
% 2.15/0.63 % (1280)Time elapsed: 0.220 s
% 2.15/0.63 % (1280)Instructions burned: 52 (million)
% 2.15/0.63 % (1280)------------------------------
% 2.15/0.63 % (1280)------------------------------
% 2.23/0.64 % (1297)Refutation found. Thanks to Tanya!
% 2.23/0.64 % SZS status Theorem for theBenchmark
% 2.23/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 2.23/0.64 % (1297)------------------------------
% 2.23/0.64 % (1297)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 2.23/0.64 % (1297)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 2.23/0.64 % (1297)Termination reason: Refutation
% 2.23/0.64
% 2.23/0.64 % (1297)Memory used [KB]: 2558
% 2.23/0.64 % (1297)Time elapsed: 0.218 s
% 2.23/0.64 % (1297)Instructions burned: 74 (million)
% 2.23/0.64 % (1297)------------------------------
% 2.23/0.64 % (1297)------------------------------
% 2.23/0.64 % (1269)Success in time 0.279 s
%------------------------------------------------------------------------------