%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC055+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 : n002.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:13 PM UTC 2026
% Result : Theorem 6.58s 1.82s
% Output : Refutation 8.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 23
% Syntax : Number of formulae : 186 ( 20 unt; 10 def)
% Number of atoms : 726 ( 108 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 966 ( 426 ~; 411 |; 82 &)
% ( 16 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 11 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 182 ( 0 sgn 152 !; 30 ?)
% 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(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax56) ).
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(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ! [X4] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ) ),
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] :
( ssItem(X4)
=> ( cons(X4,nil) != X2
| ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X3,X5)
& leq(X4,X5) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X1,X6)
| ~ segmentP(X0,X6) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ? [X4] :
( cons(X4,nil) = X2
& memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X3,X5)
| ~ leq(X4,X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X1,X6)
| ~ segmentP(X0,X6) ) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f109,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f112,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(f115,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f115]) ).
fof(f117,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f128,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f131,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f136,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f138,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f139,plain,
( sK1 = sK3
& sK0 = sK2
& ( ( sK2 = cons(sK4,nil)
& memberP(sK3,sK4)
& ! [X5] :
( ~ ssItem(X5)
| sK4 = X5
| ~ memberP(sK3,X5)
| ~ leq(sK4,X5) )
& ssItem(sK4) )
| ( nil = sK3
& nil = sK2 ) )
& ( ( nil = sK1
& nil != sK0 )
| ( neq(sK1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK1,X6)
| ~ segmentP(sK0,X6) ) ) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f99]) ).
fof(f142,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f148,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,[],[f112]) ).
fof(f149,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,[],[f148]) ).
fof(f150,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK9(X0,X1))
& ssList(sK10(X0,X1))
& app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f149]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f153,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f152]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK11(X0,X1))
& ssList(sK12(X0,X1))
& app(app(sK11(X0,X1),X1),sK12(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12]),skolemize(X4,sK11(X0,X1)),skolemize(X5,sK12(X0,X1))],[f153]) ).
fof(f157,plain,
ssList(sK0),
inference(cnf_transformation,[],[f139]) ).
fof(f158,plain,
ssList(sK1),
inference(cnf_transformation,[],[f139]) ).
fof(f161,plain,
! [X6] :
( nil != sK0
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK1,X6)
| ~ segmentP(sK0,X6) ),
inference(cnf_transformation,[],[f139]) ).
fof(f162,plain,
( nil != sK0
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f139]) ).
fof(f163,plain,
! [X6] :
( nil = sK1
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK1,X6)
| ~ segmentP(sK0,X6) ),
inference(cnf_transformation,[],[f139]) ).
fof(f165,plain,
( ssItem(sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f139]) ).
fof(f166,plain,
( ssItem(sK4)
| nil = sK3 ),
inference(cnf_transformation,[],[f139]) ).
fof(f169,plain,
( memberP(sK3,sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f139]) ).
fof(f171,plain,
( sK2 = cons(sK4,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f139]) ).
fof(f172,plain,
( sK2 = cons(sK4,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f139]) ).
fof(f173,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f139]) ).
fof(f174,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f139]) ).
fof(f178,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f187,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f190,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f191,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f198,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| app(sK9(X0,X1),cons(X1,sK10(X0,X1))) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f199,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| ssList(sK10(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f200,plain,
! [X0,X1] :
( ~ ssItem(X1)
| ~ memberP(X0,X1)
| ssList(sK9(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f205,plain,
! [X2,X3,X0,X1] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f206,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f212,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f216,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f128]) ).
fof(f221,plain,
! [X0,X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f224,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f136]) ).
fof(f226,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f138]) ).
fof(f228,plain,
! [X6] :
( nil = sK3
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK3,X6)
| ~ segmentP(sK2,X6) ),
inference(definition_unfolding,[],[f163,f174,f174,f173]) ).
fof(f229,plain,
( nil != sK2
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f162,f173,f174]) ).
fof(f230,plain,
! [X6] :
( nil != sK2
| ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(sK3,X6)
| ~ segmentP(sK2,X6) ),
inference(definition_unfolding,[],[f161,f173,f174,f173]) ).
fof(f231,plain,
ssList(sK3),
inference(definition_unfolding,[],[f158,f174]) ).
fof(f232,plain,
ssList(sK2),
inference(definition_unfolding,[],[f157,f173]) ).
fof(f238,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f212]) ).
fof(f246,definition,
( spl13_1
<=> ! [X6] :
( ~ ssList(X6)
| ~ segmentP(sK2,X6)
| ~ segmentP(sK3,X6)
| ~ neq(X6,nil) ) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
fof(f247,plain,
( ! [X6] :
( ~ segmentP(sK3,X6)
| ~ segmentP(sK2,X6)
| ~ ssList(X6)
| ~ neq(X6,nil) )
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f249,definition,
( spl13_2
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
fof(f250,plain,
( nil != sK2
| spl13_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f251,plain,
( spl13_1
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f230,f249,f246]) ).
fof(f253,definition,
( spl13_3
<=> neq(sK3,nil) ),
introduced(definition,[new_symbols(definition,[spl13_3])],[avatar_definition]) ).
fof(f254,plain,
( neq(sK3,nil)
| ~ spl13_3 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f255,plain,
( spl13_3
| ~ spl13_2 ),
inference(avatar_split_clause,[],[f229,f249,f253]) ).
fof(f257,definition,
( spl13_4
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl13_4])],[avatar_definition]) ).
fof(f258,plain,
( nil = sK3
| ~ spl13_4 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f259,plain,
( spl13_1
| spl13_4 ),
inference(avatar_split_clause,[],[f228,f257,f246]) ).
fof(f261,plain,
( nil = sK2
| ~ spl13_2 ),
inference(avatar_component_clause,[],[f249]) ).
fof(f263,definition,
( spl13_5
<=> ssItem(sK4) ),
introduced(definition,[new_symbols(definition,[spl13_5])],[avatar_definition]) ).
fof(f264,plain,
( ssItem(sK4)
| ~ spl13_5 ),
inference(avatar_component_clause,[],[f263]) ).
fof(f265,plain,
( spl13_2
| spl13_5 ),
inference(avatar_split_clause,[],[f165,f263,f249]) ).
fof(f266,plain,
( spl13_4
| spl13_5 ),
inference(avatar_split_clause,[],[f166,f263,f257]) ).
fof(f273,definition,
( spl13_7
<=> memberP(sK3,sK4) ),
introduced(definition,[new_symbols(definition,[spl13_7])],[avatar_definition]) ).
fof(f274,plain,
( memberP(sK3,sK4)
| ~ spl13_7 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f275,plain,
( spl13_2
| spl13_7 ),
inference(avatar_split_clause,[],[f169,f273,f249]) ).
fof(f278,definition,
( spl13_8
<=> sK2 = cons(sK4,nil) ),
introduced(definition,[new_symbols(definition,[spl13_8])],[avatar_definition]) ).
fof(f279,plain,
( sK2 = cons(sK4,nil)
| ~ spl13_8 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f280,plain,
( spl13_2
| spl13_8 ),
inference(avatar_split_clause,[],[f171,f278,f249]) ).
fof(f281,plain,
( spl13_4
| spl13_8 ),
inference(avatar_split_clause,[],[f172,f278,f257]) ).
fof(f283,plain,
( memberP(nil,sK4)
| ~ spl13_4
| ~ spl13_7 ),
inference(forward_demodulation,[],[f274,f258]) ).
fof(f285,plain,
( nil != sK2
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl13_8 ),
inference(superposition,[],[f178,f279]) ).
fof(f287,plain,
( ~ ssItem(sK4)
| ~ spl13_4
| ~ spl13_7 ),
inference(resolution,[],[f191,f283]) ).
fof(f289,plain,
( $false
| ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(forward_subsumption_resolution,[],[f287,f264]) ).
fof(f290,plain,
( ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f292,plain,
sK3 = app(sK3,nil),
inference(resolution,[],[f216,f231]) ).
fof(f299,plain,
sK2 = app(nil,sK2),
inference(resolution,[],[f224,f232]) ).
fof(f300,plain,
sK3 = app(nil,sK3),
inference(resolution,[],[f224,f231]) ).
fof(f301,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ ssList(sK3)
| ~ neq(sK3,nil)
| ~ spl13_1 ),
inference(resolution,[],[f206,f247]) ).
fof(f302,plain,
( ~ ssList(sK3)
| ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil)
| ~ spl13_1 ),
inference(duplicate_literal_removal,[],[f301]) ).
fof(f303,plain,
( ~ segmentP(sK2,sK3)
| ~ neq(sK3,nil)
| ~ spl13_1 ),
inference(forward_subsumption_resolution,[],[f302,f231]) ).
fof(f304,plain,
( ~ segmentP(sK2,sK3)
| ~ spl13_1
| ~ spl13_3 ),
inference(forward_subsumption_resolution,[],[f303,f254]) ).
fof(f307,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK2,X0),sK2) ),
inference(superposition,[],[f238,f299]) ).
fof(f309,plain,
! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK2)
| segmentP(app(sK2,X0),sK2) ),
inference(forward_subsumption_resolution,[],[f307,f190]) ).
fof(f310,plain,
! [X0] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[],[f309,f232]) ).
fof(f311,plain,
( ! [X0] :
( cons(sK4,X0) = app(cons(sK4,nil),X0)
| ~ ssList(X0) )
| ~ spl13_5 ),
inference(resolution,[],[f221,f264]) ).
fof(f312,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(sK4,X0) = app(sK2,X0) )
| ~ spl13_5
| ~ spl13_8 ),
inference(forward_demodulation,[],[f311,f279]) ).
fof(f320,plain,
! [X0] :
( ssList(app(sK2,X0))
| ~ ssList(X0) ),
inference(resolution,[],[f226,f232]) ).
fof(f321,plain,
! [X0] :
( ssList(app(sK3,X0))
| ~ ssList(X0) ),
inference(resolution,[],[f226,f231]) ).
fof(f322,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK3)
| segmentP(app(sK3,X0),sK3) ),
inference(superposition,[],[f238,f300]) ).
fof(f323,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| ~ ssList(sK3)
| segmentP(app(sK3,X0),sK3) ),
inference(forward_subsumption_resolution,[],[f322,f190]) ).
fof(f324,plain,
! [X0] :
( ~ ssList(app(sK3,X0))
| ~ ssList(X0)
| segmentP(app(sK3,X0),sK3) ),
inference(forward_subsumption_resolution,[],[f323,f231]) ).
fof(f325,plain,
! [X0] :
( segmentP(app(sK3,X0),sK3)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f324,f321]) ).
fof(f326,plain,
( segmentP(sK3,sK3)
| ~ ssList(nil) ),
inference(superposition,[],[f325,f292]) ).
fof(f327,plain,
segmentP(sK3,sK3),
inference(forward_subsumption_resolution,[],[f326,f190]) ).
fof(f329,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| app(sK9(X0,sK4),cons(sK4,sK10(X0,sK4))) = X0
| ~ ssList(X0) )
| ~ spl13_5 ),
inference(resolution,[],[f198,f264]) ).
fof(f330,plain,
( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
| ~ ssList(sK3)
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f329,f274]) ).
fof(f331,plain,
( sK3 = app(sK9(sK3,sK4),cons(sK4,sK10(sK3,sK4)))
| ~ spl13_5
| ~ spl13_7 ),
inference(forward_subsumption_resolution,[],[f330,f231]) ).
fof(f350,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| ssList(sK10(X0,sK4))
| ~ ssList(X0) )
| ~ spl13_5 ),
inference(resolution,[],[f199,f264]) ).
fof(f352,plain,
( ssList(sK10(sK3,sK4))
| ~ ssList(sK3)
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f350,f274]) ).
fof(f353,plain,
( ssList(sK10(sK3,sK4))
| ~ spl13_5
| ~ spl13_7 ),
inference(forward_subsumption_resolution,[],[f352,f231]) ).
fof(f355,plain,
( cons(sK4,sK10(sK3,sK4)) = app(sK2,sK10(sK3,sK4))
| ~ spl13_5
| ~ spl13_7
| ~ spl13_8 ),
inference(resolution,[],[f353,f312]) ).
fof(f376,plain,
( ! [X0] :
( ~ memberP(X0,sK4)
| ssList(sK9(X0,sK4))
| ~ ssList(X0) )
| ~ spl13_5 ),
inference(resolution,[],[f200,f264]) ).
fof(f379,plain,
( ssList(sK9(sK3,sK4))
| ~ ssList(sK3)
| ~ spl13_5
| ~ spl13_7 ),
inference(resolution,[],[f376,f274]) ).
fof(f384,plain,
( ssList(sK9(sK3,sK4))
| ~ spl13_5
| ~ spl13_7 ),
inference(forward_subsumption_resolution,[],[f379,f231]) ).
fof(f400,definition,
( spl13_13
<=> ssList(app(sK2,sK10(sK3,sK4))) ),
introduced(definition,[new_symbols(definition,[spl13_13])],[avatar_definition]) ).
fof(f401,plain,
( ~ ssList(app(sK2,sK10(sK3,sK4)))
| spl13_13 ),
inference(avatar_component_clause,[],[f400]) ).
fof(f535,plain,
( ! [X0,X1] :
( segmentP(app(sK3,X0),X1)
| ~ segmentP(cons(sK4,sK10(sK3,sK4)),X1)
| ~ ssList(X0)
| ~ ssList(sK9(sK3,sK4))
| ~ ssList(X1)
| ~ ssList(cons(sK4,sK10(sK3,sK4))) )
| ~ spl13_5
| ~ spl13_7 ),
inference(superposition,[],[f205,f331]) ).
fof(f538,plain,
( ! [X0,X1] :
( segmentP(app(sK3,X0),X1)
| ~ segmentP(cons(sK4,sK10(sK3,sK4)),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK4,sK10(sK3,sK4))) )
| ~ spl13_5
| ~ spl13_7 ),
inference(forward_subsumption_resolution,[],[f535,f384]) ).
fof(f544,plain,
( ! [X0,X1] :
( ~ segmentP(app(sK2,sK10(sK3,sK4)),X1)
| segmentP(app(sK3,X0),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK4,sK10(sK3,sK4))) )
| ~ spl13_5
| ~ spl13_7
| ~ spl13_8 ),
inference(forward_demodulation,[],[f538,f355]) ).
fof(f550,plain,
( ! [X0,X1] :
( ~ ssList(app(sK2,sK10(sK3,sK4)))
| ~ segmentP(app(sK2,sK10(sK3,sK4)),X1)
| segmentP(app(sK3,X0),X1)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl13_5
| ~ spl13_7
| ~ spl13_8 ),
inference(forward_demodulation,[],[f544,f355]) ).
fof(f556,definition,
( spl13_26
<=> ! [X0,X1] :
( ~ segmentP(app(sK2,sK10(sK3,sK4)),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(sK3,X0),X1) ) ),
introduced(definition,[new_symbols(definition,[spl13_26])],[avatar_definition]) ).
fof(f557,plain,
( ! [X0,X1] :
( ~ segmentP(app(sK2,sK10(sK3,sK4)),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(sK3,X0),X1) )
| ~ spl13_26 ),
inference(avatar_component_clause,[],[f556]) ).
fof(f558,plain,
( spl13_26
| ~ spl13_13
| ~ spl13_5
| ~ spl13_7
| ~ spl13_8 ),
inference(avatar_split_clause,[],[f550,f278,f273,f263,f400,f556]) ).
fof(f561,plain,
( ~ ssList(sK10(sK3,sK4))
| spl13_13 ),
inference(resolution,[],[f401,f320]) ).
fof(f564,plain,
( $false
| ~ spl13_5
| ~ spl13_7
| spl13_13 ),
inference(forward_subsumption_resolution,[],[f561,f353]) ).
fof(f565,plain,
( ~ spl13_5
| ~ spl13_7
| spl13_13 ),
inference(avatar_contradiction_clause,[],[f564]) ).
fof(f566,plain,
( ! [X0] :
( ~ ssList(sK2)
| ~ ssList(X0)
| segmentP(app(sK3,X0),sK2)
| ~ ssList(sK10(sK3,sK4))
| ~ ssList(app(sK2,sK10(sK3,sK4))) )
| ~ spl13_26 ),
inference(resolution,[],[f557,f310]) ).
fof(f571,plain,
( ! [X0] :
( ~ ssList(X0)
| segmentP(app(sK3,X0),sK2)
| ~ ssList(sK10(sK3,sK4))
| ~ ssList(app(sK2,sK10(sK3,sK4))) )
| ~ spl13_26 ),
inference(forward_subsumption_resolution,[],[f566,f232]) ).
fof(f576,plain,
( ! [X0] :
( ~ ssList(X0)
| segmentP(app(sK3,X0),sK2)
| ~ ssList(app(sK2,sK10(sK3,sK4))) )
| ~ spl13_5
| ~ spl13_7
| ~ spl13_26 ),
inference(forward_subsumption_resolution,[],[f571,f353]) ).
fof(f578,definition,
( spl13_28
<=> ! [X0] :
( ~ ssList(X0)
| segmentP(app(sK3,X0),sK2) ) ),
introduced(definition,[new_symbols(definition,[spl13_28])],[avatar_definition]) ).
fof(f579,plain,
( ! [X0] :
( segmentP(app(sK3,X0),sK2)
| ~ ssList(X0) )
| ~ spl13_28 ),
inference(avatar_component_clause,[],[f578]) ).
fof(f580,plain,
( ~ spl13_13
| spl13_28
| ~ spl13_5
| ~ spl13_7
| ~ spl13_26 ),
inference(avatar_split_clause,[],[f576,f556,f273,f263,f578,f400]) ).
fof(f581,plain,
( segmentP(sK3,sK2)
| ~ ssList(nil)
| ~ spl13_28 ),
inference(superposition,[],[f579,f292]) ).
fof(f582,plain,
( segmentP(sK3,sK2)
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f581,f190]) ).
fof(f583,plain,
( ~ segmentP(sK2,sK2)
| ~ ssList(sK2)
| ~ neq(sK2,nil)
| ~ spl13_1
| ~ spl13_28 ),
inference(resolution,[],[f582,f247]) ).
fof(f584,plain,
( ~ ssList(sK2)
| ~ neq(sK2,nil)
| ~ spl13_1
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f583,f206]) ).
fof(f585,plain,
( ~ neq(sK2,nil)
| ~ spl13_1
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f584,f232]) ).
fof(f587,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl13_1
| ~ spl13_28 ),
inference(resolution,[],[f585,f187]) ).
fof(f589,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl13_1
| spl13_2
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f587,f250]) ).
fof(f590,plain,
( ~ ssList(sK2)
| ~ spl13_1
| spl13_2
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f589,f190]) ).
fof(f591,plain,
( $false
| ~ spl13_1
| spl13_2
| ~ spl13_28 ),
inference(forward_subsumption_resolution,[],[f590,f232]) ).
fof(f592,plain,
( ~ spl13_1
| spl13_2
| ~ spl13_28 ),
inference(avatar_contradiction_clause,[],[f591]) ).
fof(f593,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl13_2
| ~ spl13_8 ),
inference(forward_subsumption_resolution,[],[f285,f261]) ).
fof(f594,plain,
( ~ ssList(nil)
| ~ spl13_2
| ~ spl13_5
| ~ spl13_8 ),
inference(forward_subsumption_resolution,[],[f593,f264]) ).
fof(f595,plain,
( $false
| ~ spl13_2
| ~ spl13_5
| ~ spl13_8 ),
inference(forward_subsumption_resolution,[],[f594,f190]) ).
fof(f596,plain,
( ~ spl13_2
| ~ spl13_5
| ~ spl13_8 ),
inference(avatar_contradiction_clause,[],[f595]) ).
fof(f612,plain,
( ~ segmentP(nil,sK3)
| ~ spl13_1
| ~ spl13_2
| ~ spl13_3 ),
inference(superposition,[],[f304,f261]) ).
fof(f622,plain,
( ~ segmentP(nil,nil)
| ~ spl13_1
| ~ spl13_2
| ~ spl13_3
| ~ spl13_4 ),
inference(forward_demodulation,[],[f612,f258]) ).
fof(f636,plain,
( segmentP(nil,nil)
| ~ spl13_4 ),
inference(superposition,[],[f327,f258]) ).
fof(f640,plain,
( $false
| ~ spl13_1
| ~ spl13_2
| ~ spl13_3
| ~ spl13_4 ),
inference(forward_subsumption_resolution,[],[f636,f622]) ).
fof(f641,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_3
| ~ spl13_4 ),
inference(avatar_contradiction_clause,[],[f640]) ).
cnf(s1,plain,
( spl13_1
| ~ spl13_2 ),
inference(sat_conversion,[],[f251]) ).
cnf(s2,plain,
( ~ spl13_2
| spl13_3 ),
inference(sat_conversion,[],[f255]) ).
cnf(s3,plain,
( spl13_1
| spl13_4 ),
inference(sat_conversion,[],[f259]) ).
cnf(s5,plain,
( spl13_2
| spl13_5 ),
inference(sat_conversion,[],[f265]) ).
cnf(s6,plain,
( spl13_4
| spl13_5 ),
inference(sat_conversion,[],[f266]) ).
cnf(s9,plain,
( spl13_2
| spl13_7 ),
inference(sat_conversion,[],[f275]) ).
cnf(s11,plain,
( spl13_2
| spl13_8 ),
inference(sat_conversion,[],[f280]) ).
cnf(s12,plain,
( spl13_4
| spl13_8 ),
inference(sat_conversion,[],[f281]) ).
cnf(s14,plain,
( ~ spl13_4
| ~ spl13_5
| ~ spl13_7 ),
inference(sat_conversion,[],[f290]) ).
cnf(s34,plain,
( ~ spl13_5
| ~ spl13_7
| ~ spl13_8
| ~ spl13_13
| spl13_26 ),
inference(sat_conversion,[],[f558]) ).
cnf(s37,plain,
( ~ spl13_5
| ~ spl13_7
| spl13_13 ),
inference(sat_conversion,[],[f565]) ).
cnf(s39,plain,
( ~ spl13_5
| ~ spl13_7
| ~ spl13_13
| ~ spl13_26
| spl13_28 ),
inference(sat_conversion,[],[f580]) ).
cnf(s41,plain,
( ~ spl13_1
| spl13_2
| ~ spl13_28 ),
inference(sat_conversion,[],[f592]) ).
cnf(s42,plain,
( ~ spl13_2
| ~ spl13_5
| ~ spl13_8 ),
inference(sat_conversion,[],[f596]) ).
cnf(s45,plain,
( ~ spl13_1
| ~ spl13_2
| ~ spl13_3
| ~ spl13_4 ),
inference(sat_conversion,[],[f641]) ).
cnf(s52,plain,
spl13_1,
inference(rat,[],[s14,s5,s9,s1,s3]) ).
cnf(s53,plain,
spl13_2,
inference(rat,[],[s39,s34,s37,s41,s5,s9,s11,s52]) ).
cnf(s54,plain,
spl13_3,
inference(rat,[],[s2,s53]) ).
cnf(s55,plain,
~ spl13_4,
inference(rat,[],[s45,s53,s52,s54]) ).
cnf(s56,plain,
spl13_8,
inference(rat,[],[s12,s55]) ).
cnf(s59,plain,
spl13_5,
inference(rat,[],[s6,s55]) ).
cnf(s60,plain,
$false,
inference(rat,[],[s42,s53,s56,s59]) ).
fof(f645,plain,
$false,
inference(avatar_sat_refutation,[],[s60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC055+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.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 28 07:40:52 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 6.58/1.82 % (188867)Detected formulas, will run a generic FOF schedule.
% 6.58/1.82 % (188878)dis-21_1_sil=8000:lcm=predicate:random_seed=1010044087: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)
% 6.58/1.82 % (188877)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1525082516:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 6.58/1.82 % (188876)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2697676828:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 6.58/1.82 % (188874)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=37437304:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 6.58/1.82 % (188875)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2029282418:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 6.58/1.82 % (188872)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=2733211710:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 6.58/1.82 % (188873)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=247056522:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 6.58/1.82 % (188878)Instruction limit reached!
% 6.58/1.82 % (188878)------------------------------
% 6.58/1.82 % (188878)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188878)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188878)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188878)Termination reason: Instruction limit
% 6.58/1.82 % (188878)Termination phase: Saturation
% 6.58/1.82 % (188878)Time elapsed: 0.041 s
% 6.58/1.82 % (188878)Peak memory usage: 90 MB
% 6.58/1.82 % (188878)Instructions burned: 131 (million)
% 6.58/1.82 % (188875)Refutation not found, incomplete strategy
% 6.58/1.82 % (188875)------------------------------
% 6.58/1.82 % (188875)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188875)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188875)Termination reason: Refutation not found, incomplete strategy
% 6.58/1.82 % (188875)Time elapsed: 0.005 s
% 6.58/1.82 % (188875)Peak memory usage: 88 MB
% 6.58/1.82 % (188875)Instructions burned: 5 (million)
% 6.58/1.82 % (188876)Instruction limit reached!
% 6.58/1.82 % (188876)------------------------------
% 6.58/1.82 % (188876)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188876)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188876)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188876)Termination reason: Instruction limit
% 6.58/1.82 % (188876)Termination phase: Saturation
% 6.58/1.82 % (188876)Time elapsed: 0.081 s
% 6.58/1.82 % (188876)Peak memory usage: 88 MB
% 6.58/1.82 % (188876)Instructions burned: 120 (million)
% 6.58/1.82 % (188887)lrs+10_1_sil=8000:sp=occurrence:random_seed=623641308:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 6.58/1.82 % (188877)Instruction limit reached!
% 6.58/1.82 % (188877)------------------------------
% 6.58/1.82 % (188877)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188877)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188877)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188877)Termination reason: Instruction limit
% 6.58/1.82 % (188877)Termination phase: Saturation
% 6.58/1.82 % (188877)Time elapsed: 0.094 s
% 6.58/1.82 % (188877)Peak memory usage: 90 MB
% 6.58/1.82 % (188877)Instructions burned: 140 (million)
% 6.58/1.82 % (188887)Instruction limit reached!
% 6.58/1.82 % (188887)------------------------------
% 6.58/1.82 % (188887)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188887)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188887)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188887)Termination reason: Instruction limit
% 6.58/1.82 % (188887)Termination phase: Saturation
% 6.58/1.82 % (188887)Time elapsed: 0.094 s
% 6.58/1.82 % (188887)Peak memory usage: 93 MB
% 6.58/1.82 % (188887)Instructions burned: 286 (million)
% 6.58/1.82 % (188888)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2135294782:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 6.58/1.82 % (188890)lrs+1011_1_sil=32000:sp=occurrence:random_seed=4139151752:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 6.58/1.82 % (188875)------------------------------
% 6.58/1.82 % (188875)------------------------------
% 6.58/1.82 % (188905)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=2011155761:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 6.58/1.82 % (188888)Instruction limit reached!
% 6.58/1.82 % (188888)------------------------------
% 6.58/1.82 % (188888)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188888)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188888)Termination reason: Instruction limit
% 6.58/1.82 % (188888)Termination phase: Saturation
% 6.58/1.82 % (188888)Time elapsed: 0.079 s
% 6.58/1.82 % (188888)Peak memory usage: 91 MB
% 6.58/1.82 % (188888)Instructions burned: 159 (million)
% 6.58/1.82 % (188905)Instruction limit reached!
% 6.58/1.82 % (188905)------------------------------
% 6.58/1.82 % (188905)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188905)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188905)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188905)Termination reason: Instruction limit
% 6.58/1.82 % (188905)Termination phase: Saturation
% 6.58/1.82 % (188905)Time elapsed: 0.066 s
% 6.58/1.82 % (188905)Peak memory usage: 93 MB
% 6.58/1.82 % (188905)Instructions burned: 250 (million)
% 6.58/1.82 % (188933)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=44264735:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2996 on theBenchmark for (2996ds/294Mi)
% 6.58/1.82 % (188952)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=1501155431:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 6.58/1.82 % (188975)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=2670399458:cts=off:i=113:fsr=off:ss=included:sgt=4_2995 on theBenchmark for (2995ds/113Mi)
% 6.58/1.82 % (188890)Instruction limit reached!
% 6.58/1.82 % (188890)------------------------------
% 6.58/1.82 % (188890)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188890)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188890)Termination reason: Instruction limit
% 6.58/1.82 % (188890)Termination phase: Saturation
% 6.58/1.82 % (188890)Time elapsed: 0.213 s
% 6.58/1.82 % (188890)Peak memory usage: 92 MB
% 6.58/1.82 % (188890)Instructions burned: 325 (million)
% 6.58/1.82 % (188975)Instruction limit reached!
% 6.58/1.82 % (188975)------------------------------
% 6.58/1.82 % (188975)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188975)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188975)Termination reason: Instruction limit
% 6.58/1.82 % (188975)Termination phase: Saturation
% 6.58/1.82 % (188975)Time elapsed: 0.043 s
% 6.58/1.82 % (188975)Peak memory usage: 90 MB
% 6.58/1.82 % (188975)Instructions burned: 115 (million)
% 6.58/1.82 % (189007)dis-1003_1024_sil=8000:sos=all:sac=on:random_seed=3319863608:cond=fast:i=114:sd=1:nm=0:fsr=off:gtg=exists_sym:ss=axioms_2993 on theBenchmark for (2993ds/114Mi)
% 6.58/1.82 % (189006)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2972753340:i=127:av=off:fsr=off:sup=off_2994 on theBenchmark for (2994ds/127Mi)
% 6.58/1.82 % (188933)Instruction limit reached!
% 6.58/1.82 % (188933)------------------------------
% 6.58/1.82 % (188933)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (188933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (188933)CaDiCaL version: 2.1.3
% 6.58/1.82 % (188933)Termination reason: Instruction limit
% 6.58/1.82 % (188933)Termination phase: Saturation
% 6.58/1.82 % (188933)Time elapsed: 0.178 s
% 6.58/1.82 % (188933)Peak memory usage: 90 MB
% 6.58/1.82 % (188933)Instructions burned: 295 (million)
% 6.58/1.82 % (189007)Instruction limit reached!
% 6.58/1.82 % (189007)------------------------------
% 6.58/1.82 % (189007)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (189007)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (189007)CaDiCaL version: 2.1.3
% 6.58/1.82 % (189007)Termination reason: Instruction limit
% 6.58/1.82 % (189007)Termination phase: Saturation
% 6.58/1.82 % (189007)Time elapsed: 0.039 s
% 6.58/1.82 % (189007)Peak memory usage: 89 MB
% 6.58/1.82 % (189007)Instructions burned: 117 (million)
% 6.58/1.82 % (189006)Instruction limit reached!
% 6.58/1.82 % (189006)------------------------------
% 6.58/1.82 % (189006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (189006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (189006)CaDiCaL version: 2.1.3
% 6.58/1.82 % (189006)Termination reason: Instruction limit
% 6.58/1.82 % (189006)Termination phase: Saturation
% 6.58/1.82 % (189006)Time elapsed: 0.064 s
% 6.58/1.82 % (189006)Peak memory usage: 90 MB
% 6.58/1.82 % (189006)Instructions burned: 127 (million)
% 6.58/1.82 % (189048)dis-1010_1_sil=16000:fde=unused:sp=occurrence:sos=on:random_seed=4281457455:i=437:sd=1:aac=none:ss=included_2992 on theBenchmark for (2992ds/437Mi)
% 6.58/1.82 % (188873)First to succeed.
% 6.58/1.82 % (189024)lrs+10_1_sil=8000:sp=occurrence:random_seed=4066343297:st=1.2:i=907:sd=14:ss=axioms:sgt=12_2993 on theBenchmark for (2993ds/907Mi)
% 6.58/1.82 % (188873)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-188867"
% 6.58/1.82 % (188872)Also succeeded, but the first one will report.
% 6.58/1.82 % (189058)lrs-1002_1_ncem=casc2026/models/all5champsBiggishL14.pt:sil=16000:npcc=on:random_seed=3066659908:i=5202:ss=axioms:sgt=16_2992 on theBenchmark for (2992ds/5202Mi)
% 6.58/1.82 % (189048)Instruction limit reached!
% 6.58/1.82 % (189048)------------------------------
% 6.58/1.82 % (189048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (189048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (189048)CaDiCaL version: 2.1.3
% 6.58/1.82 % (189048)Termination reason: Instruction limit
% 6.58/1.82 % (189048)Termination phase: Saturation
% 6.58/1.82 % (189048)Time elapsed: 0.092 s
% 6.58/1.82 % (189048)Peak memory usage: 89 MB
% 6.58/1.82 % (189048)Instructions burned: 442 (million)
% 6.58/1.82 % (189063)dis+10_3:1_sil=8000:acc=on:urr=on:br=off:sac=on:newcnf=on:random_seed=542284571:i=134:sd=2:doe=on:nm=16:sup=off:ss=included_2990 on theBenchmark for (2990ds/134Mi)
% 6.58/1.82 % (189063)Instruction limit reached!
% 6.58/1.82 % (189063)------------------------------
% 6.58/1.82 % (189063)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.58/1.82 % (189063)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.58/1.82 % (189063)CaDiCaL version: 2.1.3
% 6.58/1.82 % (189063)Termination reason: Instruction limit
% 6.58/1.82 % (189063)Termination phase: Saturation
% 6.58/1.82 % (189063)Time elapsed: 0.035 s
% 6.58/1.82 % (189063)Peak memory usage: 91 MB
% 6.58/1.82 % (189063)Instructions burned: 135 (million)
% 6.58/1.82 % (188873)Refutation found. Thanks to Tanya!
% 6.58/1.82 % SZS status Theorem for theBenchmark
% 6.58/1.82 % SZS output start Proof for theBenchmark
% See solution above
% 8.18/2.02 % (188873)------------------------------
% 8.18/2.02 % (188873)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 8.18/2.02 % (188873)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 8.18/2.02 % (188873)CaDiCaL version: 2.1.3
% 8.18/2.02 % (188873)Termination reason: Refutation
% 8.18/2.02 % (188873)Time elapsed: 0.696 s
% 8.18/2.02 % (188873)Peak memory usage: 130 MB
% 8.18/2.02 % (188873)Instructions burned: 1009 (million)
% 8.18/2.02 % (188873)------------------------------
% 8.18/2.02 % (188873)------------------------------
% 8.18/2.02 % (188867)Success in time 1.091 s
% 8.18/2.02 % Vampire exiting
%------------------------------------------------------------------------------