%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWX022+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:41 PM UTC 2026
% Result : Theorem 3.11s 1.08s
% Output : Refutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 15
% Syntax : Number of formulae : 109 ( 19 unt; 10 def)
% Number of atoms : 325 ( 75 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 366 ( 150 ~; 167 |; 25 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 90 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f181,axiom,
! [X0] : '**'(nil,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','corollary-(app:nil)') ).
fof(f182,axiom,
! [X0,X1,X2] :
( list_succeeds(X1)
=> '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','corollary-(app:cons)') ).
fof(f183,axiom,
! [X0,X1] :
( ( list_succeeds(X0)
& list_succeeds(X1) )
=> list_succeeds('**'(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','corollary-(app:types:1)') ).
fof(f187,axiom,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3,X4] :
( list_succeeds(X3)
=> '**'('**'(X2,X3),X4) = '**'(X2,'**'(X3,X4)) ) )
| X0 = nil )
=> ! [X3,X4] :
( list_succeeds(X3)
=> '**'('**'(X0,X3),X4) = '**'(X0,'**'(X3,X4)) ) )
=> ! [X0] :
( list_succeeds(X0)
=> ! [X3,X4] :
( list_succeeds(X3)
=> '**'('**'(X0,X3),X4) = '**'(X0,'**'(X3,X4)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',induction) ).
fof(f188,conjecture,
! [X0,X1,X2] :
( ( list_succeeds(X0)
& list_succeeds(X1) )
=> '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','theorem-(app:associative)') ).
fof(f189,negated_conjecture,
~ ! [X0,X1,X2] :
( ( list_succeeds(X0)
& list_succeeds(X1) )
=> '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f188]) ).
fof(f190,plain,
( ! [X0] :
( ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3,X4] :
( list_succeeds(X3)
=> '**'('**'(X2,X3),X4) = '**'(X2,'**'(X3,X4)) ) )
| X0 = nil )
=> ! [X5,X6] :
( list_succeeds(X5)
=> '**'('**'(X0,X5),X6) = '**'(X0,'**'(X5,X6)) ) )
=> ! [X7] :
( list_succeeds(X7)
=> ! [X8,X9] :
( list_succeeds(X8)
=> '**'('**'(X7,X8),X9) = '**'(X7,'**'(X8,X9)) ) ) ),
inference(rectify,[],[f187]) ).
fof(f191,plain,
? [X0,X1,X2] :
( '**'('**'(X0,X1),X2) != '**'(X0,'**'(X1,X2))
& list_succeeds(X0)
& list_succeeds(X1) ),
inference(ennf_transformation,[],[f189]) ).
fof(f192,plain,
? [X0,X1,X2] :
( '**'('**'(X0,X1),X2) != '**'(X0,'**'(X1,X2))
& list_succeeds(X0)
& list_succeeds(X1) ),
inference(flattening,[],[f191]) ).
fof(f193,plain,
( ! [X7] :
( ! [X8,X9] :
( '**'('**'(X7,X8),X9) = '**'(X7,'**'(X8,X9))
| ~ list_succeeds(X8) )
| ~ list_succeeds(X7) )
| ? [X0] :
( ? [X5,X6] :
( '**'('**'(X0,X5),X6) != '**'(X0,'**'(X5,X6))
& list_succeeds(X5) )
& ( ? [X1,X2] :
( X0 = cons(X1,X2)
& list_succeeds(X2)
& ! [X3,X4] :
( '**'('**'(X2,X3),X4) = '**'(X2,'**'(X3,X4))
| ~ list_succeeds(X3) ) )
| X0 = nil ) ) ),
inference(ennf_transformation,[],[f190]) ).
fof(f200,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f183]) ).
fof(f201,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(flattening,[],[f200]) ).
fof(f202,plain,
! [X0,X1,X2] :
( '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2))
| ~ list_succeeds(X1) ),
inference(ennf_transformation,[],[f182]) ).
fof(f205,plain,
( '**'('**'(sK0,sK1),sK2) != '**'(sK0,'**'(sK1,sK2))
& list_succeeds(sK0)
& list_succeeds(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f192]) ).
fof(f206,plain,
( ! [X0] :
( ! [X1,X2] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1) )
| ~ list_succeeds(X0) )
| ? [X3] :
( ? [X4,X5] :
( '**'('**'(X3,X4),X5) != '**'(X3,'**'(X4,X5))
& list_succeeds(X4) )
& ( ? [X6,X7] :
( cons(X6,X7) = X3
& list_succeeds(X7)
& ! [X8,X9] :
( '**'('**'(X7,X8),X9) = '**'(X7,'**'(X8,X9))
| ~ list_succeeds(X8) ) )
| nil = X3 ) ) ),
inference(rectify,[],[f193]) ).
fof(f207,plain,
( ! [X0] :
( ! [X1,X2] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1) )
| ~ list_succeeds(X0) )
| ( '**'('**'(sK3,sK4),sK5) != '**'(sK3,'**'(sK4,sK5))
& list_succeeds(sK4)
& ( ( sK3 = cons(sK6,sK7)
& list_succeeds(sK7)
& ! [X8,X9] :
( '**'('**'(sK7,X8),X9) = '**'(sK7,'**'(X8,X9))
| ~ list_succeeds(X8) ) )
| nil = sK3 ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7]),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7)],[f206]) ).
fof(f209,plain,
list_succeeds(sK1),
inference(cnf_transformation,[],[f205]) ).
fof(f210,plain,
list_succeeds(sK0),
inference(cnf_transformation,[],[f205]) ).
fof(f211,plain,
'**'('**'(sK0,sK1),sK2) != '**'(sK0,'**'(sK1,sK2)),
inference(cnf_transformation,[],[f205]) ).
fof(f212,plain,
! [X2,X0,X1,X8,X9] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| '**'('**'(sK7,X8),X9) = '**'(sK7,'**'(X8,X9))
| ~ list_succeeds(X8)
| nil = sK3 ),
inference(cnf_transformation,[],[f207]) ).
fof(f213,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| list_succeeds(sK7)
| nil = sK3 ),
inference(cnf_transformation,[],[f207]) ).
fof(f214,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| sK3 = cons(sK6,sK7)
| nil = sK3 ),
inference(cnf_transformation,[],[f207]) ).
fof(f215,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| list_succeeds(sK4) ),
inference(cnf_transformation,[],[f207]) ).
fof(f216,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| '**'('**'(sK3,sK4),sK5) != '**'(sK3,'**'(sK4,sK5)) ),
inference(cnf_transformation,[],[f207]) ).
fof(f221,plain,
! [X0,X1] :
( list_succeeds('**'(X0,X1))
| ~ list_succeeds(X0)
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f201]) ).
fof(f222,plain,
! [X2,X0,X1] :
( '**'(cons(X0,X1),X2) = cons(X0,'**'(X1,X2))
| ~ list_succeeds(X1) ),
inference(cnf_transformation,[],[f202]) ).
fof(f223,plain,
! [X0] : '**'(nil,X0) = X0,
inference(cnf_transformation,[],[f181]) ).
fof(f227,definition,
~ sP8('**'('**'(sK0,sK1),sK2)),
introduced(definition,[new_symbols(definition,[sP8])],[inequality_splitting_name_introduction]) ).
fof(f228,plain,
sP8('**'(sK0,'**'(sK1,sK2))),
inference(inequality_splitting,[],[f211,f227]) ).
fof(f229,definition,
~ sP9('**'('**'(sK3,sK4),sK5)),
introduced(definition,[new_symbols(definition,[sP9])],[inequality_splitting_name_introduction]) ).
fof(f230,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| sP9('**'(sK3,'**'(sK4,sK5))) ),
inference(inequality_splitting,[],[f216,f229]) ).
fof(f232,plain,
! [X8,X9] :
( '**'('**'(sK7,X8),X9) = '**'(sK7,'**'(X8,X9))
| ~ list_succeeds(X8)
| sP10(X9) ),
inference(cnf_transformation,[],[f232_D]) ).
fof(f232_D,definition,
! [X9] :
( ! [X8] :
( '**'('**'(sK7,X8),X9) = '**'(sK7,'**'(X8,X9))
| ~ list_succeeds(X8) )
<=> ~ sP10(X9) ),
introduced(definition,[new_symbols(definition,[sP10])],[general_splitting_component_introduction]) ).
fof(f233,plain,
! [X2,X0,X1,X9] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| nil = sK3
| ~ sP10(X9) ),
inference(general_splitting,[],[f212,f232_D]) ).
fof(f234,plain,
! [X9] :
( ~ sP10(X9)
| sP11 ),
inference(cnf_transformation,[],[f234_D]) ).
fof(f234_D,definition,
( ! [X9] : ~ sP10(X9)
<=> ~ sP11 ),
introduced(definition,[new_symbols(definition,[sP11])],[general_splitting_component_introduction]) ).
fof(f235,plain,
! [X2,X0,X1] :
( '**'('**'(X0,X1),X2) = '**'(X0,'**'(X1,X2))
| ~ list_succeeds(X1)
| ~ list_succeeds(X0)
| nil = sK3
| ~ sP11 ),
inference(general_splitting,[],[f233,f234_D]) ).
fof(f236,plain,
( ~ sP8('**'(sK0,'**'(sK1,sK2)))
| ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| list_succeeds(sK7)
| nil = sK3 ),
inference(superposition,[],[f227,f213]) ).
fof(f237,plain,
( ~ sP8('**'(sK0,'**'(sK1,sK2)))
| ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| sK3 = cons(sK6,sK7)
| nil = sK3 ),
inference(superposition,[],[f227,f214]) ).
fof(f238,plain,
( ~ sP8('**'(sK0,'**'(sK1,sK2)))
| ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| list_succeeds(sK4) ),
inference(superposition,[],[f227,f215]) ).
fof(f239,plain,
( ~ sP8('**'(sK0,'**'(sK1,sK2)))
| ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| sP9('**'(sK3,'**'(sK4,sK5))) ),
inference(superposition,[],[f227,f230]) ).
fof(f240,plain,
( ~ sP8('**'(sK0,'**'(sK1,sK2)))
| ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| nil = sK3
| ~ sP11 ),
inference(superposition,[],[f227,f235]) ).
fof(f241,plain,
( ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| nil = sK3
| ~ sP11 ),
inference(forward_subsumption_resolution,[],[f240,f228]) ).
fof(f242,plain,
( ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| sP9('**'(sK3,'**'(sK4,sK5))) ),
inference(forward_subsumption_resolution,[],[f239,f228]) ).
fof(f243,plain,
( ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| list_succeeds(sK4) ),
inference(forward_subsumption_resolution,[],[f238,f228]) ).
fof(f244,plain,
( ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| sK3 = cons(sK6,sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f237,f228]) ).
fof(f245,plain,
( ~ list_succeeds(sK1)
| ~ list_succeeds(sK0)
| list_succeeds(sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f236,f228]) ).
fof(f246,plain,
( ~ list_succeeds(sK0)
| nil = sK3
| ~ sP11 ),
inference(forward_subsumption_resolution,[],[f241,f209]) ).
fof(f247,plain,
( ~ list_succeeds(sK0)
| sP9('**'(sK3,'**'(sK4,sK5))) ),
inference(forward_subsumption_resolution,[],[f242,f209]) ).
fof(f248,plain,
( ~ list_succeeds(sK0)
| list_succeeds(sK4) ),
inference(forward_subsumption_resolution,[],[f243,f209]) ).
fof(f249,plain,
( ~ list_succeeds(sK0)
| sK3 = cons(sK6,sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f244,f209]) ).
fof(f250,plain,
( ~ list_succeeds(sK0)
| list_succeeds(sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f245,f209]) ).
fof(f251,plain,
( nil = sK3
| ~ sP11 ),
inference(forward_subsumption_resolution,[],[f246,f210]) ).
fof(f252,plain,
sP9('**'(sK3,'**'(sK4,sK5))),
inference(forward_subsumption_resolution,[],[f247,f210]) ).
fof(f253,plain,
list_succeeds(sK4),
inference(forward_subsumption_resolution,[],[f248,f210]) ).
fof(f254,plain,
( sK3 = cons(sK6,sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f249,f210]) ).
fof(f255,plain,
( list_succeeds(sK7)
| nil = sK3 ),
inference(forward_subsumption_resolution,[],[f250,f210]) ).
fof(f257,definition,
( spl12_1
<=> sP11 ),
introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition]) ).
fof(f259,plain,
( ~ sP11
| spl12_1 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f261,definition,
( spl12_2
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition]) ).
fof(f263,plain,
( nil = sK3
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f251,f261,f257]) ).
fof(f266,definition,
( spl12_3
<=> sK3 = cons(sK6,sK7) ),
introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition]) ).
fof(f268,plain,
( sK3 = cons(sK6,sK7)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f269,plain,
( spl12_2
| spl12_3 ),
inference(avatar_split_clause,[],[f254,f266,f261]) ).
fof(f271,definition,
( spl12_4
<=> list_succeeds(sK7) ),
introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition]) ).
fof(f273,plain,
( list_succeeds(sK7)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f274,plain,
( spl12_2
| spl12_4 ),
inference(avatar_split_clause,[],[f255,f271,f261]) ).
fof(f275,plain,
( ! [X0] : '**'(sK3,X0) = X0
| ~ spl12_2 ),
inference(superposition,[],[f223,f263]) ).
fof(f276,plain,
( ~ sP9('**'(sK4,sK5))
| ~ spl12_2 ),
inference(superposition,[],[f229,f275]) ).
fof(f299,plain,
( sP9('**'(sK4,sK5))
| ~ spl12_2 ),
inference(superposition,[],[f252,f275]) ).
fof(f300,plain,
( $false
| ~ spl12_2 ),
inference(forward_subsumption_resolution,[],[f299,f276]) ).
fof(f301,plain,
~ spl12_2,
inference(avatar_contradiction_clause,[],[f300]) ).
fof(f303,plain,
( sP9('**'(cons(sK6,sK7),'**'(sK4,sK5)))
| ~ spl12_3 ),
inference(superposition,[],[f252,f268]) ).
fof(f304,plain,
( ~ sP9('**'('**'(cons(sK6,sK7),sK4),sK5))
| ~ spl12_3 ),
inference(superposition,[],[f229,f268]) ).
fof(f305,plain,
( sP9(cons(sK6,'**'(sK7,'**'(sK4,sK5))))
| ~ list_succeeds(sK7)
| ~ spl12_3 ),
inference(superposition,[],[f303,f222]) ).
fof(f306,plain,
( sP9(cons(sK6,'**'(sK7,'**'(sK4,sK5))))
| ~ spl12_3
| ~ spl12_4 ),
inference(forward_subsumption_resolution,[],[f305,f273]) ).
fof(f307,plain,
( ~ sP9('**'(cons(sK6,'**'(sK7,sK4)),sK5))
| ~ list_succeeds(sK7)
| ~ spl12_3 ),
inference(superposition,[],[f304,f222]) ).
fof(f313,plain,
( ~ sP9('**'(cons(sK6,'**'(sK7,sK4)),sK5))
| ~ spl12_3
| ~ spl12_4 ),
inference(forward_subsumption_resolution,[],[f307,f273]) ).
fof(f314,plain,
( ~ sP9(cons(sK6,'**'('**'(sK7,sK4),sK5)))
| ~ list_succeeds('**'(sK7,sK4))
| ~ spl12_3
| ~ spl12_4 ),
inference(superposition,[],[f313,f222]) ).
fof(f316,definition,
( spl12_8
<=> list_succeeds('**'(sK7,sK4)) ),
introduced(definition,[new_symbols(definition,[spl12_8])],[avatar_definition]) ).
fof(f318,plain,
( ~ list_succeeds('**'(sK7,sK4))
| spl12_8 ),
inference(avatar_component_clause,[],[f316]) ).
fof(f320,definition,
( spl12_9
<=> sP9(cons(sK6,'**'('**'(sK7,sK4),sK5))) ),
introduced(definition,[new_symbols(definition,[spl12_9])],[avatar_definition]) ).
fof(f322,plain,
( ~ sP9(cons(sK6,'**'('**'(sK7,sK4),sK5)))
| spl12_9 ),
inference(avatar_component_clause,[],[f320]) ).
fof(f323,plain,
( ~ spl12_8
| ~ spl12_9
| ~ spl12_3
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f314,f271,f266,f320,f316]) ).
fof(f324,plain,
( ~ list_succeeds(sK7)
| ~ list_succeeds(sK4)
| spl12_8 ),
inference(resolution,[],[f318,f221]) ).
fof(f325,plain,
( ~ list_succeeds(sK4)
| ~ spl12_4
| spl12_8 ),
inference(forward_subsumption_resolution,[],[f324,f273]) ).
fof(f326,plain,
( $false
| ~ spl12_4
| spl12_8 ),
inference(forward_subsumption_resolution,[],[f325,f253]) ).
fof(f327,plain,
( ~ spl12_4
| spl12_8 ),
inference(avatar_contradiction_clause,[],[f326]) ).
fof(f329,plain,
( ~ sP9(cons(sK6,'**'(sK7,'**'(sK4,sK5))))
| ~ list_succeeds(sK4)
| sP10(sK5)
| spl12_9 ),
inference(superposition,[],[f322,f232]) ).
fof(f335,plain,
( ~ list_succeeds(sK4)
| sP10(sK5)
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(forward_subsumption_resolution,[],[f329,f306]) ).
fof(f336,plain,
( sP10(sK5)
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(forward_subsumption_resolution,[],[f335,f253]) ).
fof(f337,plain,
( sP11
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(resolution,[],[f336,f234]) ).
fof(f338,plain,
( $false
| spl12_1
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(forward_subsumption_resolution,[],[f337,f259]) ).
fof(f339,plain,
( spl12_1
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(avatar_contradiction_clause,[],[f338]) ).
cnf(s1,plain,
( ~ spl12_1
| spl12_2 ),
inference(sat_conversion,[],[f264]) ).
cnf(s2,plain,
( spl12_2
| spl12_3 ),
inference(sat_conversion,[],[f269]) ).
cnf(s3,plain,
( spl12_2
| spl12_4 ),
inference(sat_conversion,[],[f274]) ).
cnf(s5,plain,
~ spl12_2,
inference(sat_conversion,[],[f301]) ).
cnf(s6,plain,
( ~ spl12_3
| ~ spl12_4
| ~ spl12_8
| ~ spl12_9 ),
inference(sat_conversion,[],[f323]) ).
cnf(s7,plain,
( ~ spl12_4
| spl12_8 ),
inference(sat_conversion,[],[f327]) ).
cnf(s8,plain,
( spl12_1
| ~ spl12_3
| ~ spl12_4
| spl12_9 ),
inference(sat_conversion,[],[f339]) ).
cnf(s9,plain,
spl12_4,
inference(rat,[],[s3,s5]) ).
cnf(s10,plain,
spl12_8,
inference(rat,[],[s7,s9]) ).
cnf(s11,plain,
spl12_3,
inference(rat,[],[s2,s5]) ).
cnf(s12,plain,
~ spl12_9,
inference(rat,[],[s6,s9,s10,s11]) ).
cnf(s13,plain,
spl12_1,
inference(rat,[],[s8,s11,s9,s12]) ).
cnf(s14,plain,
$false,
inference(rat,[],[s1,s5,s13]) ).
fof(f340,plain,
$false,
inference(avatar_sat_refutation,[],[s14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWX022+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n015.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 14:55:02 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running first-order theorem proving
% 0.08/0.21 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.11/1.08 % (2691227)Detected formulas, will run a generic FOF schedule.
% 3.11/1.08 % (2691234)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=4025731647:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.11/1.08 % (2691235)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4142322392:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.11/1.08 % (2691236)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2107219305:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.11/1.08 % (2691232)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=827617202:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.11/1.08 % (2691233)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=2228786777:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.11/1.08 % (2691237)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=569525548:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.11/1.08 % (2691238)dis-21_1_sil=8000:lcm=predicate:random_seed=1303220608: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.11/1.08 % (2691235)First to succeed.
% 3.11/1.08 % (2691235)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2691227"
% 3.11/1.08 % (2691236)Instruction limit reached!
% 3.11/1.08 % (2691236)------------------------------
% 3.11/1.08 % (2691236)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.08 % (2691236)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.08 % (2691236)CaDiCaL version: 2.1.3
% 3.11/1.08 % (2691236)Termination reason: Instruction limit
% 3.11/1.08 % (2691236)Termination phase: Saturation
% 3.11/1.08 % (2691236)Time elapsed: 0.075 s
% 3.11/1.08 % (2691236)Peak memory usage: 88 MB
% 3.11/1.08 % (2691236)Instructions burned: 119 (million)
% 3.11/1.08 % (2691238)Instruction limit reached!
% 3.11/1.08 % (2691238)------------------------------
% 3.11/1.08 % (2691238)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.08 % (2691238)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.08 % (2691238)CaDiCaL version: 2.1.3
% 3.11/1.08 % (2691238)Termination reason: Instruction limit
% 3.11/1.08 % (2691238)Termination phase: Saturation
% 3.11/1.08 % (2691238)Time elapsed: 0.079 s
% 3.11/1.08 % (2691238)Peak memory usage: 90 MB
% 3.11/1.08 % (2691238)Instructions burned: 129 (million)
% 3.11/1.08 % (2691237)Instruction limit reached!
% 3.11/1.08 % (2691237)------------------------------
% 3.11/1.08 % (2691237)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.11/1.08 % (2691237)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.11/1.08 % (2691237)CaDiCaL version: 2.1.3
% 3.11/1.08 % (2691237)Termination reason: Instruction limit
% 3.11/1.08 % (2691237)Termination phase: Saturation
% 3.11/1.08 % (2691237)Time elapsed: 0.104 s
% 3.11/1.08 % (2691237)Peak memory usage: 91 MB
% 3.11/1.08 % (2691237)Instructions burned: 140 (million)
% 3.11/1.08 % (2691246)lrs+10_1_sil=8000:sp=occurrence:random_seed=3283792612:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.11/1.08 % (2691247)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1139463726:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.11/1.08 % (2691235)Refutation found. Thanks to Tanya!
% 3.11/1.08 % SZS status Theorem for theBenchmark
% 3.11/1.08 % SZS output start Proof for theBenchmark
% See solution above
% 3.62/1.28 % (2691235)------------------------------
% 3.62/1.28 % (2691235)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.62/1.28 % (2691235)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.62/1.28 % (2691235)CaDiCaL version: 2.1.3
% 3.62/1.28 % (2691235)Termination reason: Refutation
% 3.62/1.28 % (2691235)Time elapsed: 0.006 s
% 3.62/1.28 % (2691235)Peak memory usage: 89 MB
% 3.62/1.28 % (2691235)Instructions burned: 7 (million)
% 3.62/1.28 % (2691235)------------------------------
% 3.62/1.28 % (2691235)------------------------------
% 3.62/1.28 % (2691227)Success in time 0.43 s
% 3.62/1.28 % Vampire exiting
%------------------------------------------------------------------------------