%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC070+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 : n007.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:18 PM UTC 2026
% Result : Theorem 2.91s 1.34s
% Output : Refutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 15
% Syntax : Number of formulae : 106 ( 17 unt; 8 def)
% Number of atoms : 379 ( 70 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 462 ( 189 ~; 184 |; 61 &)
% ( 12 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 74 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
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] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(X1,sK11(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK13(X0,X1))
& ssList(sK14(X0,X1))
& app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ( nil != sK54
| nil != sK53 )
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& frontsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f309,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK11(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f310,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f318,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f440,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( nil = sK55
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( nil = sK56
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil != sK54
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f318]) ).
fof(f543,definition,
( spl57_1
<=> frontsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f545,plain,
( frontsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f543]) ).
fof(f547,definition,
( spl57_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f550,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f500,f547,f543]) ).
fof(f552,definition,
( spl57_3
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f554,plain,
( neq(sK55,nil)
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f552]) ).
fof(f555,plain,
( spl57_3
| spl57_2 ),
inference(avatar_split_clause,[],[f501,f547,f552]) ).
fof(f557,definition,
( spl57_4
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f560,plain,
( spl57_1
| spl57_4 ),
inference(avatar_split_clause,[],[f502,f557,f543]) ).
fof(f561,plain,
( spl57_3
| spl57_4 ),
inference(avatar_split_clause,[],[f503,f557,f552]) ).
fof(f563,definition,
( spl57_5
<=> nil = sK53 ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f565,plain,
( nil != sK53
| spl57_5 ),
inference(avatar_component_clause,[],[f563]) ).
fof(f567,definition,
( spl57_6
<=> nil = sK54 ),
introduced(definition,[new_symbols(definition,[spl57_6])],[avatar_definition]) ).
fof(f569,plain,
( nil != sK54
| spl57_6 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f570,plain,
( ~ spl57_5
| ~ spl57_6 ),
inference(avatar_split_clause,[],[f504,f567,f563]) ).
fof(f572,definition,
( spl57_7
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_7])],[avatar_definition]) ).
fof(f573,plain,
( ssList(nil)
| ~ spl57_7 ),
inference(avatar_component_clause,[],[f572]) ).
fof(f605,plain,
spl57_7,
inference(avatar_split_clause,[],[f389,f572]) ).
fof(f612,plain,
( nil != sK55
| spl57_5 ),
inference(forward_demodulation,[],[f565,f506]) ).
fof(f616,plain,
( ~ spl57_2
| spl57_5 ),
inference(avatar_split_clause,[],[f612,f563,f547]) ).
fof(f617,plain,
! [X4] :
( ~ segmentP(sK56,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK53,X4) ),
inference(forward_demodulation,[],[f505,f507]) ).
fof(f643,plain,
( nil != sK56
| spl57_6 ),
inference(forward_demodulation,[],[f569,f507]) ).
fof(f648,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ segmentP(sK56,X4)
| ~ ssList(X4)
| ~ segmentP(sK55,X4) ),
inference(forward_demodulation,[],[f617,f506]) ).
fof(f649,plain,
( ~ spl57_4
| spl57_6 ),
inference(avatar_split_clause,[],[f643,f567,f557]) ).
fof(f671,plain,
( ~ segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ segmentP(sK55,sK55)
| ~ spl57_3 ),
inference(resolution,[],[f648,f554]) ).
fof(f672,plain,
( ~ segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ spl57_3 ),
inference(forward_subsumption_resolution,[],[f671,f440]) ).
fof(f673,plain,
( ~ segmentP(sK56,sK55)
| ~ spl57_3 ),
inference(forward_subsumption_resolution,[],[f672,f498]) ).
fof(f885,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(resolution,[],[f309,f545]) ).
fof(f890,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f885,f498]) ).
fof(f894,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f890,f499]) ).
fof(f902,definition,
( spl57_18
<=> ssList(sK11(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_18])],[avatar_definition]) ).
fof(f903,plain,
( ssList(sK11(sK56,sK55))
| ~ spl57_18 ),
inference(avatar_component_clause,[],[f902]) ).
fof(f904,plain,
( ~ ssList(sK11(sK56,sK55))
| spl57_18 ),
inference(avatar_component_clause,[],[f902]) ).
fof(f921,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| spl57_18 ),
inference(resolution,[],[f904,f310]) ).
fof(f922,plain,
( ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1
| spl57_18 ),
inference(forward_subsumption_resolution,[],[f921,f545]) ).
fof(f923,plain,
( ~ ssList(sK56)
| ~ spl57_1
| spl57_18 ),
inference(forward_subsumption_resolution,[],[f922,f498]) ).
fof(f924,plain,
( $false
| ~ spl57_1
| spl57_18 ),
inference(forward_subsumption_resolution,[],[f923,f499]) ).
fof(f925,plain,
( ~ spl57_1
| spl57_18 ),
inference(avatar_contradiction_clause,[],[f924]) ).
fof(f1739,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f513,f403]) ).
fof(f1746,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f1739]) ).
fof(f1755,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f1746,f401]) ).
fof(f1761,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f1755,f573]) ).
fof(f2398,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_7 ),
inference(superposition,[],[f1761,f894]) ).
fof(f2410,plain,
( ~ ssList(sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_3
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f2398,f673]) ).
fof(f2419,plain,
( ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_3
| ~ spl57_7 ),
inference(forward_subsumption_resolution,[],[f2410,f498]) ).
fof(f2426,plain,
( $false
| ~ spl57_1
| ~ spl57_3
| ~ spl57_7
| ~ spl57_18 ),
inference(forward_subsumption_resolution,[],[f2419,f903]) ).
fof(f2427,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_7
| ~ spl57_18 ),
inference(avatar_contradiction_clause,[],[f2426]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f550]) ).
cnf(s2,plain,
( spl57_2
| spl57_3 ),
inference(sat_conversion,[],[f555]) ).
cnf(s3,plain,
( spl57_1
| spl57_4 ),
inference(sat_conversion,[],[f560]) ).
cnf(s4,plain,
( spl57_3
| spl57_4 ),
inference(sat_conversion,[],[f561]) ).
cnf(s5,plain,
( ~ spl57_5
| ~ spl57_6 ),
inference(sat_conversion,[],[f570]) ).
cnf(s14,plain,
spl57_7,
inference(sat_conversion,[],[f605]) ).
cnf(s18,plain,
( ~ spl57_2
| spl57_5 ),
inference(sat_conversion,[],[f616]) ).
cnf(s22,plain,
( ~ spl57_4
| spl57_6 ),
inference(sat_conversion,[],[f649]) ).
cnf(s31,plain,
( ~ spl57_1
| spl57_18 ),
inference(sat_conversion,[],[f925]) ).
cnf(s76,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_7
| ~ spl57_18 ),
inference(sat_conversion,[],[f2427]) ).
cnf(s81,plain,
spl57_1,
inference(rat,[],[s5,s18,s22,s1,s3]) ).
cnf(s82,plain,
spl57_18,
inference(rat,[],[s31,s81]) ).
cnf(s83,plain,
~ spl57_3,
inference(rat,[],[s76,s82,s14,s81]) ).
cnf(s85,plain,
spl57_4,
inference(rat,[],[s4,s83]) ).
cnf(s86,plain,
spl57_2,
inference(rat,[],[s2,s83]) ).
cnf(s87,plain,
spl57_6,
inference(rat,[],[s22,s85]) ).
cnf(s88,plain,
spl57_5,
inference(rat,[],[s18,s86]) ).
cnf(s89,plain,
$false,
inference(rat,[],[s5,s87,s88]) ).
fof(f2429,plain,
$false,
inference(avatar_sat_refutation,[],[s89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC070+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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:41:10 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 2.91/1.34 % (2228188)Detected formulas, will run a generic FOF schedule.
% 2.91/1.34 % (2228196)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3499077296:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.91/1.34 % (2228196)Instruction limit reached!
% 2.91/1.34 % (2228196)------------------------------
% 2.91/1.34 % (2228196)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.34 % (2228196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.34 % (2228196)CaDiCaL version: 2.1.3
% 2.91/1.34 % (2228196)Termination reason: Instruction limit
% 2.91/1.34 % (2228196)Termination phase: Saturation
% 2.91/1.34 % (2228196)Time elapsed: 0.037 s
% 2.91/1.34 % (2228196)Peak memory usage: 89 MB
% 2.91/1.34 % (2228196)Instructions burned: 111 (million)
% 2.91/1.34 % (2228199)dis-21_1_sil=8000:lcm=predicate:random_seed=1481136561: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.91/1.34 % (2228194)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=2683500940:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.91/1.34 % (2228197)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4052630092:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.91/1.34 % (2228195)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=1286010012:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.91/1.34 % (2228193)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=556571794:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.91/1.34 % (2228198)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2264151187:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.91/1.34 % (2228198)First to succeed.
% 2.91/1.34 % (2228198)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2228188"
% 2.91/1.34 % (2228197)Instruction limit reached!
% 2.91/1.34 % (2228197)------------------------------
% 2.91/1.34 % (2228197)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.34 % (2228197)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.34 % (2228197)CaDiCaL version: 2.1.3
% 2.91/1.34 % (2228197)Termination reason: Instruction limit
% 2.91/1.34 % (2228197)Termination phase: Saturation
% 2.91/1.34 % (2228197)Time elapsed: 0.064 s
% 2.91/1.34 % (2228197)Peak memory usage: 88 MB
% 2.91/1.34 % (2228197)Instructions burned: 121 (million)
% 2.91/1.34 % (2228199)Instruction limit reached!
% 2.91/1.34 % (2228199)------------------------------
% 2.91/1.34 % (2228199)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.34 % (2228199)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.34 % (2228199)CaDiCaL version: 2.1.3
% 2.91/1.34 % (2228199)Termination reason: Instruction limit
% 2.91/1.34 % (2228199)Termination phase: Saturation
% 2.91/1.34 % (2228199)Time elapsed: 0.076 s
% 2.91/1.34 % (2228199)Peak memory usage: 90 MB
% 2.91/1.34 % (2228199)Instructions burned: 129 (million)
% 2.91/1.34 % (2228207)lrs+10_1_sil=8000:sp=occurrence:random_seed=224795926:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 2.91/1.34 % (2228207)Also succeeded, but the first one will report.
% 2.91/1.34 % (2228208)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1816422809:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 2.91/1.34 % (2228209)lrs+1011_1_sil=32000:sp=occurrence:random_seed=773843442:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 2.91/1.34 % (2228208)Instruction limit reached!
% 2.91/1.34 % (2228208)------------------------------
% 2.91/1.34 % (2228208)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.91/1.34 % (2228208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.91/1.34 % (2228208)CaDiCaL version: 2.1.3
% 2.91/1.34 % (2228208)Termination reason: Instruction limit
% 2.91/1.34 % (2228208)Termination phase: Saturation
% 2.91/1.34 % (2228208)Time elapsed: 0.076 s
% 2.91/1.34 % (2228208)Peak memory usage: 91 MB
% 2.91/1.34 % (2228208)Instructions burned: 158 (million)
% 2.91/1.34 % (2228198)Refutation found. Thanks to Tanya!
% 2.91/1.34 % SZS status Theorem for theBenchmark
% 2.91/1.34 % SZS output start Proof for theBenchmark
% See solution above
% 4.02/1.53 % (2228198)------------------------------
% 4.02/1.53 % (2228198)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.02/1.53 % (2228198)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.02/1.53 % (2228198)CaDiCaL version: 2.1.3
% 4.02/1.53 % (2228198)Termination reason: Refutation
% 4.02/1.53 % (2228198)Time elapsed: 0.054 s
% 4.02/1.53 % (2228198)Peak memory usage: 91 MB
% 4.02/1.53 % (2228198)Instructions burned: 78 (million)
% 4.02/1.53 % (2228198)------------------------------
% 4.02/1.53 % (2228198)------------------------------
% 4.02/1.53 % (2228188)Success in time 0.484 s
% 4.02/1.53 % Vampire exiting
%------------------------------------------------------------------------------