%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC158+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:02:42 PM UTC 2026
% Result : Theorem 13.40s 2.87s
% Output : Refutation 14.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 23
% Syntax : Number of formulae : 239 ( 31 unt; 14 def)
% Number of atoms : 1229 ( 95 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 1798 ( 808 ~; 810 |; 116 &)
% ( 21 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 15 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-2 aty)
% Number of variables : 316 ( 0 sgn 268 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
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(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ( app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) != X0
| ~ leq(X10,X9)
| ( ! [X14] :
( ssItem(X14)
=> ( ~ memberP(X12,X14)
| ( leq(X9,X14)
& leq(X14,X10) ) ) )
& leq(X9,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& leq(X7,X5) ) ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> ( app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) != X0
| ~ leq(X10,X9)
| ( ! [X14] :
( ssItem(X14)
=> ( ~ memberP(X12,X14)
| ( leq(X9,X14)
& leq(X14,X10) ) ) )
& leq(X9,X10) ) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ? [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) = X0
& leq(X10,X9)
& ( ? [X14] :
( memberP(X12,X14)
& ( ~ leq(X9,X14)
| ~ leq(X14,X10) )
& ssItem(X14) )
| ~ leq(X9,X10) )
& ssList(X13) )
& ssList(X12) )
& ssList(X11) )
& ssItem(X10) )
& ssItem(X9) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != X2
| ~ leq(X7,X5) ) ) ) )
& ssList(X4) )
& ? [X9] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( app(app(app(app(X11,cons(X9,nil)),X12),cons(X10,nil)),X13) = X0
& leq(X10,X9)
& ( ? [X14] :
( memberP(X12,X14)
& ( ~ leq(X9,X14)
| ~ leq(X14,X10) )
& ssItem(X14) )
| ~ leq(X9,X10) )
& ssList(X13) )
& ssList(X12) )
& ssList(X11) )
& ssItem(X10) )
& ssItem(X9) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f134,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f135,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f134]) ).
fof(f192,plain,
( sK7 = sK9
& sK6 = sK8
& sK9 = app(sK8,sK10)
& totalorderedP(sK8)
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK10
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| app(X8,cons(X7,nil)) != sK8
| ~ leq(X7,X5) ) ) ) )
& ssList(sK10)
& sK6 = app(app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,nil)),sK15)
& leq(sK12,sK11)
& ( ( memberP(sK14,sK16)
& ( ~ leq(sK11,sK16)
| ~ leq(sK16,sK12) )
& ssItem(sK16) )
| ~ leq(sK11,sK12) )
& ssList(sK15)
& ssList(sK14)
& ssList(sK13)
& ssItem(sK12)
& ssItem(sK11)
& ( nil = sK9
| nil != sK8 )
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X4,sK10),skolemize(X9,sK11),skolemize(X10,sK12),skolemize(X11,sK13),skolemize(X12,sK14),skolemize(X13,sK15),skolemize(X14,sK16)],[f99]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f199]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(X4,cons(X1,X5)) = X0 ) )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f201]) ).
fof(f203,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK21(X0,X1))
& ssList(sK22(X0,X1))
& app(sK21(X0,X1),cons(X1,sK22(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21,sK22]),skolemize(X4,sK21(X0,X1)),skolemize(X5,sK22(X0,X1))],[f202]) ).
fof(f209,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f135]) ).
fof(f210,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f209]) ).
fof(f211,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK23(X0),sK24(X0))
& app(app(sK25(X0),cons(sK23(X0),sK26(X0))),cons(sK24(X0),sK27(X0))) = X0
& ssList(sK27(X0))
& ssList(sK26(X0))
& ssList(sK25(X0))
& ssItem(sK24(X0))
& ssItem(sK23(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23,sK24,sK25,sK26,sK27]),skolemize(X1,sK23(X0)),skolemize(X2,sK24(X0)),skolemize(X3,sK25(X0)),skolemize(X4,sK26(X0)),skolemize(X5,sK27(X0))],[f210]) ).
fof(f232,plain,
ssList(sK6),
inference(cnf_transformation,[],[f192]) ).
fof(f237,plain,
ssItem(sK11),
inference(cnf_transformation,[],[f192]) ).
fof(f238,plain,
ssItem(sK12),
inference(cnf_transformation,[],[f192]) ).
fof(f239,plain,
ssList(sK13),
inference(cnf_transformation,[],[f192]) ).
fof(f240,plain,
ssList(sK14),
inference(cnf_transformation,[],[f192]) ).
fof(f241,plain,
ssList(sK15),
inference(cnf_transformation,[],[f192]) ).
fof(f242,plain,
( ssItem(sK16)
| ~ leq(sK11,sK12) ),
inference(cnf_transformation,[],[f192]) ).
fof(f243,plain,
( ~ leq(sK11,sK16)
| ~ leq(sK16,sK12)
| ~ leq(sK11,sK12) ),
inference(cnf_transformation,[],[f192]) ).
fof(f244,plain,
( memberP(sK14,sK16)
| ~ leq(sK11,sK12) ),
inference(cnf_transformation,[],[f192]) ).
fof(f246,plain,
sK6 = app(app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,nil)),sK15),
inference(cnf_transformation,[],[f192]) ).
fof(f249,plain,
totalorderedP(sK8),
inference(cnf_transformation,[],[f192]) ).
fof(f251,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f192]) ).
fof(f263,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f268,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f269,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f274,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f275,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f281,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f282,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f283,plain,
! [X0,X1] :
( app(sK21(X0,X1),cons(X1,sK22(X0,X1))) = X0
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f284,plain,
! [X0,X1] :
( ssList(sK22(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f285,plain,
! [X0,X1] :
( ssList(sK21(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f286,plain,
! [X2,X3,X0,X1] :
( memberP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f302,plain,
! [X10,X0,X8,X6,X9,X7] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f211]) ).
fof(f391,plain,
sK8 = app(app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,nil)),sK15),
inference(definition_unfolding,[],[f246,f251]) ).
fof(f393,plain,
ssList(sK8),
inference(definition_unfolding,[],[f232,f251]) ).
fof(f397,plain,
! [X2,X3,X1] :
( memberP(app(X2,cons(X1,X3)),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ ssList(app(X2,cons(X1,X3))) ),
inference(equality_resolution,[],[f286]) ).
fof(f401,plain,
! [X10,X8,X6,X9,X7] :
( ~ totalorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| leq(X6,X7)
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f302]) ).
fof(f421,definition,
( spl50_3
<=> leq(sK11,sK12) ),
introduced(definition,[new_symbols(definition,[spl50_3])],[avatar_definition]) ).
fof(f423,plain,
( ~ leq(sK11,sK12)
| spl50_3 ),
inference(avatar_component_clause,[],[f421]) ).
fof(f425,definition,
( spl50_4
<=> ssItem(sK16) ),
introduced(definition,[new_symbols(definition,[spl50_4])],[avatar_definition]) ).
fof(f427,plain,
( ssItem(sK16)
| ~ spl50_4 ),
inference(avatar_component_clause,[],[f425]) ).
fof(f428,plain,
( ~ spl50_3
| spl50_4 ),
inference(avatar_split_clause,[],[f242,f425,f421]) ).
fof(f430,definition,
( spl50_5
<=> leq(sK16,sK12) ),
introduced(definition,[new_symbols(definition,[spl50_5])],[avatar_definition]) ).
fof(f432,plain,
( ~ leq(sK16,sK12)
| spl50_5 ),
inference(avatar_component_clause,[],[f430]) ).
fof(f434,definition,
( spl50_6
<=> leq(sK11,sK16) ),
introduced(definition,[new_symbols(definition,[spl50_6])],[avatar_definition]) ).
fof(f436,plain,
( ~ leq(sK11,sK16)
| spl50_6 ),
inference(avatar_component_clause,[],[f434]) ).
fof(f437,plain,
( ~ spl50_3
| ~ spl50_5
| ~ spl50_6 ),
inference(avatar_split_clause,[],[f243,f434,f430,f421]) ).
fof(f439,definition,
( spl50_7
<=> memberP(sK14,sK16) ),
introduced(definition,[new_symbols(definition,[spl50_7])],[avatar_definition]) ).
fof(f441,plain,
( memberP(sK14,sK16)
| ~ spl50_7 ),
inference(avatar_component_clause,[],[f439]) ).
fof(f442,plain,
( ~ spl50_3
| spl50_7 ),
inference(avatar_split_clause,[],[f244,f439,f421]) ).
fof(f445,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),app(cons(sK12,nil),sK15))
| ~ ssList(sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) ),
inference(superposition,[],[f268,f391]) ).
fof(f446,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),app(sK14,cons(sK12,nil))),sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| ~ ssList(app(sK13,cons(sK11,nil))) ),
inference(superposition,[],[f391,f268]) ).
fof(f452,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),app(sK14,cons(sK12,nil))),sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(app(sK13,cons(sK11,nil))) ),
inference(forward_subsumption_resolution,[],[f446,f240]) ).
fof(f453,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),app(cons(sK12,nil),sK15))
| ~ ssList(cons(sK12,nil))
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) ),
inference(forward_subsumption_resolution,[],[f445,f241]) ).
fof(f457,definition,
( spl50_8
<=> ssList(app(app(sK13,cons(sK11,nil)),sK14)) ),
introduced(definition,[new_symbols(definition,[spl50_8])],[avatar_definition]) ).
fof(f458,plain,
( ssList(app(app(sK13,cons(sK11,nil)),sK14))
| ~ spl50_8 ),
inference(avatar_component_clause,[],[f457]) ).
fof(f459,plain,
( ~ ssList(app(app(sK13,cons(sK11,nil)),sK14))
| spl50_8 ),
inference(avatar_component_clause,[],[f457]) ).
fof(f461,definition,
( spl50_9
<=> ssList(cons(sK12,nil)) ),
introduced(definition,[new_symbols(definition,[spl50_9])],[avatar_definition]) ).
fof(f462,plain,
( ssList(cons(sK12,nil))
| ~ spl50_9 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f463,plain,
( ~ ssList(cons(sK12,nil))
| spl50_9 ),
inference(avatar_component_clause,[],[f461]) ).
fof(f465,definition,
( spl50_10
<=> sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),app(cons(sK12,nil),sK15)) ),
introduced(definition,[new_symbols(definition,[spl50_10])],[avatar_definition]) ).
fof(f467,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),app(cons(sK12,nil),sK15))
| ~ spl50_10 ),
inference(avatar_component_clause,[],[f465]) ).
fof(f471,definition,
( spl50_11
<=> ssList(app(sK13,cons(sK11,nil))) ),
introduced(definition,[new_symbols(definition,[spl50_11])],[avatar_definition]) ).
fof(f472,plain,
( ssList(app(sK13,cons(sK11,nil)))
| ~ spl50_11 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f473,plain,
( ~ ssList(app(sK13,cons(sK11,nil)))
| spl50_11 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f475,definition,
( spl50_12
<=> sK8 = app(app(app(sK13,cons(sK11,nil)),app(sK14,cons(sK12,nil))),sK15) ),
introduced(definition,[new_symbols(definition,[spl50_12])],[avatar_definition]) ).
fof(f477,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),app(sK14,cons(sK12,nil))),sK15)
| ~ spl50_12 ),
inference(avatar_component_clause,[],[f475]) ).
fof(f478,plain,
( ~ spl50_11
| ~ spl50_9
| spl50_12 ),
inference(avatar_split_clause,[],[f452,f475,f461,f471]) ).
fof(f479,plain,
( ~ spl50_8
| ~ spl50_9
| spl50_10 ),
inference(avatar_split_clause,[],[f453,f465,f461,f457]) ).
fof(f489,definition,
( spl50_15
<=> ssList(cons(sK11,nil)) ),
introduced(definition,[new_symbols(definition,[spl50_15])],[avatar_definition]) ).
fof(f490,plain,
( ssList(cons(sK11,nil))
| ~ spl50_15 ),
inference(avatar_component_clause,[],[f489]) ).
fof(f491,plain,
( ~ ssList(cons(sK11,nil))
| spl50_15 ),
inference(avatar_component_clause,[],[f489]) ).
fof(f508,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f274,f268]) ).
fof(f510,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f508]) ).
fof(f511,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f510,f274]) ).
fof(f512,plain,
( ~ ssItem(sK11)
| ~ ssList(nil)
| spl50_15 ),
inference(resolution,[],[f263,f491]) ).
fof(f513,plain,
( ~ ssItem(sK12)
| ~ ssList(nil)
| spl50_9 ),
inference(resolution,[],[f263,f463]) ).
fof(f514,plain,
( ~ ssList(nil)
| spl50_9 ),
inference(forward_subsumption_resolution,[],[f513,f238]) ).
fof(f515,plain,
( ~ ssList(nil)
| spl50_15 ),
inference(forward_subsumption_resolution,[],[f512,f237]) ).
fof(f516,plain,
( $false
| spl50_9 ),
inference(forward_subsumption_resolution,[],[f514,f275]) ).
fof(f517,plain,
spl50_9,
inference(avatar_contradiction_clause,[],[f516]) ).
fof(f518,plain,
( $false
| spl50_15 ),
inference(forward_subsumption_resolution,[],[f515,f275]) ).
fof(f519,plain,
spl50_15,
inference(avatar_contradiction_clause,[],[f518]) ).
fof(f521,plain,
( ~ ssList(app(sK13,app(cons(sK11,nil),sK14)))
| ~ ssList(sK14)
| ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| spl50_8 ),
inference(superposition,[],[f459,f268]) ).
fof(f522,plain,
( ~ ssList(sK14)
| ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| spl50_8 ),
inference(forward_subsumption_resolution,[],[f521,f511]) ).
fof(f523,plain,
( ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| spl50_8 ),
inference(forward_subsumption_resolution,[],[f522,f240]) ).
fof(f524,plain,
( ~ ssList(sK13)
| spl50_8
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f523,f490]) ).
fof(f525,plain,
( $false
| spl50_8
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f524,f239]) ).
fof(f526,plain,
( spl50_8
| ~ spl50_15 ),
inference(avatar_contradiction_clause,[],[f525]) ).
fof(f527,plain,
( ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| spl50_11 ),
inference(resolution,[],[f473,f274]) ).
fof(f528,plain,
( ~ ssList(sK13)
| spl50_11
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f527,f490]) ).
fof(f529,plain,
( $false
| spl50_11
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f528,f239]) ).
fof(f530,plain,
( spl50_11
| ~ spl50_15 ),
inference(avatar_contradiction_clause,[],[f529]) ).
fof(f531,plain,
( sK8 = app(app(sK13,app(cons(sK11,nil),sK14)),app(cons(sK12,nil),sK15))
| ~ ssList(sK14)
| ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| ~ spl50_10 ),
inference(superposition,[],[f467,f268]) ).
fof(f539,plain,
( sK8 = app(app(sK13,app(cons(sK11,nil),sK14)),app(cons(sK12,nil),sK15))
| ~ ssList(cons(sK11,nil))
| ~ ssList(sK13)
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f531,f240]) ).
fof(f550,plain,
( sK8 = app(app(sK13,app(cons(sK11,nil),sK14)),app(cons(sK12,nil),sK15))
| ~ ssList(sK13)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f539,f490]) ).
fof(f557,plain,
( sK8 = app(app(sK13,app(cons(sK11,nil),sK14)),app(cons(sK12,nil),sK15))
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f550,f239]) ).
fof(f559,plain,
( sK8 = app(app(sK13,cons(sK11,nil)),app(app(sK14,cons(sK12,nil)),sK15))
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ ssList(app(sK13,cons(sK11,nil)))
| ~ spl50_12 ),
inference(superposition,[],[f477,f268]) ).
fof(f565,plain,
( sK8 = app(app(sK13,cons(sK11,nil)),app(app(sK14,cons(sK12,nil)),sK15))
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ ssList(app(sK13,cons(sK11,nil)))
| ~ spl50_12 ),
inference(forward_subsumption_resolution,[],[f559,f241]) ).
fof(f576,plain,
( sK8 = app(app(sK13,cons(sK11,nil)),app(app(sK14,cons(sK12,nil)),sK15))
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl50_11
| ~ spl50_12 ),
inference(forward_subsumption_resolution,[],[f565,f472]) ).
fof(f579,definition,
( spl50_22
<=> ssList(app(sK14,cons(sK12,nil))) ),
introduced(definition,[new_symbols(definition,[spl50_22])],[avatar_definition]) ).
fof(f580,plain,
( ssList(app(sK14,cons(sK12,nil)))
| ~ spl50_22 ),
inference(avatar_component_clause,[],[f579]) ).
fof(f581,plain,
( ~ ssList(app(sK14,cons(sK12,nil)))
| spl50_22 ),
inference(avatar_component_clause,[],[f579]) ).
fof(f583,definition,
( spl50_23
<=> sK8 = app(app(sK13,cons(sK11,nil)),app(app(sK14,cons(sK12,nil)),sK15)) ),
introduced(definition,[new_symbols(definition,[spl50_23])],[avatar_definition]) ).
fof(f585,plain,
( sK8 = app(app(sK13,cons(sK11,nil)),app(app(sK14,cons(sK12,nil)),sK15))
| ~ spl50_23 ),
inference(avatar_component_clause,[],[f583]) ).
fof(f587,plain,
( ~ spl50_22
| spl50_23
| ~ spl50_11
| ~ spl50_12 ),
inference(avatar_split_clause,[],[f576,f475,f471,f583,f579]) ).
fof(f614,plain,
( ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl50_22 ),
inference(resolution,[],[f581,f274]) ).
fof(f615,plain,
( ~ ssList(sK14)
| ~ spl50_9
| spl50_22 ),
inference(forward_subsumption_resolution,[],[f614,f462]) ).
fof(f616,plain,
( $false
| ~ spl50_9
| spl50_22 ),
inference(forward_subsumption_resolution,[],[f615,f240]) ).
fof(f617,plain,
( ~ spl50_9
| spl50_22 ),
inference(avatar_contradiction_clause,[],[f616]) ).
fof(f635,definition,
( spl50_25
<=> ssList(app(app(sK14,cons(sK12,nil)),sK15)) ),
introduced(definition,[new_symbols(definition,[spl50_25])],[avatar_definition]) ).
fof(f636,plain,
( ssList(app(app(sK14,cons(sK12,nil)),sK15))
| ~ spl50_25 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f637,plain,
( ~ ssList(app(app(sK14,cons(sK12,nil)),sK15))
| spl50_25 ),
inference(avatar_component_clause,[],[f635]) ).
fof(f682,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,sK15))
| ~ ssItem(sK12)
| ~ ssList(sK15)
| ~ spl50_10 ),
inference(superposition,[],[f467,f269]) ).
fof(f693,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,sK15))
| ~ ssList(sK15)
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f682,f238]) ).
fof(f695,plain,
( sK8 = app(app(app(sK13,cons(sK11,nil)),sK14),cons(sK12,sK15))
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f693,f241]) ).
fof(f770,plain,
( ~ ssList(app(sK14,app(cons(sK12,nil),sK15)))
| ~ ssList(sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl50_25 ),
inference(superposition,[],[f637,f268]) ).
fof(f771,plain,
( ~ ssList(sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl50_25 ),
inference(forward_subsumption_resolution,[],[f770,f511]) ).
fof(f773,plain,
( ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl50_25 ),
inference(forward_subsumption_resolution,[],[f771,f241]) ).
fof(f776,plain,
( ~ ssList(sK14)
| ~ spl50_9
| spl50_25 ),
inference(forward_subsumption_resolution,[],[f773,f462]) ).
fof(f777,plain,
( $false
| ~ spl50_9
| spl50_25 ),
inference(forward_subsumption_resolution,[],[f776,f240]) ).
fof(f778,plain,
( ~ spl50_9
| spl50_25 ),
inference(avatar_contradiction_clause,[],[f777]) ).
fof(f798,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),app(cons(sK12,nil),sK15))
| ~ ssItem(sK11)
| ~ ssList(sK14)
| ~ spl50_10
| ~ spl50_15 ),
inference(superposition,[],[f557,f269]) ).
fof(f807,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),app(cons(sK12,nil),sK15))
| ~ ssList(sK14)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f798,f237]) ).
fof(f818,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),app(cons(sK12,nil),sK15))
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f807,f240]) ).
fof(f821,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),cons(sK12,sK15))
| ~ ssItem(sK12)
| ~ ssList(sK15)
| ~ spl50_10
| ~ spl50_15 ),
inference(superposition,[],[f818,f269]) ).
fof(f829,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),cons(sK12,sK15))
| ~ ssList(sK15)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f821,f238]) ).
fof(f840,plain,
( sK8 = app(app(sK13,cons(sK11,sK14)),cons(sK12,sK15))
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f829,f241]) ).
fof(f852,plain,
( ~ totalorderedP(sK8)
| ~ ssList(sK15)
| ~ ssList(sK14)
| ~ ssList(sK13)
| ~ ssItem(sK12)
| ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(superposition,[],[f401,f840]) ).
fof(f858,plain,
( ~ ssList(sK15)
| ~ ssList(sK14)
| ~ ssList(sK13)
| ~ ssItem(sK12)
| ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f852,f249]) ).
fof(f859,plain,
( ~ ssList(sK14)
| ~ ssList(sK13)
| ~ ssItem(sK12)
| ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f858,f241]) ).
fof(f860,plain,
( ~ ssList(sK13)
| ~ ssItem(sK12)
| ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f859,f240]) ).
fof(f861,plain,
( ~ ssItem(sK12)
| ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f860,f239]) ).
fof(f862,plain,
( ~ ssItem(sK11)
| leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f861,f238]) ).
fof(f863,plain,
( leq(sK11,sK12)
| ~ ssList(sK8)
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f862,f237]) ).
fof(f864,plain,
( ~ ssList(sK8)
| spl50_3
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f863,f423]) ).
fof(f865,plain,
( $false
| spl50_3
| ~ spl50_10
| ~ spl50_15 ),
inference(forward_subsumption_resolution,[],[f864,f393]) ).
fof(f866,plain,
( spl50_3
| ~ spl50_10
| ~ spl50_15 ),
inference(avatar_contradiction_clause,[],[f865]) ).
fof(f1192,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK22(X0,X1))
| ~ ssList(sK21(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f401,f283]) ).
fof(f1198,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK22(X0,X1))
| ~ ssList(sK21(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1192]) ).
fof(f1205,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK21(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1198,f284]) ).
fof(f1207,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1205,f285]) ).
fof(f1210,plain,
( ! [X0] :
( ~ totalorderedP(sK8)
| ~ ssList(sK15)
| ~ ssItem(sK12)
| ~ ssItem(X0)
| leq(X0,sK12)
| ~ ssList(sK8)
| ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) )
| ~ spl50_10 ),
inference(superposition,[],[f1207,f695]) ).
fof(f1211,plain,
! [X2,X3,X0,X1,X4] :
( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X4)
| leq(X4,X2)
| ~ ssList(app(X0,app(X1,cons(X2,X3))))
| ~ memberP(app(X0,X1),X4)
| ~ ssList(app(X0,X1))
| ~ ssList(cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f1207,f268]) ).
fof(f1219,plain,
! [X2,X3,X0,X1,X4] :
( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X4)
| leq(X4,X2)
| ~ ssList(app(X0,app(X1,cons(X2,X3))))
| ~ memberP(app(X0,X1),X4)
| ~ ssList(cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1211,f274]) ).
fof(f1220,plain,
( ! [X0] :
( ~ ssList(sK15)
| ~ ssItem(sK12)
| ~ ssItem(X0)
| leq(X0,sK12)
| ~ ssList(sK8)
| ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) )
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1210,f249]) ).
fof(f1223,plain,
! [X2,X3,X0,X1,X4] :
( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X4)
| leq(X4,X2)
| ~ memberP(app(X0,X1),X4)
| ~ ssList(cons(X2,X3))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1219,f511]) ).
fof(f1224,plain,
( ! [X0] :
( ~ ssItem(sK12)
| ~ ssItem(X0)
| leq(X0,sK12)
| ~ ssList(sK8)
| ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) )
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1220,f241]) ).
fof(f1225,plain,
! [X2,X3,X0,X1,X4] :
( ~ totalorderedP(app(X0,app(X1,cons(X2,X3))))
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X4)
| leq(X4,X2)
| ~ memberP(app(X0,X1),X4)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1223,f263]) ).
fof(f1226,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(X0,sK12)
| ~ ssList(sK8)
| ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) )
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1224,f238]) ).
fof(f1227,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(X0,sK12)
| ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| ~ ssList(app(app(sK13,cons(sK11,nil)),sK14)) )
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1226,f393]) ).
fof(f1228,plain,
( ! [X0] :
( ~ memberP(app(app(sK13,cons(sK11,nil)),sK14),X0)
| leq(X0,sK12)
| ~ ssItem(X0) )
| ~ spl50_8
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1227,f458]) ).
fof(f1234,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssList(sK22(X0,X2))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK21(X0,X2)),X3)
| ~ ssList(sK21(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssItem(X2)
| ~ ssList(X0) ),
inference(superposition,[],[f1225,f283]) ).
fof(f1241,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssList(sK22(X0,X2))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK21(X0,X2)),X3)
| ~ ssList(sK21(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1234]) ).
fof(f1247,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK21(X0,X2)),X3)
| ~ ssList(sK21(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1241,f284]) ).
fof(f1255,plain,
! [X2,X3,X0,X1] :
( ~ memberP(app(X1,sK21(X0,X2)),X3)
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ totalorderedP(app(X1,X0))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1247,f285]) ).
fof(f1266,plain,
( ! [X0] :
( leq(X0,sK12)
| ~ ssItem(X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK14)
| ~ ssList(app(sK13,cons(sK11,nil)))
| ~ ssItem(X0) )
| ~ spl50_8
| ~ spl50_10 ),
inference(resolution,[],[f1228,f281]) ).
fof(f1270,plain,
( ! [X0] :
( leq(X0,sK12)
| ~ ssItem(X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK14)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_8
| ~ spl50_10 ),
inference(duplicate_literal_removal,[],[f1266]) ).
fof(f1273,plain,
( ! [X0] :
( leq(X0,sK12)
| ~ ssItem(X0)
| ~ memberP(sK14,X0)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_8
| ~ spl50_10 ),
inference(forward_subsumption_resolution,[],[f1270,f240]) ).
fof(f1276,plain,
( ! [X0] :
( leq(X0,sK12)
| ~ ssItem(X0)
| ~ memberP(sK14,X0) )
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(forward_subsumption_resolution,[],[f1273,f472]) ).
fof(f1278,plain,
( ~ ssItem(sK16)
| ~ memberP(sK14,sK16)
| spl50_5
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(resolution,[],[f1276,f432]) ).
fof(f1279,plain,
( ~ memberP(sK14,sK16)
| ~ spl50_4
| spl50_5
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(forward_subsumption_resolution,[],[f1278,f427]) ).
fof(f1280,plain,
( $false
| ~ spl50_4
| spl50_5
| ~ spl50_7
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(forward_subsumption_resolution,[],[f1279,f441]) ).
fof(f1281,plain,
( ~ spl50_4
| spl50_5
| ~ spl50_7
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(avatar_contradiction_clause,[],[f1280]) ).
fof(f1394,plain,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X1,X0)
| ~ totalorderedP(app(X2,X3))
| ~ ssList(X2)
| ~ memberP(X3,X0)
| ~ ssList(X3)
| ~ memberP(X2,X1)
| ~ ssList(sK21(X3,X0))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(resolution,[],[f1255,f282]) ).
fof(f1398,plain,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| leq(X1,X0)
| ~ totalorderedP(app(X2,X3))
| ~ ssList(X2)
| ~ memberP(X3,X0)
| ~ ssList(X3)
| ~ memberP(X2,X1)
| ~ ssList(sK21(X3,X0)) ),
inference(duplicate_literal_removal,[],[f1394]) ).
fof(f1403,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X2,X3))
| ~ ssItem(X1)
| leq(X1,X0)
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ memberP(X3,X0)
| ~ ssList(X3)
| ~ memberP(X2,X1) ),
inference(forward_subsumption_resolution,[],[f1398,f285]) ).
fof(f1418,plain,
( ! [X0,X1] :
( ~ totalorderedP(sK8)
| ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssList(app(sK13,cons(sK11,nil)))
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X1)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15))
| ~ memberP(app(sK13,cons(sK11,nil)),X0) )
| ~ spl50_23 ),
inference(superposition,[],[f1403,f585]) ).
fof(f1434,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssList(app(sK13,cons(sK11,nil)))
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X1)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15))
| ~ memberP(app(sK13,cons(sK11,nil)),X0) )
| ~ spl50_23 ),
inference(forward_subsumption_resolution,[],[f1418,f249]) ).
fof(f1446,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X1)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15))
| ~ memberP(app(sK13,cons(sK11,nil)),X0) )
| ~ spl50_11
| ~ spl50_23 ),
inference(forward_subsumption_resolution,[],[f1434,f472]) ).
fof(f1461,plain,
( ! [X0,X1] :
( ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X1)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK13,cons(sK11,nil)),X0) )
| ~ spl50_11
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1446,f636]) ).
fof(f1613,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK13,cons(sK11,nil)),X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ ssItem(X1) )
| ~ spl50_11
| ~ spl50_23
| ~ spl50_25 ),
inference(resolution,[],[f1461,f282]) ).
fof(f1615,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK13,cons(sK11,nil)),X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl50_11
| ~ spl50_23
| ~ spl50_25 ),
inference(duplicate_literal_removal,[],[f1613]) ).
fof(f1618,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK13,cons(sK11,nil)),X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl50_11
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1615,f241]) ).
fof(f1620,plain,
( ! [X0,X1] :
( ~ memberP(app(sK14,cons(sK12,nil)),X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK13,cons(sK11,nil)),X0)
| leq(X0,X1) )
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1618,f580]) ).
fof(f1624,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK13,cons(sK11,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK14,X0)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| ~ ssItem(X0) )
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(resolution,[],[f1620,f282]) ).
fof(f1625,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK13,cons(sK11,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK14,X0)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14) )
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(duplicate_literal_removal,[],[f1624]) ).
fof(f1628,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK13,cons(sK11,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK14) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1625,f462]) ).
fof(f1630,plain,
( ! [X0,X1] :
( ~ memberP(app(sK13,cons(sK11,nil)),X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| leq(X1,X0)
| ~ memberP(sK14,X0) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1628,f240]) ).
fof(f1632,plain,
( ! [X0] :
( ~ ssItem(sK11)
| ~ ssItem(X0)
| leq(sK11,X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssItem(sK11)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(resolution,[],[f1630,f397]) ).
fof(f1637,plain,
( ! [X0] :
( ~ ssItem(sK11)
| ~ ssItem(X0)
| leq(sK11,X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(duplicate_literal_removal,[],[f1632]) ).
fof(f1640,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK11,X0)
| ~ memberP(sK14,X0)
| ~ ssList(sK13)
| ~ ssList(nil)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1637,f237]) ).
fof(f1643,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK11,X0)
| ~ memberP(sK14,X0)
| ~ ssList(nil)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1640,f239]) ).
fof(f1644,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK11,X0)
| ~ memberP(sK14,X0)
| ~ ssList(app(sK13,cons(sK11,nil))) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1643,f275]) ).
fof(f1645,plain,
( ! [X0] :
( leq(sK11,X0)
| ~ ssItem(X0)
| ~ memberP(sK14,X0) )
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1644,f472]) ).
fof(f1646,plain,
( ~ ssItem(sK16)
| ~ memberP(sK14,sK16)
| spl50_6
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(resolution,[],[f1645,f436]) ).
fof(f1647,plain,
( ~ memberP(sK14,sK16)
| ~ spl50_4
| spl50_6
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1646,f427]) ).
fof(f1648,plain,
( $false
| ~ spl50_4
| spl50_6
| ~ spl50_7
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(forward_subsumption_resolution,[],[f1647,f441]) ).
fof(f1649,plain,
( ~ spl50_4
| spl50_6
| ~ spl50_7
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(avatar_contradiction_clause,[],[f1648]) ).
cnf(s2,plain,
( ~ spl50_3
| spl50_4 ),
inference(sat_conversion,[],[f428]) ).
cnf(s3,plain,
( ~ spl50_3
| ~ spl50_5
| ~ spl50_6 ),
inference(sat_conversion,[],[f437]) ).
cnf(s4,plain,
( ~ spl50_3
| spl50_7 ),
inference(sat_conversion,[],[f442]) ).
cnf(s6,plain,
( ~ spl50_9
| ~ spl50_11
| spl50_12 ),
inference(sat_conversion,[],[f478]) ).
cnf(s7,plain,
( ~ spl50_8
| ~ spl50_9
| spl50_10 ),
inference(sat_conversion,[],[f479]) ).
cnf(s10,plain,
spl50_9,
inference(sat_conversion,[],[f517]) ).
cnf(s11,plain,
spl50_15,
inference(sat_conversion,[],[f519]) ).
cnf(s12,plain,
( spl50_8
| ~ spl50_15 ),
inference(sat_conversion,[],[f526]) ).
cnf(s13,plain,
( spl50_11
| ~ spl50_15 ),
inference(sat_conversion,[],[f530]) ).
cnf(s19,plain,
( ~ spl50_11
| ~ spl50_12
| ~ spl50_22
| spl50_23 ),
inference(sat_conversion,[],[f587]) ).
cnf(s23,plain,
( ~ spl50_9
| spl50_22 ),
inference(sat_conversion,[],[f617]) ).
cnf(s43,plain,
( ~ spl50_9
| spl50_25 ),
inference(sat_conversion,[],[f778]) ).
cnf(s50,plain,
( spl50_3
| ~ spl50_10
| ~ spl50_15 ),
inference(sat_conversion,[],[f866]) ).
cnf(s63,plain,
( ~ spl50_4
| spl50_5
| ~ spl50_7
| ~ spl50_8
| ~ spl50_10
| ~ spl50_11 ),
inference(sat_conversion,[],[f1281]) ).
cnf(s65,plain,
( ~ spl50_4
| spl50_6
| ~ spl50_7
| ~ spl50_9
| ~ spl50_11
| ~ spl50_22
| ~ spl50_23
| ~ spl50_25 ),
inference(sat_conversion,[],[f1649]) ).
cnf(s73,plain,
spl50_11,
inference(rat,[],[s13,s11]) ).
cnf(s74,plain,
spl50_8,
inference(rat,[],[s12,s11]) ).
cnf(s77,plain,
spl50_25,
inference(rat,[],[s43,s10]) ).
cnf(s78,plain,
spl50_22,
inference(rat,[],[s23,s10]) ).
cnf(s88,plain,
spl50_10,
inference(rat,[],[s7,s10,s74]) ).
cnf(s89,plain,
spl50_3,
inference(rat,[],[s50,s11,s88]) ).
cnf(s95,plain,
spl50_12,
inference(rat,[],[s6,s73,s10]) ).
cnf(s97,plain,
spl50_23,
inference(rat,[],[s19,s78,s73,s95]) ).
cnf(s102,plain,
spl50_7,
inference(rat,[],[s4,s89]) ).
cnf(s103,plain,
( ~ spl50_5
| ~ spl50_6 ),
inference(rat,[],[s3,s89]) ).
cnf(s104,plain,
spl50_4,
inference(rat,[],[s2,s89]) ).
cnf(s105,plain,
spl50_6,
inference(rat,[],[s65,s77,s97,s78,s73,s10,s102,s104]) ).
cnf(s106,plain,
spl50_5,
inference(rat,[],[s63,s73,s88,s74,s102,s104]) ).
cnf(s107,plain,
$false,
inference(rat,[],[s103,s105,s106]) ).
fof(f1650,plain,
$false,
inference(avatar_sat_refutation,[],[s107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC158+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 08:14:40 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.04/2.45 % (3222103)Detected formulas, will run a generic FOF schedule.
% 11.04/2.45 % (3222111)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2118864387:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 11.04/2.45 % (3222111)Instruction limit reached!
% 11.04/2.45 % (3222111)------------------------------
% 11.04/2.45 % (3222111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.45 % (3222111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.45 % (3222111)CaDiCaL version: 2.1.3
% 11.04/2.45 % (3222111)Termination reason: Instruction limit
% 11.04/2.45 % (3222111)Termination phase: Saturation
% 11.04/2.45 % (3222111)Time elapsed: 0.039 s
% 11.04/2.45 % (3222111)Peak memory usage: 90 MB
% 11.04/2.45 % (3222111)Instructions burned: 112 (million)
% 11.04/2.45 % (3222109)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1179883362:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 11.04/2.45 % (3222114)dis-21_1_sil=8000:lcm=predicate:random_seed=2222345515:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 11.04/2.45 % (3222108)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1907785576:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 11.04/2.45 % (3222112)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=715147380:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 11.04/2.45 % (3222110)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2269762882:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 11.04/2.45 % (3222113)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=910496731:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 11.04/2.45 % (3222114)Instruction limit reached!
% 11.04/2.45 % (3222114)------------------------------
% 11.04/2.45 % (3222114)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.45 % (3222114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.45 % (3222114)CaDiCaL version: 2.1.3
% 11.04/2.45 % (3222114)Termination reason: Instruction limit
% 11.04/2.45 % (3222114)Termination phase: Saturation
% 11.04/2.45 % (3222114)Time elapsed: 0.068 s
% 11.04/2.45 % (3222114)Peak memory usage: 91 MB
% 11.04/2.45 % (3222114)Instructions burned: 130 (million)
% 11.04/2.45 % (3222112)Instruction limit reached!
% 11.04/2.45 % (3222112)------------------------------
% 11.04/2.45 % (3222112)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.45 % (3222112)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.45 % (3222112)CaDiCaL version: 2.1.3
% 11.04/2.45 % (3222112)Termination reason: Instruction limit
% 11.04/2.45 % (3222112)Termination phase: Saturation
% 11.04/2.45 % (3222112)Time elapsed: 0.070 s
% 11.04/2.45 % (3222112)Peak memory usage: 88 MB
% 11.04/2.45 % (3222112)Instructions burned: 120 (million)
% 11.04/2.45 % (3222113)Instruction limit reached!
% 11.04/2.45 % (3222113)------------------------------
% 11.04/2.45 % (3222113)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.45 % (3222113)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 11.04/2.45 % (3222113)CaDiCaL version: 2.1.3
% 11.04/2.45 % (3222113)Termination reason: Instruction limit
% 11.04/2.45 % (3222113)Termination phase: Saturation
% 11.04/2.45 % (3222113)Time elapsed: 0.089 s
% 11.04/2.45 % (3222113)Peak memory usage: 90 MB
% 11.04/2.45 % (3222113)Instructions burned: 140 (million)
% 11.04/2.45 % (3222116)lrs+10_1_sil=8000:sp=occurrence:random_seed=4059160663:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 11.04/2.45 % (3222124)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4276427778:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 11.04/2.45 % (3222123)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2654906982:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 11.04/2.45 % (3222116)Instruction limit reached!
% 11.04/2.45 % (3222116)------------------------------
% 11.04/2.45 % (3222116)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 11.04/2.45 % (3222116)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222116)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222116)Termination reason: Instruction limit
% 13.40/2.86 % (3222116)Termination phase: Saturation
% 13.40/2.86 % (3222116)Time elapsed: 0.090 s
% 13.40/2.86 % (3222116)Peak memory usage: 93 MB
% 13.40/2.86 % (3222116)Instructions burned: 288 (million)
% 13.40/2.86 % (3222125)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=30263068:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 13.40/2.86 % (3222123)Instruction limit reached!
% 13.40/2.86 % (3222123)------------------------------
% 13.40/2.86 % (3222123)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222123)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222123)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222123)Termination reason: Instruction limit
% 13.40/2.86 % (3222123)Termination phase: Saturation
% 13.40/2.86 % (3222123)Time elapsed: 0.085 s
% 13.40/2.86 % (3222123)Peak memory usage: 95 MB
% 13.40/2.86 % (3222123)Instructions burned: 158 (million)
% 13.40/2.86 % (3222129)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3929989033:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 13.40/2.86 % (3222125)Instruction limit reached!
% 13.40/2.86 % (3222125)------------------------------
% 13.40/2.86 % (3222125)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222125)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222125)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222125)Termination reason: Instruction limit
% 13.40/2.86 % (3222125)Termination phase: Saturation
% 13.40/2.86 % (3222125)Time elapsed: 0.122 s
% 13.40/2.86 % (3222125)Peak memory usage: 95 MB
% 13.40/2.86 % (3222125)Instructions burned: 249 (million)
% 13.40/2.86 % (3222124)Instruction limit reached!
% 13.40/2.86 % (3222124)------------------------------
% 13.40/2.86 % (3222124)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222124)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222124)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222124)Termination reason: Instruction limit
% 13.40/2.86 % (3222124)Termination phase: Saturation
% 13.40/2.86 % (3222124)Time elapsed: 0.199 s
% 13.40/2.86 % (3222124)Peak memory usage: 92 MB
% 13.40/2.86 % (3222124)Instructions burned: 326 (million)
% 13.40/2.86 % (3222129)Instruction limit reached!
% 13.40/2.86 % (3222129)------------------------------
% 13.40/2.86 % (3222129)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222129)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222129)Termination reason: Instruction limit
% 13.40/2.86 % (3222129)Termination phase: Saturation
% 13.40/2.86 % (3222129)Time elapsed: 0.095 s
% 13.40/2.86 % (3222129)Peak memory usage: 90 MB
% 13.40/2.86 % (3222129)Instructions burned: 295 (million)
% 13.40/2.86 % (3222131)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2395328682:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 13.40/2.86 % (3222133)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=4085111234:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 13.40/2.86 % (3222135)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=4200209414:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 13.40/2.86 % (3222134)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=1079521724:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 13.40/2.86 % (3222133)Instruction limit reached!
% 13.40/2.86 % (3222133)------------------------------
% 13.40/2.86 % (3222133)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222133)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222133)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222133)Termination reason: Instruction limit
% 13.40/2.86 % (3222133)Termination phase: Saturation
% 13.40/2.86 % (3222133)Time elapsed: 0.072 s
% 13.40/2.86 % (3222133)Peak memory usage: 90 MB
% 13.40/2.86 % (3222133)Instructions burned: 114 (million)
% 13.40/2.86 % (3222135)Instruction limit reached!
% 13.40/2.86 % (3222135)------------------------------
% 13.40/2.86 % (3222135)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222135)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222135)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222135)Termination reason: Instruction limit
% 13.40/2.86 % (3222135)Termination phase: Saturation
% 13.40/2.86 % (3222135)Time elapsed: 0.036 s
% 13.40/2.86 % (3222135)Peak memory usage: 89 MB
% 13.40/2.86 % (3222135)Instructions burned: 116 (million)
% 13.40/2.86 % (3222134)Instruction limit reached!
% 13.40/2.86 % (3222134)------------------------------
% 13.40/2.86 % (3222134)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222134)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222134)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222134)Termination reason: Instruction limit
% 13.40/2.86 % (3222134)Termination phase: Saturation
% 13.40/2.86 % (3222134)Time elapsed: 0.064 s
% 13.40/2.86 % (3222134)Peak memory usage: 90 MB
% 13.40/2.86 % (3222134)Instructions burned: 128 (million)
% 13.40/2.86 % (3222142)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=3393354542:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 13.40/2.86 % (3222141)lrs+10_1_sil=8000:sp=occurrence:random_seed=3205122336:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 13.40/2.86 % (3222143)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=2512396346:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 13.40/2.86 % (3222142)Instruction limit reached!
% 13.40/2.86 % (3222142)------------------------------
% 13.40/2.86 % (3222142)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222142)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222142)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222142)Termination reason: Instruction limit
% 13.40/2.86 % (3222142)Termination phase: Saturation
% 13.40/2.86 % (3222142)Time elapsed: 0.139 s
% 13.40/2.86 % (3222142)Peak memory usage: 93 MB
% 13.40/2.86 % (3222142)Instructions burned: 439 (million)
% 13.40/2.86 % (3222147)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=607296444:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2989 on theBenchmark for (2989ds/134Mi)
% 13.40/2.86 % (3222147)Instruction limit reached!
% 13.40/2.86 % (3222147)------------------------------
% 13.40/2.86 % (3222147)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222147)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222147)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222147)Termination reason: Instruction limit
% 13.40/2.86 % (3222147)Termination phase: Saturation
% 13.40/2.86 % (3222147)Time elapsed: 0.034 s
% 13.40/2.86 % (3222147)Peak memory usage: 91 MB
% 13.40/2.86 % (3222147)Instructions burned: 138 (million)
% 13.40/2.86 % (3222149)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=2924279584:st=8:i=592:sd=3:ep=RST:ss=axioms_2988 on theBenchmark for (2988ds/592Mi)
% 13.40/2.86 % (3222141)Instruction limit reached!
% 13.40/2.86 % (3222141)------------------------------
% 13.40/2.86 % (3222141)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.86 % (3222141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.86 % (3222141)CaDiCaL version: 2.1.3
% 13.40/2.86 % (3222141)Termination reason: Instruction limit
% 13.40/2.86 % (3222141)Termination phase: Saturation
% 13.40/2.87 % (3222141)Time elapsed: 0.484 s
% 13.40/2.87 % (3222141)Peak memory usage: 100 MB
% 13.40/2.87 % (3222141)Instructions burned: 908 (million)
% 13.40/2.87 % (3222149)Instruction limit reached!
% 13.40/2.87 % (3222149)------------------------------
% 13.40/2.87 % (3222149)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.87 % (3222149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.87 % (3222149)CaDiCaL version: 2.1.3
% 13.40/2.87 % (3222149)Termination reason: Instruction limit
% 13.40/2.87 % (3222149)Termination phase: Saturation
% 13.40/2.87 % (3222149)Time elapsed: 0.171 s
% 13.40/2.87 % (3222149)Peak memory usage: 95 MB
% 13.40/2.87 % (3222149)Instructions burned: 595 (million)
% 13.40/2.87 % (3222151)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=806690704:st=3:i=13193:sd=3:ss=axioms_2986 on theBenchmark for (2986ds/13193Mi)
% 13.40/2.87 % (3222152)lrs+1666_7_slsqr=4,1:sil=8000:plsq=on:plsqc=1:sos=on:urr=on:plsql=on:rp=on:alpa=false:sac=on:slsq=on:random_seed=1237848375:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2985 on theBenchmark for (2985ds/125Mi)
% 13.40/2.87 % (3222152)Instruction limit reached!
% 13.40/2.87 % (3222152)------------------------------
% 13.40/2.87 % (3222152)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.87 % (3222152)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.87 % (3222152)CaDiCaL version: 2.1.3
% 13.40/2.87 % (3222152)Termination reason: Instruction limit
% 13.40/2.87 % (3222152)Termination phase: Saturation
% 13.40/2.87 % (3222152)Time elapsed: 0.039 s
% 13.40/2.87 % (3222152)Peak memory usage: 91 MB
% 13.40/2.87 % (3222152)Instructions burned: 128 (million)
% 13.40/2.87 % (3222143)First to succeed.
% 13.40/2.87 % (3222143)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3222103"
% 13.40/2.87 % (3222155)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=1178068328:i=134:gtgl=5:slsql=off:gtg=exists_sym_2983 on theBenchmark for (2983ds/134Mi)
% 13.40/2.87 % (3222155)Instruction limit reached!
% 13.40/2.87 % (3222155)------------------------------
% 13.40/2.87 % (3222155)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.87 % (3222155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.87 % (3222155)CaDiCaL version: 2.1.3
% 13.40/2.87 % (3222155)Termination reason: Instruction limit
% 13.40/2.87 % (3222155)Termination phase: Saturation
% 13.40/2.87 % (3222155)Time elapsed: 0.046 s
% 13.40/2.87 % (3222155)Peak memory usage: 92 MB
% 13.40/2.87 % (3222155)Instructions burned: 135 (million)
% 13.40/2.87 % (3222157)lrs+10_1_sil=16000:plsq=on:plsqc=1:plsqr=32,1:sos=on:lcm=reverse:fd=off:newcnf=on:random_seed=4167335030:i=141:sd=1:gsp=on:sup=off:ss=axioms:sgt=8_2981 on theBenchmark for (2981ds/141Mi)
% 13.40/2.87 % (3222157)Instruction limit reached!
% 13.40/2.87 % (3222157)------------------------------
% 13.40/2.87 % (3222157)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 13.40/2.87 % (3222157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 13.40/2.87 % (3222157)CaDiCaL version: 2.1.3
% 13.40/2.87 % (3222157)Termination reason: Instruction limit
% 13.40/2.87 % (3222157)Termination phase: Saturation
% 13.40/2.87 % (3222157)Time elapsed: 0.041 s
% 13.40/2.87 % (3222157)Peak memory usage: 92 MB
% 13.40/2.87 % (3222157)Instructions burned: 143 (million)
% 13.40/2.87 % (3222143)Refutation found. Thanks to Tanya!
% 13.40/2.87 % SZS status Theorem for theBenchmark
% 13.40/2.87 % SZS output start Proof for theBenchmark
% See solution above
% 14.74/3.06 % (3222143)------------------------------
% 14.74/3.06 % (3222143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 14.74/3.06 % (3222143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 14.74/3.06 % (3222143)CaDiCaL version: 2.1.3
% 14.74/3.06 % (3222143)Termination reason: Refutation
% 14.74/3.06 % (3222143)Time elapsed: 0.786 s
% 14.74/3.06 % (3222143)Peak memory usage: 132 MB
% 14.74/3.06 % (3222143)Instructions burned: 1167 (million)
% 14.74/3.06 % (3222143)------------------------------
% 14.74/3.06 % (3222143)------------------------------
% 14.74/3.06 % (3222103)Success in time 2.001 s
% 14.74/3.06 % Vampire exiting
%------------------------------------------------------------------------------