TSTP Solution File: SWC236+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC236+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 : n019.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:39:47 EDT 2022
% Result : Theorem 1.48s 0.58s
% Output : Refutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 20
% Syntax : Number of formulae : 88 ( 9 unt; 0 def)
% Number of atoms : 888 ( 241 equ)
% Maximal formula atoms : 72 ( 10 avg)
% Number of connectives : 1294 ( 494 ~; 464 |; 295 &)
% ( 4 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 9 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 358 ( 249 !; 109 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f545,plain,
$false,
inference(avatar_sat_refutation,[],[f301,f315,f515,f527,f544]) ).
fof(f544,plain,
( ~ spl19_2
| spl19_3
| ~ spl19_8
| ~ spl19_9 ),
inference(avatar_contradiction_clause,[],[f543]) ).
fof(f543,plain,
( $false
| ~ spl19_2
| spl19_3
| ~ spl19_8
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f539,f510]) ).
fof(f510,plain,
( ssItem(sK15(sK1(sK11),nil,sK0(sK11)))
| ~ spl19_8 ),
inference(avatar_component_clause,[],[f508]) ).
fof(f508,plain,
( spl19_8
<=> ssItem(sK15(sK1(sK11),nil,sK0(sK11))) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_8])]) ).
fof(f539,plain,
( ~ ssItem(sK15(sK1(sK11),nil,sK0(sK11)))
| ~ spl19_2
| spl19_3
| ~ spl19_9 ),
inference(resolution,[],[f538,f254]) ).
fof(f254,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f538,plain,
( memberP(nil,sK15(sK1(sK11),nil,sK0(sK11)))
| ~ spl19_2
| spl19_3
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f537,f246]) ).
fof(f246,plain,
ssList(sK11),
inference(cnf_transformation,[],[f179]) ).
fof(f179,plain,
( ssList(sK9)
& ssList(sK11)
& ( nil != sK11
| nil = sK12 )
& sK9 = sK11
& ssList(sK13)
& ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != sK14
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(sK14)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK13
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(sK13,sK11),sK14) = sK12
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ( memberP(X15,sK15(X14,X15,X16))
& leq(X14,sK15(X14,X15,X16))
& memberP(X16,sK15(X14,X15,X16))
& ~ lt(X14,sK15(X14,X15,X16))
& ssItem(sK15(X14,X15,X16)) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = sK12
& ssList(sK12)
& nil != sK9
& ssList(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13,sK14,sK15])],[f171,f178,f177,f176,f175,f174,f173,f172]) ).
fof(f172,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& X1 = X3
& ssList(X3)
& nil != X0 ) )
& ssList(X1) ) )
=> ( ssList(sK9)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& sK9 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& X1 = X3
& ssList(X3)
& nil != sK9 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& sK9 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& X1 = X3
& ssList(X3)
& nil != sK9 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& sK9 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = X3
& ssList(X3)
& nil != sK9 ) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& sK9 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = X3
& ssList(X3)
& nil != sK9 ) )
=> ( ssList(sK11)
& ? [X3] :
( ( nil != sK11
| nil = X3 )
& sK9 = sK11
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,sK11),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = X3
& ssList(X3)
& nil != sK9 ) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X3] :
( ( nil != sK11
| nil = X3 )
& sK9 = sK11
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,sK11),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = X3
& ssList(X3)
& nil != sK9 )
=> ( ( nil != sK11
| nil = sK12 )
& sK9 = sK11
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& sK12 = app(app(X4,sK11),X5) ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& sK10 = sK12
& ssList(sK12)
& nil != sK9 ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& sK12 = app(app(X4,sK11),X5) ) )
=> ( ssList(sK13)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK13
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(sK13,sK11),X5) = sK12 ) ) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK13
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(sK13,sK11),X5) = sK12 )
=> ( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != sK14
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != sK11
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(sK11)
& ssList(sK14)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != sK13
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK11
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(sK13,sK11),sK14) = sK12 ) ),
introduced(choice_axiom,[]) ).
fof(f178,plain,
! [X14,X15,X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
=> ( memberP(X15,sK15(X14,X15,X16))
& leq(X14,sK15(X14,X15,X16))
& memberP(X16,sK15(X14,X15,X16))
& ~ lt(X14,sK15(X14,X15,X16))
& ssItem(sK15(X14,X15,X16)) ) ),
introduced(choice_axiom,[]) ).
fof(f171,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X6] :
( ! [X7] :
( app(cons(X6,nil),X7) != X5
| ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( ~ leq(X8,X6)
| app(X9,cons(X8,nil)) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) ) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& ssList(X5)
& ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ! [X13] :
( ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X4,X2),X5) = X3 ) )
& ! [X14] :
( ~ ssItem(X14)
| ! [X15] :
( ! [X16] :
( ? [X17] :
( memberP(X15,X17)
& leq(X14,X17)
& memberP(X16,X17)
& ~ lt(X14,X17)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0
| ~ ssList(X16) )
| ~ ssList(X15) ) )
& X1 = X3
& ssList(X3)
& nil != X0 ) )
& ssList(X1) ) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X10,nil),X11) != X9
| ~ ssList(X11)
| ! [X12] :
( ! [X13] :
( ~ leq(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X9)
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| app(X15,cons(X14,nil)) != X8
| ! [X16] :
( ! [X17] :
( ~ leq(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) ) )
| ~ ssItem(X14) )
& app(app(X8,X2),X9) = X3 ) )
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( ? [X7] :
( memberP(X5,X7)
& leq(X4,X7)
& memberP(X6,X7)
& ~ lt(X4,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3)
& nil != X0 ) )
& ssList(X1) ) ),
inference(flattening,[],[f141]) ).
fof(f141,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ? [X8] :
( ? [X9] :
( totalorderedP(X2)
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| app(X15,cons(X14,nil)) != X8
| ! [X16] :
( ! [X17] :
( ~ leq(X14,X16)
| app(cons(X16,nil),X17) != X2
| ~ ssList(X17) )
| ~ ssItem(X16) ) )
| ~ ssItem(X14) )
& ! [X10] :
( ! [X11] :
( app(cons(X10,nil),X11) != X9
| ~ ssList(X11)
| ! [X12] :
( ! [X13] :
( ~ leq(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) ) )
| ~ ssItem(X10) )
& app(app(X8,X2),X9) = X3
& ssList(X9) )
& ssList(X8) )
& ( nil != X2
| nil = X3 )
& nil != X0
& X0 = X2
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( leq(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ~ lt(X4,X7)
& ssItem(X7) ) )
| ~ ssList(X5) ) )
& 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)
=> ( X1 != X3
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ~ totalorderedP(X2)
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(X15,cons(X14,nil)) = X8
& ? [X16] :
( ? [X17] :
( leq(X14,X16)
& app(cons(X16,nil),X17) = X2
& ssList(X17) )
& ssItem(X16) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( app(X13,cons(X12,nil)) = X2
& leq(X12,X10)
& ssList(X13) ) )
& app(cons(X10,nil),X11) = X9 ) )
| app(app(X8,X2),X9) != X3 ) ) )
| ( nil != X3
& nil = X2 )
| nil = X0
| X0 != X2
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| lt(X4,X7) ) ) )
& ssList(X5) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| lt(X4,X7) ) ) )
& ssList(X5) ) )
| ( nil != X3
& nil = X2 )
| X0 != X2
| nil = X0
| X1 != X3
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,X2),X9) != X3
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ? [X17] :
( ssList(X17)
& leq(X16,X14)
& app(X17,cons(X16,nil)) = X2 )
& ssItem(X16) ) ) )
| ? [X10] :
( ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( app(cons(X12,nil),X13) = X2
& ssList(X13)
& leq(X10,X12) ) ) )
& ssItem(X10) )
| ~ totalorderedP(X2) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| lt(X4,X7) ) ) )
& ssList(X5) ) )
| ( nil != X3
& nil = X2 )
| X0 != X2
| nil = X0
| X1 != X3
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(X8,X2),X9) != X3
| ? [X14] :
( ssItem(X14)
& ? [X15] :
( ssList(X15)
& app(cons(X14,nil),X15) = X9
& ? [X16] :
( ? [X17] :
( ssList(X17)
& leq(X16,X14)
& app(X17,cons(X16,nil)) = X2 )
& ssItem(X16) ) ) )
| ? [X10] :
( ? [X11] :
( ssList(X11)
& app(X11,cons(X10,nil)) = X8
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( app(cons(X12,nil),X13) = X2
& ssList(X13)
& leq(X10,X12) ) ) )
& ssItem(X10) )
| ~ totalorderedP(X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f537,plain,
( ~ ssList(sK11)
| memberP(nil,sK15(sK1(sK11),nil,sK0(sK11)))
| ~ spl19_2
| spl19_3
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f536,f305]) ).
fof(f305,plain,
( nil != sK11
| spl19_3 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f303,plain,
( spl19_3
<=> nil = sK11 ),
introduced(avatar_definition,[new_symbols(naming,[spl19_3])]) ).
fof(f536,plain,
( memberP(nil,sK15(sK1(sK11),nil,sK0(sK11)))
| nil = sK11
| ~ ssList(sK11)
| ~ spl19_2
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f535,f513]) ).
fof(f513,plain,
( ssList(cons(sK1(sK11),nil))
| ~ spl19_9 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f512,plain,
( spl19_9
<=> ssList(cons(sK1(sK11),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_9])]) ).
fof(f535,plain,
( memberP(nil,sK15(sK1(sK11),nil,sK0(sK11)))
| ~ ssList(cons(sK1(sK11),nil))
| nil = sK11
| ~ ssList(sK11)
| ~ spl19_2 ),
inference(equality_resolution,[],[f483]) ).
fof(f483,plain,
( ! [X0] :
( sK11 != X0
| ~ ssList(X0)
| ~ ssList(cons(sK1(X0),nil))
| memberP(nil,sK15(sK1(X0),nil,sK0(X0)))
| nil = X0 )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f482,f190]) ).
fof(f190,plain,
! [X0] :
( ssList(sK0(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f151,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( ssItem(sK1(X0))
& cons(sK1(X0),sK0(X0)) = X0
& ssList(sK0(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f119,f150,f149]) ).
fof(f149,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 )
& ssList(X1) )
=> ( ? [X2] :
( ssItem(X2)
& cons(X2,sK0(X0)) = X0 )
& ssList(sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,sK0(X0)) = X0 )
=> ( ssItem(sK1(X0))
& cons(sK1(X0),sK0(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 )
& ssList(X1) ) ),
inference(flattening,[],[f118]) ).
fof(f118,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 )
& ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 )
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f482,plain,
( ! [X0] :
( memberP(nil,sK15(sK1(X0),nil,sK0(X0)))
| ~ ssList(X0)
| sK11 != X0
| nil = X0
| ~ ssList(cons(sK1(X0),nil))
| ~ ssList(sK0(X0)) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f480,f192]) ).
fof(f192,plain,
! [X0] :
( ssItem(sK1(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f480,plain,
( ! [X0] :
( memberP(nil,sK15(sK1(X0),nil,sK0(X0)))
| ~ ssList(X0)
| sK11 != X0
| nil = X0
| ~ ssItem(sK1(X0))
| ~ ssList(sK0(X0))
| ~ ssList(cons(sK1(X0),nil)) )
| ~ spl19_2 ),
inference(superposition,[],[f460,f191]) ).
fof(f191,plain,
! [X0] :
( cons(sK1(X0),sK0(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f151]) ).
fof(f460,plain,
( ! [X10,X11] :
( sK11 != cons(X10,X11)
| ~ ssItem(X10)
| ~ ssList(cons(X10,nil))
| ~ ssList(X11)
| memberP(nil,sK15(X10,nil,X11)) )
| ~ spl19_2 ),
inference(duplicate_literal_removal,[],[f440]) ).
fof(f440,plain,
( ! [X10,X11] :
( ~ ssItem(X10)
| sK11 != cons(X10,X11)
| ~ ssList(X11)
| memberP(nil,sK15(X10,nil,X11))
| ~ ssList(cons(X10,nil))
| ~ ssList(X11)
| ~ ssItem(X10) )
| ~ spl19_2 ),
inference(superposition,[],[f352,f248]) ).
fof(f248,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f352,plain,
( ! [X0,X1] :
( app(cons(X0,nil),X1) != sK11
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| memberP(nil,sK15(X0,nil,X1))
| ~ ssList(X1) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f331,f298]) ).
fof(f298,plain,
( ssList(nil)
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f297]) ).
fof(f297,plain,
( spl19_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_2])]) ).
fof(f331,plain,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(nil)
| ~ ssList(cons(X0,nil))
| memberP(nil,sK15(X0,nil,X1))
| app(cons(X0,nil),X1) != sK11
| ~ ssList(X1) ),
inference(superposition,[],[f274,f261]) ).
fof(f261,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f274,plain,
! [X16,X14,X15] :
( app(app(X15,cons(X14,nil)),X16) != sK11
| memberP(X15,sK15(X14,X15,X16))
| ~ ssList(X15)
| ~ ssList(X16)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f237,f244]) ).
fof(f244,plain,
sK9 = sK11,
inference(cnf_transformation,[],[f179]) ).
fof(f237,plain,
! [X16,X14,X15] :
( ~ ssItem(X14)
| memberP(X15,sK15(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16)
| ~ ssList(X15) ),
inference(cnf_transformation,[],[f179]) ).
fof(f527,plain,
( ~ spl19_2
| spl19_3
| spl19_9 ),
inference(avatar_contradiction_clause,[],[f526]) ).
fof(f526,plain,
( $false
| ~ spl19_2
| spl19_3
| spl19_9 ),
inference(subsumption_resolution,[],[f525,f305]) ).
fof(f525,plain,
( nil = sK11
| ~ spl19_2
| spl19_9 ),
inference(subsumption_resolution,[],[f521,f246]) ).
fof(f521,plain,
( ~ ssList(sK11)
| nil = sK11
| ~ spl19_2
| spl19_9 ),
inference(resolution,[],[f518,f192]) ).
fof(f518,plain,
( ~ ssItem(sK1(sK11))
| ~ spl19_2
| spl19_9 ),
inference(subsumption_resolution,[],[f516,f298]) ).
fof(f516,plain,
( ~ ssList(nil)
| ~ ssItem(sK1(sK11))
| spl19_9 ),
inference(resolution,[],[f514,f272]) ).
fof(f272,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f514,plain,
( ~ ssList(cons(sK1(sK11),nil))
| spl19_9 ),
inference(avatar_component_clause,[],[f512]) ).
fof(f515,plain,
( spl19_8
| ~ spl19_9
| ~ spl19_2
| spl19_3 ),
inference(avatar_split_clause,[],[f506,f303,f297,f512,f508]) ).
fof(f506,plain,
( ~ ssList(cons(sK1(sK11),nil))
| ssItem(sK15(sK1(sK11),nil,sK0(sK11)))
| ~ spl19_2
| spl19_3 ),
inference(subsumption_resolution,[],[f505,f246]) ).
fof(f505,plain,
( ssItem(sK15(sK1(sK11),nil,sK0(sK11)))
| ~ ssList(cons(sK1(sK11),nil))
| ~ ssList(sK11)
| ~ spl19_2
| spl19_3 ),
inference(subsumption_resolution,[],[f504,f305]) ).
fof(f504,plain,
( nil = sK11
| ssItem(sK15(sK1(sK11),nil,sK0(sK11)))
| ~ ssList(sK11)
| ~ ssList(cons(sK1(sK11),nil))
| ~ spl19_2 ),
inference(equality_resolution,[],[f477]) ).
fof(f477,plain,
( ! [X0] :
( sK11 != X0
| ~ ssList(X0)
| nil = X0
| ssItem(sK15(sK1(X0),nil,sK0(X0)))
| ~ ssList(cons(sK1(X0),nil)) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f476,f192]) ).
fof(f476,plain,
( ! [X0] :
( nil = X0
| ~ ssList(X0)
| ssItem(sK15(sK1(X0),nil,sK0(X0)))
| ~ ssList(cons(sK1(X0),nil))
| ~ ssItem(sK1(X0))
| sK11 != X0 )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f474,f190]) ).
fof(f474,plain,
( ! [X0] :
( sK11 != X0
| nil = X0
| ~ ssList(sK0(X0))
| ~ ssList(X0)
| ~ ssList(cons(sK1(X0),nil))
| ~ ssItem(sK1(X0))
| ssItem(sK15(sK1(X0),nil,sK0(X0))) )
| ~ spl19_2 ),
inference(superposition,[],[f461,f191]) ).
fof(f461,plain,
( ! [X16,X17] :
( sK11 != cons(X16,X17)
| ~ ssList(cons(X16,nil))
| ssItem(sK15(X16,nil,X17))
| ~ ssList(X17)
| ~ ssItem(X16) )
| ~ spl19_2 ),
inference(duplicate_literal_removal,[],[f443]) ).
fof(f443,plain,
( ! [X16,X17] :
( ~ ssList(X17)
| sK11 != cons(X16,X17)
| ~ ssItem(X16)
| ssItem(sK15(X16,nil,X17))
| ~ ssItem(X16)
| ~ ssList(X17)
| ~ ssList(cons(X16,nil)) )
| ~ spl19_2 ),
inference(superposition,[],[f355,f248]) ).
fof(f355,plain,
( ! [X8,X9] :
( sK11 != app(cons(X8,nil),X9)
| ~ ssList(cons(X8,nil))
| ssItem(sK15(X8,nil,X9))
| ~ ssList(X9)
| ~ ssItem(X8) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f335,f298]) ).
fof(f335,plain,
! [X8,X9] :
( sK11 != app(cons(X8,nil),X9)
| ssItem(sK15(X8,nil,X9))
| ~ ssList(nil)
| ~ ssList(cons(X8,nil))
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(superposition,[],[f278,f261]) ).
fof(f278,plain,
! [X16,X14,X15] :
( app(app(X15,cons(X14,nil)),X16) != sK11
| ~ ssList(X16)
| ~ ssList(X15)
| ssItem(sK15(X14,X15,X16))
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f233,f244]) ).
fof(f233,plain,
! [X16,X14,X15] :
( ~ ssItem(X14)
| ssItem(sK15(X14,X15,X16))
| app(app(X15,cons(X14,nil)),X16) != sK9
| ~ ssList(X16)
| ~ ssList(X15) ),
inference(cnf_transformation,[],[f179]) ).
fof(f315,plain,
~ spl19_3,
inference(avatar_split_clause,[],[f279,f303]) ).
fof(f279,plain,
nil != sK11,
inference(definition_unfolding,[],[f230,f244]) ).
fof(f230,plain,
nil != sK9,
inference(cnf_transformation,[],[f179]) ).
fof(f301,plain,
spl19_2,
inference(avatar_split_clause,[],[f193,f297]) ).
fof(f193,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC236+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 19:59:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (29748)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.48 % (29740)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (29739)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.51 % (29756)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.51 % (29738)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.33/0.52 % (29738)Instruction limit reached!
% 1.33/0.52 % (29738)------------------------------
% 1.33/0.52 % (29738)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.52 % (29738)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.52 % (29738)Termination reason: Unknown
% 1.33/0.52 % (29738)Termination phase: Saturation
% 1.33/0.52
% 1.33/0.52 % (29738)Memory used [KB]: 6268
% 1.33/0.52 % (29738)Time elapsed: 0.110 s
% 1.33/0.52 % (29738)Instructions burned: 8 (million)
% 1.33/0.52 % (29738)------------------------------
% 1.33/0.52 % (29738)------------------------------
% 1.33/0.52 % (29732)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.33/0.52 % (29749)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.52 % (29736)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.33/0.53 % (29730)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.33/0.53 % (29735)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.33/0.53 % (29731)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.33/0.53 % (29741)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.33/0.53 % (29737)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.53 % (29739)Instruction limit reached!
% 1.33/0.53 % (29739)------------------------------
% 1.33/0.53 % (29739)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.53 % (29739)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.53 % (29739)Termination reason: Unknown
% 1.33/0.53 % (29739)Termination phase: Saturation
% 1.33/0.53
% 1.33/0.53 % (29739)Memory used [KB]: 2046
% 1.33/0.53 % (29739)Time elapsed: 0.009 s
% 1.33/0.53 % (29739)Instructions burned: 16 (million)
% 1.33/0.53 % (29739)------------------------------
% 1.33/0.53 % (29739)------------------------------
% 1.33/0.53 % (29727)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.53 % (29741)Instruction limit reached!
% 1.33/0.53 % (29741)------------------------------
% 1.33/0.53 % (29741)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.53 % (29741)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.53 % (29741)Termination reason: Unknown
% 1.33/0.53 % (29741)Termination phase: Naming
% 1.33/0.53
% 1.33/0.53 % (29741)Memory used [KB]: 1663
% 1.33/0.53 % (29741)Time elapsed: 0.005 s
% 1.33/0.53 % (29741)Instructions burned: 3 (million)
% 1.33/0.53 % (29741)------------------------------
% 1.33/0.53 % (29741)------------------------------
% 1.33/0.53 % (29740)Instruction limit reached!
% 1.33/0.53 % (29740)------------------------------
% 1.33/0.53 % (29740)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.33/0.53 % (29740)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.33/0.53 % (29740)Termination reason: Unknown
% 1.33/0.53 % (29740)Termination phase: Saturation
% 1.33/0.53
% 1.33/0.53 % (29740)Memory used [KB]: 8315
% 1.33/0.53 % (29740)Time elapsed: 0.113 s
% 1.33/0.53 % (29740)Instructions burned: 52 (million)
% 1.33/0.53 % (29740)------------------------------
% 1.33/0.53 % (29740)------------------------------
% 1.48/0.53 % (29733)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)
% 1.48/0.53 % (29737)Instruction limit reached!
% 1.48/0.53 % (29737)------------------------------
% 1.48/0.53 % (29737)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.53 % (29737)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.53 % (29737)Termination reason: Unknown
% 1.48/0.53 % (29737)Termination phase: Saturation
% 1.48/0.53
% 1.48/0.53 % (29737)Memory used [KB]: 6396
% 1.48/0.53 % (29737)Time elapsed: 0.132 s
% 1.48/0.53 % (29737)Instructions burned: 12 (million)
% 1.48/0.53 % (29737)------------------------------
% 1.48/0.53 % (29737)------------------------------
% 1.48/0.54 % (29752)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.48/0.54 % (29755)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.48/0.54 % (29729)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.48/0.54 % (29753)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.48/0.54 % (29728)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.48/0.54 % (29729)Instruction limit reached!
% 1.48/0.54 % (29729)------------------------------
% 1.48/0.54 % (29729)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.54 % (29729)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.54 % (29729)Termination reason: Unknown
% 1.48/0.54 % (29729)Termination phase: Preprocessing 3
% 1.48/0.54
% 1.48/0.54 % (29729)Memory used [KB]: 1663
% 1.48/0.54 % (29729)Time elapsed: 0.004 s
% 1.48/0.54 % (29729)Instructions burned: 4 (million)
% 1.48/0.54 % (29729)------------------------------
% 1.48/0.54 % (29729)------------------------------
% 1.48/0.54 % (29754)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.48/0.54 % (29746)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.48/0.54 % (29744)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 1.48/0.54 % (29747)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.48/0.54 % (29744)Instruction limit reached!
% 1.48/0.54 % (29744)------------------------------
% 1.48/0.54 % (29744)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.54 % (29744)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.54 % (29744)Termination reason: Unknown
% 1.48/0.54 % (29744)Termination phase: Preprocessing 3
% 1.48/0.54
% 1.48/0.54 % (29744)Memory used [KB]: 1663
% 1.48/0.54 % (29744)Time elapsed: 0.003 s
% 1.48/0.54 % (29744)Instructions burned: 4 (million)
% 1.48/0.54 % (29744)------------------------------
% 1.48/0.54 % (29744)------------------------------
% 1.48/0.55 % (29746)Instruction limit reached!
% 1.48/0.55 % (29746)------------------------------
% 1.48/0.55 % (29746)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55 % (29746)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55 % (29746)Termination reason: Unknown
% 1.48/0.55 % (29746)Termination phase: Saturation
% 1.48/0.55
% 1.48/0.55 % (29746)Memory used [KB]: 6396
% 1.48/0.55 % (29746)Time elapsed: 0.147 s
% 1.48/0.55 % (29746)Instructions burned: 11 (million)
% 1.48/0.55 % (29746)------------------------------
% 1.48/0.55 % (29746)------------------------------
% 1.48/0.55 % (29742)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.48/0.55 % (29731)Instruction limit reached!
% 1.48/0.55 % (29731)------------------------------
% 1.48/0.55 % (29731)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55 % (29731)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55 % (29731)Termination reason: Unknown
% 1.48/0.55 % (29731)Termination phase: Saturation
% 1.48/0.55
% 1.48/0.55 % (29731)Memory used [KB]: 6396
% 1.48/0.55 % (29731)Time elapsed: 0.135 s
% 1.48/0.55 % (29731)Instructions burned: 14 (million)
% 1.48/0.55 % (29731)------------------------------
% 1.48/0.55 % (29731)------------------------------
% 1.48/0.55 % (29755)Instruction limit reached!
% 1.48/0.55 % (29755)------------------------------
% 1.48/0.55 % (29755)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55 % (29755)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55 % (29755)Termination reason: Unknown
% 1.48/0.55 % (29755)Termination phase: Function definition elimination
% 1.48/0.55
% 1.48/0.55 % (29755)Memory used [KB]: 1791
% 1.48/0.55 % (29755)Time elapsed: 0.005 s
% 1.48/0.55 % (29755)Instructions burned: 8 (million)
% 1.48/0.55 % (29755)------------------------------
% 1.48/0.55 % (29755)------------------------------
% 1.48/0.55 % (29734)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.48/0.55 % (29732)Instruction limit reached!
% 1.48/0.55 % (29732)------------------------------
% 1.48/0.55 % (29732)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55 % (29732)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55 % (29732)Termination reason: Unknown
% 1.48/0.55 % (29732)Termination phase: Saturation
% 1.48/0.55
% 1.48/0.55 % (29732)Memory used [KB]: 1791
% 1.48/0.55 % (29732)Time elapsed: 0.155 s
% 1.48/0.55 % (29732)Instructions burned: 15 (million)
% 1.48/0.55 % (29732)------------------------------
% 1.48/0.55 % (29732)------------------------------
% 1.48/0.55 % (29756)Instruction limit reached!
% 1.48/0.55 % (29756)------------------------------
% 1.48/0.55 % (29756)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.55 % (29756)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.55 % (29756)Termination reason: Unknown
% 1.48/0.55 % (29756)Termination phase: Saturation
% 1.48/0.55
% 1.48/0.55 % (29756)Memory used [KB]: 6524
% 1.48/0.55 % (29756)Time elapsed: 0.145 s
% 1.48/0.55 % (29756)Instructions burned: 24 (million)
% 1.48/0.55 % (29756)------------------------------
% 1.48/0.55 % (29756)------------------------------
% 1.48/0.55 % (29745)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.48/0.56 % (29745)Instruction limit reached!
% 1.48/0.56 % (29745)------------------------------
% 1.48/0.56 % (29745)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.56 % (29745)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.56 % (29745)Termination reason: Unknown
% 1.48/0.56 % (29745)Termination phase: Preprocessing 3
% 1.48/0.56
% 1.48/0.56 % (29745)Memory used [KB]: 1535
% 1.48/0.56 % (29745)Time elapsed: 0.002 s
% 1.48/0.56 % (29745)Instructions burned: 3 (million)
% 1.48/0.56 % (29745)------------------------------
% 1.48/0.56 % (29745)------------------------------
% 1.48/0.56 % (29728)Instruction limit reached!
% 1.48/0.56 % (29728)------------------------------
% 1.48/0.56 % (29728)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.56 % (29728)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.56 % (29728)Termination reason: Unknown
% 1.48/0.56 % (29728)Termination phase: Saturation
% 1.48/0.56
% 1.48/0.56 % (29728)Memory used [KB]: 6524
% 1.48/0.56 % (29728)Time elapsed: 0.011 s
% 1.48/0.56 % (29728)Instructions burned: 13 (million)
% 1.48/0.56 % (29728)------------------------------
% 1.48/0.56 % (29728)------------------------------
% 1.48/0.56 % (29751)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.48/0.56 % (29733)First to succeed.
% 1.48/0.56 % (29743)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.48/0.56 % (29750)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.48/0.57 % (29742)Instruction limit reached!
% 1.48/0.57 % (29742)------------------------------
% 1.48/0.57 % (29742)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.57 % (29742)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.57 % (29742)Termination reason: Unknown
% 1.48/0.57 % (29742)Termination phase: Property scanning
% 1.48/0.57
% 1.48/0.57 % (29742)Memory used [KB]: 1918
% 1.48/0.57 % (29742)Time elapsed: 0.004 s
% 1.48/0.57 % (29742)Instructions burned: 8 (million)
% 1.48/0.57 % (29742)------------------------------
% 1.48/0.57 % (29742)------------------------------
% 1.48/0.57 % (29754)Instruction limit reached!
% 1.48/0.57 % (29754)------------------------------
% 1.48/0.57 % (29754)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.57 % (29736)Instruction limit reached!
% 1.48/0.57 % (29736)------------------------------
% 1.48/0.57 % (29736)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.58 % (29747)Instruction limit reached!
% 1.48/0.58 % (29747)------------------------------
% 1.48/0.58 % (29747)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.58 % (29748)Instruction limit reached!
% 1.48/0.58 % (29748)------------------------------
% 1.48/0.58 % (29748)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.58 % (29748)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.58 % (29748)Termination reason: Unknown
% 1.48/0.58 % (29748)Termination phase: Saturation
% 1.48/0.58
% 1.48/0.58 % (29748)Memory used [KB]: 8187
% 1.48/0.58 % (29748)Time elapsed: 0.178 s
% 1.48/0.58 % (29748)Instructions burned: 99 (million)
% 1.48/0.58 % (29748)------------------------------
% 1.48/0.58 % (29748)------------------------------
% 1.48/0.58 % (29733)Refutation found. Thanks to Tanya!
% 1.48/0.58 % SZS status Theorem for theBenchmark
% 1.48/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.48/0.58 % (29733)------------------------------
% 1.48/0.58 % (29733)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.48/0.58 % (29733)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.48/0.58 % (29733)Termination reason: Refutation
% 1.48/0.58
% 1.48/0.58 % (29733)Memory used [KB]: 6396
% 1.48/0.58 % (29733)Time elapsed: 0.134 s
% 1.48/0.58 % (29733)Instructions burned: 19 (million)
% 1.48/0.58 % (29733)------------------------------
% 1.48/0.58 % (29733)------------------------------
% 1.48/0.58 % (29726)Success in time 0.231 s
%------------------------------------------------------------------------------