%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX062+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:45:47 PM UTC 2026
% Result : Theorem 3.07s 1.06s
% Output : Refutation 3.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 19
% Syntax : Number of formulae : 111 ( 23 unt; 9 def)
% Number of atoms : 280 ( 79 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 286 ( 117 ~; 134 |; 16 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 87 ( 0 sgn 73 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f199,axiom,
! [X0] : list_succeeds(cons(X0,nil)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(list:1)') ).
fof(f218,axiom,
! [X0] : '**'(nil,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(app:nil)') ).
fof(f219,axiom,
! [X0,X1,X2] :
( list_succeeds(X1)
=> '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(app:cons)') ).
fof(f220,axiom,
! [X0,X1] :
( ( list_succeeds(X0)
& list_succeeds(X1) )
=> list_succeeds('**'(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','axiom-(app:types:1)') ).
fof(f342,axiom,
rev(nil) = nil,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:nil)') ).
fof(f343,axiom,
! [X0] :
( list_succeeds(X0)
=> list_succeeds(rev(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:types)') ).
fof(f344,axiom,
! [X0,X1] :
( list_succeeds(X1)
=> rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:cons)') ).
fof(f350,axiom,
! [X0] : rev(cons(X0,nil)) = cons(X0,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','corollary-(rev:1)') ).
fof(f353,axiom,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3] : rev('**'(X2,cons(X3,nil))) = cons(X3,rev(X2)) )
| X0 = nil )
=> ! [X3] : rev('**'(X0,cons(X3,nil))) = cons(X3,rev(X0)) )
=> ! [X0] :
( list_succeeds(X0)
=> ! [X3] : rev('**'(X0,cons(X3,nil))) = cons(X3,rev(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',induction) ).
fof(f354,conjecture,
! [X0,X1] :
( list_succeeds(X0)
=> rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','lemma-(rev:app)') ).
fof(f355,negated_conjecture,
~ ! [X0,X1] :
( list_succeeds(X0)
=> rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0)) ),
inference(negated_conjecture,[status(cth)],[f354]) ).
fof(f356,plain,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3] : rev('**'(X2,cons(X3,nil))) = cons(X3,rev(X2)) )
| X0 = nil )
=> ! [X4] : rev('**'(X0,cons(X4,nil))) = cons(X4,rev(X0)) )
=> ! [X5] :
( list_succeeds(X5)
=> ! [X6] : rev('**'(X5,cons(X6,nil))) = cons(X6,rev(X5)) ) ),
inference(rectify,[],[f353]) ).
fof(f357,plain,
? [X0,X1] :
( rev('**'(X0,cons(X1,nil))) != cons(X1,rev(X0))
& list_succeeds(X0) ),
inference(ennf_transformation,[],[f355]) ).
fof(f372,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f220]) ).
fof(f373,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(flattening,[],[f372]) ).
fof(f374,plain,
! [X0,X1,X2] :
( '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2))
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f219]) ).
fof(f375,plain,
( ! [X5] :
( ! [X6] : rev('**'(X5,cons(X6,nil))) = cons(X6,rev(X5))
| ~ list_succeeds(X5) )
| ? [X0] :
( ? [X4] : rev('**'(X0,cons(X4,nil))) != cons(X4,rev(X0))
& ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3] : rev('**'(X2,cons(X3,nil))) = cons(X3,rev(X2)) )
| X0 = nil ) ) ),
inference(ennf_transformation,[],[f356]) ).
fof(f376,plain,
! [X0,X1] :
( rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil))
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f344]) ).
fof(f377,plain,
! [X0] :
( list_succeeds(rev(X0))
| ~ list_succeeds(X0) ),
inference(ennf_transformation,[],[f343]) ).
fof(f379,plain,
( rev('**'(sK0,cons(sK1,nil))) != cons(sK1,rev(sK0))
& list_succeeds(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f357]) ).
fof(f384,plain,
( ! [X0] :
( ! [X1] : rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0) )
| ? [X2] :
( ? [X3] : rev('**'(X2,cons(X3,nil))) != cons(X3,rev(X2))
& ( ? [X4,X5] :
( cons(X4,X5) = X2
& list_succeeds(X5)
& ! [X6] : rev('**'(X5,cons(X6,nil))) = cons(X6,rev(X5)) )
| nil = X2 ) ) ),
inference(rectify,[],[f375]) ).
fof(f385,plain,
( ! [X0] :
( ! [X1] : rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0) )
| ( rev('**'(sK4,cons(sK5,nil))) != cons(sK5,rev(sK4))
& ( ( sK4 = cons(sK6,sK7)
& list_succeeds(sK7)
& ! [X6] : rev('**'(sK7,cons(X6,nil))) = cons(X6,rev(sK7)) )
| nil = sK4 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X2,sK4),skolemize(X3,sK5),skolemize(X4,sK6),skolemize(X5,sK7)],[f384]) ).
fof(f387,plain,
list_succeeds(sK0),
inference(cnf_transformation,[],[f379]) ).
fof(f388,plain,
rev('**'(sK0,cons(sK1,nil))) != cons(sK1,rev(sK0)),
inference(cnf_transformation,[],[f379]) ).
fof(f391,plain,
! [X0] : list_succeeds(cons(X0,nil)),
inference(cnf_transformation,[],[f199]) ).
fof(f408,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f373]) ).
fof(f409,plain,
! [X2,X0,X1] :
( '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2))
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f374]) ).
fof(f410,plain,
! [X0] : '**'(nil,X0) = X0,
inference(cnf_transformation,[],[f218]) ).
fof(f411,plain,
! [X0,X1,X6] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| rev('**'(sK7,cons(X6,nil))) = cons(X6,rev(sK7))
| nil = sK4 ),
inference(cnf_transformation,[],[f385]) ).
fof(f412,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| list_succeeds(sK7)
| nil = sK4 ),
inference(cnf_transformation,[],[f385]) ).
fof(f413,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| sK4 = cons(sK6,sK7)
| nil = sK4 ),
inference(cnf_transformation,[],[f385]) ).
fof(f414,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| rev('**'(sK4,cons(sK5,nil))) != cons(sK5,rev(sK4)) ),
inference(cnf_transformation,[],[f385]) ).
fof(f417,plain,
! [X0] : cons(X0,nil) = rev(cons(X0,nil)),
inference(cnf_transformation,[],[f350]) ).
fof(f418,plain,
! [X0,X1] :
( rev(cons(X0,X1)) = '**'(rev(X1),cons(X0,nil))
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f376]) ).
fof(f419,plain,
! [X0] :
( list_succeeds(rev(X0))
| ~ list_succeeds(X0) ),
inference(cnf_transformation,[],[f377]) ).
fof(f420,plain,
nil = rev(nil),
inference(cnf_transformation,[],[f342]) ).
fof(f423,definition,
~ sP8(rev('**'(sK0,cons(sK1,nil)))),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
fof(f424,plain,
sP8(cons(sK1,rev(sK0))),
inference(inequality_splitting,[],[f388,f423]) ).
fof(f431,definition,
~ sP12(rev('**'(sK4,cons(sK5,nil)))),
introduced(definition,[new_symbols(definition,[sP12])],[inequality_splitting_name_introduction]) ).
fof(f432,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| sP12(cons(sK5,rev(sK4))) ),
inference(inequality_splitting,[],[f414,f431]) ).
fof(f435,plain,
! [X6] :
( rev('**'(sK7,cons(X6,nil))) = cons(X6,rev(sK7))
| sP13 ),
inference(cnf_transformation,[],[f435_D]) ).
fof(f435_D,definition,
( ! [X6] : rev('**'(sK7,cons(X6,nil))) = cons(X6,rev(sK7))
<=> ~ sP13 ),
introduced(definition,[new_symbols(definition,[sP13])],[general_splitting_component_introduction]) ).
fof(f436,plain,
! [X0,X1] :
( rev('**'(X0,cons(X1,nil))) = cons(X1,rev(X0))
| ~ list_succeeds(X0)
| nil = sK4
| ~ sP13 ),
inference(general_splitting,[],[f411,f435_D]) ).
fof(f437,plain,
( ~ sP8(cons(sK1,rev(sK0)))
| ~ list_succeeds(sK0)
| list_succeeds(sK7)
| nil = sK4 ),
inference(superposition,[],[f423,f412]) ).
fof(f438,plain,
( ~ sP8(cons(sK1,rev(sK0)))
| ~ list_succeeds(sK0)
| sK4 = cons(sK6,sK7)
| nil = sK4 ),
inference(superposition,[],[f423,f413]) ).
fof(f439,plain,
( ~ sP8(cons(sK1,rev(sK0)))
| ~ list_succeeds(sK0)
| sP12(cons(sK5,rev(sK4))) ),
inference(superposition,[],[f423,f432]) ).
fof(f440,plain,
( ~ sP8(cons(sK1,rev(sK0)))
| ~ list_succeeds(sK0)
| nil = sK4
| ~ sP13 ),
inference(superposition,[],[f423,f436]) ).
fof(f441,plain,
( ~ list_succeeds(sK0)
| nil = sK4
| ~ sP13 ),
inference(forward_subsumption_resolution,[],[f440,f424]) ).
fof(f442,plain,
( ~ list_succeeds(sK0)
| sP12(cons(sK5,rev(sK4))) ),
inference(forward_subsumption_resolution,[],[f439,f424]) ).
fof(f443,plain,
( ~ list_succeeds(sK0)
| sK4 = cons(sK6,sK7)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f438,f424]) ).
fof(f444,plain,
( ~ list_succeeds(sK0)
| list_succeeds(sK7)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f437,f424]) ).
fof(f445,plain,
( nil = sK4
| ~ sP13 ),
inference(forward_subsumption_resolution,[],[f441,f387]) ).
fof(f446,plain,
sP12(cons(sK5,rev(sK4))),
inference(forward_subsumption_resolution,[],[f442,f387]) ).
fof(f447,plain,
( sK4 = cons(sK6,sK7)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f443,f387]) ).
fof(f448,plain,
( list_succeeds(sK7)
| nil = sK4 ),
inference(forward_subsumption_resolution,[],[f444,f387]) ).
fof(f450,definition,
( spl14_1
<=> sP13 ),
introduced(definition,[new_symbols(definition,[spl14_1])],[avatar_definition]) ).
fof(f452,plain,
( ~ sP13
| spl14_1 ),
inference(avatar_component_clause,[],[f450]) ).
fof(f454,definition,
( spl14_2
<=> nil = sK4 ),
introduced(definition,[new_symbols(definition,[spl14_2])],[avatar_definition]) ).
fof(f456,plain,
( nil = sK4
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f454]) ).
fof(f457,plain,
( ~ spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f445,f454,f450]) ).
fof(f459,definition,
( spl14_3
<=> sK4 = cons(sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl14_3])],[avatar_definition]) ).
fof(f461,plain,
( sK4 = cons(sK6,sK7)
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f459]) ).
fof(f462,plain,
( spl14_2
| spl14_3 ),
inference(avatar_split_clause,[],[f447,f459,f454]) ).
fof(f464,definition,
( spl14_4
<=> list_succeeds(sK7) ),
introduced(definition,[new_symbols(definition,[spl14_4])],[avatar_definition]) ).
fof(f466,plain,
( list_succeeds(sK7)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f467,plain,
( spl14_2
| spl14_4 ),
inference(avatar_split_clause,[],[f448,f464,f454]) ).
fof(f472,plain,
( ! [X0] : '**'(sK4,X0) = X0
| ~ spl14_2 ),
inference(superposition,[],[f410,f456]) ).
fof(f476,plain,
( sK4 = rev(sK4)
| ~ spl14_2 ),
inference(superposition,[],[f420,f456]) ).
fof(f490,plain,
( sP12(cons(sK5,sK4))
| ~ spl14_2 ),
inference(superposition,[],[f446,f476]) ).
fof(f502,plain,
( ~ sP12(rev(cons(sK5,nil)))
| ~ spl14_2 ),
inference(superposition,[],[f431,f472]) ).
fof(f507,plain,
( ~ sP12(cons(sK5,nil))
| ~ spl14_2 ),
inference(forward_demodulation,[],[f502,f417]) ).
fof(f511,plain,
( ~ sP12(cons(sK5,sK4))
| ~ spl14_2 ),
inference(forward_demodulation,[],[f507,f456]) ).
fof(f520,plain,
( $false
| ~ spl14_2 ),
inference(forward_subsumption_resolution,[],[f511,f490]) ).
fof(f521,plain,
~ spl14_2,
inference(avatar_contradiction_clause,[],[f520]) ).
fof(f527,plain,
( ! [X0] :
( '**'(sK4,X0) = cons(sK6,'**'(sK7,X0))
| ~ list_succeeds(sK7) )
| ~ spl14_3 ),
inference(superposition,[],[f409,f461]) ).
fof(f528,plain,
( rev(sK4) = '**'(rev(sK7),cons(sK6,nil))
| ~ list_succeeds(sK7)
| ~ spl14_3 ),
inference(superposition,[],[f418,f461]) ).
fof(f532,plain,
( rev(sK4) = '**'(rev(sK7),cons(sK6,nil))
| ~ spl14_3
| ~ spl14_4 ),
inference(forward_subsumption_resolution,[],[f528,f466]) ).
fof(f533,plain,
( ! [X0] : '**'(sK4,X0) = cons(sK6,'**'(sK7,X0))
| ~ spl14_3
| ~ spl14_4 ),
inference(forward_subsumption_resolution,[],[f527,f466]) ).
fof(f536,plain,
( sP12(cons(sK5,'**'(rev(sK7),cons(sK6,nil))))
| ~ spl14_3
| ~ spl14_4 ),
inference(superposition,[],[f446,f532]) ).
fof(f549,plain,
( ~ sP12(rev(cons(sK6,'**'(sK7,cons(sK5,nil)))))
| ~ spl14_3
| ~ spl14_4 ),
inference(superposition,[],[f431,f533]) ).
fof(f651,plain,
( ~ sP12('**'(rev('**'(sK7,cons(sK5,nil))),cons(sK6,nil)))
| ~ list_succeeds('**'(sK7,cons(sK5,nil)))
| ~ spl14_3
| ~ spl14_4 ),
inference(superposition,[],[f549,f418]) ).
fof(f653,definition,
( spl14_12
<=> list_succeeds('**'(sK7,cons(sK5,nil))) ),
introduced(definition,[new_symbols(definition,[spl14_12])],[avatar_definition]) ).
fof(f655,plain,
( ~ list_succeeds('**'(sK7,cons(sK5,nil)))
| spl14_12 ),
inference(avatar_component_clause,[],[f653]) ).
fof(f657,definition,
( spl14_13
<=> sP12('**'(rev('**'(sK7,cons(sK5,nil))),cons(sK6,nil))) ),
introduced(definition,[new_symbols(definition,[spl14_13])],[avatar_definition]) ).
fof(f659,plain,
( ~ sP12('**'(rev('**'(sK7,cons(sK5,nil))),cons(sK6,nil)))
| spl14_13 ),
inference(avatar_component_clause,[],[f657]) ).
fof(f660,plain,
( ~ spl14_12
| ~ spl14_13
| ~ spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f651,f464,f459,f657,f653]) ).
fof(f662,plain,
( ~ list_succeeds(sK7)
| ~ list_succeeds(cons(sK5,nil))
| spl14_12 ),
inference(resolution,[],[f655,f408]) ).
fof(f663,plain,
( ~ list_succeeds(cons(sK5,nil))
| ~ spl14_4
| spl14_12 ),
inference(forward_subsumption_resolution,[],[f662,f466]) ).
fof(f666,plain,
( $false
| ~ spl14_4
| spl14_12 ),
inference(forward_subsumption_resolution,[],[f663,f391]) ).
fof(f667,plain,
( ~ spl14_4
| spl14_12 ),
inference(avatar_contradiction_clause,[],[f666]) ).
fof(f784,plain,
( ~ sP12('**'(cons(sK5,rev(sK7)),cons(sK6,nil)))
| sP13
| spl14_13 ),
inference(superposition,[],[f659,f435]) ).
fof(f789,plain,
( ~ sP12('**'(cons(sK5,rev(sK7)),cons(sK6,nil)))
| spl14_1
| spl14_13 ),
inference(forward_subsumption_resolution,[],[f784,f452]) ).
fof(f790,plain,
( ~ sP12(cons(sK5,'**'(rev(sK7),cons(sK6,nil))))
| ~ list_succeeds(rev(sK7))
| spl14_1
| spl14_13 ),
inference(superposition,[],[f789,f409]) ).
fof(f791,plain,
( ~ list_succeeds(rev(sK7))
| spl14_1
| ~ spl14_3
| ~ spl14_4
| spl14_13 ),
inference(forward_subsumption_resolution,[],[f790,f536]) ).
fof(f806,plain,
( ~ list_succeeds(sK7)
| spl14_1
| ~ spl14_3
| ~ spl14_4
| spl14_13 ),
inference(resolution,[],[f791,f419]) ).
fof(f807,plain,
( $false
| spl14_1
| ~ spl14_3
| ~ spl14_4
| spl14_13 ),
inference(forward_subsumption_resolution,[],[f806,f466]) ).
fof(f808,plain,
( spl14_1
| ~ spl14_3
| ~ spl14_4
| spl14_13 ),
inference(avatar_contradiction_clause,[],[f807]) ).
cnf(s1,plain,
( ~ spl14_1
| spl14_2 ),
inference(sat_conversion,[],[f457]) ).
cnf(s2,plain,
( spl14_2
| spl14_3 ),
inference(sat_conversion,[],[f462]) ).
cnf(s3,plain,
( spl14_2
| spl14_4 ),
inference(sat_conversion,[],[f467]) ).
cnf(s6,plain,
~ spl14_2,
inference(sat_conversion,[],[f521]) ).
cnf(s10,plain,
( ~ spl14_3
| ~ spl14_4
| ~ spl14_12
| ~ spl14_13 ),
inference(sat_conversion,[],[f660]) ).
cnf(s12,plain,
( ~ spl14_4
| spl14_12 ),
inference(sat_conversion,[],[f667]) ).
cnf(s13,plain,
( spl14_1
| ~ spl14_3
| ~ spl14_4
| spl14_13 ),
inference(sat_conversion,[],[f808]) ).
cnf(s14,plain,
spl14_4,
inference(rat,[],[s3,s6]) ).
cnf(s15,plain,
spl14_12,
inference(rat,[],[s12,s14]) ).
cnf(s16,plain,
spl14_3,
inference(rat,[],[s2,s6]) ).
cnf(s17,plain,
~ spl14_13,
inference(rat,[],[s10,s14,s15,s16]) ).
cnf(s18,plain,
spl14_1,
inference(rat,[],[s13,s16,s14,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s1,s6,s18]) ).
fof(f809,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX062+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n026.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 15:00:27 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running first-order theorem proving
% 0.07/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
% 3.07/1.06 % (3911612)Detected formulas, will run a generic FOF schedule.
% 3.07/1.06 % (3911619)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=2885837148:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.07/1.06 % (3911622)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2580598607:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.07/1.06 % (3911620)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2821292537:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.07/1.06 % (3911617)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=1715176850:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.07/1.06 % (3911618)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=2095310555:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.07/1.06 % (3911620)First to succeed.
% 3.07/1.06 % (3911621)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=209174865:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.07/1.06 % (3911620)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3911612"
% 3.07/1.06 % (3911623)dis-21_1_sil=8000:lcm=predicate:random_seed=2311362338: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.07/1.06 % (3911621)Instruction limit reached!
% 3.07/1.06 % (3911621)------------------------------
% 3.07/1.06 % (3911621)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.06 % (3911621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.06 % (3911621)CaDiCaL version: 2.1.3
% 3.07/1.06 % (3911621)Termination reason: Instruction limit
% 3.07/1.06 % (3911621)Termination phase: Saturation
% 3.07/1.06 % (3911621)Time elapsed: 0.074 s
% 3.07/1.06 % (3911621)Peak memory usage: 89 MB
% 3.07/1.06 % (3911621)Instructions burned: 119 (million)
% 3.07/1.06 % (3911623)Instruction limit reached!
% 3.07/1.06 % (3911623)------------------------------
% 3.07/1.06 % (3911623)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.06 % (3911623)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.06 % (3911623)CaDiCaL version: 2.1.3
% 3.07/1.06 % (3911623)Termination reason: Instruction limit
% 3.07/1.06 % (3911623)Termination phase: Saturation
% 3.07/1.06 % (3911623)Time elapsed: 0.079 s
% 3.07/1.06 % (3911623)Peak memory usage: 89 MB
% 3.07/1.06 % (3911623)Instructions burned: 130 (million)
% 3.07/1.06 % (3911622)Instruction limit reached!
% 3.07/1.06 % (3911622)------------------------------
% 3.07/1.06 % (3911622)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.07/1.06 % (3911622)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.07/1.06 % (3911622)CaDiCaL version: 2.1.3
% 3.07/1.06 % (3911622)Termination reason: Instruction limit
% 3.07/1.06 % (3911622)Termination phase: Saturation
% 3.07/1.06 % (3911622)Time elapsed: 0.099 s
% 3.07/1.06 % (3911622)Peak memory usage: 91 MB
% 3.07/1.06 % (3911622)Instructions burned: 139 (million)
% 3.07/1.06 % (3911631)lrs+10_1_sil=8000:sp=occurrence:random_seed=1730974341:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.07/1.06 % (3911633)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2687043369:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.07/1.06 % (3911632)lrs+10_1_sil=32000:urr=on:br=off:random_seed=3987525718:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.07/1.06 % (3911620)Refutation found. Thanks to Tanya!
% 3.07/1.06 % SZS status Theorem for theBenchmark
% 3.07/1.06 % SZS output start Proof for theBenchmark
% See solution above
% 3.48/1.26 % (3911620)------------------------------
% 3.48/1.26 % (3911620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.48/1.26 % (3911620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.48/1.26 % (3911620)CaDiCaL version: 2.1.3
% 3.48/1.26 % (3911620)Termination reason: Refutation
% 3.48/1.26 % (3911620)Time elapsed: 0.013 s
% 3.48/1.26 % (3911620)Peak memory usage: 90 MB
% 3.48/1.26 % (3911620)Instructions burned: 16 (million)
% 3.48/1.26 % (3911620)------------------------------
% 3.48/1.26 % (3911620)------------------------------
% 3.48/1.26 % (3911612)Success in time 0.412 s
% 3.48/1.26 % Vampire exiting
%------------------------------------------------------------------------------