%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC084+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:22 PM UTC 2026
% Result : Theorem 5.44s 1.74s
% Output : Refutation 6.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 35
% Number of leaves : 19
% Syntax : Number of formulae : 157 ( 17 unt; 8 def)
% Number of atoms : 698 ( 87 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 991 ( 450 ~; 417 |; 79 &)
% ( 16 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 9 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 181 ( 0 sgn 151 !; 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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f53,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( segmentP(X0,X1)
& segmentP(X1,X2) )
=> segmentP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X3,X6)
& leq(X5,X6) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X2
| ~ memberP(X3,X5)
| ? [X6] :
( ssItem(X6)
& X5 != X6
& memberP(X3,X6)
& leq(X5,X6) ) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ! [X6] :
( ~ ssItem(X6)
| X5 = X6
| ~ memberP(X3,X6)
| ~ leq(X5,X6) )
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( ? [X5] :
( cons(X5,nil) = X2
& memberP(X3,X5)
& ! [X6] :
( ~ ssItem(X6)
| X5 = X6
| ~ memberP(X3,X6)
| ~ leq(X5,X6) )
& ssItem(X5) )
| ( nil = X3
& nil = X2 ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f102,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(f103,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f125,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(f126,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f130,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X0,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f53]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( segmentP(X0,X2)
| ~ segmentP(X0,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f133]) ).
fof(f135,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(f205,plain,
( sK7 = sK9
& sK6 = sK8
& neq(sK7,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4) )
& ( ( sK8 = cons(sK10,nil)
& memberP(sK9,sK10)
& ! [X6] :
( ~ ssItem(X6)
| sK10 = X6
| ~ memberP(sK9,X6)
| ~ leq(sK10,X6) )
& ssItem(sK10) )
| ( nil = sK9
& nil = sK8 ) )
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X5,sK10)],[f99]) ).
fof(f212,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f218,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,[],[f125]) ).
fof(f219,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,[],[f218]) ).
fof(f220,plain,
! [X0] :
( ! [X1] :
( ( ( memberP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(X2,cons(X1,X3)) != X0 ) ) )
& ( ( ssList(sK15(X0,X1))
& ssList(sK16(X0,X1))
& app(sK15(X0,X1),cons(X1,sK16(X0,X1))) = X0 )
| ~ memberP(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X4,sK15(X0,X1)),skolemize(X5,sK16(X0,X1))],[f219]) ).
fof(f221,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f126]) ).
fof(f222,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,[],[f135]) ).
fof(f223,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,[],[f222]) ).
fof(f224,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK17(X0,X1))
& ssList(sK18(X0,X1))
& app(app(sK17(X0,X1),X1),sK18(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17,sK18]),skolemize(X4,sK17(X0,X1)),skolemize(X5,sK18(X0,X1))],[f223]) ).
fof(f259,plain,
ssList(sK6),
inference(cnf_transformation,[],[f205]) ).
fof(f260,plain,
ssList(sK7),
inference(cnf_transformation,[],[f205]) ).
fof(f263,plain,
( ssItem(sK10)
| nil = sK8 ),
inference(cnf_transformation,[],[f205]) ).
fof(f264,plain,
( ssItem(sK10)
| nil = sK9 ),
inference(cnf_transformation,[],[f205]) ).
fof(f267,plain,
( memberP(sK9,sK10)
| nil = sK8 ),
inference(cnf_transformation,[],[f205]) ).
fof(f269,plain,
( sK8 = cons(sK10,nil)
| nil = sK8 ),
inference(cnf_transformation,[],[f205]) ).
fof(f270,plain,
( sK8 = cons(sK10,nil)
| nil = sK9 ),
inference(cnf_transformation,[],[f205]) ).
fof(f271,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK7,X4)
| ~ segmentP(sK6,X4) ),
inference(cnf_transformation,[],[f205]) ).
fof(f272,plain,
neq(sK7,nil),
inference(cnf_transformation,[],[f205]) ).
fof(f273,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f205]) ).
fof(f274,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f205]) ).
fof(f279,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f280,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f285,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f301,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f212]) ).
fof(f304,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f313,plain,
! [X0,X1] :
( app(sK15(X0,X1),cons(X1,sK16(X0,X1))) = X0
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f220]) ).
fof(f314,plain,
! [X0,X1] :
( ssList(sK16(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f220]) ).
fof(f315,plain,
! [X0,X1] :
( ssList(sK15(X0,X1))
| ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f220]) ).
fof(f318,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f221]) ).
fof(f321,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f323,plain,
! [X2,X0,X1] :
( segmentP(X0,X2)
| ~ segmentP(X0,X1)
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f327,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,[],[f224]) ).
fof(f434,plain,
neq(sK9,nil),
inference(definition_unfolding,[],[f272,f274]) ).
fof(f435,plain,
! [X4] :
( ~ segmentP(sK9,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ segmentP(sK8,X4) ),
inference(definition_unfolding,[],[f271,f274,f273]) ).
fof(f436,plain,
ssList(sK9),
inference(definition_unfolding,[],[f260,f274]) ).
fof(f437,plain,
ssList(sK8),
inference(definition_unfolding,[],[f259,f273]) ).
fof(f445,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f318]) ).
fof(f446,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f327]) ).
fof(f467,definition,
( spl47_1
<=> nil = sK8 ),
introduced(definition,[new_symbols(definition,[spl47_1])],[avatar_definition]) ).
fof(f468,plain,
( nil != sK8
| spl47_1 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f469,plain,
( nil = sK8
| ~ spl47_1 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f471,definition,
( spl47_2
<=> ssItem(sK10) ),
introduced(definition,[new_symbols(definition,[spl47_2])],[avatar_definition]) ).
fof(f473,plain,
( ssItem(sK10)
| ~ spl47_2 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f474,plain,
( spl47_1
| spl47_2 ),
inference(avatar_split_clause,[],[f263,f471,f467]) ).
fof(f476,definition,
( spl47_3
<=> nil = sK9 ),
introduced(definition,[new_symbols(definition,[spl47_3])],[avatar_definition]) ).
fof(f478,plain,
( nil = sK9
| ~ spl47_3 ),
inference(avatar_component_clause,[],[f476]) ).
fof(f479,plain,
( spl47_3
| spl47_2 ),
inference(avatar_split_clause,[],[f264,f471,f476]) ).
fof(f486,definition,
( spl47_5
<=> memberP(sK9,sK10) ),
introduced(definition,[new_symbols(definition,[spl47_5])],[avatar_definition]) ).
fof(f488,plain,
( memberP(sK9,sK10)
| ~ spl47_5 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f489,plain,
( spl47_1
| spl47_5 ),
inference(avatar_split_clause,[],[f267,f486,f467]) ).
fof(f492,definition,
( spl47_6
<=> sK8 = cons(sK10,nil) ),
introduced(definition,[new_symbols(definition,[spl47_6])],[avatar_definition]) ).
fof(f494,plain,
( sK8 = cons(sK10,nil)
| ~ spl47_6 ),
inference(avatar_component_clause,[],[f492]) ).
fof(f495,plain,
( spl47_1
| spl47_6 ),
inference(avatar_split_clause,[],[f269,f492,f467]) ).
fof(f496,plain,
( spl47_3
| spl47_6 ),
inference(avatar_split_clause,[],[f270,f492,f476]) ).
fof(f497,plain,
( nil != cons(sK10,nil)
| spl47_1
| ~ spl47_6 ),
inference(superposition,[],[f468,f494]) ).
fof(f498,plain,
( ssList(cons(sK10,nil))
| ~ spl47_6 ),
inference(superposition,[],[f437,f494]) ).
fof(f499,plain,
( ~ neq(sK9,nil)
| ~ ssList(sK9)
| ~ segmentP(sK8,sK9)
| ~ ssList(sK9) ),
inference(resolution,[],[f435,f321]) ).
fof(f500,plain,
! [X0,X1] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sK8,X0)
| ~ segmentP(sK9,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(sK9) ),
inference(resolution,[],[f435,f323]) ).
fof(f502,plain,
! [X0,X1] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sK8,X0)
| ~ segmentP(sK9,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X1)
| ~ ssList(sK9) ),
inference(duplicate_literal_removal,[],[f500]) ).
fof(f503,plain,
( ~ neq(sK9,nil)
| ~ ssList(sK9)
| ~ segmentP(sK8,sK9) ),
inference(duplicate_literal_removal,[],[f499]) ).
fof(f504,plain,
! [X0,X1] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sK8,X0)
| ~ segmentP(sK9,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f502,f436]) ).
fof(f505,plain,
( ~ ssList(sK9)
| ~ segmentP(sK8,sK9) ),
inference(forward_subsumption_resolution,[],[f503,f434]) ).
fof(f506,plain,
( ! [X0,X1] :
( ~ segmentP(cons(sK10,nil),X0)
| ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sK9,X1)
| ~ segmentP(X1,X0)
| ~ ssList(X1) )
| ~ spl47_6 ),
inference(forward_demodulation,[],[f504,f494]) ).
fof(f507,plain,
~ segmentP(sK8,sK9),
inference(forward_subsumption_resolution,[],[f505,f436]) ).
fof(f530,plain,
( ! [X0] :
( ~ neq(cons(sK10,nil),nil)
| ~ ssList(cons(sK10,nil))
| ~ segmentP(sK9,X0)
| ~ segmentP(X0,cons(sK10,nil))
| ~ ssList(X0)
| ~ ssList(cons(sK10,nil)) )
| ~ spl47_6 ),
inference(resolution,[],[f506,f321]) ).
fof(f534,plain,
( ! [X0] :
( ~ neq(cons(sK10,nil),nil)
| ~ ssList(cons(sK10,nil))
| ~ segmentP(sK9,X0)
| ~ segmentP(X0,cons(sK10,nil))
| ~ ssList(X0) )
| ~ spl47_6 ),
inference(duplicate_literal_removal,[],[f530]) ).
fof(f536,plain,
( ! [X0] :
( ~ neq(cons(sK10,nil),nil)
| ~ segmentP(sK9,X0)
| ~ segmentP(X0,cons(sK10,nil))
| ~ ssList(X0) )
| ~ spl47_6 ),
inference(forward_subsumption_resolution,[],[f534,f498]) ).
fof(f538,definition,
( spl47_7
<=> ! [X0] :
( ~ segmentP(sK9,X0)
| ~ ssList(X0)
| ~ segmentP(X0,cons(sK10,nil)) ) ),
introduced(definition,[new_symbols(definition,[spl47_7])],[avatar_definition]) ).
fof(f539,plain,
( ! [X0] :
( ~ segmentP(X0,cons(sK10,nil))
| ~ ssList(X0)
| ~ segmentP(sK9,X0) )
| ~ spl47_7 ),
inference(avatar_component_clause,[],[f538]) ).
fof(f541,definition,
( spl47_8
<=> neq(cons(sK10,nil),nil) ),
introduced(definition,[new_symbols(definition,[spl47_8])],[avatar_definition]) ).
fof(f543,plain,
( ~ neq(cons(sK10,nil),nil)
| spl47_8 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f544,plain,
( spl47_7
| ~ spl47_8
| ~ spl47_6 ),
inference(avatar_split_clause,[],[f536,f492,f541,f538]) ).
fof(f549,plain,
( nil = cons(sK10,nil)
| ~ ssList(nil)
| ~ ssList(cons(sK10,nil))
| spl47_8 ),
inference(resolution,[],[f543,f301]) ).
fof(f550,plain,
( ~ ssList(nil)
| ~ ssList(cons(sK10,nil))
| spl47_1
| ~ spl47_6
| spl47_8 ),
inference(forward_subsumption_resolution,[],[f549,f497]) ).
fof(f552,plain,
( ~ ssList(cons(sK10,nil))
| spl47_1
| ~ spl47_6
| spl47_8 ),
inference(forward_subsumption_resolution,[],[f550,f304]) ).
fof(f562,plain,
( $false
| spl47_1
| ~ spl47_6
| spl47_8 ),
inference(forward_subsumption_resolution,[],[f552,f498]) ).
fof(f563,plain,
( spl47_1
| ~ spl47_6
| spl47_8 ),
inference(avatar_contradiction_clause,[],[f562]) ).
fof(f935,plain,
( nil = cons(sK10,nil)
| ~ spl47_1
| ~ spl47_6 ),
inference(superposition,[],[f494,f469]) ).
fof(f954,plain,
( nil != nil
| ~ ssItem(sK10)
| ~ ssList(nil)
| ~ spl47_1
| ~ spl47_6 ),
inference(superposition,[],[f285,f935]) ).
fof(f983,plain,
( ~ ssItem(sK10)
| ~ ssList(nil)
| ~ spl47_1
| ~ spl47_6 ),
inference(trivial_inequality_removal,[],[f954]) ).
fof(f1003,plain,
( ~ ssList(nil)
| ~ spl47_1
| ~ spl47_2
| ~ spl47_6 ),
inference(forward_subsumption_resolution,[],[f983,f473]) ).
fof(f1028,plain,
( $false
| ~ spl47_1
| ~ spl47_2
| ~ spl47_6 ),
inference(forward_subsumption_resolution,[],[f1003,f304]) ).
fof(f1029,plain,
( ~ spl47_1
| ~ spl47_2
| ~ spl47_6 ),
inference(avatar_contradiction_clause,[],[f1028]) ).
fof(f1039,plain,
( ~ segmentP(sK8,nil)
| ~ spl47_3 ),
inference(forward_demodulation,[],[f507,f478]) ).
fof(f1042,plain,
( ~ segmentP(nil,nil)
| ~ spl47_1
| ~ spl47_3 ),
inference(forward_demodulation,[],[f1039,f469]) ).
fof(f1044,definition,
( spl47_16
<=> ssList(cons(sK10,nil)) ),
introduced(definition,[new_symbols(definition,[spl47_16])],[avatar_definition]) ).
fof(f1045,plain,
( ssList(cons(sK10,nil))
| ~ spl47_16 ),
inference(avatar_component_clause,[],[f1044]) ).
fof(f1046,plain,
( ~ ssList(cons(sK10,nil))
| spl47_16 ),
inference(avatar_component_clause,[],[f1044]) ).
fof(f1057,plain,
( ~ ssList(nil)
| ~ spl47_1
| ~ spl47_3 ),
inference(resolution,[],[f1042,f445]) ).
fof(f1067,plain,
( $false
| ~ spl47_1
| ~ spl47_3 ),
inference(forward_subsumption_resolution,[],[f1057,f304]) ).
fof(f1068,plain,
( ~ spl47_1
| ~ spl47_3 ),
inference(avatar_contradiction_clause,[],[f1067]) ).
fof(f1070,plain,
( $false
| ~ spl47_6
| spl47_16 ),
inference(forward_subsumption_resolution,[],[f498,f1046]) ).
fof(f1071,plain,
( ~ spl47_6
| spl47_16 ),
inference(avatar_contradiction_clause,[],[f1070]) ).
fof(f1091,plain,
( ! [X0,X1] :
( ~ ssList(app(app(X0,cons(sK10,nil)),X1))
| ~ segmentP(sK9,app(app(X0,cons(sK10,nil)),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK10,nil))
| ~ ssList(app(app(X0,cons(sK10,nil)),X1)) )
| ~ spl47_7 ),
inference(resolution,[],[f539,f446]) ).
fof(f1093,plain,
( ! [X0,X1] :
( ~ ssList(app(app(X0,cons(sK10,nil)),X1))
| ~ segmentP(sK9,app(app(X0,cons(sK10,nil)),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK10,nil)) )
| ~ spl47_7 ),
inference(duplicate_literal_removal,[],[f1091]) ).
fof(f1097,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(app(X0,cons(sK10,nil)),X1))
| ~ ssList(app(app(X0,cons(sK10,nil)),X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f1093,f1045]) ).
fof(f1212,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X1)
| ~ ssList(cons(sK10,nil))
| ~ ssList(X0) )
| ~ spl47_7
| ~ spl47_16 ),
inference(superposition,[],[f1097,f279]) ).
fof(f1219,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(cons(sK10,nil)) )
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f1212]) ).
fof(f1223,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(app(X0,app(cons(sK10,nil),X1)))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f1219,f1045]) ).
fof(f1665,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X1,cons(sK10,X0)))
| ~ ssList(app(X1,cons(sK10,X0)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(sK10)
| ~ ssList(X0) )
| ~ spl47_7
| ~ spl47_16 ),
inference(superposition,[],[f1223,f280]) ).
fof(f1677,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X1,cons(sK10,X0)))
| ~ ssList(app(X1,cons(sK10,X0)))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(sK10) )
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f1665]) ).
fof(f1685,plain,
( ! [X0,X1] :
( ~ segmentP(sK9,app(X1,cons(sK10,X0)))
| ~ ssList(app(X1,cons(sK10,X0)))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f1677,f473]) ).
fof(f2357,plain,
( ! [X0] :
( ~ segmentP(sK9,X0)
| ~ ssList(X0)
| ~ ssList(sK15(X0,sK10))
| ~ ssList(sK16(X0,sK10))
| ~ memberP(X0,sK10)
| ~ ssItem(sK10)
| ~ ssList(X0) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(superposition,[],[f1685,f313]) ).
fof(f2365,plain,
( ! [X0] :
( ~ segmentP(sK9,X0)
| ~ ssList(X0)
| ~ ssList(sK15(X0,sK10))
| ~ ssList(sK16(X0,sK10))
| ~ memberP(X0,sK10)
| ~ ssItem(sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f2357]) ).
fof(f2371,plain,
( ! [X0] :
( ~ ssList(sK16(X0,sK10))
| ~ ssList(X0)
| ~ ssList(sK15(X0,sK10))
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f2365,f473]) ).
fof(f2386,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(sK15(X0,sK10))
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10)
| ~ memberP(X0,sK10)
| ~ ssItem(sK10)
| ~ ssList(X0) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(resolution,[],[f2371,f314]) ).
fof(f2387,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(sK15(X0,sK10))
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10)
| ~ ssItem(sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f2386]) ).
fof(f2388,plain,
( ! [X0] :
( ~ ssList(sK15(X0,sK10))
| ~ ssList(X0)
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f2387,f473]) ).
fof(f2421,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10)
| ~ memberP(X0,sK10)
| ~ ssItem(sK10)
| ~ ssList(X0) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(resolution,[],[f2388,f315]) ).
fof(f2422,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK9,X0)
| ~ memberP(X0,sK10)
| ~ ssItem(sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f2421]) ).
fof(f2423,plain,
( ! [X0] :
( ~ segmentP(sK9,X0)
| ~ ssList(X0)
| ~ memberP(X0,sK10) )
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f2422,f473]) ).
fof(f2464,plain,
( ~ ssList(sK9)
| ~ memberP(sK9,sK10)
| ~ ssList(sK9)
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(resolution,[],[f2423,f321]) ).
fof(f2468,plain,
( ~ ssList(sK9)
| ~ memberP(sK9,sK10)
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(duplicate_literal_removal,[],[f2464]) ).
fof(f2471,plain,
( ~ memberP(sK9,sK10)
| ~ spl47_2
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f2468,f436]) ).
fof(f2473,plain,
( $false
| ~ spl47_2
| ~ spl47_5
| ~ spl47_7
| ~ spl47_16 ),
inference(forward_subsumption_resolution,[],[f2471,f488]) ).
fof(f2474,plain,
( ~ spl47_2
| ~ spl47_5
| ~ spl47_7
| ~ spl47_16 ),
inference(avatar_contradiction_clause,[],[f2473]) ).
cnf(s1,plain,
( spl47_1
| spl47_2 ),
inference(sat_conversion,[],[f474]) ).
cnf(s2,plain,
( spl47_2
| spl47_3 ),
inference(sat_conversion,[],[f479]) ).
cnf(s5,plain,
( spl47_1
| spl47_5 ),
inference(sat_conversion,[],[f489]) ).
cnf(s7,plain,
( spl47_1
| spl47_6 ),
inference(sat_conversion,[],[f495]) ).
cnf(s8,plain,
( spl47_3
| spl47_6 ),
inference(sat_conversion,[],[f496]) ).
cnf(s9,plain,
( ~ spl47_6
| spl47_7
| ~ spl47_8 ),
inference(sat_conversion,[],[f544]) ).
cnf(s11,plain,
( spl47_1
| ~ spl47_6
| spl47_8 ),
inference(sat_conversion,[],[f563]) ).
cnf(s16,plain,
( ~ spl47_1
| ~ spl47_2
| ~ spl47_6 ),
inference(sat_conversion,[],[f1029]) ).
cnf(s20,plain,
( ~ spl47_1
| ~ spl47_3 ),
inference(sat_conversion,[],[f1068]) ).
cnf(s21,plain,
( ~ spl47_6
| spl47_16 ),
inference(sat_conversion,[],[f1071]) ).
cnf(s27,plain,
( ~ spl47_2
| ~ spl47_5
| ~ spl47_7
| ~ spl47_16 ),
inference(sat_conversion,[],[f2474]) ).
cnf(s28,plain,
spl47_1,
inference(rat,[],[s27,s9,s11,s21,s1,s5,s7]) ).
cnf(s29,plain,
~ spl47_3,
inference(rat,[],[s20,s28]) ).
cnf(s30,plain,
spl47_6,
inference(rat,[],[s8,s29]) ).
cnf(s33,plain,
spl47_2,
inference(rat,[],[s2,s29]) ).
cnf(s35,plain,
$false,
inference(rat,[],[s16,s28,s30,s33]) ).
fof(f2475,plain,
$false,
inference(avatar_sat_refutation,[],[s35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC084+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n002.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 28 07:49:58 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.44/1.74 % (196145)Detected formulas, will run a generic FOF schedule.
% 5.44/1.74 % (196152)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=3404733853:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.44/1.74 % (196155)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1284525340:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.44/1.74 % (196154)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=945107763:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.44/1.74 % (196153)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3942401396:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.44/1.74 % (196151)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=3867592042:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.44/1.74 % (196150)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=2633941410:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.44/1.74 % (196156)dis-21_1_sil=8000:lcm=predicate:random_seed=2147218757: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)
% 5.44/1.74 % (196153)Refutation not found, incomplete strategy
% 5.44/1.74 % (196153)------------------------------
% 5.44/1.74 % (196153)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196153)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196153)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196153)Termination reason: Refutation not found, incomplete strategy
% 5.44/1.74 % (196153)Time elapsed: 0.004 s
% 5.44/1.74 % (196153)Peak memory usage: 88 MB
% 5.44/1.74 % (196153)Instructions burned: 4 (million)
% 5.44/1.74 % (196154)Instruction limit reached!
% 5.44/1.74 % (196154)------------------------------
% 5.44/1.74 % (196154)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196154)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196154)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196154)Termination reason: Instruction limit
% 5.44/1.74 % (196154)Termination phase: Saturation
% 5.44/1.74 % (196154)Time elapsed: 0.070 s
% 5.44/1.74 % (196154)Peak memory usage: 88 MB
% 5.44/1.74 % (196154)Instructions burned: 121 (million)
% 5.44/1.74 % (196156)Instruction limit reached!
% 5.44/1.74 % (196156)------------------------------
% 5.44/1.74 % (196156)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196156)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196156)Termination reason: Instruction limit
% 5.44/1.74 % (196156)Termination phase: Saturation
% 5.44/1.74 % (196156)Time elapsed: 0.072 s
% 5.44/1.74 % (196156)Peak memory usage: 90 MB
% 5.44/1.74 % (196156)Instructions burned: 130 (million)
% 5.44/1.74 % (196155)Instruction limit reached!
% 5.44/1.74 % (196155)------------------------------
% 5.44/1.74 % (196155)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196155)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196155)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196155)Termination reason: Instruction limit
% 5.44/1.74 % (196155)Termination phase: Saturation
% 5.44/1.74 % (196155)Time elapsed: 0.101 s
% 5.44/1.74 % (196155)Peak memory usage: 90 MB
% 5.44/1.74 % (196155)Instructions burned: 140 (million)
% 5.44/1.74 % (196164)lrs+10_1_sil=8000:sp=occurrence:random_seed=164169827:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.44/1.74 % (196165)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1458624699:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 5.44/1.74 % (196166)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3636621346:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 5.44/1.74 % (196153)------------------------------
% 5.44/1.74 % (196153)------------------------------
% 5.44/1.74 % (196165)Instruction limit reached!
% 5.44/1.74 % (196165)------------------------------
% 5.44/1.74 % (196165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196165)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196165)Termination reason: Instruction limit
% 5.44/1.74 % (196165)Termination phase: Saturation
% 5.44/1.74 % (196165)Time elapsed: 0.075 s
% 5.44/1.74 % (196165)Peak memory usage: 91 MB
% 5.44/1.74 % (196165)Instructions burned: 159 (million)
% 5.44/1.74 % (196164)Instruction limit reached!
% 5.44/1.74 % (196164)------------------------------
% 5.44/1.74 % (196164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196164)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196164)Termination reason: Instruction limit
% 5.44/1.74 % (196164)Termination phase: Saturation
% 5.44/1.74 % (196164)Time elapsed: 0.171 s
% 5.44/1.74 % (196164)Peak memory usage: 93 MB
% 5.44/1.74 % (196164)Instructions burned: 285 (million)
% 5.44/1.74 % (196170)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=4168935665:s2a=on:i=248:s2at=1.23:gtg=position_2996 on theBenchmark for (2996ds/248Mi)
% 5.44/1.74 % (196171)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=1299094182:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 5.44/1.74 % (196166)Instruction limit reached!
% 5.44/1.74 % (196166)------------------------------
% 5.44/1.74 % (196166)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196166)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196166)Termination reason: Instruction limit
% 5.44/1.74 % (196166)Termination phase: Saturation
% 5.44/1.74 % (196166)Time elapsed: 0.205 s
% 5.44/1.74 % (196166)Peak memory usage: 92 MB
% 5.44/1.74 % (196166)Instructions burned: 326 (million)
% 5.44/1.74 % (196171)First to succeed.
% 5.44/1.74 % (196171)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-196145"
% 5.44/1.74 % (196172)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=907280219:i=2350_2994 on theBenchmark for (2994ds/2350Mi)
% 5.44/1.74 % (196170)Instruction limit reached!
% 5.44/1.74 % (196170)------------------------------
% 5.44/1.74 % (196170)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196170)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196170)Termination reason: Instruction limit
% 5.44/1.74 % (196170)Termination phase: Saturation
% 5.44/1.74 % (196170)Time elapsed: 0.122 s
% 5.44/1.74 % (196170)Peak memory usage: 93 MB
% 5.44/1.74 % (196170)Instructions burned: 248 (million)
% 5.44/1.74 % (196175)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=4052634085:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 5.44/1.74 % (196177)lrs-1004_1_sil=8000:sp=occurrence:sos=all:erd=off:fs=off:bce=on:random_seed=2277198022:i=127:av=off:fsr=off:sup=off_2993 on theBenchmark for (2993ds/127Mi)
% 5.44/1.74 % (196151)Also succeeded, but the first one will report.
% 5.44/1.74 % (196175)Instruction limit reached!
% 5.44/1.74 % (196175)------------------------------
% 5.44/1.74 % (196175)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196175)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196175)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196175)Termination reason: Instruction limit
% 5.44/1.74 % (196175)Termination phase: Saturation
% 5.44/1.74 % (196175)Time elapsed: 0.078 s
% 5.44/1.74 % (196175)Peak memory usage: 90 MB
% 5.44/1.74 % (196175)Instructions burned: 114 (million)
% 5.44/1.74 % (196150)Also succeeded, but the first one will report.
% 5.44/1.74 % (196177)Instruction limit reached!
% 5.44/1.74 % (196177)------------------------------
% 5.44/1.74 % (196177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.44/1.74 % (196177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.44/1.74 % (196177)CaDiCaL version: 2.1.3
% 5.44/1.74 % (196177)Termination reason: Instruction limit
% 5.44/1.74 % (196177)Termination phase: Saturation
% 5.44/1.74 % (196177)Time elapsed: 0.064 s
% 5.44/1.74 % (196177)Peak memory usage: 90 MB
% 5.44/1.74 % (196177)Instructions burned: 128 (million)
% 5.44/1.74 % (196171)Refutation found. Thanks to Tanya!
% 5.44/1.74 % SZS status Theorem for theBenchmark
% 5.44/1.74 % SZS output start Proof for theBenchmark
% See solution above
% 6.75/1.84 % (196171)------------------------------
% 6.75/1.84 % (196171)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.75/1.84 % (196171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.75/1.84 % (196171)CaDiCaL version: 2.1.3
% 6.75/1.84 % (196171)Termination reason: Refutation
% 6.75/1.84 % (196171)Time elapsed: 0.092 s
% 6.75/1.84 % (196171)Peak memory usage: 90 MB
% 6.75/1.84 % (196171)Instructions burned: 161 (million)
% 6.75/1.84 % (196171)------------------------------
% 6.75/1.84 % (196171)------------------------------
% 6.75/1.84 % (196145)Success in time 0.889 s
% 6.75/1.84 % Vampire exiting
%------------------------------------------------------------------------------