%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC075+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:04:33 PM UTC 2026
% Result : Theorem 6.29s 1.43s
% Output : Refutation 6.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 23
% Syntax : Number of formulae : 176 ( 30 unt; 11 def)
% Number of atoms : 538 ( 110 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 653 ( 291 ~; 286 |; 27 &)
% ( 19 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 135 ( 0 sgn 121 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f79,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,X1) = app(X0,X1)
=> X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax79) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
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) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(X5,X6) != X3
| app(X6,X5) != X2 ) )
| ( nil = X1
& nil = X0 ) ) ) ) ),
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
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| app(X5,X6) != X3
| app(X6,X5) != X2 ) )
| ( nil = X1
& nil = X0 ) ) ) ) ),
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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
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(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f194,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f195,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f194]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ? [X5] :
( ? [X6] :
( ssList(X6)
& app(X5,X6) = X3
& app(X6,X5) = X2 )
& ssList(X5) )
& ( nil != X1
| nil != X0 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f234,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f235,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ssList(sK5(X0,X1))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f236,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f240,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f302,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f317,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f319,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f356,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f357,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X0)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f389,plain,
! [X2,X0,X1] :
( app(X2,X1) != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| X0 = X2 ),
inference(cnf_transformation,[],[f195]) ).
fof(f393,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f395,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != X0
| nil != X1
| nil = app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f396,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f410,plain,
sK49 = app(sK52,sK51),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
sK50 = app(sK51,sK52),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
ssList(sK52),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f221]) ).
fof(f414,plain,
ssList(sK51),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
ssList(sK50),
inference(cnf_transformation,[],[f221]) ).
fof(f419,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f424,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f415,f416,f417]) ).
fof(f425,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f413,f416,f417]) ).
fof(f429,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f236]) ).
fof(f431,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f240]) ).
fof(f448,plain,
! [X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| nil != X1
| nil = app(nil,X1) ),
inference(equality_resolution,[],[f395]) ).
fof(f449,plain,
( ~ ssList(nil)
| ~ ssList(nil)
| nil = app(nil,nil) ),
inference(equality_resolution,[],[f448]) ).
fof(f481,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f302]) ).
fof(f511,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| neq(X4,nil)
| ~ ssList(X4) ),
inference(consistent_polarity_flipping,[],[f425]) ).
fof(f513,plain,
( ~ ssList(nil)
| nil = app(nil,nil) ),
inference(duplicate_literal_removal,[],[f449]) ).
fof(f520,definition,
( spl53_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f522,plain,
( nil != sK50
| spl53_1 ),
inference(avatar_component_clause,[],[f520]) ).
fof(f524,definition,
( spl53_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f526,plain,
( nil != sK49
| spl53_2 ),
inference(avatar_component_clause,[],[f524]) ).
fof(f527,plain,
( ~ spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f424,f524,f520]) ).
fof(f529,definition,
( spl53_3
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f531,plain,
( nil = app(nil,nil)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f529]) ).
fof(f533,definition,
( spl53_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f534,plain,
( ssList(nil)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f533]) ).
fof(f536,plain,
( spl53_3
| ~ spl53_4 ),
inference(avatar_split_clause,[],[f513,f533,f529]) ).
fof(f562,plain,
spl53_4,
inference(avatar_split_clause,[],[f305,f533]) ).
fof(f563,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| neq(sK50,nil)
| ~ ssList(sK50) ),
inference(resolution,[],[f356,f511]) ).
fof(f564,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| neq(sK50,nil) ),
inference(duplicate_literal_removal,[],[f563]) ).
fof(f565,plain,
( ~ segmentP(sK49,sK50)
| neq(sK50,nil) ),
inference(forward_subsumption_resolution,[],[f564,f418]) ).
fof(f567,definition,
( spl53_10
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_10])],[avatar_definition]) ).
fof(f569,plain,
( neq(sK50,nil)
| ~ spl53_10 ),
inference(avatar_component_clause,[],[f567]) ).
fof(f571,definition,
( spl53_11
<=> segmentP(sK49,sK50) ),
introduced(definition,[new_symbols(definition,[spl53_11])],[avatar_definition]) ).
fof(f574,plain,
( spl53_10
| ~ spl53_11 ),
inference(avatar_split_clause,[],[f565,f571,f567]) ).
fof(f609,plain,
sK52 = app(nil,sK52),
inference(resolution,[],[f319,f412]) ).
fof(f626,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f396,f419]) ).
fof(f627,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f396,f418]) ).
fof(f765,definition,
( spl53_15
<=> nil = sK52 ),
introduced(definition,[new_symbols(definition,[spl53_15])],[avatar_definition]) ).
fof(f766,plain,
( nil != sK52
| spl53_15 ),
inference(avatar_component_clause,[],[f765]) ).
fof(f767,plain,
( nil = sK52
| ~ spl53_15 ),
inference(avatar_component_clause,[],[f765]) ).
fof(f774,definition,
( spl53_17
<=> nil = sK51 ),
introduced(definition,[new_symbols(definition,[spl53_17])],[avatar_definition]) ).
fof(f776,plain,
( nil = sK51
| ~ spl53_17 ),
inference(avatar_component_clause,[],[f774]) ).
fof(f846,plain,
( sK49 = app(nil,sK51)
| ~ spl53_15 ),
inference(superposition,[],[f410,f767]) ).
fof(f1069,plain,
( nil != sK50
| ~ ssList(sK52)
| nil = sK51
| ~ ssList(sK51) ),
inference(superposition,[],[f393,f411]) ).
fof(f1127,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f429,f317]) ).
fof(f1140,plain,
( frontsegP(sK49,sK52)
| ~ ssList(sK51)
| ~ ssList(sK52) ),
inference(superposition,[],[f1127,f410]) ).
fof(f1145,plain,
( frontsegP(sK49,sK52)
| ~ ssList(sK52) ),
inference(forward_subsumption_resolution,[],[f1140,f414]) ).
fof(f1150,plain,
frontsegP(sK49,sK52),
inference(forward_subsumption_resolution,[],[f1145,f412]) ).
fof(f1156,plain,
( ~ ssList(sK52)
| ssList(sK5(sK49,sK52))
| ~ ssList(sK49) ),
inference(resolution,[],[f1150,f235]) ).
fof(f1157,plain,
( ssList(sK5(sK49,sK52))
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f1156,f412]) ).
fof(f1159,plain,
ssList(sK5(sK49,sK52)),
inference(forward_subsumption_resolution,[],[f1157,f419]) ).
fof(f1278,plain,
( ~ ssList(sK52)
| sK49 = app(sK52,sK5(sK49,sK52))
| ~ ssList(sK49) ),
inference(resolution,[],[f234,f1150]) ).
fof(f1285,plain,
( sK49 = app(sK52,sK5(sK49,sK52))
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f1278,f412]) ).
fof(f1290,plain,
sK49 = app(sK52,sK5(sK49,sK52)),
inference(forward_subsumption_resolution,[],[f1285,f419]) ).
fof(f1545,plain,
! [X0] :
( sK50 != app(X0,sK52)
| ~ ssList(sK52)
| ~ ssList(X0)
| ~ ssList(sK51)
| sK51 = X0 ),
inference(superposition,[],[f389,f411]) ).
fof(f1556,plain,
! [X0] :
( sK50 != app(X0,sK52)
| ~ ssList(X0)
| ~ ssList(sK51)
| sK51 = X0 ),
inference(forward_subsumption_resolution,[],[f1545,f412]) ).
fof(f1576,plain,
! [X0] :
( sK50 != app(X0,sK52)
| ~ ssList(X0)
| sK51 = X0 ),
inference(forward_subsumption_resolution,[],[f1556,f414]) ).
fof(f1839,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X0) ),
inference(resolution,[],[f357,f356]) ).
fof(f1843,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1839]) ).
fof(f1873,plain,
! [X0] :
( ~ ssList(app(sK50,X0))
| ~ ssList(sK52)
| ~ ssList(X0)
| ~ ssList(sK51)
| segmentP(app(sK50,X0),sK52) ),
inference(superposition,[],[f431,f411]) ).
fof(f1875,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK51)
| ~ ssList(X0)
| ~ ssList(sK52)
| segmentP(app(sK49,X0),sK51) ),
inference(superposition,[],[f431,f410]) ).
fof(f1879,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ ssList(sK52)
| segmentP(app(sK49,X0),sK51) ),
inference(forward_subsumption_resolution,[],[f1875,f414]) ).
fof(f1880,plain,
! [X0] :
( ~ ssList(app(sK50,X0))
| ~ ssList(X0)
| ~ ssList(sK51)
| segmentP(app(sK50,X0),sK52) ),
inference(forward_subsumption_resolution,[],[f1873,f412]) ).
fof(f1886,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK51) ),
inference(forward_subsumption_resolution,[],[f1879,f412]) ).
fof(f1887,plain,
! [X0] :
( ~ ssList(app(sK50,X0))
| ~ ssList(X0)
| segmentP(app(sK50,X0),sK52) ),
inference(forward_subsumption_resolution,[],[f1880,f414]) ).
fof(f2705,plain,
( sK49 = app(nil,nil)
| ~ spl53_15
| ~ spl53_17 ),
inference(forward_demodulation,[],[f846,f776]) ).
fof(f2718,plain,
( nil = sK49
| ~ spl53_3
| ~ spl53_15
| ~ spl53_17 ),
inference(forward_demodulation,[],[f2705,f531]) ).
fof(f2726,plain,
( $false
| spl53_2
| ~ spl53_3
| ~ spl53_15
| ~ spl53_17 ),
inference(forward_subsumption_resolution,[],[f2718,f526]) ).
fof(f2727,plain,
( spl53_2
| ~ spl53_3
| ~ spl53_15
| ~ spl53_17 ),
inference(avatar_contradiction_clause,[],[f2726]) ).
fof(f2738,plain,
( nil != sK50
| nil = sK51
| ~ ssList(sK51) ),
inference(forward_subsumption_resolution,[],[f1069,f412]) ).
fof(f2739,plain,
( nil != sK50
| nil = sK51 ),
inference(forward_subsumption_resolution,[],[f2738,f414]) ).
fof(f2740,plain,
( spl53_17
| ~ spl53_1 ),
inference(avatar_split_clause,[],[f2739,f520,f774]) ).
fof(f2831,plain,
( ! [X0] :
( app(X0,nil) != sK50
| ~ ssList(X0)
| sK51 = X0 )
| ~ spl53_15 ),
inference(forward_demodulation,[],[f1576,f767]) ).
fof(f2857,definition,
( spl53_179
<=> sK50 = sK51 ),
introduced(definition,[new_symbols(definition,[spl53_179])],[avatar_definition]) ).
fof(f2859,plain,
( sK50 = sK51
| ~ spl53_179 ),
inference(avatar_component_clause,[],[f2857]) ).
fof(f3537,plain,
( sK50 != sK50
| ~ ssList(sK50)
| sK50 = sK51
| ~ spl53_15 ),
inference(superposition,[],[f2831,f627]) ).
fof(f3539,plain,
( ~ ssList(sK50)
| sK50 = sK51
| ~ spl53_15 ),
inference(trivial_inequality_removal,[],[f3537]) ).
fof(f3541,plain,
( sK50 = sK51
| ~ spl53_15 ),
inference(forward_subsumption_resolution,[],[f3539,f418]) ).
fof(f3544,plain,
( spl53_179
| ~ spl53_15 ),
inference(avatar_split_clause,[],[f3541,f765,f2857]) ).
fof(f3600,plain,
( ~ ssList(sK49)
| ~ ssList(nil)
| segmentP(sK49,sK51) ),
inference(superposition,[],[f1886,f626]) ).
fof(f3602,plain,
( ~ ssList(nil)
| segmentP(sK49,sK51) ),
inference(forward_subsumption_resolution,[],[f3600,f419]) ).
fof(f3604,plain,
( segmentP(sK49,sK51)
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f3602,f534]) ).
fof(f5440,plain,
( segmentP(sK49,sK50)
| ~ spl53_4
| ~ spl53_179 ),
inference(forward_demodulation,[],[f3604,f2859]) ).
fof(f5443,plain,
( spl53_11
| ~ spl53_4
| ~ spl53_179 ),
inference(avatar_split_clause,[],[f5440,f2857,f533,f571]) ).
fof(f5444,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| ~ spl53_10 ),
inference(resolution,[],[f569,f481]) ).
fof(f5447,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ spl53_4
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f5444,f534]) ).
fof(f5457,plain,
( ~ ssList(sK50)
| spl53_1
| ~ spl53_4
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f5447,f522]) ).
fof(f5458,plain,
( $false
| spl53_1
| ~ spl53_4
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f5457,f418]) ).
fof(f5459,plain,
( spl53_1
| ~ spl53_4
| ~ spl53_10 ),
inference(avatar_contradiction_clause,[],[f5458]) ).
fof(f6191,plain,
( ~ ssList(sK50)
| ~ ssList(nil)
| segmentP(sK50,sK52) ),
inference(superposition,[],[f1887,f627]) ).
fof(f6193,plain,
( ~ ssList(nil)
| segmentP(sK50,sK52) ),
inference(forward_subsumption_resolution,[],[f6191,f418]) ).
fof(f6195,plain,
( segmentP(sK50,sK52)
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f6193,f534]) ).
fof(f7158,plain,
( ~ segmentP(sK49,sK52)
| neq(sK52,nil)
| ~ ssList(sK52)
| ~ spl53_4 ),
inference(resolution,[],[f6195,f511]) ).
fof(f7171,plain,
( ~ segmentP(sK49,sK52)
| neq(sK52,nil)
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f7158,f412]) ).
fof(f7179,definition,
( spl53_505
<=> neq(sK52,nil) ),
introduced(definition,[new_symbols(definition,[spl53_505])],[avatar_definition]) ).
fof(f7181,plain,
( neq(sK52,nil)
| ~ spl53_505 ),
inference(avatar_component_clause,[],[f7179]) ).
fof(f7183,definition,
( spl53_506
<=> segmentP(sK49,sK52) ),
introduced(definition,[new_symbols(definition,[spl53_506])],[avatar_definition]) ).
fof(f7186,plain,
( spl53_505
| ~ spl53_506
| ~ spl53_4 ),
inference(avatar_split_clause,[],[f7171,f533,f7183,f7179]) ).
fof(f10796,plain,
! [X0] :
( segmentP(app(sK52,X0),sK52)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK52) ),
inference(superposition,[],[f1843,f609]) ).
fof(f10819,plain,
( ! [X0] :
( segmentP(app(sK52,X0),sK52)
| ~ ssList(X0)
| ~ ssList(sK52) )
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f10796,f534]) ).
fof(f10833,plain,
( ! [X0] :
( segmentP(app(sK52,X0),sK52)
| ~ ssList(X0) )
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f10819,f412]) ).
fof(f46019,plain,
( segmentP(sK49,sK52)
| ~ ssList(sK5(sK49,sK52))
| ~ spl53_4 ),
inference(superposition,[],[f10833,f1290]) ).
fof(f46040,plain,
( segmentP(sK49,sK52)
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f46019,f1159]) ).
fof(f46042,plain,
( spl53_506
| ~ spl53_4 ),
inference(avatar_split_clause,[],[f46040,f533,f7183]) ).
fof(f46110,plain,
( ~ ssList(nil)
| nil = sK52
| ~ ssList(sK52)
| ~ spl53_505 ),
inference(resolution,[],[f7181,f481]) ).
fof(f46113,plain,
( nil = sK52
| ~ ssList(sK52)
| ~ spl53_4
| ~ spl53_505 ),
inference(forward_subsumption_resolution,[],[f46110,f534]) ).
fof(f46119,plain,
( ~ ssList(sK52)
| ~ spl53_4
| spl53_15
| ~ spl53_505 ),
inference(forward_subsumption_resolution,[],[f46113,f766]) ).
fof(f46120,plain,
( $false
| ~ spl53_4
| spl53_15
| ~ spl53_505 ),
inference(forward_subsumption_resolution,[],[f46119,f412]) ).
fof(f46121,plain,
( ~ spl53_4
| spl53_15
| ~ spl53_505 ),
inference(avatar_contradiction_clause,[],[f46120]) ).
cnf(s1,plain,
( ~ spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f527]) ).
cnf(s2,plain,
( spl53_3
| ~ spl53_4 ),
inference(sat_conversion,[],[f536]) ).
cnf(s10,plain,
spl53_4,
inference(sat_conversion,[],[f562]) ).
cnf(s11,plain,
( spl53_10
| ~ spl53_11 ),
inference(sat_conversion,[],[f574]) ).
cnf(s189,plain,
( spl53_2
| ~ spl53_3
| ~ spl53_15
| ~ spl53_17 ),
inference(sat_conversion,[],[f2727]) ).
cnf(s192,plain,
( ~ spl53_1
| spl53_17 ),
inference(sat_conversion,[],[f2740]) ).
cnf(s409,plain,
( ~ spl53_15
| spl53_179 ),
inference(sat_conversion,[],[f3544]) ).
cnf(s588,plain,
( ~ spl53_4
| spl53_11
| ~ spl53_179 ),
inference(sat_conversion,[],[f5443]) ).
cnf(s590,plain,
( spl53_1
| ~ spl53_4
| ~ spl53_10 ),
inference(sat_conversion,[],[f5459]) ).
cnf(s796,plain,
( ~ spl53_4
| spl53_505
| ~ spl53_506 ),
inference(sat_conversion,[],[f7186]) ).
cnf(s5372,plain,
( ~ spl53_4
| spl53_506 ),
inference(sat_conversion,[],[f46042]) ).
cnf(s5382,plain,
( ~ spl53_4
| spl53_15
| ~ spl53_505 ),
inference(sat_conversion,[],[f46121]) ).
cnf(s5427,plain,
spl53_506,
inference(rat,[],[s5372,s10]) ).
cnf(s5433,plain,
spl53_505,
inference(rat,[],[s796,s5427,s10]) ).
cnf(s5435,plain,
spl53_15,
inference(rat,[],[s5382,s10,s5433]) ).
cnf(s5437,plain,
spl53_179,
inference(rat,[],[s409,s5435]) ).
cnf(s5440,plain,
spl53_11,
inference(rat,[],[s588,s10,s5437]) ).
cnf(s5441,plain,
spl53_10,
inference(rat,[],[s11,s5440]) ).
cnf(s5442,plain,
spl53_1,
inference(rat,[],[s590,s10,s5441]) ).
cnf(s5443,plain,
spl53_17,
inference(rat,[],[s192,s5442]) ).
cnf(s5454,plain,
spl53_3,
inference(rat,[],[s2,s10]) ).
cnf(s5455,plain,
spl53_2,
inference(rat,[],[s189,s5443,s5435,s5454]) ).
cnf(s5456,plain,
$false,
inference(rat,[],[s1,s5455,s5442]) ).
fof(f46122,plain,
$false,
inference(avatar_sat_refutation,[],[s5456]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC075+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 % Computer : n016.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 28 07:49:03 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43 Running first-order model finding
% 0.13/0.43 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.29/1.43 % (3459746)Will run a generic schedule for satisfiability detection.
% 6.29/1.43 % (3459751)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2030759055_2999 on theBenchmark for (2999ds/0Mi)
% 6.29/1.43 % (3459752)% WARNING: option uhcvi not known.
% 6.29/1.43 % (3459752)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2332865924:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 6.29/1.43 % (3459753)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3077439707:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 6.29/1.43 % (3459754)dis+10_1_sil=32000:sp=arity:random_seed=3453537422:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 6.29/1.43 % (3459756)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=805324079:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 6.29/1.43 % (3459755)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4004397649:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 6.29/1.43 % (3459757)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=766884365:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 6.29/1.43 % TRYING [1]
% 6.29/1.43 % TRYING [2]
% 6.29/1.43 % TRYING [3]
% 6.29/1.43 % TRYING [4]
% 6.29/1.43 % TRYING [5]
% 6.29/1.43 % (3459754)Instruction limit reached!
% 6.29/1.43 % (3459754)------------------------------
% 6.29/1.43 % (3459754)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459754)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459754)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459754)Termination reason: Instruction limit
% 6.29/1.43 % (3459754)Termination phase: Saturation
% 6.29/1.43 % (3459754)Time elapsed: 0.060 s
% 6.29/1.43 % (3459754)Peak memory usage: 13 MB
% 6.29/1.43 % (3459754)Instructions burned: 103 (million)
% 6.29/1.43 % (3459755)Instruction limit reached!
% 6.29/1.43 % (3459755)------------------------------
% 6.29/1.43 % (3459755)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459755)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459755)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459755)Termination reason: Instruction limit
% 6.29/1.43 % (3459755)Termination phase: Saturation
% 6.29/1.43 % (3459755)Time elapsed: 0.068 s
% 6.29/1.43 % (3459755)Peak memory usage: 13 MB
% 6.29/1.43 % (3459755)Instructions burned: 116 (million)
% 6.29/1.43 % (3459756)Instruction limit reached!
% 6.29/1.43 % (3459756)------------------------------
% 6.29/1.43 % (3459756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459756)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459756)Termination reason: Instruction limit
% 6.29/1.43 % (3459756)Termination phase: Saturation
% 6.29/1.43 % (3459756)Time elapsed: 0.077 s
% 6.29/1.43 % (3459756)Peak memory usage: 14 MB
% 6.29/1.43 % (3459756)Instructions burned: 131 (million)
% 6.29/1.43 % (3459765)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2746391722:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 6.29/1.43 % (3459766)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2362894435:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 6.29/1.43 % TRYING [1]
% 6.29/1.43 % TRYING [2]
% 6.29/1.43 % (3459767)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=3947199144:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 6.29/1.43 % (3459757)Instruction limit reached!
% 6.29/1.43 % (3459757)------------------------------
% 6.29/1.43 % (3459757)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459757)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459757)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459757)Termination reason: Instruction limit
% 6.29/1.43 % (3459757)Termination phase: Saturation
% 6.29/1.43 % (3459757)Time elapsed: 0.097 s
% 6.29/1.43 % (3459757)Peak memory usage: 15 MB
% 6.29/1.43 % (3459757)Instructions burned: 160 (million)
% 6.29/1.43 % TRYING [3]
% 6.29/1.43 % TRYING [6]
% 6.29/1.43 % TRYING [4]
% 6.29/1.43 % (3459771)ott-21_1_sil=16000:fs=off:random_seed=1332922953:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 6.29/1.43 % (3459766)Instruction limit reached!
% 6.29/1.43 % (3459766)------------------------------
% 6.29/1.43 % (3459766)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459766)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459766)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459766)Termination reason: Instruction limit
% 6.29/1.43 % (3459766)Termination phase: Saturation
% 6.29/1.43 % (3459766)Time elapsed: 0.071 s
% 6.29/1.43 % (3459766)Peak memory usage: 13 MB
% 6.29/1.43 % (3459766)Instructions burned: 132 (million)
% 6.29/1.43 % TRYING [5]
% 6.29/1.43 % (3459773)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=983384253:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 6.29/1.43 % (3459771)Instruction limit reached!
% 6.29/1.43 % (3459771)------------------------------
% 6.29/1.43 % (3459771)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459771)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459771)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459771)Termination reason: Instruction limit
% 6.29/1.43 % (3459771)Termination phase: Saturation
% 6.29/1.43 % (3459771)Time elapsed: 0.088 s
% 6.29/1.43 % (3459771)Peak memory usage: 13 MB
% 6.29/1.43 % (3459771)Instructions burned: 181 (million)
% 6.29/1.43 % (3459775)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2927707486:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 6.29/1.43 % TRYING [1]
% 6.29/1.43 % TRYING [2]
% 6.29/1.43 % TRYING [3]
% 6.29/1.43 % TRYING [7]
% 6.29/1.43 % TRYING [4]
% 6.29/1.43 % TRYING [6]
% 6.29/1.43 % (3459765)Instruction limit reached!
% 6.29/1.43 % (3459765)------------------------------
% 6.29/1.43 % (3459765)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459765)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459765)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459765)Termination reason: Instruction limit
% 6.29/1.43 % (3459765)Termination phase: Finite model building constraint generation
% 6.29/1.43 % (3459765)Time elapsed: 0.298 s
% 6.29/1.43 % (3459765)Peak memory usage: 28 MB
% 6.29/1.43 % (3459765)Instructions burned: 715 (million)
% 6.29/1.43 % TRYING [5]
% 6.29/1.43 % (3459777)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=249112405:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 6.29/1.43 % (3459767)Instruction limit reached!
% 6.29/1.43 % (3459767)------------------------------
% 6.29/1.43 % (3459767)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459767)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459767)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459767)Termination reason: Instruction limit
% 6.29/1.43 % (3459767)Termination phase: Saturation
% 6.29/1.43 % (3459767)Time elapsed: 0.357 s
% 6.29/1.43 % (3459767)Peak memory usage: 23 MB
% 6.29/1.43 % (3459767)Instructions burned: 685 (million)
% 6.29/1.43 % (3459779)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=892682046:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 6.29/1.43 % (3459773)Instruction limit reached!
% 6.29/1.43 % (3459773)------------------------------
% 6.29/1.43 % (3459773)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459773)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459773)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459773)Termination reason: Instruction limit
% 6.29/1.43 % (3459773)Termination phase: Saturation
% 6.29/1.43 % (3459773)Time elapsed: 0.323 s
% 6.29/1.43 % (3459773)Peak memory usage: 15 MB
% 6.29/1.43 % (3459773)Instructions burned: 478 (million)
% 6.29/1.43 % (3459781)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=126053936:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2994 on theBenchmark for (2994ds/692Mi)
% 6.29/1.43 % TRYING [14]
% 6.29/1.43 % (3459775)Instruction limit reached!
% 6.29/1.43 % (3459775)------------------------------
% 6.29/1.43 % (3459775)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459775)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459775)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459775)Termination reason: Instruction limit
% 6.29/1.43 % (3459775)Termination phase: Finite model building SAT solving
% 6.29/1.43 % (3459775)Time elapsed: 0.355 s
% 6.29/1.43 % (3459775)Peak memory usage: 23 MB
% 6.29/1.43 % (3459775)Instructions burned: 866 (million)
% 6.29/1.43 % (3459783)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=3877286102:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 6.29/1.43 % TRYING [8]
% 6.29/1.43 % (3459779)Instruction limit reached!
% 6.29/1.43 % (3459779)------------------------------
% 6.29/1.43 % (3459779)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459779)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459779)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459779)Termination reason: Instruction limit
% 6.29/1.43 % (3459779)Termination phase: Finite model building constraint generation
% 6.29/1.43 % (3459779)Time elapsed: 0.322 s
% 6.29/1.43 % (3459779)Peak memory usage: 70 MB
% 6.29/1.43 % (3459779)Instructions burned: 892 (million)
% 6.29/1.43 % (3459785)fmb+10_1_sil=64000:random_seed=2194597136:i=22061:nm=2:gsp=on_2991 on theBenchmark for (2991ds/22061Mi)
% 6.29/1.43 % TRYING [1]
% 6.29/1.43 % TRYING [2]
% 6.29/1.43 % TRYING [3]
% 6.29/1.43 % (3459781)Instruction limit reached!
% 6.29/1.43 % (3459781)------------------------------
% 6.29/1.43 % (3459781)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459781)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459781)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459781)Termination reason: Instruction limit
% 6.29/1.43 % (3459781)Termination phase: Saturation
% 6.29/1.43 % (3459781)Time elapsed: 0.347 s
% 6.29/1.43 % (3459781)Peak memory usage: 23 MB
% 6.29/1.43 % (3459781)Instructions burned: 693 (million)
% 6.29/1.43 % TRYING [4]
% 6.29/1.43 % (3459787)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=2722469656:i=9515:nm=5_2990 on theBenchmark for (2990ds/9515Mi)
% 6.29/1.43 % TRYING [20]
% 6.29/1.43 % (3459752) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3459746-3459752"...
% 6.29/1.43 % (3459752)...printing done.
% 6.29/1.43 % (3459752)Refutation found. Thanks to Tanya!
% 6.29/1.43 % SZS status Theorem for theBenchmark
% 6.29/1.43 % SZS output start Proof for theBenchmark
% See solution above
% 6.29/1.43 % (3459752)------------------------------
% 6.29/1.43 % (3459752)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 6.29/1.43 % (3459752)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.29/1.43 % (3459752)CaDiCaL version: 2.1.3
% 6.29/1.43 % (3459752)Termination reason: Refutation
% 6.29/1.43 % (3459752)Time elapsed: 0.932 s
% 6.29/1.43 % (3459752)Peak memory usage: 37 MB
% 6.29/1.43 % (3459752)Instructions burned: 1781 (million)
% 6.29/1.43 % (3459746)Success in time 0.99 s
% 6.29/1.43 % Vampire exiting
%------------------------------------------------------------------------------