%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC159+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 17.80s 3.70s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 48
% Number of leaves : 23
% Syntax : Number of formulae : 229 ( 31 unt; 14 def)
% Number of atoms : 1208 ( 85 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 1783 ( 804 ~; 809 |; 112 &)
% ( 21 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 7 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 15 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 13 con; 0-2 aty)
% Number of variables : 324 ( 0 sgn 278 !; 46 ?)
% 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)
=> ! [X5] :
( ~ ssList(X5)
| app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& leq(X12,X10) ) ) ) ) ) )
| ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssList(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18) != X0
| ~ leq(X15,X14)
| ( ! [X19] :
( ~ ssItem(X19)
| ~ memberP(X17,X19)
| ( leq(X14,X19)
& leq(X19,X15) ) )
& leq(X14,X15) ) ) ) ) ) )
| ( 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)
=> ! [X5] :
( ~ ssList(X5)
| app(app(X4,X2),X5) != X3
| ~ totalorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& leq(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& leq(X12,X10) ) ) ) ) ) )
| ! [X14] :
( ssItem(X14)
=> ! [X15] :
( ssItem(X15)
=> ! [X16] :
( ssList(X16)
=> ! [X17] :
( ssList(X17)
=> ! [X18] :
( ~ ssList(X18)
| app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18) != X0
| ~ leq(X15,X14)
| ( ! [X19] :
( ~ ssItem(X19)
| ~ memberP(X17,X19)
| ( leq(X14,X19)
& leq(X19,X15) ) )
& leq(X14,X15) ) ) ) ) ) )
| ( nil != X3
& nil = X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( ssList(X5)
& app(app(X4,X2),X5) = X3
& totalorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ leq(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ leq(X12,X10) ) ) ) ) )
& ssList(X4) )
& ? [X14] :
( ? [X15] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( ssList(X18)
& app(app(app(app(X16,cons(X14,nil)),X17),cons(X15,nil)),X18) = X0
& leq(X15,X14)
& ( ? [X19] :
( ssItem(X19)
& memberP(X17,X19)
& ( ~ leq(X14,X19)
| ~ leq(X19,X15) ) )
| ~ leq(X14,X15) ) )
& ssList(X17) )
& ssList(X16) )
& ssItem(X15) )
& ssItem(X14) )
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f108,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(f109,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f119,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(f120,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(f133,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(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(flattening,[],[f133]) ).
fof(f191,plain,
( ssList(sK9)
& sK7 = sK9
& sK6 = sK8
& ssList(sK11)
& sK9 = app(app(sK10,sK8),sK11)
& totalorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8
| ~ leq(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK11
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8
| ~ leq(X12,X10) ) ) ) )
& ssList(sK10)
& ssList(sK16)
& sK6 = app(app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,nil)),sK16)
& leq(sK13,sK12)
& ( ( ssItem(sK17)
& memberP(sK15,sK17)
& ( ~ leq(sK12,sK17)
| ~ leq(sK17,sK13) ) )
| ~ leq(sK12,sK13) )
& ssList(sK15)
& ssList(sK14)
& ssItem(sK13)
& ssItem(sK12)
& ( nil = sK9
| nil != sK8 )
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11,sK12,sK13,sK14,sK15,sK16,sK17]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X4,sK10),skolemize(X5,sK11),skolemize(X14,sK12),skolemize(X15,sK13),skolemize(X16,sK14),skolemize(X17,sK15),skolemize(X18,sK16),skolemize(X19,sK17)],[f98]) ).
fof(f198,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,[],[f119]) ).
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(flattening,[],[f198]) ).
fof(f200,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,[],[f120]) ).
fof(f201,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,[],[f200]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK22(X0,X1))
& ssList(sK23(X0,X1))
& app(sK22(X0,X1),cons(X1,sK23(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22,sK23]),skolemize(X4,sK22(X0,X1)),skolemize(X5,sK23(X0,X1))],[f201]) ).
fof(f208,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,[],[f134]) ).
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) ) )
& ( ! [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,[],[f208]) ).
fof(f210,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK24(X0),sK25(X0))
& app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
& ssList(sK28(X0))
& ssList(sK27(X0))
& ssList(sK26(X0))
& ssItem(sK25(X0))
& ssItem(sK24(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,[sK24,sK25,sK26,sK27,sK28]),skolemize(X1,sK24(X0)),skolemize(X2,sK25(X0)),skolemize(X3,sK26(X0)),skolemize(X4,sK27(X0)),skolemize(X5,sK28(X0))],[f209]) ).
fof(f231,plain,
ssList(sK6),
inference(cnf_transformation,[],[f191]) ).
fof(f235,plain,
ssItem(sK12),
inference(cnf_transformation,[],[f191]) ).
fof(f236,plain,
ssItem(sK13),
inference(cnf_transformation,[],[f191]) ).
fof(f237,plain,
ssList(sK14),
inference(cnf_transformation,[],[f191]) ).
fof(f238,plain,
ssList(sK15),
inference(cnf_transformation,[],[f191]) ).
fof(f239,plain,
( ~ leq(sK12,sK17)
| ~ leq(sK17,sK13)
| ~ leq(sK12,sK13) ),
inference(cnf_transformation,[],[f191]) ).
fof(f240,plain,
( memberP(sK15,sK17)
| ~ leq(sK12,sK13) ),
inference(cnf_transformation,[],[f191]) ).
fof(f241,plain,
( ssItem(sK17)
| ~ leq(sK12,sK13) ),
inference(cnf_transformation,[],[f191]) ).
fof(f243,plain,
sK6 = app(app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,nil)),sK16),
inference(cnf_transformation,[],[f191]) ).
fof(f244,plain,
ssList(sK16),
inference(cnf_transformation,[],[f191]) ).
fof(f248,plain,
totalorderedP(sK8),
inference(cnf_transformation,[],[f191]) ).
fof(f251,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f191]) ).
fof(f264,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f269,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f270,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f275,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f276,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f282,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f283,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f284,plain,
! [X0,X1] :
( app(sK22(X0,X1),cons(X1,sK23(X0,X1))) = X0
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f285,plain,
! [X0,X1] :
( ssList(sK23(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f286,plain,
! [X0,X1] :
( ssList(sK22(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f287,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,[],[f202]) ).
fof(f303,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,[],[f210]) ).
fof(f392,plain,
sK8 = app(app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,nil)),sK16),
inference(definition_unfolding,[],[f243,f251]) ).
fof(f394,plain,
ssList(sK8),
inference(definition_unfolding,[],[f231,f251]) ).
fof(f398,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,[],[f287]) ).
fof(f402,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,[],[f303]) ).
fof(f422,definition,
( spl51_3
<=> leq(sK12,sK13) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f424,plain,
( ~ leq(sK12,sK13)
| spl51_3 ),
inference(avatar_component_clause,[],[f422]) ).
fof(f426,definition,
( spl51_4
<=> leq(sK17,sK13) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f428,plain,
( ~ leq(sK17,sK13)
| spl51_4 ),
inference(avatar_component_clause,[],[f426]) ).
fof(f430,definition,
( spl51_5
<=> leq(sK12,sK17) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f432,plain,
( ~ leq(sK12,sK17)
| spl51_5 ),
inference(avatar_component_clause,[],[f430]) ).
fof(f433,plain,
( ~ spl51_3
| ~ spl51_4
| ~ spl51_5 ),
inference(avatar_split_clause,[],[f239,f430,f426,f422]) ).
fof(f435,definition,
( spl51_6
<=> memberP(sK15,sK17) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f437,plain,
( memberP(sK15,sK17)
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f435]) ).
fof(f438,plain,
( ~ spl51_3
| spl51_6 ),
inference(avatar_split_clause,[],[f240,f435,f422]) ).
fof(f440,definition,
( spl51_7
<=> ssItem(sK17) ),
introduced(definition,[new_symbols(definition,[spl51_7])],[avatar_definition]) ).
fof(f442,plain,
( ssItem(sK17)
| ~ spl51_7 ),
inference(avatar_component_clause,[],[f440]) ).
fof(f443,plain,
( ~ spl51_3
| spl51_7 ),
inference(avatar_split_clause,[],[f241,f440,f422]) ).
fof(f473,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),app(sK15,cons(sK13,nil))),sK16)
| ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil))) ),
inference(superposition,[],[f392,f269]) ).
fof(f474,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),app(cons(sK13,nil),sK16))
| ~ ssList(sK16)
| ~ ssList(cons(sK13,nil))
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) ),
inference(superposition,[],[f392,f269]) ).
fof(f479,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),app(cons(sK13,nil),sK16))
| ~ ssList(cons(sK13,nil))
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) ),
inference(forward_subsumption_resolution,[],[f474,f244]) ).
fof(f480,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),app(sK15,cons(sK13,nil))),sK16)
| ~ ssList(cons(sK13,nil))
| ~ ssList(app(sK14,cons(sK12,nil))) ),
inference(forward_subsumption_resolution,[],[f473,f238]) ).
fof(f491,definition,
( spl51_12
<=> ssList(app(app(sK14,cons(sK12,nil)),sK15)) ),
introduced(definition,[new_symbols(definition,[spl51_12])],[avatar_definition]) ).
fof(f492,plain,
( ssList(app(app(sK14,cons(sK12,nil)),sK15))
| ~ spl51_12 ),
inference(avatar_component_clause,[],[f491]) ).
fof(f493,plain,
( ~ ssList(app(app(sK14,cons(sK12,nil)),sK15))
| spl51_12 ),
inference(avatar_component_clause,[],[f491]) ).
fof(f495,definition,
( spl51_13
<=> ssList(cons(sK13,nil)) ),
introduced(definition,[new_symbols(definition,[spl51_13])],[avatar_definition]) ).
fof(f496,plain,
( ssList(cons(sK13,nil))
| ~ spl51_13 ),
inference(avatar_component_clause,[],[f495]) ).
fof(f497,plain,
( ~ ssList(cons(sK13,nil))
| spl51_13 ),
inference(avatar_component_clause,[],[f495]) ).
fof(f499,definition,
( spl51_14
<=> sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),app(cons(sK13,nil),sK16)) ),
introduced(definition,[new_symbols(definition,[spl51_14])],[avatar_definition]) ).
fof(f501,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),app(cons(sK13,nil),sK16))
| ~ spl51_14 ),
inference(avatar_component_clause,[],[f499]) ).
fof(f503,plain,
( ~ spl51_12
| ~ spl51_13
| spl51_14 ),
inference(avatar_split_clause,[],[f479,f499,f495,f491]) ).
fof(f505,definition,
( spl51_15
<=> ssList(app(sK14,cons(sK12,nil))) ),
introduced(definition,[new_symbols(definition,[spl51_15])],[avatar_definition]) ).
fof(f506,plain,
( ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_15 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f507,plain,
( ~ ssList(app(sK14,cons(sK12,nil)))
| spl51_15 ),
inference(avatar_component_clause,[],[f505]) ).
fof(f509,definition,
( spl51_16
<=> sK8 = app(app(app(sK14,cons(sK12,nil)),app(sK15,cons(sK13,nil))),sK16) ),
introduced(definition,[new_symbols(definition,[spl51_16])],[avatar_definition]) ).
fof(f511,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),app(sK15,cons(sK13,nil))),sK16)
| ~ spl51_16 ),
inference(avatar_component_clause,[],[f509]) ).
fof(f512,plain,
( ~ spl51_15
| ~ spl51_13
| spl51_16 ),
inference(avatar_split_clause,[],[f480,f509,f495,f505]) ).
fof(f515,definition,
( spl51_17
<=> ssList(cons(sK12,nil)) ),
introduced(definition,[new_symbols(definition,[spl51_17])],[avatar_definition]) ).
fof(f516,plain,
( ssList(cons(sK12,nil))
| ~ spl51_17 ),
inference(avatar_component_clause,[],[f515]) ).
fof(f517,plain,
( ~ ssList(cons(sK12,nil))
| spl51_17 ),
inference(avatar_component_clause,[],[f515]) ).
fof(f524,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f275,f269]) ).
fof(f526,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f524]) ).
fof(f527,plain,
! [X2,X0,X1] :
( ssList(app(X0,app(X1,X2)))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f526,f275]) ).
fof(f528,plain,
( ~ ssItem(sK12)
| ~ ssList(nil)
| spl51_17 ),
inference(resolution,[],[f264,f517]) ).
fof(f529,plain,
( ~ ssItem(sK13)
| ~ ssList(nil)
| spl51_13 ),
inference(resolution,[],[f264,f497]) ).
fof(f530,plain,
( ~ ssList(nil)
| spl51_13 ),
inference(forward_subsumption_resolution,[],[f529,f236]) ).
fof(f531,plain,
( ~ ssList(nil)
| spl51_17 ),
inference(forward_subsumption_resolution,[],[f528,f235]) ).
fof(f532,plain,
( $false
| spl51_13 ),
inference(forward_subsumption_resolution,[],[f530,f276]) ).
fof(f533,plain,
spl51_13,
inference(avatar_contradiction_clause,[],[f532]) ).
fof(f534,plain,
( $false
| spl51_17 ),
inference(forward_subsumption_resolution,[],[f531,f276]) ).
fof(f535,plain,
spl51_17,
inference(avatar_contradiction_clause,[],[f534]) ).
fof(f537,plain,
( ~ ssList(app(sK14,app(cons(sK12,nil),sK15)))
| ~ ssList(sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl51_12 ),
inference(superposition,[],[f493,f269]) ).
fof(f538,plain,
( ~ ssList(sK15)
| ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl51_12 ),
inference(forward_subsumption_resolution,[],[f537,f527]) ).
fof(f539,plain,
( ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl51_12 ),
inference(forward_subsumption_resolution,[],[f538,f238]) ).
fof(f540,plain,
( ~ ssList(sK14)
| spl51_12
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f539,f516]) ).
fof(f541,plain,
( $false
| spl51_12
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f540,f237]) ).
fof(f542,plain,
( spl51_12
| ~ spl51_17 ),
inference(avatar_contradiction_clause,[],[f541]) ).
fof(f543,plain,
( ~ ssList(cons(sK12,nil))
| ~ ssList(sK14)
| spl51_15 ),
inference(resolution,[],[f507,f275]) ).
fof(f544,plain,
( ~ ssList(sK14)
| spl51_15
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f543,f516]) ).
fof(f545,plain,
( $false
| spl51_15
| ~ spl51_17 ),
inference(forward_subsumption_resolution,[],[f544,f237]) ).
fof(f546,plain,
( spl51_15
| ~ spl51_17 ),
inference(avatar_contradiction_clause,[],[f545]) ).
fof(f579,plain,
( sK8 = app(app(sK14,cons(sK12,nil)),app(app(sK15,cons(sK13,nil)),sK16))
| ~ ssList(sK16)
| ~ ssList(app(sK15,cons(sK13,nil)))
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_16 ),
inference(superposition,[],[f511,f269]) ).
fof(f585,plain,
( sK8 = app(app(sK14,cons(sK12,nil)),app(app(sK15,cons(sK13,nil)),sK16))
| ~ ssList(app(sK15,cons(sK13,nil)))
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_16 ),
inference(forward_subsumption_resolution,[],[f579,f244]) ).
fof(f596,plain,
( sK8 = app(app(sK14,cons(sK12,nil)),app(app(sK15,cons(sK13,nil)),sK16))
| ~ ssList(app(sK15,cons(sK13,nil)))
| ~ spl51_15
| ~ spl51_16 ),
inference(forward_subsumption_resolution,[],[f585,f506]) ).
fof(f599,definition,
( spl51_24
<=> ssList(app(sK15,cons(sK13,nil))) ),
introduced(definition,[new_symbols(definition,[spl51_24])],[avatar_definition]) ).
fof(f600,plain,
( ssList(app(sK15,cons(sK13,nil)))
| ~ spl51_24 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f601,plain,
( ~ ssList(app(sK15,cons(sK13,nil)))
| spl51_24 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f603,definition,
( spl51_25
<=> sK8 = app(app(sK14,cons(sK12,nil)),app(app(sK15,cons(sK13,nil)),sK16)) ),
introduced(definition,[new_symbols(definition,[spl51_25])],[avatar_definition]) ).
fof(f605,plain,
( sK8 = app(app(sK14,cons(sK12,nil)),app(app(sK15,cons(sK13,nil)),sK16))
| ~ spl51_25 ),
inference(avatar_component_clause,[],[f603]) ).
fof(f607,plain,
( ~ spl51_24
| spl51_25
| ~ spl51_15
| ~ spl51_16 ),
inference(avatar_split_clause,[],[f596,f509,f505,f603,f599]) ).
fof(f650,plain,
( ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| spl51_24 ),
inference(resolution,[],[f601,f275]) ).
fof(f651,plain,
( ~ ssList(sK15)
| ~ spl51_13
| spl51_24 ),
inference(forward_subsumption_resolution,[],[f650,f496]) ).
fof(f652,plain,
( $false
| ~ spl51_13
| spl51_24 ),
inference(forward_subsumption_resolution,[],[f651,f238]) ).
fof(f653,plain,
( ~ spl51_13
| spl51_24 ),
inference(avatar_contradiction_clause,[],[f652]) ).
fof(f666,definition,
( spl51_27
<=> ssList(app(app(sK15,cons(sK13,nil)),sK16)) ),
introduced(definition,[new_symbols(definition,[spl51_27])],[avatar_definition]) ).
fof(f667,plain,
( ssList(app(app(sK15,cons(sK13,nil)),sK16))
| ~ spl51_27 ),
inference(avatar_component_clause,[],[f666]) ).
fof(f668,plain,
( ~ ssList(app(app(sK15,cons(sK13,nil)),sK16))
| spl51_27 ),
inference(avatar_component_clause,[],[f666]) ).
fof(f689,plain,
( ~ ssList(app(sK15,app(cons(sK13,nil),sK16)))
| ~ ssList(sK16)
| ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| spl51_27 ),
inference(superposition,[],[f668,f269]) ).
fof(f690,plain,
( ~ ssList(sK16)
| ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| spl51_27 ),
inference(forward_subsumption_resolution,[],[f689,f527]) ).
fof(f692,plain,
( ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| spl51_27 ),
inference(forward_subsumption_resolution,[],[f690,f244]) ).
fof(f695,plain,
( ~ ssList(sK15)
| ~ spl51_13
| spl51_27 ),
inference(forward_subsumption_resolution,[],[f692,f496]) ).
fof(f696,plain,
( $false
| ~ spl51_13
| spl51_27 ),
inference(forward_subsumption_resolution,[],[f695,f238]) ).
fof(f697,plain,
( ~ spl51_13
| spl51_27 ),
inference(avatar_contradiction_clause,[],[f696]) ).
fof(f945,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,sK16))
| ~ ssItem(sK13)
| ~ ssList(sK16)
| ~ spl51_14 ),
inference(superposition,[],[f501,f270]) ).
fof(f962,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,sK16))
| ~ ssList(sK16)
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f945,f236]) ).
fof(f967,plain,
( sK8 = app(app(app(sK14,cons(sK12,nil)),sK15),cons(sK13,sK16))
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f962,f244]) ).
fof(f1120,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK23(X0,X1))
| ~ ssList(sK22(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f402,f284]) ).
fof(f1126,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK23(X0,X1))
| ~ ssList(sK22(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1120]) ).
fof(f1132,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X0,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(sK22(X0,X1))
| ~ ssItem(X2)
| ~ ssItem(X1)
| leq(X1,X2)
| ~ ssList(app(X0,cons(X2,X3)))
| ~ memberP(X0,X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1126,f285]) ).
fof(f1133,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,[],[f1132,f286]) ).
fof(f1136,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,[],[f1133,f269]) ).
fof(f1137,plain,
( ! [X0] :
( ~ totalorderedP(sK8)
| ~ ssList(sK16)
| ~ ssItem(sK13)
| ~ ssItem(X0)
| leq(X0,sK13)
| ~ ssList(sK8)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) )
| ~ spl51_14 ),
inference(superposition,[],[f1133,f967]) ).
fof(f1144,plain,
( ! [X0] :
( ~ ssList(sK16)
| ~ ssItem(sK13)
| ~ ssItem(X0)
| leq(X0,sK13)
| ~ ssList(sK8)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) )
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1137,f248]) ).
fof(f1145,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,[],[f1136,f275]) ).
fof(f1149,plain,
( ! [X0] :
( ~ ssItem(sK13)
| ~ ssItem(X0)
| leq(X0,sK13)
| ~ ssList(sK8)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) )
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1144,f244]) ).
fof(f1150,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,[],[f1145,f527]) ).
fof(f1152,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(X0,sK13)
| ~ ssList(sK8)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) )
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1149,f236]) ).
fof(f1153,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,[],[f1150,f264]) ).
fof(f1155,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(X0,sK13)
| ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| ~ ssList(app(app(sK14,cons(sK12,nil)),sK15)) )
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1152,f394]) ).
fof(f1156,plain,
( ! [X0] :
( ~ memberP(app(app(sK14,cons(sK12,nil)),sK15),X0)
| leq(X0,sK13)
| ~ ssItem(X0) )
| ~ spl51_12
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1155,f492]) ).
fof(f1162,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssList(sK23(X0,X2))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK22(X0,X2)),X3)
| ~ ssList(sK22(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssItem(X2)
| ~ ssList(X0) ),
inference(superposition,[],[f1153,f284]) ).
fof(f1169,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssList(sK23(X0,X2))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK22(X0,X2)),X3)
| ~ ssList(sK22(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1162]) ).
fof(f1175,plain,
! [X2,X3,X0,X1] :
( ~ totalorderedP(app(X1,X0))
| ~ ssItem(X2)
| ~ ssItem(X3)
| leq(X3,X2)
| ~ memberP(app(X1,sK22(X0,X2)),X3)
| ~ ssList(sK22(X0,X2))
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1169,f285]) ).
fof(f1184,plain,
! [X2,X3,X0,X1] :
( ~ memberP(app(X1,sK22(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,[],[f1175,f286]) ).
fof(f1196,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ ssItem(X0) )
| ~ spl51_12
| ~ spl51_14 ),
inference(resolution,[],[f1156,f282]) ).
fof(f1197,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ ssItem(X0) )
| ~ spl51_12
| ~ spl51_14 ),
inference(resolution,[],[f1156,f283]) ).
fof(f1199,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_12
| ~ spl51_14 ),
inference(duplicate_literal_removal,[],[f1197]) ).
fof(f1200,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK15)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_12
| ~ spl51_14 ),
inference(duplicate_literal_removal,[],[f1196]) ).
fof(f1202,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_12
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1199,f238]) ).
fof(f1203,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(sK15,X0)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_12
| ~ spl51_14 ),
inference(forward_subsumption_resolution,[],[f1200,f238]) ).
fof(f1205,plain,
( ! [X0] :
( ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ ssItem(X0)
| leq(X0,sK13) )
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1202,f506]) ).
fof(f1206,plain,
( ! [X0] :
( leq(X0,sK13)
| ~ ssItem(X0)
| ~ memberP(sK15,X0) )
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1203,f506]) ).
fof(f1210,plain,
( ~ ssItem(sK12)
| leq(sK12,sK13)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssItem(sK12)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(resolution,[],[f1205,f398]) ).
fof(f1215,plain,
( ~ ssItem(sK12)
| leq(sK12,sK13)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(duplicate_literal_removal,[],[f1210]) ).
fof(f1218,plain,
( leq(sK12,sK13)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1215,f235]) ).
fof(f1221,plain,
( ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil)))
| spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1218,f424]) ).
fof(f1222,plain,
( ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil)))
| spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1221,f237]) ).
fof(f1223,plain,
( ~ ssList(app(sK14,cons(sK12,nil)))
| spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1222,f276]) ).
fof(f1224,plain,
( $false
| spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1223,f506]) ).
fof(f1225,plain,
( spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(avatar_contradiction_clause,[],[f1224]) ).
fof(f1227,plain,
( ~ ssItem(sK17)
| ~ memberP(sK15,sK17)
| spl51_4
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(resolution,[],[f428,f1206]) ).
fof(f1228,plain,
( ~ memberP(sK15,sK17)
| spl51_4
| ~ spl51_7
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1227,f442]) ).
fof(f1230,plain,
( $false
| spl51_4
| ~ spl51_6
| ~ spl51_7
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(forward_subsumption_resolution,[],[f1228,f437]) ).
fof(f1231,plain,
( spl51_4
| ~ spl51_6
| ~ spl51_7
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(avatar_contradiction_clause,[],[f1230]) ).
fof(f1432,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(sK22(X3,X0))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(resolution,[],[f1184,f283]) ).
fof(f1436,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(sK22(X3,X0)) ),
inference(duplicate_literal_removal,[],[f1432]) ).
fof(f1441,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,[],[f1436,f286]) ).
fof(f1457,plain,
( ! [X0,X1] :
( ~ totalorderedP(sK8)
| ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ memberP(app(app(sK15,cons(sK13,nil)),sK16),X1)
| ~ ssList(app(app(sK15,cons(sK13,nil)),sK16))
| ~ memberP(app(sK14,cons(sK12,nil)),X0) )
| ~ spl51_25 ),
inference(superposition,[],[f1441,f605]) ).
fof(f1468,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssList(app(sK14,cons(sK12,nil)))
| ~ memberP(app(app(sK15,cons(sK13,nil)),sK16),X1)
| ~ ssList(app(app(sK15,cons(sK13,nil)),sK16))
| ~ memberP(app(sK14,cons(sK12,nil)),X0) )
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f1457,f248]) ).
fof(f1479,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ memberP(app(app(sK15,cons(sK13,nil)),sK16),X1)
| ~ ssList(app(app(sK15,cons(sK13,nil)),sK16))
| ~ memberP(app(sK14,cons(sK12,nil)),X0) )
| ~ spl51_15
| ~ spl51_25 ),
inference(forward_subsumption_resolution,[],[f1468,f506]) ).
fof(f1488,plain,
( ! [X0,X1] :
( ~ memberP(app(app(sK15,cons(sK13,nil)),sK16),X1)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0) )
| ~ spl51_15
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f1479,f667]) ).
fof(f9245,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ memberP(app(sK15,cons(sK13,nil)),X1)
| ~ ssList(sK16)
| ~ ssList(app(sK15,cons(sK13,nil)))
| ~ ssItem(X1) )
| ~ spl51_15
| ~ spl51_25
| ~ spl51_27 ),
inference(resolution,[],[f1488,f283]) ).
fof(f9247,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ memberP(app(sK15,cons(sK13,nil)),X1)
| ~ ssList(sK16)
| ~ ssList(app(sK15,cons(sK13,nil))) )
| ~ spl51_15
| ~ spl51_25
| ~ spl51_27 ),
inference(duplicate_literal_removal,[],[f9245]) ).
fof(f9250,plain,
( ! [X0,X1] :
( leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| ~ memberP(app(sK15,cons(sK13,nil)),X1)
| ~ ssList(app(sK15,cons(sK13,nil))) )
| ~ spl51_15
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9247,f244]) ).
fof(f9252,plain,
( ! [X0,X1] :
( ~ memberP(app(sK15,cons(sK13,nil)),X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| ~ memberP(app(sK14,cons(sK12,nil)),X0)
| leq(X0,X1) )
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9250,f600]) ).
fof(f9256,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK15,X0)
| ~ ssList(cons(sK13,nil))
| ~ ssList(sK15)
| ~ ssItem(X0) )
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(resolution,[],[f9252,f283]) ).
fof(f9257,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK15,X0)
| ~ ssList(cons(sK13,nil))
| ~ ssList(sK15) )
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(duplicate_literal_removal,[],[f9256]) ).
fof(f9260,plain,
( ! [X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ memberP(app(sK14,cons(sK12,nil)),X1)
| leq(X1,X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK15) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9257,f496]) ).
fof(f9262,plain,
( ! [X0,X1] :
( ~ memberP(app(sK14,cons(sK12,nil)),X1)
| ~ ssItem(X1)
| ~ ssItem(X0)
| leq(X1,X0)
| ~ memberP(sK15,X0) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9260,f238]) ).
fof(f9264,plain,
( ! [X0] :
( ~ ssItem(sK12)
| ~ ssItem(X0)
| leq(sK12,X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssItem(sK12)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(resolution,[],[f9262,f398]) ).
fof(f9269,plain,
( ! [X0] :
( ~ ssItem(sK12)
| ~ ssItem(X0)
| leq(sK12,X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(duplicate_literal_removal,[],[f9264]) ).
fof(f9272,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK12,X0)
| ~ memberP(sK15,X0)
| ~ ssList(sK14)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9269,f235]) ).
fof(f9275,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK12,X0)
| ~ memberP(sK15,X0)
| ~ ssList(nil)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9272,f237]) ).
fof(f9276,plain,
( ! [X0] :
( ~ ssItem(X0)
| leq(sK12,X0)
| ~ memberP(sK15,X0)
| ~ ssList(app(sK14,cons(sK12,nil))) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9275,f276]) ).
fof(f9277,plain,
( ! [X0] :
( leq(sK12,X0)
| ~ ssItem(X0)
| ~ memberP(sK15,X0) )
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9276,f506]) ).
fof(f9278,plain,
( ~ ssItem(sK17)
| ~ memberP(sK15,sK17)
| spl51_5
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(resolution,[],[f9277,f432]) ).
fof(f9279,plain,
( ~ memberP(sK15,sK17)
| spl51_5
| ~ spl51_7
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9278,f442]) ).
fof(f9280,plain,
( $false
| spl51_5
| ~ spl51_6
| ~ spl51_7
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(forward_subsumption_resolution,[],[f9279,f437]) ).
fof(f9281,plain,
( spl51_5
| ~ spl51_6
| ~ spl51_7
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(avatar_contradiction_clause,[],[f9280]) ).
cnf(s2,plain,
( ~ spl51_3
| ~ spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f433]) ).
cnf(s3,plain,
( ~ spl51_3
| spl51_6 ),
inference(sat_conversion,[],[f438]) ).
cnf(s4,plain,
( ~ spl51_3
| spl51_7 ),
inference(sat_conversion,[],[f443]) ).
cnf(s8,plain,
( ~ spl51_12
| ~ spl51_13
| spl51_14 ),
inference(sat_conversion,[],[f503]) ).
cnf(s9,plain,
( ~ spl51_13
| ~ spl51_15
| spl51_16 ),
inference(sat_conversion,[],[f512]) ).
cnf(s11,plain,
spl51_13,
inference(sat_conversion,[],[f533]) ).
cnf(s12,plain,
spl51_17,
inference(sat_conversion,[],[f535]) ).
cnf(s13,plain,
( spl51_12
| ~ spl51_17 ),
inference(sat_conversion,[],[f542]) ).
cnf(s14,plain,
( spl51_15
| ~ spl51_17 ),
inference(sat_conversion,[],[f546]) ).
cnf(s21,plain,
( ~ spl51_15
| ~ spl51_16
| ~ spl51_24
| spl51_25 ),
inference(sat_conversion,[],[f607]) ).
cnf(s26,plain,
( ~ spl51_13
| spl51_24 ),
inference(sat_conversion,[],[f653]) ).
cnf(s32,plain,
( ~ spl51_13
| spl51_27 ),
inference(sat_conversion,[],[f697]) ).
cnf(s55,plain,
( spl51_3
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(sat_conversion,[],[f1225]) ).
cnf(s56,plain,
( spl51_4
| ~ spl51_6
| ~ spl51_7
| ~ spl51_12
| ~ spl51_14
| ~ spl51_15 ),
inference(sat_conversion,[],[f1231]) ).
cnf(s176,plain,
( spl51_5
| ~ spl51_6
| ~ spl51_7
| ~ spl51_13
| ~ spl51_15
| ~ spl51_24
| ~ spl51_25
| ~ spl51_27 ),
inference(sat_conversion,[],[f9281]) ).
cnf(s198,plain,
spl51_15,
inference(rat,[],[s14,s12]) ).
cnf(s199,plain,
spl51_12,
inference(rat,[],[s13,s12]) ).
cnf(s204,plain,
spl51_27,
inference(rat,[],[s32,s11]) ).
cnf(s205,plain,
spl51_24,
inference(rat,[],[s26,s11]) ).
cnf(s218,plain,
spl51_16,
inference(rat,[],[s9,s198,s11]) ).
cnf(s220,plain,
spl51_25,
inference(rat,[],[s21,s205,s198,s218]) ).
cnf(s229,plain,
spl51_14,
inference(rat,[],[s8,s11,s199]) ).
cnf(s233,plain,
spl51_3,
inference(rat,[],[s55,s198,s199,s229]) ).
cnf(s241,plain,
spl51_7,
inference(rat,[],[s4,s233]) ).
cnf(s242,plain,
spl51_6,
inference(rat,[],[s3,s233]) ).
cnf(s243,plain,
spl51_5,
inference(rat,[],[s176,s204,s220,s205,s198,s11,s241,s242]) ).
cnf(s244,plain,
spl51_4,
inference(rat,[],[s56,s198,s229,s199,s241,s242]) ).
cnf(s245,plain,
$false,
inference(rat,[],[s2,s243,s244,s233]) ).
fof(f9282,plain,
$false,
inference(avatar_sat_refutation,[],[s245]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC159+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 08:14:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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
% 12.31/2.67 % (3222561)Detected formulas, will run a generic FOF schedule.
% 12.31/2.67 % (3222570)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2016008941:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 12.31/2.67 % (3222570)Instruction limit reached!
% 12.31/2.67 % (3222570)------------------------------
% 12.31/2.67 % (3222570)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.67 % (3222570)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.67 % (3222570)CaDiCaL version: 2.1.3
% 12.31/2.67 % (3222570)Termination reason: Instruction limit
% 12.31/2.67 % (3222570)Termination phase: Saturation
% 12.31/2.67 % (3222570)Time elapsed: 0.039 s
% 12.31/2.67 % (3222570)Peak memory usage: 88 MB
% 12.31/2.67 % (3222570)Instructions burned: 121 (million)
% 12.31/2.67 % (3222572)dis-21_1_sil=8000:lcm=predicate:random_seed=1648715139: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)
% 12.31/2.67 % (3222567)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=1921184290:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 12.31/2.67 % (3222569)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1186732614:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 12.31/2.67 % (3222566)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=1192303356:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 12.31/2.67 % (3222568)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=2085205640:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 12.31/2.67 % (3222571)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=322287842:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 12.31/2.67 % (3222569)Instruction limit reached!
% 12.31/2.67 % (3222569)------------------------------
% 12.31/2.67 % (3222569)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.67 % (3222569)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.67 % (3222569)CaDiCaL version: 2.1.3
% 12.31/2.67 % (3222569)Termination reason: Instruction limit
% 12.31/2.67 % (3222569)Termination phase: Saturation
% 12.31/2.67 % (3222569)Time elapsed: 0.069 s
% 12.31/2.67 % (3222569)Peak memory usage: 89 MB
% 12.31/2.67 % (3222569)Instructions burned: 109 (million)
% 12.31/2.67 % (3222572)Instruction limit reached!
% 12.31/2.67 % (3222572)------------------------------
% 12.31/2.67 % (3222572)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.67 % (3222572)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.67 % (3222572)CaDiCaL version: 2.1.3
% 12.31/2.67 % (3222572)Termination reason: Instruction limit
% 12.31/2.67 % (3222572)Termination phase: Saturation
% 12.31/2.67 % (3222572)Time elapsed: 0.070 s
% 12.31/2.67 % (3222572)Peak memory usage: 90 MB
% 12.31/2.67 % (3222572)Instructions burned: 130 (million)
% 12.31/2.67 % (3222571)Instruction limit reached!
% 12.31/2.67 % (3222571)------------------------------
% 12.31/2.67 % (3222571)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.67 % (3222571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.67 % (3222571)CaDiCaL version: 2.1.3
% 12.31/2.67 % (3222571)Termination reason: Instruction limit
% 12.31/2.67 % (3222571)Termination phase: Saturation
% 12.31/2.67 % (3222571)Time elapsed: 0.091 s
% 12.31/2.67 % (3222571)Peak memory usage: 90 MB
% 12.31/2.67 % (3222571)Instructions burned: 140 (million)
% 12.31/2.67 % (3222579)lrs+10_1_sil=8000:sp=occurrence:random_seed=1345411367:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 12.31/2.67 % (3222579)Instruction limit reached!
% 12.31/2.67 % (3222579)------------------------------
% 12.31/2.67 % (3222579)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 12.31/2.67 % (3222579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 12.31/2.67 % (3222579)CaDiCaL version: 2.1.3
% 12.31/2.67 % (3222579)Termination reason: Instruction limit
% 12.31/2.67 % (3222579)Termination phase: Saturation
% 12.31/2.67 % (3222579)Time elapsed: 0.089 s
% 12.31/2.67 % (3222579)Peak memory usage: 93 MB
% 12.31/2.67 % (3222579)Instructions burned: 287 (million)
% 18.75/3.58 % (3222582)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1633343865:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 18.75/3.58 % (3222581)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3577452310:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 18.75/3.58 % (3222583)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=1909946575:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 18.75/3.58 % (3222581)Instruction limit reached!
% 18.75/3.58 % (3222581)------------------------------
% 18.75/3.58 % (3222581)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222581)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.75/3.58 % (3222581)CaDiCaL version: 2.1.3
% 18.75/3.58 % (3222581)Termination reason: Instruction limit
% 18.75/3.58 % (3222581)Termination phase: Saturation
% 18.75/3.58 % (3222581)Time elapsed: 0.085 s
% 18.75/3.58 % (3222581)Peak memory usage: 94 MB
% 18.75/3.58 % (3222581)Instructions burned: 158 (million)
% 18.75/3.58 % (3222585)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=123454837:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 18.75/3.58 % (3222583)Instruction limit reached!
% 18.75/3.58 % (3222583)------------------------------
% 18.75/3.58 % (3222583)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222583)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.75/3.58 % (3222583)CaDiCaL version: 2.1.3
% 18.75/3.58 % (3222583)Termination reason: Instruction limit
% 18.75/3.58 % (3222583)Termination phase: Saturation
% 18.75/3.58 % (3222583)Time elapsed: 0.125 s
% 18.75/3.58 % (3222583)Peak memory usage: 97 MB
% 18.75/3.58 % (3222583)Instructions burned: 249 (million)
% 18.75/3.58 % (3222585)Instruction limit reached!
% 18.75/3.58 % (3222585)------------------------------
% 18.75/3.58 % (3222585)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222585)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.75/3.58 % (3222585)CaDiCaL version: 2.1.3
% 18.75/3.58 % (3222585)Termination reason: Instruction limit
% 18.75/3.58 % (3222585)Termination phase: Saturation
% 18.75/3.58 % (3222585)Time elapsed: 0.094 s
% 18.75/3.58 % (3222585)Peak memory usage: 90 MB
% 18.75/3.58 % (3222585)Instructions burned: 294 (million)
% 18.75/3.58 % (3222582)Instruction limit reached!
% 18.75/3.58 % (3222582)------------------------------
% 18.75/3.58 % (3222582)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222582)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.75/3.58 % (3222582)CaDiCaL version: 2.1.3
% 18.75/3.58 % (3222582)Termination reason: Instruction limit
% 18.75/3.58 % (3222582)Termination phase: Saturation
% 18.75/3.58 % (3222582)Time elapsed: 0.207 s
% 18.75/3.58 % (3222582)Peak memory usage: 92 MB
% 18.75/3.58 % (3222582)Instructions burned: 326 (million)
% 18.75/3.58 % (3222589)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=872306351:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 18.75/3.58 % (3222592)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2450935660:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 18.75/3.58 % (3222591)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2377881268:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 18.75/3.58 % (3222592)Instruction limit reached!
% 18.75/3.58 % (3222592)------------------------------
% 18.75/3.58 % (3222592)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222592)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 18.75/3.58 % (3222592)CaDiCaL version: 2.1.3
% 18.75/3.58 % (3222592)Termination reason: Instruction limit
% 18.75/3.58 % (3222592)Termination phase: Saturation
% 18.75/3.58 % (3222592)Time elapsed: 0.035 s
% 18.75/3.58 % (3222592)Peak memory usage: 90 MB
% 18.75/3.58 % (3222592)Instructions burned: 128 (million)
% 18.75/3.58 % (3222593)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=431066260:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 18.75/3.58 % (3222591)Instruction limit reached!
% 18.75/3.58 % (3222591)------------------------------
% 18.75/3.58 % (3222591)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 18.75/3.58 % (3222591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222591)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222591)Termination reason: Instruction limit
% 17.80/3.70 % (3222591)Termination phase: Saturation
% 17.80/3.70 % (3222591)Time elapsed: 0.074 s
% 17.80/3.70 % (3222591)Peak memory usage: 91 MB
% 17.80/3.70 % (3222591)Instructions burned: 114 (million)
% 17.80/3.70 % (3222593)Instruction limit reached!
% 17.80/3.70 % (3222593)------------------------------
% 17.80/3.70 % (3222593)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222593)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222593)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222593)Termination reason: Instruction limit
% 17.80/3.70 % (3222593)Termination phase: Saturation
% 17.80/3.70 % (3222593)Time elapsed: 0.068 s
% 17.80/3.70 % (3222593)Peak memory usage: 89 MB
% 17.80/3.70 % (3222593)Instructions burned: 114 (million)
% 17.80/3.70 % (3222597)lrs+10_1_sil=8000:sp=occurrence:random_seed=1270841171:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2992 on theBenchmark for (2992ds/907Mi)
% 17.80/3.70 % (3222599)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=2525648764:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 17.80/3.70 % (3222600)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=4270546842:i=5202:ss=axioms:sgt=16_2991 on theBenchmark for (2991ds/5202Mi)
% 17.80/3.70 % (3222597)Instruction limit reached!
% 17.80/3.70 % (3222597)------------------------------
% 17.80/3.70 % (3222597)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222597)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222597)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222597)Termination reason: Instruction limit
% 17.80/3.70 % (3222597)Termination phase: Saturation
% 17.80/3.70 % (3222597)Time elapsed: 0.263 s
% 17.80/3.70 % (3222597)Peak memory usage: 99 MB
% 17.80/3.70 % (3222597)Instructions burned: 907 (million)
% 17.80/3.70 % (3222599)Instruction limit reached!
% 17.80/3.70 % (3222599)------------------------------
% 17.80/3.70 % (3222599)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222599)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222599)Termination reason: Instruction limit
% 17.80/3.70 % (3222599)Termination phase: Saturation
% 17.80/3.70 % (3222599)Time elapsed: 0.261 s
% 17.80/3.70 % (3222599)Peak memory usage: 93 MB
% 17.80/3.70 % (3222599)Instructions burned: 437 (million)
% 17.80/3.70 % (3222604)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=4187887644:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2988 on theBenchmark for (2988ds/134Mi)
% 17.80/3.70 % (3222604)Instruction limit reached!
% 17.80/3.70 % (3222604)------------------------------
% 17.80/3.70 % (3222604)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222604)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222604)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222604)Termination reason: Instruction limit
% 17.80/3.70 % (3222604)Termination phase: Saturation
% 17.80/3.70 % (3222604)Time elapsed: 0.034 s
% 17.80/3.70 % (3222604)Peak memory usage: 91 MB
% 17.80/3.70 % (3222604)Instructions burned: 138 (million)
% 17.80/3.70 % (3222605)lrs+1002_8_sil=8000:sp=occurrence:sos=on:sac=on:random_seed=688187989:st=8:i=592:sd=3:ep=RST:ss=axioms_2987 on theBenchmark for (2987ds/592Mi)
% 17.80/3.70 % (3222607)lrs+10_1_ncem=casc2026/models/loop6.pt:sil=32000:npcc=on:random_seed=1302285585:st=3:i=13193:sd=3:ss=axioms_2987 on theBenchmark for (2987ds/13193Mi)
% 17.80/3.70 % (3222605)Instruction limit reached!
% 17.80/3.70 % (3222605)------------------------------
% 17.80/3.70 % (3222605)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222605)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222605)Termination reason: Instruction limit
% 17.80/3.70 % (3222605)Termination phase: Saturation
% 17.80/3.70 % (3222605)Time elapsed: 0.329 s
% 17.80/3.70 % (3222605)Peak memory usage: 96 MB
% 17.80/3.70 % (3222605)Instructions burned: 592 (million)
% 17.80/3.70 % (3222610)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=556665923:i=125:slsql=off:bs=unit_only:gtg=position:fdi=2:gsp=on:ss=axioms:sgt=8_2983 on theBenchmark for (2983ds/125Mi)
% 17.80/3.70 % (3222610)Instruction limit reached!
% 17.80/3.70 % (3222610)------------------------------
% 17.80/3.70 % (3222610)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222610)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222610)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222610)Termination reason: Instruction limit
% 17.80/3.70 % (3222610)Termination phase: Saturation
% 17.80/3.70 % (3222610)Time elapsed: 0.070 s
% 17.80/3.70 % (3222610)Peak memory usage: 91 MB
% 17.80/3.70 % (3222610)Instructions burned: 126 (million)
% 17.80/3.70 % (3222612)lrs+10_1024_to=lpo:sil=8000:tgt=full:sp=arity:slsq=on:random_seed=937944065:i=134:gtgl=5:slsql=off:gtg=exists_sym_2980 on theBenchmark for (2980ds/134Mi)
% 17.80/3.70 % (3222589)Instruction limit reached!
% 17.80/3.70 % (3222589)------------------------------
% 17.80/3.70 % (3222589)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222589)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222589)Termination reason: Instruction limit
% 17.80/3.70 % (3222589)Termination phase: Saturation
% 17.80/3.70 % (3222589)Time elapsed: 1.451 s
% 17.80/3.70 % (3222589)Peak memory usage: 144 MB
% 17.80/3.70 % (3222589)Instructions burned: 2351 (million)
% 17.80/3.70 % (3222612)Instruction limit reached!
% 17.80/3.70 % (3222612)------------------------------
% 17.80/3.70 % (3222612)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222612)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222612)Termination reason: Instruction limit
% 17.80/3.70 % (3222612)Termination phase: Saturation
% 17.80/3.70 % (3222612)Time elapsed: 0.082 s
% 17.80/3.70 % (3222612)Peak memory usage: 92 MB
% 17.80/3.70 % (3222612)Instructions burned: 135 (million)
% 17.80/3.70 % (3222614)lrs+10_1_sil=16000:plsq=on:plsqc=1:plsqr=32,1:sos=on:lcm=reverse:fd=off:newcnf=on:random_seed=2662851036:i=141:sd=1:gsp=on:sup=off:ss=axioms:sgt=8_2978 on theBenchmark for (2978ds/141Mi)
% 17.80/3.70 % (3222615)lrs+1011_1_sil=8000:plsq=on:sp=occurrence:fs=off:random_seed=1239811308:i=431:sd=1:fsr=off:sup=off:ss=axioms:sgt=64_2978 on theBenchmark for (2978ds/431Mi)
% 17.80/3.70 % (3222614)Instruction limit reached!
% 17.80/3.70 % (3222614)------------------------------
% 17.80/3.70 % (3222614)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222614)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222614)Termination reason: Instruction limit
% 17.80/3.70 % (3222614)Termination phase: Saturation
% 17.80/3.70 % (3222614)Time elapsed: 0.074 s
% 17.80/3.70 % (3222614)Peak memory usage: 92 MB
% 17.80/3.70 % (3222614)Instructions burned: 142 (million)
% 17.80/3.70 % (3222618)lrs+1010_1_ncem=casc2026/models/loop6.pt:sil=64000:tgt=full:npcc=on:prc=on:urr=ec_only:bsr=on:fd=preordered:gs=on:sac=on:newcnf=on:random_seed=1995440992:i=6060:aac=none:ins=25_2976 on theBenchmark for (2976ds/6060Mi)
% 17.80/3.70 % (3222615)Instruction limit reached!
% 17.80/3.70 % (3222615)------------------------------
% 17.80/3.70 % (3222615)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222615)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222615)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222615)Termination reason: Instruction limit
% 17.80/3.70 % (3222615)Termination phase: Saturation
% 17.80/3.70 % (3222615)Time elapsed: 0.204 s
% 17.80/3.70 % (3222615)Peak memory usage: 89 MB
% 17.80/3.70 % (3222615)Instructions burned: 432 (million)
% 17.80/3.70 % (3222600)First to succeed.
% 17.80/3.70 % (3222600)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3222561"
% 17.80/3.70 % (3222620)lrs+10_16_anc=all:slsqr=32,1:sil=8000:avsql=on:sp=unary_frequency:lcm=predicate:urr=full:rp=on:br=off:slsqc=4:flr=on:sac=on:slsq=on:avsqc=1:random_seed=3873741810:avsq=on:s2a=on:i=150:kws=precedence:nicw=on:gsp=on:rawr=on_2974 on theBenchmark for (2974ds/150Mi)
% 17.80/3.70 % (3222620)Instruction limit reached!
% 17.80/3.70 % (3222620)------------------------------
% 17.80/3.70 % (3222620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 17.80/3.70 % (3222620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 17.80/3.70 % (3222620)CaDiCaL version: 2.1.3
% 17.80/3.70 % (3222620)Termination reason: Instruction limit
% 17.80/3.70 % (3222620)Termination phase: Saturation
% 17.80/3.70 % (3222620)Time elapsed: 0.083 s
% 17.80/3.70 % (3222620)Peak memory usage: 92 MB
% 17.80/3.70 % (3222620)Instructions burned: 150 (million)
% 17.80/3.70 % (3222600)Refutation found. Thanks to Tanya!
% 17.80/3.70 % SZS status Theorem for theBenchmark
% 17.80/3.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/3.90 % (3222600)------------------------------
% 0.16/3.90 % (3222600)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/3.90 % (3222600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/3.90 % (3222600)CaDiCaL version: 2.1.3
% 0.16/3.90 % (3222600)Termination reason: Refutation
% 0.16/3.90 % (3222600)Time elapsed: 1.599 s
% 0.16/3.90 % (3222600)Peak memory usage: 142 MB
% 0.16/3.90 % (3222600)Instructions burned: 2581 (million)
% 0.16/3.90 % (3222600)------------------------------
% 0.16/3.90 % (3222600)------------------------------
% 0.16/3.90 % (3222561)Success in time 2.866 s
% 0.16/3.90 % Vampire exiting
%------------------------------------------------------------------------------