%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC106+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 : n005.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:28 PM UTC 2026
% Result : Theorem 2.76s 1.36s
% Output : Refutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 11
% Syntax : Number of formulae : 93 ( 15 unt; 6 def)
% Number of atoms : 329 ( 59 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 386 ( 150 ~; 138 |; 71 &)
% ( 9 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 84 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax18) ).
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)
=> ( cons(X4,nil) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| ( neq(X0,nil)
& rearsegP(X1,X0) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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)
=> ( cons(X4,nil) != X2
| app(X5,cons(X4,nil)) != X3 ) ) )
| ( neq(X0,nil)
& rearsegP(X1,X0) ) )
& ( ~ 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] :
( ? [X5] :
( cons(X4,nil) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) )
| ( 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] :
( ? [X5] :
( cons(X4,nil) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f130,definition,
! [X1,X2,X3,X0] :
( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( cons(X4,nil) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) )
| ~ sP0(X1,X2,X3,X0) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f131,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( sP0(X1,X2,X3,X0)
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f130]) ).
fof(f132,plain,
! [X1,X2,X3,X0] :
( ( neq(X1,nil)
& ? [X4] :
( ? [X5] :
( cons(X4,nil) = X2
& app(X5,cons(X4,nil)) = X3
& ssList(X5) )
& ssItem(X4) )
& ( ~ neq(X0,nil)
| ~ rearsegP(X1,X0) ) )
| ~ sP0(X1,X2,X3,X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f133,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& ? [X4] :
( ? [X5] :
( cons(X4,nil) = X1
& app(X5,cons(X4,nil)) = X2
& ssList(X5) )
& ssItem(X4) )
& ( ~ neq(X3,nil)
| ~ rearsegP(X0,X3) ) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f132]) ).
fof(f134,plain,
! [X0,X1,X2,X3] :
( ( neq(X0,nil)
& cons(sK1(X1,X2),nil) = X1
& app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2
& ssList(sK2(X1,X2))
& ssItem(sK1(X1,X2))
& ( ~ neq(X3,nil)
| ~ rearsegP(X0,X3) ) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X4,sK1(X1,X2)),skolemize(X5,sK2(X1,X2))],[f133]) ).
fof(f135,plain,
( sK4 = sK6
& sK3 = sK5
& ( sP0(sK4,sK5,sK6,sK3)
| ( 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)],[f131]) ).
fof(f140,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f143,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f144,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X3,X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f143]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X2,X1) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(sK11(X0,X1),X1) = X0 )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f144]) ).
fof(f146,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ~ rearsegP(X0,X3)
| ~ neq(X3,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f147,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X1,X2)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f148,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X1,X2)) ),
inference(cnf_transformation,[],[f134]) ).
fof(f149,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X1,X2),cons(sK1(X1,X2),nil)) = X2 ),
inference(cnf_transformation,[],[f134]) ).
fof(f150,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X1,X2),nil) = X1 ),
inference(cnf_transformation,[],[f134]) ).
fof(f151,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X0,nil) ),
inference(cnf_transformation,[],[f134]) ).
fof(f152,plain,
ssList(sK3),
inference(cnf_transformation,[],[f135]) ).
fof(f153,plain,
ssList(sK4),
inference(cnf_transformation,[],[f135]) ).
fof(f156,plain,
( sP0(sK4,sK5,sK6,sK3)
| ~ neq(sK6,nil) ),
inference(cnf_transformation,[],[f135]) ).
fof(f157,plain,
( sP0(sK4,sK5,sK6,sK3)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f135]) ).
fof(f158,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f135]) ).
fof(f159,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f135]) ).
fof(f169,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f183,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f186,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f196,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| ~ ssList(X2)
| app(X2,X1) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f197,plain,
( sP0(sK6,sK5,sK6,sK5)
| neq(sK6,nil) ),
inference(definition_unfolding,[],[f157,f159,f158,f159]) ).
fof(f198,plain,
( sP0(sK6,sK5,sK6,sK5)
| ~ neq(sK6,nil) ),
inference(definition_unfolding,[],[f156,f159,f158]) ).
fof(f199,plain,
ssList(sK6),
inference(definition_unfolding,[],[f153,f159]) ).
fof(f200,plain,
ssList(sK5),
inference(definition_unfolding,[],[f152,f158]) ).
fof(f206,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f196]) ).
fof(f211,definition,
( spl12_1
<=> neq(sK6,nil) ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f215,definition,
( spl12_2
<=> sP0(sK6,sK5,sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f217,plain,
( sP0(sK6,sK5,sK6,sK5)
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f218,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f198,f215,f211]) ).
fof(f219,plain,
( spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f197,f215,f211]) ).
fof(f226,plain,
( neq(sK6,nil)
| ~ spl12_2 ),
inference(resolution,[],[f151,f217]) ).
fof(f227,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f226,f215,f211]) ).
fof(f244,plain,
( ssItem(sK1(sK5,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f147,f217]) ).
fof(f245,plain,
( ssList(sK2(sK5,sK6))
| ~ spl12_2 ),
inference(resolution,[],[f148,f217]) ).
fof(f258,plain,
( ~ rearsegP(sK6,sK5)
| ~ neq(sK5,nil)
| ~ spl12_2 ),
inference(resolution,[],[f146,f217]) ).
fof(f260,definition,
( spl12_3
<=> neq(sK5,nil) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f262,plain,
( ~ neq(sK5,nil)
| spl12_3 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f264,definition,
( spl12_4
<=> rearsegP(sK6,sK5) ),
introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).
fof(f266,plain,
( ~ rearsegP(sK6,sK5)
| spl12_4 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f267,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f258,f215,f264,f260]) ).
fof(f269,plain,
( nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5)
| spl12_3 ),
inference(resolution,[],[f262,f183]) ).
fof(f270,plain,
( nil = sK5
| ~ ssList(sK5)
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f269,f186]) ).
fof(f280,definition,
( spl12_7
<=> nil = sK5 ),
introduced(definition,[new_symbols(definition,[spl12_7])],[avatar_definition]) ).
fof(f282,plain,
( nil = sK5
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f284,plain,
( nil = sK5
| spl12_3 ),
inference(forward_subsumption_resolution,[],[f270,f200]) ).
fof(f285,plain,
( spl12_7
| spl12_3 ),
inference(avatar_split_clause,[],[f284,f260,f280]) ).
fof(f292,plain,
( ssItem(sK1(nil,sK6))
| ~ spl12_2
| ~ spl12_7 ),
inference(superposition,[],[f244,f282]) ).
fof(f297,plain,
( sK5 = cons(sK1(sK5,sK6),nil)
| ~ spl12_2 ),
inference(resolution,[],[f150,f217]) ).
fof(f298,plain,
( nil = cons(sK1(nil,sK6),nil)
| ~ spl12_2
| ~ spl12_7 ),
inference(forward_demodulation,[],[f297,f282]) ).
fof(f395,plain,
( nil != nil
| ~ ssItem(sK1(nil,sK6))
| ~ ssList(nil)
| ~ spl12_2
| ~ spl12_7 ),
inference(superposition,[],[f169,f298]) ).
fof(f399,plain,
( ~ ssItem(sK1(nil,sK6))
| ~ ssList(nil)
| ~ spl12_2
| ~ spl12_7 ),
inference(trivial_inequality_removal,[],[f395]) ).
fof(f401,plain,
( ~ ssList(nil)
| ~ spl12_2
| ~ spl12_7 ),
inference(forward_subsumption_resolution,[],[f399,f292]) ).
fof(f404,plain,
( $false
| ~ spl12_2
| ~ spl12_7 ),
inference(forward_subsumption_resolution,[],[f401,f186]) ).
fof(f405,plain,
( ~ spl12_2
| ~ spl12_7 ),
inference(avatar_contradiction_clause,[],[f404]) ).
fof(f455,plain,
( sK6 = app(sK2(sK5,sK6),cons(sK1(sK5,sK6),nil))
| ~ spl12_2 ),
inference(resolution,[],[f149,f217]) ).
fof(f456,plain,
( sK6 = app(sK2(sK5,sK6),sK5)
| ~ spl12_2 ),
inference(forward_demodulation,[],[f455,f297]) ).
fof(f733,plain,
( rearsegP(sK6,sK5)
| ~ ssList(sK2(sK5,sK6))
| ~ ssList(sK5)
| ~ ssList(sK6)
| ~ spl12_2 ),
inference(superposition,[],[f206,f456]) ).
fof(f734,plain,
( ~ ssList(sK2(sK5,sK6))
| ~ ssList(sK5)
| ~ ssList(sK6)
| ~ spl12_2
| spl12_4 ),
inference(forward_subsumption_resolution,[],[f733,f266]) ).
fof(f740,plain,
( ~ ssList(sK5)
| ~ ssList(sK6)
| ~ spl12_2
| spl12_4 ),
inference(forward_subsumption_resolution,[],[f734,f245]) ).
fof(f746,plain,
( ~ ssList(sK6)
| ~ spl12_2
| spl12_4 ),
inference(forward_subsumption_resolution,[],[f740,f200]) ).
fof(f747,plain,
( $false
| ~ spl12_2
| spl12_4 ),
inference(forward_subsumption_resolution,[],[f746,f199]) ).
fof(f748,plain,
( ~ spl12_2
| spl12_4 ),
inference(avatar_contradiction_clause,[],[f747]) ).
cnf(s1,plain,
( ~ spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f218]) ).
cnf(s2,plain,
( spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f219]) ).
cnf(s3,plain,
( spl12_1
| ~ spl12_2 ),
inference(sat_conversion,[],[f227]) ).
cnf(s4,plain,
( ~ spl12_2
| ~ spl12_3
| ~ spl12_4 ),
inference(sat_conversion,[],[f267]) ).
cnf(s6,plain,
( spl12_3
| spl12_7 ),
inference(sat_conversion,[],[f285]) ).
cnf(s11,plain,
( ~ spl12_2
| ~ spl12_7 ),
inference(sat_conversion,[],[f405]) ).
cnf(s27,plain,
( ~ spl12_2
| spl12_4 ),
inference(sat_conversion,[],[f748]) ).
cnf(s28,plain,
spl12_1,
inference(rat,[],[s2,s3]) ).
cnf(s30,plain,
spl12_2,
inference(rat,[],[s1,s28]) ).
cnf(s34,plain,
spl12_4,
inference(rat,[],[s27,s30]) ).
cnf(s35,plain,
~ spl12_7,
inference(rat,[],[s11,s30]) ).
cnf(s36,plain,
~ spl12_3,
inference(rat,[],[s4,s34,s30]) ).
cnf(s39,plain,
$false,
inference(rat,[],[s6,s35,s36]) ).
fof(f749,plain,
$false,
inference(avatar_sat_refutation,[],[s39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC106+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.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:53:47 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 2.76/1.36 % (628667)Detected formulas, will run a generic FOF schedule.
% 2.76/1.36 % (628676)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3532411217:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.76/1.36 % (628677)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=272800955:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.76/1.36 % (628674)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=3386458083:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.76/1.36 % (628675)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2954341731:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.76/1.36 % (628672)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=2146147111:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.76/1.36 % (628678)dis-21_1_sil=8000:lcm=predicate:random_seed=1580832450: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)
% 2.76/1.36 % (628673)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=2552734238:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.76/1.36 % (628676)Instruction limit reached!
% 2.76/1.36 % (628676)------------------------------
% 2.76/1.36 % (628676)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (628676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (628676)CaDiCaL version: 2.1.3
% 2.76/1.36 % (628676)Termination reason: Instruction limit
% 2.76/1.36 % (628676)Termination phase: Saturation
% 2.76/1.36 % (628676)Time elapsed: 0.028 s
% 2.76/1.36 % (628676)Peak memory usage: 88 MB
% 2.76/1.36 % (628676)Instructions burned: 122 (million)
% 2.76/1.36 % (628675)Instruction limit reached!
% 2.76/1.36 % (628675)------------------------------
% 2.76/1.36 % (628675)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (628675)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (628675)CaDiCaL version: 2.1.3
% 2.76/1.36 % (628675)Termination reason: Instruction limit
% 2.76/1.36 % (628675)Termination phase: Saturation
% 2.76/1.36 % (628675)Time elapsed: 0.073 s
% 2.76/1.36 % (628675)Peak memory usage: 89 MB
% 2.76/1.36 % (628675)Instructions burned: 110 (million)
% 2.76/1.36 % (628678)Instruction limit reached!
% 2.76/1.36 % (628678)------------------------------
% 2.76/1.36 % (628678)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (628678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (628678)CaDiCaL version: 2.1.3
% 2.76/1.36 % (628678)Termination reason: Instruction limit
% 2.76/1.36 % (628678)Termination phase: Saturation
% 2.76/1.36 % (628678)Time elapsed: 0.076 s
% 2.76/1.36 % (628678)Peak memory usage: 90 MB
% 2.76/1.36 % (628678)Instructions burned: 130 (million)
% 2.76/1.36 % (628677)Instruction limit reached!
% 2.76/1.36 % (628677)------------------------------
% 2.76/1.36 % (628677)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (628677)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (628677)CaDiCaL version: 2.1.3
% 2.76/1.36 % (628677)Termination reason: Instruction limit
% 2.76/1.36 % (628677)Termination phase: Saturation
% 2.76/1.36 % (628677)Time elapsed: 0.092 s
% 2.76/1.36 % (628677)Peak memory usage: 90 MB
% 2.76/1.36 % (628677)Instructions burned: 139 (million)
% 2.76/1.36 % (628686)lrs+10_1_sil=8000:sp=occurrence:random_seed=4227754395:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 2.76/1.36 % (628686)First to succeed.
% 2.76/1.36 % (628686)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-628667"
% 2.76/1.36 % (628688)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1394497590:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.76/1.36 % (628687)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1959220513:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.76/1.36 % (628688)Also succeeded, but the first one will report.
% 2.76/1.36 % (628689)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=121658552:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 2.76/1.36 % (628687)Instruction limit reached!
% 2.76/1.36 % (628687)------------------------------
% 2.76/1.36 % (628687)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.76/1.36 % (628687)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.76/1.36 % (628687)CaDiCaL version: 2.1.3
% 2.76/1.36 % (628687)Termination reason: Instruction limit
% 2.76/1.36 % (628687)Termination phase: Saturation
% 2.76/1.36 % (628687)Time elapsed: 0.078 s
% 2.76/1.36 % (628687)Peak memory usage: 92 MB
% 2.76/1.36 % (628687)Instructions burned: 159 (million)
% 2.76/1.36 % (628686)Refutation found. Thanks to Tanya!
% 2.76/1.36 % SZS status Theorem for theBenchmark
% 2.76/1.36 % SZS output start Proof for theBenchmark
% See solution above
% 3.99/1.48 % (628686)------------------------------
% 3.99/1.48 % (628686)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.99/1.48 % (628686)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.99/1.48 % (628686)CaDiCaL version: 2.1.3
% 3.99/1.48 % (628686)Termination reason: Refutation
% 3.99/1.48 % (628686)Time elapsed: 0.008 s
% 3.99/1.48 % (628686)Peak memory usage: 90 MB
% 3.99/1.48 % (628686)Instructions burned: 19 (million)
% 3.99/1.48 % (628686)------------------------------
% 3.99/1.48 % (628686)------------------------------
% 3.99/1.48 % (628667)Success in time 0.504 s
% 3.99/1.48 % Vampire exiting
%------------------------------------------------------------------------------