%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC397+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 : 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:03:48 PM UTC 2026
% Result : Theorem 3.09s 1.09s
% Output : Refutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 16
% Syntax : Number of formulae : 116 ( 24 unt; 10 def)
% Number of atoms : 382 ( 53 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 469 ( 203 ~; 183 |; 48 &)
% ( 13 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 10 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 52 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
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(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) )
| ( nil != X2
& nil = X3 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X2
| app(X6,cons(X5,nil)) != X3 ) ) )
& 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
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) )
| ( nil != X2
& nil = X3 )
| ( ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(cons(X5,nil),X6) != X2
| app(X6,cons(X5,nil)) != X3 ) ) )
& neq(X3,nil) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ( ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X2
& app(X6,cons(X5,nil)) = X3
& ssList(X6) )
& ssItem(X5) )
| ~ 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
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil = X2
| nil != X3 )
& ( ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X2
& app(X6,cons(X5,nil)) = X3
& ssList(X6) )
& ssItem(X5) )
| ~ 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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f122,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f124,plain,
( sK1 = sK3
& sK0 = sK2
& memberP(sK0,sK4)
& ~ memberP(sK1,sK4)
& ssItem(sK4)
& ( nil = sK2
| nil != sK3 )
& ( ( sK2 = app(cons(sK5,nil),sK6)
& sK3 = app(sK6,cons(sK5,nil))
& ssList(sK6)
& ssItem(sK5) )
| ~ neq(sK3,nil) )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f99]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f122]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X1,X0)
& ~ memberP(X2,X0) ) )
& ( memberP(X1,X0)
| memberP(X2,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f133]) ).
fof(f139,plain,
ssList(sK1),
inference(cnf_transformation,[],[f124]) ).
fof(f142,plain,
( ssItem(sK5)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f143,plain,
( ssList(sK6)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f144,plain,
( sK3 = app(sK6,cons(sK5,nil))
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f145,plain,
( sK2 = app(cons(sK5,nil),sK6)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f124]) ).
fof(f146,plain,
( nil = sK2
| nil != sK3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f147,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f124]) ).
fof(f148,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f124]) ).
fof(f149,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f124]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f124]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f124]) ).
fof(f162,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f175,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f178,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f179,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f183,plain,
! [X2,X0,X1] :
( ~ memberP(app(X1,X2),X0)
| memberP(X2,X0)
| memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f184,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f185,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f190,plain,
memberP(sK2,sK4),
inference(definition_unfolding,[],[f149,f150]) ).
fof(f191,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f148,f151]) ).
fof(f192,plain,
ssList(sK3),
inference(definition_unfolding,[],[f139,f151]) ).
fof(f194,definition,
~ sP13(nil),
introduced(definition,[new_symbols(definition,[sP13])],[inequality_splitting_name_introduction]) ).
fof(f195,plain,
( nil = sK2
| sP13(sK3) ),
inference(inequality_splitting,[],[f146,f194]) ).
fof(f213,definition,
( spl20_1
<=> neq(sK3,nil) ),
introduced(definition,[new_symbols(definition,[spl20_1])],[avatar_definition]) ).
fof(f215,plain,
( ~ neq(sK3,nil)
| spl20_1 ),
inference(avatar_component_clause,[],[f213]) ).
fof(f217,definition,
( spl20_2
<=> ssItem(sK5) ),
introduced(definition,[new_symbols(definition,[spl20_2])],[avatar_definition]) ).
fof(f219,plain,
( ssItem(sK5)
| ~ spl20_2 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f220,plain,
( ~ spl20_1
| spl20_2 ),
inference(avatar_split_clause,[],[f142,f217,f213]) ).
fof(f222,definition,
( spl20_3
<=> ssList(sK6) ),
introduced(definition,[new_symbols(definition,[spl20_3])],[avatar_definition]) ).
fof(f224,plain,
( ssList(sK6)
| ~ spl20_3 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f225,plain,
( ~ spl20_1
| spl20_3 ),
inference(avatar_split_clause,[],[f143,f222,f213]) ).
fof(f227,definition,
( spl20_4
<=> sK3 = app(sK6,cons(sK5,nil)) ),
introduced(definition,[new_symbols(definition,[spl20_4])],[avatar_definition]) ).
fof(f229,plain,
( sK3 = app(sK6,cons(sK5,nil))
| ~ spl20_4 ),
inference(avatar_component_clause,[],[f227]) ).
fof(f230,plain,
( ~ spl20_1
| spl20_4 ),
inference(avatar_split_clause,[],[f144,f227,f213]) ).
fof(f232,definition,
( spl20_5
<=> sK2 = app(cons(sK5,nil),sK6) ),
introduced(definition,[new_symbols(definition,[spl20_5])],[avatar_definition]) ).
fof(f234,plain,
( sK2 = app(cons(sK5,nil),sK6)
| ~ spl20_5 ),
inference(avatar_component_clause,[],[f232]) ).
fof(f235,plain,
( ~ spl20_1
| spl20_5 ),
inference(avatar_split_clause,[],[f145,f232,f213]) ).
fof(f237,definition,
( spl20_6
<=> sP13(sK3) ),
introduced(definition,[new_symbols(definition,[spl20_6])],[avatar_definition]) ).
fof(f239,plain,
( sP13(sK3)
| ~ spl20_6 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f241,definition,
( spl20_7
<=> nil = sK2 ),
introduced(definition,[new_symbols(definition,[spl20_7])],[avatar_definition]) ).
fof(f243,plain,
( nil = sK2
| ~ spl20_7 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f244,plain,
( spl20_6
| spl20_7 ),
inference(avatar_split_clause,[],[f195,f241,f237]) ).
fof(f247,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl20_1 ),
inference(resolution,[],[f215,f175]) ).
fof(f249,plain,
( nil = sK3
| ~ ssList(sK3)
| spl20_1 ),
inference(forward_subsumption_resolution,[],[f247,f178]) ).
fof(f259,definition,
( spl20_10
<=> nil = sK3 ),
introduced(definition,[new_symbols(definition,[spl20_10])],[avatar_definition]) ).
fof(f261,plain,
( nil = sK3
| ~ spl20_10 ),
inference(avatar_component_clause,[],[f259]) ).
fof(f263,plain,
( nil = sK3
| spl20_1 ),
inference(forward_subsumption_resolution,[],[f249,f192]) ).
fof(f264,plain,
( spl20_10
| spl20_1 ),
inference(avatar_split_clause,[],[f263,f213,f259]) ).
fof(f267,plain,
( sP13(nil)
| ~ spl20_6
| ~ spl20_10 ),
inference(superposition,[],[f239,f261]) ).
fof(f269,plain,
( $false
| ~ spl20_6
| ~ spl20_10 ),
inference(forward_subsumption_resolution,[],[f267,f194]) ).
fof(f270,plain,
( ~ spl20_6
| ~ spl20_10 ),
inference(avatar_contradiction_clause,[],[f269]) ).
fof(f272,plain,
( memberP(nil,sK4)
| ~ spl20_7 ),
inference(superposition,[],[f190,f243]) ).
fof(f283,plain,
( ~ ssItem(sK4)
| ~ spl20_7 ),
inference(resolution,[],[f272,f179]) ).
fof(f285,plain,
( $false
| ~ spl20_7 ),
inference(forward_subsumption_resolution,[],[f283,f147]) ).
fof(f286,plain,
~ spl20_7,
inference(avatar_contradiction_clause,[],[f285]) ).
fof(f293,definition,
( spl20_11
<=> ssList(cons(sK5,nil)) ),
introduced(definition,[new_symbols(definition,[spl20_11])],[avatar_definition]) ).
fof(f294,plain,
( ssList(cons(sK5,nil))
| ~ spl20_11 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f295,plain,
( ~ ssList(cons(sK5,nil))
| spl20_11 ),
inference(avatar_component_clause,[],[f293]) ).
fof(f306,plain,
( ~ memberP(app(sK6,cons(sK5,nil)),sK4)
| ~ spl20_4 ),
inference(superposition,[],[f191,f229]) ).
fof(f308,plain,
( ~ ssItem(sK5)
| ~ ssList(nil)
| spl20_11 ),
inference(resolution,[],[f295,f162]) ).
fof(f310,plain,
( ~ ssList(nil)
| ~ spl20_2
| spl20_11 ),
inference(forward_subsumption_resolution,[],[f308,f219]) ).
fof(f311,plain,
( $false
| ~ spl20_2
| spl20_11 ),
inference(forward_subsumption_resolution,[],[f310,f178]) ).
fof(f312,plain,
( ~ spl20_2
| spl20_11 ),
inference(avatar_contradiction_clause,[],[f311]) ).
fof(f314,plain,
( memberP(app(cons(sK5,nil),sK6),sK4)
| ~ spl20_5 ),
inference(superposition,[],[f190,f234]) ).
fof(f327,plain,
( ~ memberP(cons(sK5,nil),sK4)
| ~ ssList(cons(sK5,nil))
| ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ spl20_4 ),
inference(resolution,[],[f306,f184]) ).
fof(f328,plain,
( ~ memberP(sK6,sK4)
| ~ ssList(cons(sK5,nil))
| ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ spl20_4 ),
inference(resolution,[],[f306,f185]) ).
fof(f331,plain,
( ~ memberP(sK6,sK4)
| ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f328,f294]) ).
fof(f332,plain,
( ~ memberP(cons(sK5,nil),sK4)
| ~ ssList(sK6)
| ~ ssItem(sK4)
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f327,f294]) ).
fof(f333,plain,
( ~ memberP(sK6,sK4)
| ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f331,f224]) ).
fof(f334,plain,
( ~ memberP(cons(sK5,nil),sK4)
| ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f332,f224]) ).
fof(f335,plain,
( ~ memberP(sK6,sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f333,f147]) ).
fof(f336,plain,
( ~ memberP(cons(sK5,nil),sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f334,f147]) ).
fof(f354,plain,
( memberP(sK6,sK4)
| memberP(cons(sK5,nil),sK4)
| ~ ssList(sK6)
| ~ ssList(cons(sK5,nil))
| ~ ssItem(sK4)
| ~ spl20_5 ),
inference(resolution,[],[f314,f183]) ).
fof(f359,plain,
( memberP(cons(sK5,nil),sK4)
| ~ ssList(sK6)
| ~ ssList(cons(sK5,nil))
| ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f354,f335]) ).
fof(f361,plain,
( ~ ssList(sK6)
| ~ ssList(cons(sK5,nil))
| ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f359,f336]) ).
fof(f362,plain,
( ~ ssList(cons(sK5,nil))
| ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f361,f224]) ).
fof(f363,plain,
( ~ ssItem(sK4)
| ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f362,f294]) ).
fof(f364,plain,
( $false
| ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(forward_subsumption_resolution,[],[f363,f147]) ).
fof(f365,plain,
( ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(avatar_contradiction_clause,[],[f364]) ).
cnf(s1,plain,
( ~ spl20_1
| spl20_2 ),
inference(sat_conversion,[],[f220]) ).
cnf(s2,plain,
( ~ spl20_1
| spl20_3 ),
inference(sat_conversion,[],[f225]) ).
cnf(s3,plain,
( ~ spl20_1
| spl20_4 ),
inference(sat_conversion,[],[f230]) ).
cnf(s4,plain,
( ~ spl20_1
| spl20_5 ),
inference(sat_conversion,[],[f235]) ).
cnf(s5,plain,
( spl20_6
| spl20_7 ),
inference(sat_conversion,[],[f244]) ).
cnf(s7,plain,
( spl20_1
| spl20_10 ),
inference(sat_conversion,[],[f264]) ).
cnf(s8,plain,
( ~ spl20_6
| ~ spl20_10 ),
inference(sat_conversion,[],[f270]) ).
cnf(s10,plain,
~ spl20_7,
inference(sat_conversion,[],[f286]) ).
cnf(s12,plain,
( ~ spl20_2
| spl20_11 ),
inference(sat_conversion,[],[f312]) ).
cnf(s14,plain,
( ~ spl20_3
| ~ spl20_4
| ~ spl20_5
| ~ spl20_11 ),
inference(sat_conversion,[],[f365]) ).
cnf(s15,plain,
spl20_6,
inference(rat,[],[s5,s10]) ).
cnf(s16,plain,
~ spl20_10,
inference(rat,[],[s8,s15]) ).
cnf(s17,plain,
spl20_1,
inference(rat,[],[s7,s16]) ).
cnf(s18,plain,
spl20_5,
inference(rat,[],[s4,s17]) ).
cnf(s19,plain,
spl20_4,
inference(rat,[],[s3,s17]) ).
cnf(s20,plain,
spl20_3,
inference(rat,[],[s2,s17]) ).
cnf(s21,plain,
~ spl20_11,
inference(rat,[],[s14,s19,s18,s20]) ).
cnf(s22,plain,
~ spl20_2,
inference(rat,[],[s12,s21]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s1,s22,s17]) ).
fof(f366,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC397+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n005.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 09:26:31 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.21 Running first-order theorem proving
% 0.09/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.09/1.09 % (665818)Detected formulas, will run a generic FOF schedule.
% 3.09/1.09 % (665825)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=1300291285:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.09/1.09 % (665828)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=999146843:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.09/1.09 % (665826)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4247753816:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.09/1.09 % (665829)dis-21_1_sil=8000:lcm=predicate:random_seed=3534344052: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.09/1.09 % (665824)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=4267925838:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.09/1.09 % (665823)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=1076952281:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.09/1.09 % (665827)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1245093636:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.09/1.09 % (665826)First to succeed.
% 3.09/1.09 % (665826)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-665818"
% 3.09/1.09 % (665827)Also succeeded, but the first one will report.
% 3.09/1.09 % (665829)Instruction limit reached!
% 3.09/1.09 % (665829)------------------------------
% 3.09/1.09 % (665829)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.09 % (665829)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.09 % (665829)CaDiCaL version: 2.1.3
% 3.09/1.09 % (665829)Termination reason: Instruction limit
% 3.09/1.09 % (665829)Termination phase: Saturation
% 3.09/1.09 % (665829)Time elapsed: 0.075 s
% 3.09/1.09 % (665829)Peak memory usage: 90 MB
% 3.09/1.09 % (665829)Instructions burned: 129 (million)
% 3.09/1.09 % (665828)Instruction limit reached!
% 3.09/1.09 % (665828)------------------------------
% 3.09/1.09 % (665828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.09/1.09 % (665828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.09/1.09 % (665828)CaDiCaL version: 2.1.3
% 3.09/1.09 % (665828)Termination reason: Instruction limit
% 3.09/1.09 % (665828)Termination phase: Saturation
% 3.09/1.09 % (665828)Time elapsed: 0.093 s
% 3.09/1.09 % (665828)Peak memory usage: 90 MB
% 3.09/1.09 % (665828)Instructions burned: 139 (million)
% 3.09/1.09 % (665837)lrs+10_1_sil=8000:sp=occurrence:random_seed=1212322374:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.09/1.09 % (665826)Refutation found. Thanks to Tanya!
% 3.09/1.09 % SZS status Theorem for theBenchmark
% 3.09/1.09 % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.29 % (665826)------------------------------
% 3.67/1.29 % (665826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (665826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (665826)CaDiCaL version: 2.1.3
% 3.67/1.29 % (665826)Termination reason: Refutation
% 3.67/1.29 % (665826)Time elapsed: 0.008 s
% 3.67/1.29 % (665826)Peak memory usage: 89 MB
% 3.67/1.29 % (665826)Instructions burned: 9 (million)
% 3.67/1.29 % (665826)------------------------------
% 3.67/1.29 % (665826)------------------------------
% 3.67/1.29 % (665818)Success in time 0.436 s
% 3.67/1.29 % Vampire exiting
%------------------------------------------------------------------------------