%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC417+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 : n016.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:54 PM UTC 2026
% Result : Theorem 3.69s 1.18s
% Output : Refutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 76 ( 12 unt; 4 def)
% Number of atoms : 279 ( 61 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 334 ( 131 ~; 116 |; 68 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 4 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn 113 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
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)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X2 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,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)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X1
& app(app(X6,cons(X4,nil)),X5) = X0 ) ) )
| ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( app(cons(X7,nil),X8) != X3
| app(X8,cons(X7,nil)) != X2 ) ) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X3
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,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)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X3
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& 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(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f120,definition,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X3
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f121,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( sP0(X1,X0,X3,X2)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f120]) ).
fof(f122,plain,
! [X1,X0,X3,X2] :
( ( neq(X1,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X1
| app(app(X6,cons(X4,nil)),X5) != X0 ) ) )
& ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X3
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X1,X0,X3,X2) ),
inference(nnf_transformation,[],[f120]) ).
fof(f123,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1 ) ) )
& ? [X7] :
( ? [X8] :
( app(cons(X7,nil),X8) = X2
& app(X8,cons(X7,nil)) = X3
& ssList(X8) )
& ssItem(X7) ) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f122]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1 ) ) )
& app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X2
& app(sK2(X2,X3),cons(sK1(X2,X3),nil)) = X3
& ssList(sK2(X2,X3))
& ssItem(sK1(X2,X3)) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X7,sK1(X2,X3)),skolemize(X8,sK2(X2,X3))],[f123]) ).
fof(f125,plain,
( sK4 = sK6
& sK3 = sK5
& ( sP0(sK4,sK3,sK6,sK5)
| ( neq(sK4,nil)
& ~ neq(sK6,nil) ) )
& ssList(sK6)
& ssList(sK5)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f121]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f133,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X2,X3),cons(sK1(X2,X3),nil)) = X3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X2 ),
inference(cnf_transformation,[],[f124]) ).
fof(f136,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| app(app(X6,cons(X4,nil)),X5) != X1
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f124]) ).
fof(f137,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X0,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f138,plain,
ssList(sK3),
inference(cnf_transformation,[],[f125]) ).
fof(f142,plain,
( sP0(sK4,sK3,sK6,sK5)
| ~ neq(sK6,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f143,plain,
( sP0(sK4,sK3,sK6,sK5)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f144,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f125]) ).
fof(f156,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f157,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f165,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f115]) ).
fof(f172,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f173,plain,
( sP0(sK6,sK5,sK6,sK5)
| neq(sK6,nil) ),
inference(definition_unfolding,[],[f143,f145,f144,f145]) ).
fof(f174,plain,
( sP0(sK6,sK5,sK6,sK5)
| ~ neq(sK6,nil) ),
inference(definition_unfolding,[],[f142,f145,f144]) ).
fof(f176,plain,
ssList(sK5),
inference(definition_unfolding,[],[f138,f144]) ).
fof(f177,plain,
! [X2,X3,X1,X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X6,cons(X4,nil)),X5) != X1
| ~ sP0(app(app(X5,cons(X4,nil)),X6),X1,X2,X3) ),
inference(equality_resolution,[],[f136]) ).
fof(f178,plain,
! [X2,X3,X6,X4,X5] :
( ~ sP0(app(app(X5,cons(X4,nil)),X6),app(app(X6,cons(X4,nil)),X5),X2,X3)
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(equality_resolution,[],[f177]) ).
fof(f187,definition,
( spl11_1
<=> neq(sK6,nil) ),
introduced(definition,[new_symbols(definition,[spl11_1])],[avatar_definition]) ).
fof(f191,definition,
( spl11_2
<=> sP0(sK6,sK5,sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl11_2])],[avatar_definition]) ).
fof(f193,plain,
( sP0(sK6,sK5,sK6,sK5)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f191]) ).
fof(f194,plain,
( ~ spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f174,f191,f187]) ).
fof(f195,plain,
( spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f173,f191,f187]) ).
fof(f197,plain,
sK5 = app(sK5,nil),
inference(resolution,[],[f157,f176]) ).
fof(f202,plain,
( neq(sK6,nil)
| ~ spl11_2 ),
inference(resolution,[],[f137,f193]) ).
fof(f203,plain,
( spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f202,f191,f187]) ).
fof(f216,plain,
( ssItem(sK1(sK6,sK5))
| ~ spl11_2 ),
inference(resolution,[],[f132,f193]) ).
fof(f217,plain,
( ssList(sK2(sK6,sK5))
| ~ spl11_2 ),
inference(resolution,[],[f133,f193]) ).
fof(f326,plain,
( sK5 = app(sK2(sK6,sK5),cons(sK1(sK6,sK5),nil))
| ~ spl11_2 ),
inference(resolution,[],[f134,f193]) ).
fof(f329,plain,
( sK6 = app(cons(sK1(sK6,sK5),nil),sK2(sK6,sK5))
| ~ spl11_2 ),
inference(resolution,[],[f135,f193]) ).
fof(f690,definition,
( spl11_22
<=> ssList(cons(sK1(sK6,sK5),nil)) ),
introduced(definition,[new_symbols(definition,[spl11_22])],[avatar_definition]) ).
fof(f691,plain,
( ssList(cons(sK1(sK6,sK5),nil))
| ~ spl11_22 ),
inference(avatar_component_clause,[],[f690]) ).
fof(f692,plain,
( ~ ssList(cons(sK1(sK6,sK5),nil))
| spl11_22 ),
inference(avatar_component_clause,[],[f690]) ).
fof(f781,plain,
( ~ ssItem(sK1(sK6,sK5))
| ~ ssList(nil)
| spl11_22 ),
inference(resolution,[],[f692,f156]) ).
fof(f782,plain,
( ~ ssList(nil)
| ~ spl11_2
| spl11_22 ),
inference(forward_subsumption_resolution,[],[f781,f216]) ).
fof(f783,plain,
( $false
| ~ spl11_2
| spl11_22 ),
inference(forward_subsumption_resolution,[],[f782,f172]) ).
fof(f784,plain,
( ~ spl11_2
| spl11_22 ),
inference(avatar_contradiction_clause,[],[f783]) ).
fof(f816,plain,
( cons(sK1(sK6,sK5),nil) = app(nil,cons(sK1(sK6,sK5),nil))
| ~ spl11_22 ),
inference(resolution,[],[f691,f165]) ).
fof(f3799,plain,
( ! [X2,X0,X1] :
( ~ sP0(app(app(X0,cons(sK1(sK6,sK5),nil)),sK2(sK6,sK5)),app(sK5,X0),X1,X2)
| ~ ssList(X0)
| ~ ssList(sK2(sK6,sK5))
| ~ ssItem(sK1(sK6,sK5)) )
| ~ spl11_2 ),
inference(superposition,[],[f178,f326]) ).
fof(f3814,plain,
( ! [X2,X0,X1] :
( ~ sP0(app(app(X0,cons(sK1(sK6,sK5),nil)),sK2(sK6,sK5)),app(sK5,X0),X1,X2)
| ~ ssList(X0)
| ~ ssItem(sK1(sK6,sK5)) )
| ~ spl11_2 ),
inference(forward_subsumption_resolution,[],[f3799,f217]) ).
fof(f3821,plain,
( ! [X2,X0,X1] :
( ~ sP0(app(app(X0,cons(sK1(sK6,sK5),nil)),sK2(sK6,sK5)),app(sK5,X0),X1,X2)
| ~ ssList(X0) )
| ~ spl11_2 ),
inference(forward_subsumption_resolution,[],[f3814,f216]) ).
fof(f5700,plain,
( ! [X0,X1] :
( ~ sP0(app(app(nil,cons(sK1(sK6,sK5),nil)),sK2(sK6,sK5)),sK5,X0,X1)
| ~ ssList(nil) )
| ~ spl11_2 ),
inference(superposition,[],[f3821,f197]) ).
fof(f5701,plain,
( ! [X0,X1] : ~ sP0(app(app(nil,cons(sK1(sK6,sK5),nil)),sK2(sK6,sK5)),sK5,X0,X1)
| ~ spl11_2 ),
inference(forward_subsumption_resolution,[],[f5700,f172]) ).
fof(f5702,plain,
( ! [X0,X1] : ~ sP0(app(cons(sK1(sK6,sK5),nil),sK2(sK6,sK5)),sK5,X0,X1)
| ~ spl11_2
| ~ spl11_22 ),
inference(forward_demodulation,[],[f5701,f816]) ).
fof(f5703,plain,
( ! [X0,X1] : ~ sP0(sK6,sK5,X0,X1)
| ~ spl11_2
| ~ spl11_22 ),
inference(forward_demodulation,[],[f5702,f329]) ).
fof(f5704,plain,
( $false
| ~ spl11_2
| ~ spl11_22 ),
inference(resolution,[],[f5703,f193]) ).
fof(f5705,plain,
( ~ spl11_2
| ~ spl11_22 ),
inference(avatar_contradiction_clause,[],[f5704]) ).
cnf(s1,plain,
( ~ spl11_1
| spl11_2 ),
inference(sat_conversion,[],[f194]) ).
cnf(s2,plain,
( spl11_1
| spl11_2 ),
inference(sat_conversion,[],[f195]) ).
cnf(s3,plain,
( spl11_1
| ~ spl11_2 ),
inference(sat_conversion,[],[f203]) ).
cnf(s29,plain,
( ~ spl11_2
| spl11_22 ),
inference(sat_conversion,[],[f784]) ).
cnf(s187,plain,
( ~ spl11_2
| ~ spl11_22 ),
inference(sat_conversion,[],[f5705]) ).
cnf(s226,plain,
spl11_1,
inference(rat,[],[s2,s3]) ).
cnf(s228,plain,
spl11_2,
inference(rat,[],[s1,s226]) ).
cnf(s232,plain,
~ spl11_22,
inference(rat,[],[s187,s228]) ).
cnf(s233,plain,
$false,
inference(rat,[],[s29,s232,s228]) ).
fof(f5706,plain,
$false,
inference(avatar_sat_refutation,[],[s233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC417+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.19 % Computer : n016.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:38:33 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 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
% 3.69/1.18 % (3510443)Detected formulas, will run a generic FOF schedule.
% 3.69/1.18 % (3510454)dis-21_1_sil=8000:lcm=predicate:random_seed=2758363794: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)
% 3.69/1.18 % (3510454)Instruction limit reached!
% 3.69/1.18 % (3510454)------------------------------
% 3.69/1.18 % (3510454)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.18 % (3510454)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.18 % (3510454)CaDiCaL version: 2.1.3
% 3.69/1.18 % (3510454)Termination reason: Instruction limit
% 3.69/1.18 % (3510454)Termination phase: Saturation
% 3.69/1.18 % (3510454)Time elapsed: 0.042 s
% 3.69/1.18 % (3510454)Peak memory usage: 90 MB
% 3.69/1.18 % (3510454)Instructions burned: 129 (million)
% 3.69/1.18 % (3510448)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=1529590423:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.69/1.18 % (3510452)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=469902672:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.69/1.18 % (3510453)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3695132052:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.69/1.18 % (3510451)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2193590209:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.69/1.18 % (3510450)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=3766798768:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.69/1.18 % (3510449)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=1951403362:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.69/1.18 % (3510451)Instruction limit reached!
% 3.69/1.18 % (3510451)------------------------------
% 3.69/1.18 % (3510451)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.18 % (3510451)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.18 % (3510451)CaDiCaL version: 2.1.3
% 3.69/1.18 % (3510451)Termination reason: Instruction limit
% 3.69/1.18 % (3510451)Termination phase: Saturation
% 3.69/1.18 % (3510451)Time elapsed: 0.069 s
% 3.69/1.18 % (3510451)Peak memory usage: 89 MB
% 3.69/1.18 % (3510451)Instructions burned: 109 (million)
% 3.69/1.18 % (3510452)Instruction limit reached!
% 3.69/1.18 % (3510452)------------------------------
% 3.69/1.18 % (3510452)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.18 % (3510452)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.18 % (3510452)CaDiCaL version: 2.1.3
% 3.69/1.18 % (3510452)Termination reason: Instruction limit
% 3.69/1.18 % (3510452)Termination phase: Saturation
% 3.69/1.18 % (3510452)Time elapsed: 0.071 s
% 3.69/1.18 % (3510452)Peak memory usage: 88 MB
% 3.69/1.18 % (3510452)Instructions burned: 119 (million)
% 3.69/1.18 % (3510453)Instruction limit reached!
% 3.69/1.18 % (3510453)------------------------------
% 3.69/1.18 % (3510453)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.18 % (3510453)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.18 % (3510453)CaDiCaL version: 2.1.3
% 3.69/1.18 % (3510453)Termination reason: Instruction limit
% 3.69/1.18 % (3510453)Termination phase: Saturation
% 3.69/1.18 % (3510453)Time elapsed: 0.090 s
% 3.69/1.18 % (3510453)Peak memory usage: 89 MB
% 3.69/1.18 % (3510453)Instructions burned: 139 (million)
% 3.69/1.18 % (3510462)lrs+10_1_sil=8000:sp=occurrence:random_seed=3801618769:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.69/1.18 % (3510462)First to succeed.
% 3.69/1.18 % (3510462)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3510443"
% 3.69/1.18 % (3510464)lrs+1011_1_sil=32000:sp=occurrence:random_seed=373344984:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.69/1.18 % (3510463)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1712560112:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.69/1.18 % (3510465)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=939338365:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.69/1.18 % (3510463)Instruction limit reached!
% 3.69/1.18 % (3510463)------------------------------
% 3.69/1.18 % (3510463)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.69/1.18 % (3510463)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.69/1.18 % (3510463)CaDiCaL version: 2.1.3
% 3.69/1.18 % (3510463)Termination reason: Instruction limit
% 3.69/1.18 % (3510463)Termination phase: Saturation
% 3.69/1.18 % (3510463)Time elapsed: 0.076 s
% 3.69/1.18 % (3510463)Peak memory usage: 91 MB
% 3.69/1.18 % (3510463)Instructions burned: 159 (million)
% 3.69/1.18 % (3510462)Refutation found. Thanks to Tanya!
% 3.69/1.18 % SZS status Theorem for theBenchmark
% 3.69/1.18 % SZS output start Proof for theBenchmark
% See solution above
% 4.24/1.37 % (3510462)------------------------------
% 4.24/1.37 % (3510462)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.24/1.37 % (3510462)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.24/1.37 % (3510462)CaDiCaL version: 2.1.3
% 4.24/1.37 % (3510462)Termination reason: Refutation
% 4.24/1.37 % (3510462)Time elapsed: 0.068 s
% 4.24/1.37 % (3510462)Peak memory usage: 93 MB
% 4.24/1.37 % (3510462)Instructions burned: 203 (million)
% 4.24/1.37 % (3510462)------------------------------
% 4.24/1.37 % (3510462)------------------------------
% 4.24/1.37 % (3510443)Success in time 0.513 s
% 4.24/1.37 % Vampire exiting
%------------------------------------------------------------------------------