%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC384+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 : n007.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:03:44 PM UTC 2026
% Result : Theorem 0.64s 0.99s
% Output : Refutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 71 ( 14 unt; 1 def)
% Number of atoms : 360 ( 71 equ)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 465 ( 176 ~; 156 |; 106 &)
% ( 6 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 157 ( 114 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
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] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& 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] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f124,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f134,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(f150,definition,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f151,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ( sP0(X2,X3)
| ( nil = X3
& nil = X2 ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f150]) ).
fof(f152,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) )
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
inference(nnf_transformation,[],[f150]) ).
fof(f153,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( cons(X2,nil) = X0
& app(app(X3,X0),X4) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ lt(X2,X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(X4,X6)
| ~ lt(X6,X2) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f152]) ).
fof(f154,plain,
! [X0,X1] :
( ( cons(sK1(X0,X1),nil) = X0
& app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK2(X0,X1),X5)
| ~ lt(sK1(X0,X1),X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(sK3(X0,X1),X6)
| ~ lt(X6,sK1(X0,X1)) )
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f153]) ).
fof(f155,plain,
( sK5 = sK7
& sK4 = sK6
& neq(sK5,nil)
& ( sP0(sK6,sK7)
| ( nil = sK7
& nil = sK6 ) )
& ( ~ singletonP(sK4)
| ~ segmentP(sK5,sK4) )
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f151]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f169,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f124]) ).
fof(f170,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f169]) ).
fof(f171,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK14(X0))
& cons(sK14(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X2,sK14(X0))],[f170]) ).
fof(f173,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,[],[f134]) ).
fof(f174,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,[],[f173]) ).
fof(f175,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK15(X0,X1))
& ssList(sK16(X0,X1))
& app(app(sK15(X0,X1),X1),sK16(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X4,sK15(X0,X1)),skolemize(X5,sK16(X0,X1))],[f174]) ).
fof(f178,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f179,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f180,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f183,plain,
! [X0,X1] :
( app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f184,plain,
! [X0,X1] :
( cons(sK1(X0,X1),nil) = X0
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f188,plain,
ssList(sK7),
inference(cnf_transformation,[],[f155]) ).
fof(f189,plain,
( ~ singletonP(sK4)
| ~ segmentP(sK5,sK4) ),
inference(cnf_transformation,[],[f155]) ).
fof(f190,plain,
( sP0(sK6,sK7)
| nil = sK6 ),
inference(cnf_transformation,[],[f155]) ).
fof(f191,plain,
( sP0(sK6,sK7)
| nil = sK7 ),
inference(cnf_transformation,[],[f155]) ).
fof(f192,plain,
neq(sK5,nil),
inference(cnf_transformation,[],[f155]) ).
fof(f193,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f155]) ).
fof(f194,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f155]) ).
fof(f205,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f217,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f221,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f233,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f236,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(X1)
| cons(X1,nil) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f171]) ).
fof(f247,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,[],[f175]) ).
fof(f259,plain,
neq(sK7,nil),
inference(definition_unfolding,[],[f192,f194]) ).
fof(f260,plain,
( ~ segmentP(sK7,sK6)
| ~ singletonP(sK6) ),
inference(definition_unfolding,[],[f189,f193,f194,f193]) ).
fof(f265,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f217]) ).
fof(f269,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f236]) ).
fof(f271,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,[],[f247]) ).
fof(f276,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f265]) ).
fof(f289,plain,
! [X0,X1] :
( ssList(X0)
| ~ ssItem(sK1(X0,X1))
| ~ ssList(nil)
| ~ sP0(X0,X1) ),
inference(superposition,[],[f205,f184]) ).
fof(f290,plain,
! [X0,X1] :
( ssList(X0)
| ~ ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(forward_subsumption_resolution,[],[f289,f221]) ).
fof(f294,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(X0) ),
inference(forward_subsumption_resolution,[],[f290,f178]) ).
fof(f324,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(sK1(X0,X1))
| ~ ssList(X0)
| ~ sP0(X0,X1) ),
inference(superposition,[],[f269,f184]) ).
fof(f327,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssList(X0)
| ~ sP0(X0,X1) ),
inference(forward_subsumption_resolution,[],[f324,f178]) ).
fof(f328,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| singletonP(X0) ),
inference(forward_subsumption_resolution,[],[f327,f294]) ).
fof(f329,plain,
( nil = sK7
| singletonP(sK6) ),
inference(resolution,[],[f328,f191]) ).
fof(f340,plain,
( neq(sK7,sK7)
| singletonP(sK6) ),
inference(superposition,[],[f259,f329]) ).
fof(f363,plain,
( singletonP(sK6)
| ~ ssList(sK7) ),
inference(resolution,[],[f340,f276]) ).
fof(f365,plain,
singletonP(sK6),
inference(forward_subsumption_resolution,[],[f363,f188]) ).
fof(f1154,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(sK2(X1,X0))
| ~ ssList(sK3(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(superposition,[],[f271,f183]) ).
fof(f1168,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(sK3(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1154,f179]) ).
fof(f1176,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1168,f180]) ).
fof(f1180,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1176,f294]) ).
fof(f1237,plain,
( ~ ssList(sK7)
| ~ sP0(sK6,sK7)
| ~ singletonP(sK6) ),
inference(resolution,[],[f1180,f260]) ).
fof(f1287,plain,
( ~ ssList(sK7)
| ~ sP0(sK6,sK7) ),
inference(forward_subsumption_resolution,[],[f1237,f328]) ).
fof(f1311,plain,
~ sP0(sK6,sK7),
inference(forward_subsumption_resolution,[],[f1287,f188]) ).
fof(f1314,plain,
nil = sK6,
inference(resolution,[],[f1311,f190]) ).
fof(f1384,plain,
~ singletonP(sK6),
inference(superposition,[],[f233,f1314]) ).
fof(f1407,plain,
$false,
inference(forward_subsumption_resolution,[],[f1384,f365]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC384+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.08/0.17 % Computer : n007.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 09:21:10 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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
% 0.64/0.99 % (2263568)Detected formulas, will run a generic FOF schedule.
% 0.64/0.99 % (2263577)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3906603502:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.64/0.99 % (2263577)First to succeed.
% 0.64/0.99 % (2263577)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2263568"
% 0.64/0.99 % (2263578)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=796561723:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.64/0.99 % (2263574)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=2130021384:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.64/0.99 % (2263573)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=3324727535:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.64/0.99 % (2263575)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=3722202776:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.64/0.99 % (2263576)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4102411258:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.64/0.99 % (2263579)dis-21_1_sil=8000:lcm=predicate:random_seed=2808877022: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)
% 0.64/0.99 % (2263576)Instruction limit reached!
% 0.64/0.99 % (2263576)------------------------------
% 0.64/0.99 % (2263576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.64/0.99 % (2263576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.64/0.99 % (2263576)CaDiCaL version: 2.1.3
% 0.64/0.99 % (2263576)Termination reason: Instruction limit
% 0.64/0.99 % (2263576)Termination phase: Saturation
% 0.64/0.99 % (2263576)Time elapsed: 0.068 s
% 0.64/0.99 % (2263576)Peak memory usage: 89 MB
% 0.64/0.99 % (2263576)Instructions burned: 110 (million)
% 0.64/0.99 % (2263579)Instruction limit reached!
% 0.64/0.99 % (2263579)------------------------------
% 0.64/0.99 % (2263579)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.64/0.99 % (2263579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.64/0.99 % (2263579)CaDiCaL version: 2.1.3
% 0.64/0.99 % (2263579)Termination reason: Instruction limit
% 0.64/0.99 % (2263579)Termination phase: Saturation
% 0.64/0.99 % (2263579)Time elapsed: 0.071 s
% 0.64/0.99 % (2263579)Peak memory usage: 90 MB
% 0.64/0.99 % (2263579)Instructions burned: 129 (million)
% 0.64/0.99 % (2263578)Instruction limit reached!
% 0.64/0.99 % (2263578)------------------------------
% 0.64/0.99 % (2263578)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.64/0.99 % (2263578)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.64/0.99 % (2263578)CaDiCaL version: 2.1.3
% 0.64/0.99 % (2263578)Termination reason: Instruction limit
% 0.64/0.99 % (2263578)Termination phase: Saturation
% 0.64/0.99 % (2263578)Time elapsed: 0.094 s
% 0.64/0.99 % (2263578)Peak memory usage: 90 MB
% 0.64/0.99 % (2263578)Instructions burned: 140 (million)
% 0.64/0.99 % (2263577)Refutation found. Thanks to Tanya!
% 0.64/0.99 % SZS status Theorem for theBenchmark
% 0.64/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 2.97/1.18 % (2263577)------------------------------
% 2.97/1.18 % (2263577)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.18 % (2263577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.18 % (2263577)CaDiCaL version: 2.1.3
% 2.97/1.18 % (2263577)Termination reason: Refutation
% 2.97/1.18 % (2263577)Time elapsed: 0.024 s
% 2.97/1.18 % (2263577)Peak memory usage: 89 MB
% 2.97/1.18 % (2263577)Instructions burned: 89 (million)
% 2.97/1.18 % (2263577)------------------------------
% 2.97/1.18 % (2263577)------------------------------
% 2.97/1.18 % (2263568)Success in time 0.331 s
% 2.97/1.18 % Vampire exiting
%------------------------------------------------------------------------------