%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC214+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 : n008.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:58 PM UTC 2026
% Result : Theorem 4.76s 1.48s
% Output : Refutation 6.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 42
% Number of leaves : 16
% Syntax : Number of formulae : 125 ( 18 unt; 2 def)
% Number of atoms : 618 ( 83 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 907 ( 414 ~; 386 |; 69 &)
% ( 8 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 209 ( 0 sgn 181 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
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(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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f40,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( frontsegP(X0,X1)
& frontsegP(X1,X2) )
=> frontsegP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax40) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax42) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
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
| ~ neq(X1,nil)
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| neq(X0,nil) ) ) ) ) ),
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
| ~ neq(X1,nil)
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X2,X4)
& frontsegP(X3,X4)
& segmentP(X4,X2)
& strictorderedP(X4) )
| neq(X0,nil) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4) )
& ~ neq(X0,nil)
& 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)
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X2,X4)
| ~ frontsegP(X3,X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4) )
& ~ neq(X0,nil)
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f111,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f112,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f115,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f116,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f125,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f128,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X0,X1)
| ~ frontsegP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(X0,X2)
| ~ frontsegP(X0,X1)
| ~ frontsegP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f128]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f140,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(f142,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f176,plain,
( sK3 = sK5
& sK2 = sK4
& neq(sK3,nil)
& frontsegP(sK5,sK4)
& strictorderedP(sK4)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(sK4,X4)
| ~ frontsegP(sK5,X4)
| ~ segmentP(X4,sK4)
| ~ strictorderedP(X4) )
& ~ neq(sK2,nil)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f99]) ).
fof(f179,plain,
! [X0] :
( nil = X0
| ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0))],[f112]) ).
fof(f181,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f116]) ).
fof(f186,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f187,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK10(X0,X1))
& app(X1,sK10(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X3,sK10(X0,X1))],[f187]) ).
fof(f190,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,[],[f140]) ).
fof(f191,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,[],[f190]) ).
fof(f192,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))],[f191]) ).
fof(f211,plain,
ssList(sK2),
inference(cnf_transformation,[],[f176]) ).
fof(f212,plain,
ssList(sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f215,plain,
~ neq(sK2,nil),
inference(cnf_transformation,[],[f176]) ).
fof(f216,plain,
! [X4] :
( ~ segmentP(X4,sK4)
| ~ neq(sK4,X4)
| ~ frontsegP(sK5,X4)
| ~ ssList(X4)
| ~ strictorderedP(X4) ),
inference(cnf_transformation,[],[f176]) ).
fof(f219,plain,
neq(sK3,nil),
inference(cnf_transformation,[],[f176]) ).
fof(f220,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f176]) ).
fof(f221,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f176]) ).
fof(f222,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f227,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f233,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
fof(f234,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
fof(f235,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
fof(f238,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f243,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f181]) ).
fof(f246,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f247,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f248,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f256,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f258,plain,
! [X2,X0,X1] :
( frontsegP(X0,X2)
| ~ frontsegP(X0,X1)
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f261,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| ~ ssList(X2)
| app(X1,X2) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
fof(f272,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,[],[f192]) ).
fof(f279,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f326,plain,
neq(sK5,nil),
inference(definition_unfolding,[],[f219,f221]) ).
fof(f327,plain,
~ neq(sK4,nil),
inference(definition_unfolding,[],[f215,f220]) ).
fof(f328,plain,
ssList(sK5),
inference(definition_unfolding,[],[f212,f221]) ).
fof(f329,plain,
ssList(sK4),
inference(definition_unfolding,[],[f211,f220]) ).
fof(f336,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f261]) ).
fof(f338,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,[],[f272]) ).
fof(f365,plain,
( nil = sK4
| ~ ssList(nil)
| ~ ssList(sK4) ),
inference(resolution,[],[f327,f243]) ).
fof(f366,plain,
( nil = sK4
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f365,f246]) ).
fof(f376,definition,
( spl25_5
<=> nil = sK4 ),
introduced(definition,[new_symbols(definition,[spl25_5])],[avatar_definition]) ).
fof(f378,plain,
( nil = sK4
| ~ spl25_5 ),
inference(avatar_component_clause,[],[f376]) ).
fof(f380,plain,
nil = sK4,
inference(forward_subsumption_resolution,[],[f366,f329]) ).
fof(f381,plain,
spl25_5,
inference(avatar_split_clause,[],[f380,f376]) ).
fof(f384,plain,
! [X0,X1] :
( ~ neq(sK4,app(app(X0,sK4),X1))
| ~ frontsegP(sK5,app(app(X0,sK4),X1))
| ~ ssList(app(app(X0,sK4),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(sK4)
| ~ ssList(app(app(X0,sK4),X1)) ),
inference(resolution,[],[f216,f338]) ).
fof(f386,plain,
! [X0,X1] :
( ~ neq(sK4,app(app(X0,sK4),X1))
| ~ frontsegP(sK5,app(app(X0,sK4),X1))
| ~ ssList(app(app(X0,sK4),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(sK4) ),
inference(duplicate_literal_removal,[],[f384]) ).
fof(f390,plain,
! [X0,X1] :
( ~ neq(sK4,app(app(X0,sK4),X1))
| ~ frontsegP(sK5,app(app(X0,sK4),X1))
| ~ ssList(app(app(X0,sK4),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f386,f329]) ).
fof(f393,plain,
( ! [X0,X1] :
( ~ neq(nil,app(app(X0,nil),X1))
| ~ frontsegP(sK5,app(app(X0,sK4),X1))
| ~ ssList(app(app(X0,sK4),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(forward_demodulation,[],[f390,f378]) ).
fof(f396,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(app(app(X0,sK4),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(forward_demodulation,[],[f393,f378]) ).
fof(f399,plain,
( ! [X0,X1] :
( ~ ssList(app(app(X0,nil),X1))
| ~ frontsegP(sK5,app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ strictorderedP(app(app(X0,sK4),X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(forward_demodulation,[],[f396,f378]) ).
fof(f401,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,app(app(X0,nil),X1))
| ~ ssList(app(app(X0,nil),X1))
| ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(forward_demodulation,[],[f399,f378]) ).
fof(f409,plain,
( ~ neq(nil,nil)
| ~ spl25_5 ),
inference(superposition,[],[f327,f378]) ).
fof(f431,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(app(X0,nil),X1))
| ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(sK5,X2)
| ~ frontsegP(X2,app(app(X0,nil),X1))
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(X2)
| ~ ssList(sK5) )
| ~ spl25_5 ),
inference(resolution,[],[f401,f258]) ).
fof(f449,plain,
( ! [X2,X0,X1] :
( ~ ssList(app(app(X0,nil),X1))
| ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(sK5,X2)
| ~ frontsegP(X2,app(app(X0,nil),X1))
| ~ ssList(X2)
| ~ ssList(sK5) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f431]) ).
fof(f450,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(X2,app(app(X0,nil),X1))
| ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(sK5,X2)
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(X2) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f449,f328]) ).
fof(f514,plain,
( ! [X2,X0,X1] :
( ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(sK5,app(app(app(X0,nil),X1),X2))
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(app(app(app(X0,nil),X1),X2))
| ~ ssList(X2)
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(app(app(app(X0,nil),X1),X2)) )
| ~ spl25_5 ),
inference(resolution,[],[f450,f336]) ).
fof(f536,plain,
( ! [X2,X0,X1] :
( ~ strictorderedP(app(app(X0,nil),X1))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(sK5,app(app(app(X0,nil),X1),X2))
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(app(app(app(X0,nil),X1),X2))
| ~ ssList(X2) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f514]) ).
fof(f539,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(sK5,app(app(app(X0,nil),X1),X2))
| ~ neq(nil,app(app(X0,nil),X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ strictorderedP(app(app(X0,nil),X1))
| ~ ssList(app(app(X0,nil),X1))
| ~ ssList(X2) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f536,f247]) ).
fof(f641,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(sK5,app(app(X0,X1),X2))
| ~ neq(nil,app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ strictorderedP(app(X0,X1))
| ~ ssList(app(X0,X1))
| ~ ssList(X2)
| ~ ssList(X0) )
| ~ spl25_5 ),
inference(superposition,[],[f539,f222]) ).
fof(f663,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(sK5,app(app(X0,X1),X2))
| ~ neq(nil,app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ strictorderedP(app(X0,X1))
| ~ ssList(app(X0,X1))
| ~ ssList(X2) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f641]) ).
fof(f674,plain,
( ! [X2,X0,X1] :
( ~ frontsegP(sK5,app(app(X0,X1),X2))
| ~ neq(nil,app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ strictorderedP(app(X0,X1))
| ~ ssList(X2) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f663,f247]) ).
fof(f942,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,app(X0,X1))
| ~ neq(nil,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ strictorderedP(X0)
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl25_5 ),
inference(superposition,[],[f674,f222]) ).
fof(f956,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,app(X0,X1))
| ~ neq(nil,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ strictorderedP(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f942]) ).
fof(f965,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,app(X0,X1))
| ~ neq(nil,X0)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f956,f246]) ).
fof(f995,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,cons(X0,X1))
| ~ neq(nil,cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ strictorderedP(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl25_5 ),
inference(superposition,[],[f965,f227]) ).
fof(f1009,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,cons(X0,X1))
| ~ neq(nil,cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ strictorderedP(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f995]) ).
fof(f1012,plain,
( ! [X0,X1] :
( ~ frontsegP(sK5,cons(X0,X1))
| ~ neq(nil,cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1009,f279]) ).
fof(f1036,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ neq(nil,cons(sK7(X0),nil))
| ~ ssList(cons(sK7(X0),nil))
| ~ ssList(sK6(X0))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl25_5 ),
inference(superposition,[],[f1012,f233]) ).
fof(f1041,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ neq(nil,cons(sK7(X0),nil))
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1036,f235]) ).
fof(f1044,plain,
( ! [X0] :
( ~ neq(nil,cons(sK7(X0),nil))
| ~ frontsegP(sK5,X0)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1041,f234]) ).
fof(f1314,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| nil = cons(sK7(X0),nil)
| ~ ssList(cons(sK7(X0),nil))
| ~ ssList(nil) )
| ~ spl25_5 ),
inference(resolution,[],[f1044,f243]) ).
fof(f1315,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| nil = cons(sK7(X0),nil)
| ~ ssList(nil) )
| ~ spl25_5 ),
inference(duplicate_literal_removal,[],[f1314]) ).
fof(f1316,plain,
( ! [X0] :
( nil = cons(sK7(X0),nil)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| ~ frontsegP(sK5,X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1315,f246]) ).
fof(f1472,plain,
( ! [X0] :
( nil != nil
| ~ ssItem(sK7(X0))
| ~ ssList(nil)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| ~ frontsegP(sK5,X0) )
| ~ spl25_5 ),
inference(superposition,[],[f238,f1316]) ).
fof(f1487,plain,
( ! [X0] :
( ~ ssItem(sK7(X0))
| ~ ssList(nil)
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| ~ frontsegP(sK5,X0) )
| ~ spl25_5 ),
inference(trivial_inequality_removal,[],[f1472]) ).
fof(f1500,plain,
( ! [X0] :
( ~ ssItem(sK7(X0))
| ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| ~ frontsegP(sK5,X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1487,f246]) ).
fof(f1514,plain,
( ! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| nil = X0
| ~ ssList(X0)
| ~ frontsegP(sK5,X0) )
| ~ spl25_5 ),
inference(forward_subsumption_resolution,[],[f1500,f234]) ).
fof(f1519,definition,
( spl25_10
<=> ! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| ~ frontsegP(sK5,X0)
| ~ ssList(X0)
| nil = X0 ) ),
introduced(definition,[new_symbols(definition,[spl25_10])],[avatar_definition]) ).
fof(f1520,plain,
( ! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| ~ frontsegP(sK5,X0)
| ~ ssList(X0)
| nil = X0 )
| ~ spl25_10 ),
inference(avatar_component_clause,[],[f1519]) ).
fof(f1525,plain,
( spl25_10
| ~ spl25_5 ),
inference(avatar_split_clause,[],[f1514,f376,f1519]) ).
fof(f1584,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssItem(sK7(X0))
| ~ ssList(nil) )
| ~ spl25_10 ),
inference(resolution,[],[f1520,f248]) ).
fof(f1587,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ ssList(X0)
| nil = X0
| ~ ssItem(sK7(X0)) )
| ~ spl25_10 ),
inference(forward_subsumption_resolution,[],[f1584,f246]) ).
fof(f1588,plain,
( ! [X0] :
( ~ frontsegP(sK5,X0)
| ~ ssList(X0)
| nil = X0 )
| ~ spl25_10 ),
inference(forward_subsumption_resolution,[],[f1587,f234]) ).
fof(f1591,plain,
( ~ ssList(sK5)
| nil = sK5
| ~ ssList(sK5)
| ~ spl25_10 ),
inference(resolution,[],[f1588,f256]) ).
fof(f1597,plain,
( ~ ssList(sK5)
| nil = sK5
| ~ spl25_10 ),
inference(duplicate_literal_removal,[],[f1591]) ).
fof(f1599,plain,
( nil = sK5
| ~ spl25_10 ),
inference(forward_subsumption_resolution,[],[f1597,f328]) ).
fof(f1621,plain,
( neq(nil,nil)
| ~ spl25_10 ),
inference(superposition,[],[f326,f1599]) ).
fof(f1669,plain,
( $false
| ~ spl25_5
| ~ spl25_10 ),
inference(forward_subsumption_resolution,[],[f1621,f409]) ).
fof(f1670,plain,
( ~ spl25_5
| ~ spl25_10 ),
inference(avatar_contradiction_clause,[],[f1669]) ).
cnf(s3,plain,
spl25_5,
inference(sat_conversion,[],[f381]) ).
cnf(s13,plain,
( ~ spl25_5
| spl25_10 ),
inference(sat_conversion,[],[f1525]) ).
cnf(s20,plain,
( ~ spl25_5
| ~ spl25_10 ),
inference(sat_conversion,[],[f1670]) ).
cnf(s22,plain,
~ spl25_10,
inference(rat,[],[s20,s3]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s13,s22,s3]) ).
fof(f1674,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC214+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.09/0.22 % Computer : n008.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Mon Sep 28 08:32:39 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.26 Running first-order theorem proving
% 0.09/0.26 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
% 4.76/1.48 % (2099387)Detected formulas, will run a generic FOF schedule.
% 4.76/1.48 % (2099395)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=157880491:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.76/1.48 % (2099395)Refutation not found, incomplete strategy
% 4.76/1.48 % (2099395)------------------------------
% 4.76/1.48 % (2099395)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099395)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099395)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099395)Termination reason: Refutation not found, incomplete strategy
% 4.76/1.48 % (2099395)Time elapsed: 0.003 s
% 4.76/1.48 % (2099395)Peak memory usage: 88 MB
% 4.76/1.48 % (2099395)Instructions burned: 6 (million)
% 4.76/1.48 % (2099397)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=892456707:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.76/1.48 % (2099392)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=2584571470:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.76/1.48 % (2099396)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4190674761:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.76/1.48 % (2099393)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=1428918048:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.76/1.48 % (2099398)dis-21_1_sil=8000:lcm=predicate:random_seed=2671123131: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)
% 4.76/1.48 % (2099394)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=1850016825:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.76/1.48 % (2099396)Instruction limit reached!
% 4.76/1.48 % (2099396)------------------------------
% 4.76/1.48 % (2099396)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099396)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099396)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099396)Termination reason: Instruction limit
% 4.76/1.48 % (2099396)Termination phase: Saturation
% 4.76/1.48 % (2099396)Time elapsed: 0.071 s
% 4.76/1.48 % (2099396)Peak memory usage: 88 MB
% 4.76/1.48 % (2099396)Instructions burned: 120 (million)
% 4.76/1.48 % (2099398)Instruction limit reached!
% 4.76/1.48 % (2099398)------------------------------
% 4.76/1.48 % (2099398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099398)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099398)Termination reason: Instruction limit
% 4.76/1.48 % (2099398)Termination phase: Saturation
% 4.76/1.48 % (2099398)Time elapsed: 0.073 s
% 4.76/1.48 % (2099398)Peak memory usage: 90 MB
% 4.76/1.48 % (2099398)Instructions burned: 130 (million)
% 4.76/1.48 % (2099397)Instruction limit reached!
% 4.76/1.48 % (2099397)------------------------------
% 4.76/1.48 % (2099397)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099397)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099397)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099397)Termination reason: Instruction limit
% 4.76/1.48 % (2099397)Termination phase: Saturation
% 4.76/1.48 % (2099397)Time elapsed: 0.100 s
% 4.76/1.48 % (2099397)Peak memory usage: 90 MB
% 4.76/1.48 % (2099397)Instructions burned: 140 (million)
% 4.76/1.48 % (2099395)------------------------------
% 4.76/1.48 % (2099395)------------------------------
% 4.76/1.48 % (2099409)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=1559643147:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 4.76/1.48 % (2099407)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2328019776:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 4.76/1.48 % (2099406)lrs+10_1_sil=8000:sp=occurrence:random_seed=608812228:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 4.76/1.48 % (2099408)lrs+1011_1_sil=32000:sp=occurrence:random_seed=3294452671:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 4.76/1.48 % (2099409)Instruction limit reached!
% 4.76/1.48 % (2099409)------------------------------
% 4.76/1.48 % (2099409)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099409)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099409)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099409)Termination reason: Instruction limit
% 4.76/1.48 % (2099409)Termination phase: Saturation
% 4.76/1.48 % (2099409)Time elapsed: 0.067 s
% 4.76/1.48 % (2099409)Peak memory usage: 93 MB
% 4.76/1.48 % (2099409)Instructions burned: 250 (million)
% 4.76/1.48 % (2099407)Instruction limit reached!
% 4.76/1.48 % (2099407)------------------------------
% 4.76/1.48 % (2099407)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099407)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099407)Termination reason: Instruction limit
% 4.76/1.48 % (2099407)Termination phase: Saturation
% 4.76/1.48 % (2099407)Time elapsed: 0.075 s
% 4.76/1.48 % (2099407)Peak memory usage: 90 MB
% 4.76/1.48 % (2099407)Instructions burned: 157 (million)
% 4.76/1.48 % (2099406)Instruction limit reached!
% 4.76/1.48 % (2099406)------------------------------
% 4.76/1.48 % (2099406)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099406)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099406)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099406)Termination reason: Instruction limit
% 4.76/1.48 % (2099406)Termination phase: Saturation
% 4.76/1.48 % (2099406)Time elapsed: 0.165 s
% 4.76/1.48 % (2099406)Peak memory usage: 93 MB
% 4.76/1.48 % (2099406)Instructions burned: 285 (million)
% 4.76/1.48 % (2099414)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=175485384:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 4.76/1.48 % (2099414)First to succeed.
% 4.76/1.48 % (2099414)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2099387"
% 4.76/1.48 % (2099415)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=2152680271:i=2350_2995 on theBenchmark for (2995ds/2350Mi)
% 4.76/1.48 % (2099408)Instruction limit reached!
% 4.76/1.48 % (2099408)------------------------------
% 4.76/1.48 % (2099408)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.76/1.48 % (2099408)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.76/1.48 % (2099408)CaDiCaL version: 2.1.3
% 4.76/1.48 % (2099408)Termination reason: Instruction limit
% 4.76/1.48 % (2099408)Termination phase: Saturation
% 4.76/1.48 % (2099408)Time elapsed: 0.205 s
% 4.76/1.48 % (2099408)Peak memory usage: 94 MB
% 4.76/1.48 % (2099408)Instructions burned: 325 (million)
% 4.76/1.48 % (2099416)dis-1011_32:1_sfv=off:sil=16000:sos=all:erd=off:acc=on:fd=off:flr=on:random_seed=3877977906:cts=off:i=113:fsr=off:ss=included:sgt=4_2994 on theBenchmark for (2994ds/113Mi)
% 4.76/1.48 % (2099414)Refutation found. Thanks to Tanya!
% 4.76/1.48 % SZS status Theorem for theBenchmark
% 4.76/1.48 % SZS output start Proof for theBenchmark
% See solution above
% 6.04/1.67 % (2099414)------------------------------
% 6.04/1.67 % (2099414)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.04/1.67 % (2099414)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.04/1.67 % (2099414)CaDiCaL version: 2.1.3
% 6.04/1.67 % (2099414)Termination reason: Refutation
% 6.04/1.67 % (2099414)Time elapsed: 0.036 s
% 6.04/1.67 % (2099414)Peak memory usage: 90 MB
% 6.04/1.67 % (2099414)Instructions burned: 120 (million)
% 6.04/1.67 % (2099414)------------------------------
% 6.04/1.67 % (2099414)------------------------------
% 6.04/1.67 % (2099387)Success in time 0.773 s
% 6.04/1.67 % Vampire exiting
%------------------------------------------------------------------------------