TSTP Solution File: SWC227+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC227+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:39:44 EDT 2022
% Result : Theorem 1.49s 0.55s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 20
% Syntax : Number of formulae : 86 ( 9 unt; 0 def)
% Number of atoms : 815 ( 218 equ)
% Maximal formula atoms : 72 ( 9 avg)
% Number of connectives : 1198 ( 469 ~; 441 |; 260 &)
% ( 4 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 322 ( 231 !; 91 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f511,plain,
$false,
inference(avatar_sat_refutation,[],[f290,f291,f481,f491,f510]) ).
fof(f510,plain,
( ~ spl19_2
| spl19_5
| ~ spl19_8
| ~ spl19_9 ),
inference(avatar_contradiction_clause,[],[f509]) ).
fof(f509,plain,
( $false
| ~ spl19_2
| spl19_5
| ~ spl19_8
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f505,f476]) ).
fof(f476,plain,
( ssItem(sK11(sK3(sK7),nil,sK2(sK7)))
| ~ spl19_8 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f474,plain,
( spl19_8
<=> ssItem(sK11(sK3(sK7),nil,sK2(sK7))) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_8])]) ).
fof(f505,plain,
( ~ ssItem(sK11(sK3(sK7),nil,sK2(sK7)))
| ~ spl19_2
| spl19_5
| ~ spl19_9 ),
inference(resolution,[],[f504,f199]) ).
fof(f199,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(f504,plain,
( memberP(nil,sK11(sK3(sK7),nil,sK2(sK7)))
| ~ spl19_2
| spl19_5
| ~ spl19_9 ),
inference(subsumption_resolution,[],[f503,f479]) ).
fof(f479,plain,
( ssList(cons(sK3(sK7),nil))
| ~ spl19_9 ),
inference(avatar_component_clause,[],[f478]) ).
fof(f478,plain,
( spl19_9
<=> ssList(cons(sK3(sK7),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_9])]) ).
fof(f503,plain,
( memberP(nil,sK11(sK3(sK7),nil,sK2(sK7)))
| ~ ssList(cons(sK3(sK7),nil))
| ~ spl19_2
| spl19_5 ),
inference(subsumption_resolution,[],[f502,f288]) ).
fof(f288,plain,
( nil != sK7
| spl19_5 ),
inference(avatar_component_clause,[],[f286]) ).
fof(f286,plain,
( spl19_5
<=> nil = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl19_5])]) ).
fof(f502,plain,
( nil = sK7
| memberP(nil,sK11(sK3(sK7),nil,sK2(sK7)))
| ~ ssList(cons(sK3(sK7),nil))
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f501,f216]) ).
fof(f216,plain,
ssList(sK7),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
( ssList(sK5)
& ssList(sK6)
& ssList(sK7)
& nil != sK5
& ssList(sK9)
& app(app(sK9,sK7),sK10) = sK8
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK10 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != sK9
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(sK10)
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ( memberP(X15,sK11(X14,X15,X16))
& memberP(X16,sK11(X14,X15,X16))
& leq(X14,sK11(X14,X15,X16))
& ~ leq(sK11(X14,X15,X16),X14)
& ssItem(sK11(X14,X15,X16)) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(sK8)
& ( nil = sK8
| nil != sK7 )
& sK5 = sK7
& sK6 = sK8 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f149,f156,f155,f154,f153,f152,f151,f150]) ).
fof(f150,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0 ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3 ) ) ) )
=> ( ssList(sK5)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& sK5 = X2
& X1 = X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& sK5 = X2
& X1 = X3 ) ) )
=> ( ssList(sK6)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& sK5 = X2
& sK6 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& sK5 = X2
& sK6 = X3 ) )
=> ( ssList(sK7)
& ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK7),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != sK7 )
& sK5 = sK7
& sK6 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
( ? [X3] :
( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK7),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != sK7 )
& sK5 = sK7
& sK6 = X3 )
=> ( nil != sK5
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK7),X5) = sK8
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| sK5 != app(app(X15,cons(X14,nil)),X16) ) )
| ~ ssItem(X14) )
& ssList(sK8)
& ( nil = sK8
| nil != sK7 )
& sK5 = sK7
& sK6 = sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f154,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,sK7),X5) = sK8
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) ) )
=> ( ssList(sK9)
& ? [X5] :
( sK8 = app(app(sK9,sK7),X5)
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != sK9
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
( ? [X5] :
( sK8 = app(app(sK9,sK7),X5)
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != sK9
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(X5) )
=> ( app(app(sK9,sK7),sK10) = sK8
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( sK7 != app(X9,cons(X8,nil))
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != sK10 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != sK9
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != sK7 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(sK7)
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X14,X15,X16] :
( ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
=> ( memberP(X15,sK11(X14,X15,X16))
& memberP(X16,sK11(X14,X15,X16))
& leq(X14,sK11(X14,X15,X16))
& ~ leq(sK11(X14,X15,X16),X14)
& ssItem(sK11(X14,X15,X16)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& ? [X4] :
( ssList(X4)
& ? [X5] :
( app(app(X4,X2),X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( ! [X9] :
( app(X9,cons(X8,nil)) != X2
| ~ ssList(X9)
| ~ leq(X8,X6) )
| ~ ssItem(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X4
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X5) ) )
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ~ ssList(X16)
| ? [X17] :
( memberP(X15,X17)
& memberP(X16,X17)
& leq(X14,X17)
& ~ leq(X17,X14)
& ssItem(X17) )
| app(app(X15,cons(X14,nil)),X16) != X0 ) )
| ~ ssItem(X14) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(rectify,[],[f107]) ).
fof(f107,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( nil != X0
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(app(X8,X2),X9) = X3
& ! [X14] :
( ! [X15] :
( ~ ssList(X15)
| ! [X16] :
( ! [X17] :
( app(X17,cons(X16,nil)) != X2
| ~ ssList(X17)
| ~ leq(X16,X14) )
| ~ ssItem(X16) )
| app(cons(X14,nil),X15) != X9 )
| ~ ssItem(X14) )
& ! [X10] :
( ! [X11] :
( app(X11,cons(X10,nil)) != X8
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| ~ leq(X10,X12)
| app(cons(X12,nil),X13) != X2 ) )
| ~ ssList(X11) )
| ~ ssItem(X10) )
& totalorderedP(X2)
& ssList(X9) ) )
& ! [X4] :
( ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X0 ) )
| ~ ssItem(X4) )
& ssList(X3)
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X6,X7)
| leq(X7,X4)
| ~ memberP(X5,X7)
| ~ leq(X4,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X5) ) )
| nil = X0
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ssItem(X14)
& ? [X15] :
( ? [X16] :
( ssItem(X16)
& ? [X17] :
( app(X17,cons(X16,nil)) = X2
& ssList(X17)
& leq(X16,X14) ) )
& ssList(X15)
& app(cons(X14,nil),X15) = X9 ) )
| ? [X10] :
( ? [X11] :
( app(X11,cons(X10,nil)) = X8
& ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& leq(X10,X12)
& app(cons(X12,nil),X13) = X2 ) ) )
& ssItem(X10) )
| ~ ssList(X9)
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3 ) )
| ~ ssList(X3)
| ( nil != X3
& nil = X2 )
| X1 != X3
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ? [X4] :
( ssItem(X4)
& ? [X5] :
( ? [X6] :
( ssList(X6)
& ! [X7] :
( ~ memberP(X6,X7)
| leq(X7,X4)
| ~ memberP(X5,X7)
| ~ leq(X4,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0 )
& ssList(X5) ) )
| nil = X0
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ? [X14] :
( ssItem(X14)
& ? [X15] :
( ? [X16] :
( ssItem(X16)
& ? [X17] :
( app(X17,cons(X16,nil)) = X2
& ssList(X17)
& leq(X16,X14) ) )
& ssList(X15)
& app(cons(X14,nil),X15) = X9 ) )
| ? [X10] :
( ? [X11] :
( app(X11,cons(X10,nil)) = X8
& ssList(X11)
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& leq(X10,X12)
& app(cons(X12,nil),X13) = X2 ) ) )
& ssItem(X10) )
| ~ ssList(X9)
| ~ totalorderedP(X2)
| app(app(X8,X2),X9) != X3 ) )
| ~ ssList(X3)
| ( nil != X3
& nil = X2 )
| X1 != X3
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f501,plain,
( memberP(nil,sK11(sK3(sK7),nil,sK2(sK7)))
| ~ ssList(sK7)
| nil = sK7
| ~ ssList(cons(sK3(sK7),nil))
| ~ spl19_2 ),
inference(equality_resolution,[],[f449]) ).
fof(f449,plain,
( ! [X0] :
( sK7 != X0
| ~ ssList(X0)
| ~ ssList(cons(sK3(X0),nil))
| nil = X0
| memberP(nil,sK11(sK3(X0),nil,sK2(X0))) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f448,f183]) ).
fof(f183,plain,
! [X0] :
( ssItem(sK3(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ( ssList(sK2(X0))
& cons(sK3(X0),sK2(X0)) = X0
& ssItem(sK3(X0)) )
| ~ ssList(X0)
| nil = X0 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f111,f143,f142]) ).
fof(f142,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
=> ( ssList(sK2(X0))
& ? [X2] :
( cons(X2,sK2(X0)) = X0
& ssItem(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK2(X0)) = X0
& ssItem(X2) )
=> ( cons(sK3(X0),sK2(X0)) = X0
& ssItem(sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
| ~ ssList(X0)
| nil = X0 ),
inference(flattening,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) ) )
| nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f448,plain,
( ! [X0] :
( memberP(nil,sK11(sK3(X0),nil,sK2(X0)))
| ~ ssItem(sK3(X0))
| sK7 != X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(cons(sK3(X0),nil)) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f446,f185]) ).
fof(f185,plain,
! [X0] :
( ssList(sK2(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f446,plain,
( ! [X0] :
( ~ ssList(cons(sK3(X0),nil))
| ~ ssList(sK2(X0))
| ~ ssItem(sK3(X0))
| memberP(nil,sK11(sK3(X0),nil,sK2(X0)))
| sK7 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl19_2 ),
inference(superposition,[],[f426,f184]) ).
fof(f184,plain,
! [X0] :
( cons(sK3(X0),sK2(X0)) = X0
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f144]) ).
fof(f426,plain,
( ! [X8,X7] :
( sK7 != cons(X7,X8)
| ~ ssList(cons(X7,nil))
| memberP(nil,sK11(X7,nil,X8))
| ~ ssList(X8)
| ~ ssItem(X7) )
| ~ spl19_2 ),
inference(duplicate_literal_removal,[],[f405]) ).
fof(f405,plain,
( ! [X8,X7] :
( ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssList(cons(X7,nil))
| ~ ssList(X8)
| sK7 != cons(X7,X8)
| memberP(nil,sK11(X7,nil,X8)) )
| ~ spl19_2 ),
inference(superposition,[],[f300,f229]) ).
fof(f229,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) )
| ~ ssList(X0) ),
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(f300,plain,
( ! [X10,X9] :
( app(cons(X9,nil),X10) != sK7
| ~ ssItem(X9)
| ~ ssList(cons(X9,nil))
| ~ ssList(X10)
| memberP(nil,sK11(X9,nil,X10)) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f297,f273]) ).
fof(f273,plain,
( ssList(nil)
| ~ spl19_2 ),
inference(avatar_component_clause,[],[f272]) ).
fof(f272,plain,
( spl19_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl19_2])]) ).
fof(f297,plain,
! [X10,X9] :
( ~ ssList(nil)
| app(cons(X9,nil),X10) != sK7
| ~ ssList(cons(X9,nil))
| ~ ssItem(X9)
| memberP(nil,sK11(X9,nil,X10))
| ~ ssList(X10) ),
inference(superposition,[],[f254,f195]) ).
fof(f195,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f254,plain,
! [X16,X14,X15] :
( sK7 != app(app(X15,cons(X14,nil)),X16)
| memberP(X15,sK11(X14,X15,X16))
| ~ ssList(X16)
| ~ ssItem(X14)
| ~ ssList(X15) ),
inference(definition_unfolding,[],[f208,f201]) ).
fof(f201,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f157]) ).
fof(f208,plain,
! [X16,X14,X15] :
( ~ ssList(X15)
| ~ ssList(X16)
| memberP(X15,sK11(X14,X15,X16))
| sK5 != app(app(X15,cons(X14,nil)),X16)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f157]) ).
fof(f491,plain,
( ~ spl19_2
| spl19_5
| spl19_9 ),
inference(avatar_contradiction_clause,[],[f490]) ).
fof(f490,plain,
( $false
| ~ spl19_2
| spl19_5
| spl19_9 ),
inference(subsumption_resolution,[],[f489,f216]) ).
fof(f489,plain,
( ~ ssList(sK7)
| ~ spl19_2
| spl19_5
| spl19_9 ),
inference(subsumption_resolution,[],[f487,f288]) ).
fof(f487,plain,
( nil = sK7
| ~ ssList(sK7)
| ~ spl19_2
| spl19_9 ),
inference(resolution,[],[f484,f183]) ).
fof(f484,plain,
( ~ ssItem(sK3(sK7))
| ~ spl19_2
| spl19_9 ),
inference(subsumption_resolution,[],[f482,f273]) ).
fof(f482,plain,
( ~ ssItem(sK3(sK7))
| ~ ssList(nil)
| spl19_9 ),
inference(resolution,[],[f480,f188]) ).
fof(f188,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,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(f480,plain,
( ~ ssList(cons(sK3(sK7),nil))
| spl19_9 ),
inference(avatar_component_clause,[],[f478]) ).
fof(f481,plain,
( spl19_8
| ~ spl19_9
| ~ spl19_2
| spl19_5 ),
inference(avatar_split_clause,[],[f472,f286,f272,f478,f474]) ).
fof(f472,plain,
( ~ ssList(cons(sK3(sK7),nil))
| ssItem(sK11(sK3(sK7),nil,sK2(sK7)))
| ~ spl19_2
| spl19_5 ),
inference(subsumption_resolution,[],[f471,f216]) ).
fof(f471,plain,
( ssItem(sK11(sK3(sK7),nil,sK2(sK7)))
| ~ ssList(cons(sK3(sK7),nil))
| ~ ssList(sK7)
| ~ spl19_2
| spl19_5 ),
inference(subsumption_resolution,[],[f470,f288]) ).
fof(f470,plain,
( ~ ssList(cons(sK3(sK7),nil))
| nil = sK7
| ~ ssList(sK7)
| ssItem(sK11(sK3(sK7),nil,sK2(sK7)))
| ~ spl19_2 ),
inference(equality_resolution,[],[f443]) ).
fof(f443,plain,
( ! [X0] :
( sK7 != X0
| nil = X0
| ~ ssList(cons(sK3(X0),nil))
| ~ ssList(X0)
| ssItem(sK11(sK3(X0),nil,sK2(X0))) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f442,f185]) ).
fof(f442,plain,
( ! [X0] :
( ~ ssList(cons(sK3(X0),nil))
| ssItem(sK11(sK3(X0),nil,sK2(X0)))
| ~ ssList(sK2(X0))
| sK7 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f440,f183]) ).
fof(f440,plain,
( ! [X0] :
( nil = X0
| sK7 != X0
| ~ ssList(cons(sK3(X0),nil))
| ssItem(sK11(sK3(X0),nil,sK2(X0)))
| ~ ssList(X0)
| ~ ssItem(sK3(X0))
| ~ ssList(sK2(X0)) )
| ~ spl19_2 ),
inference(superposition,[],[f425,f184]) ).
fof(f425,plain,
( ! [X14,X13] :
( sK7 != cons(X13,X14)
| ssItem(sK11(X13,nil,X14))
| ~ ssList(cons(X13,nil))
| ~ ssList(X14)
| ~ ssItem(X13) )
| ~ spl19_2 ),
inference(duplicate_literal_removal,[],[f408]) ).
fof(f408,plain,
( ! [X14,X13] :
( ~ ssList(X14)
| ~ ssList(X14)
| ssItem(sK11(X13,nil,X14))
| ~ ssItem(X13)
| ~ ssItem(X13)
| ~ ssList(cons(X13,nil))
| sK7 != cons(X13,X14) )
| ~ spl19_2 ),
inference(superposition,[],[f303,f229]) ).
fof(f303,plain,
( ! [X11,X12] :
( sK7 != app(cons(X11,nil),X12)
| ~ ssItem(X11)
| ssItem(sK11(X11,nil,X12))
| ~ ssList(X12)
| ~ ssList(cons(X11,nil)) )
| ~ spl19_2 ),
inference(subsumption_resolution,[],[f298,f273]) ).
fof(f298,plain,
! [X11,X12] :
( ~ ssList(cons(X11,nil))
| sK7 != app(cons(X11,nil),X12)
| ssItem(sK11(X11,nil,X12))
| ~ ssList(X12)
| ~ ssList(nil)
| ~ ssItem(X11) ),
inference(superposition,[],[f258,f195]) ).
fof(f258,plain,
! [X16,X14,X15] :
( sK7 != app(app(X15,cons(X14,nil)),X16)
| ~ ssList(X15)
| ssItem(sK11(X14,X15,X16))
| ~ ssList(X16)
| ~ ssItem(X14) ),
inference(definition_unfolding,[],[f204,f201]) ).
fof(f204,plain,
! [X16,X14,X15] :
( ~ ssList(X15)
| ~ ssList(X16)
| ssItem(sK11(X14,X15,X16))
| sK5 != app(app(X15,cons(X14,nil)),X16)
| ~ ssItem(X14) ),
inference(cnf_transformation,[],[f157]) ).
fof(f291,plain,
spl19_2,
inference(avatar_split_clause,[],[f189,f272]) ).
fof(f189,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f290,plain,
~ spl19_5,
inference(avatar_split_clause,[],[f253,f286]) ).
fof(f253,plain,
nil != sK7,
inference(definition_unfolding,[],[f215,f201]) ).
fof(f215,plain,
nil != sK5,
inference(cnf_transformation,[],[f157]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC227+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:34:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.51 % (31589)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.18/0.51 % (31584)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.51 % (31590)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.18/0.52 % (31607)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.18/0.52 % (31600)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.52 % (31600)Instruction limit reached!
% 0.18/0.52 % (31600)------------------------------
% 0.18/0.52 % (31600)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (31600)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (31600)Termination reason: Unknown
% 0.18/0.52 % (31600)Termination phase: Preprocessing 3
% 0.18/0.52
% 0.18/0.52 % (31600)Memory used [KB]: 1791
% 0.18/0.53 % (31584)Instruction limit reached!
% 0.18/0.53 % (31584)------------------------------
% 0.18/0.53 % (31584)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (31599)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.18/0.53 % (31600)Time elapsed: 0.005 s
% 0.18/0.53 % (31600)Instructions burned: 7 (million)
% 0.18/0.53 % (31600)------------------------------
% 0.18/0.53 % (31600)------------------------------
% 0.18/0.53 % (31604)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.18/0.53 % (31608)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.18/0.53 % (31586)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.18/0.54 % (31599)Instruction limit reached!
% 0.18/0.54 % (31599)------------------------------
% 0.18/0.54 % (31599)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54 % (31599)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54 % (31599)Termination reason: Unknown
% 0.18/0.54 % (31599)Termination phase: Naming
% 0.18/0.54
% 0.18/0.54 % (31599)Memory used [KB]: 1663
% 0.18/0.54 % (31599)Time elapsed: 0.004 s
% 0.18/0.54 % (31599)Instructions burned: 3 (million)
% 0.18/0.54 % (31599)------------------------------
% 0.18/0.54 % (31599)------------------------------
% 0.18/0.54 % (31604)Instruction limit reached!
% 0.18/0.54 % (31604)------------------------------
% 0.18/0.54 % (31604)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.54 % (31612)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.18/0.54 % (31585)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.54 % (31584)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.54 % (31584)Termination reason: Unknown
% 0.18/0.54 % (31584)Termination phase: Saturation
% 0.18/0.54
% 0.18/0.54 % (31584)Memory used [KB]: 6524
% 0.18/0.54 % (31584)Time elapsed: 0.010 s
% 0.18/0.54 % (31584)Instructions burned: 13 (million)
% 0.18/0.54 % (31584)------------------------------
% 0.18/0.54 % (31584)------------------------------
% 0.18/0.54 % (31589)First to succeed.
% 1.49/0.54 % (31604)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.54 % (31604)Termination reason: Unknown
% 1.49/0.54 % (31604)Termination phase: Saturation
% 1.49/0.54
% 1.49/0.54 % (31604)Memory used [KB]: 6396
% 1.49/0.54 % (31604)Time elapsed: 0.128 s
% 1.49/0.54 % (31604)Instructions burned: 12 (million)
% 1.49/0.54 % (31604)------------------------------
% 1.49/0.54 % (31604)------------------------------
% 1.49/0.55 % (31609)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.49/0.55 % (31589)Refutation found. Thanks to Tanya!
% 1.49/0.55 % SZS status Theorem for theBenchmark
% 1.49/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.49/0.55 % (31589)------------------------------
% 1.49/0.55 % (31589)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.49/0.55 % (31589)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.49/0.55 % (31589)Termination reason: Refutation
% 1.49/0.55
% 1.49/0.55 % (31589)Memory used [KB]: 6396
% 1.49/0.55 % (31589)Time elapsed: 0.128 s
% 1.49/0.55 % (31589)Instructions burned: 17 (million)
% 1.49/0.55 % (31589)------------------------------
% 1.49/0.55 % (31589)------------------------------
% 1.49/0.55 % (31582)Success in time 0.195 s
%------------------------------------------------------------------------------