%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC063+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 : n010.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:30 PM UTC 2026
% Result : Theorem 4.90s 1.26s
% Output : Refutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 30
% Syntax : Number of formulae : 204 ( 33 unt; 17 def)
% Number of atoms : 693 ( 117 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 901 ( 412 ~; 405 |; 33 &)
% ( 25 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 18 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn 106 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax39) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f80,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X1,X2) = app(X1,X0)
=> X2 = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax80) ).
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
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ),
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
| ( nil != X2
& nil = X3 )
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ~ ssList(X5)
| app(cons(X4,nil),X5) != X2
| app(X5,cons(X4,nil)) != X3 ) )
& neq(X3,nil) )
| ( ( nil != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X6] :
( ssList(X6)
& neq(X6,nil)
& segmentP(X1,X6)
& segmentP(X0,X6) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
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(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
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(f196,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f196]) ).
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
& ( nil = X2
| nil != X3 )
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(cons(X4,nil),X5) = X2
& app(X5,cons(X4,nil)) = X3 )
& ssItem(X4) )
| ~ neq(X3,nil) )
& ( ( nil = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X6] :
( ~ ssList(X6)
| ~ neq(X6,nil)
| ~ segmentP(X1,X6)
| ~ segmentP(X0,X6) ) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f233,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f100]) ).
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] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f304,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
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(f336,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f356,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f390,plain,
! [X2,X0,X1] :
( app(X1,X2) != app(X1,X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| X0 = X2 ),
inference(cnf_transformation,[],[f197]) ).
fof(f393,plain,
! [X0,X1] :
( nil != app(X0,X1)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f396,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f410,plain,
( ~ neq(sK50,nil)
| sK50 = app(sK52,cons(sK51,nil)) ),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
( ~ neq(sK50,nil)
| sK49 = app(cons(sK51,nil),sK52) ),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
( ~ neq(sK50,nil)
| ssList(sK52) ),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
! [X6] :
( ~ segmentP(sK47,X6)
| ~ segmentP(sK48,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
( ~ neq(sK50,nil)
| ssItem(sK51) ),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
( neq(sK48,nil)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
( nil != sK50
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f421,plain,
ssList(sK50),
inference(cnf_transformation,[],[f221]) ).
fof(f422,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f427,plain,
( neq(sK50,nil)
| nil = sK50 ),
inference(definition_unfolding,[],[f417,f420,f420]) ).
fof(f428,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f416,f420,f419]) ).
fof(f430,plain,
! [X6] :
( ~ segmentP(sK49,X6)
| ~ segmentP(sK50,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sK50 ),
inference(definition_unfolding,[],[f413,f419,f420,f420]) ).
fof(f433,plain,
! [X1] :
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(equality_resolution,[],[f233]) ).
fof(f436,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(f456,plain,
! [X1] :
( ~ singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(consistent_polarity_flipping,[],[f433]) ).
fof(f465,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(app(app(X2,X1),X3),X1) ),
inference(consistent_polarity_flipping,[],[f436]) ).
fof(f503,plain,
singletonP(nil),
inference(consistent_polarity_flipping,[],[f336]) ).
fof(f516,plain,
! [X0] :
( ~ segmentP(X0,X0)
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f356]) ).
fof(f536,plain,
! [X6] :
( segmentP(sK49,X6)
| segmentP(sK50,X6)
| ~ neq(X6,nil)
| ~ ssList(X6)
| nil = sK50 ),
inference(consistent_polarity_flipping,[],[f430]) ).
fof(f545,definition,
( spl53_1
<=> sK50 = app(sK52,cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_1])],[avatar_definition]) ).
fof(f547,plain,
( sK50 = app(sK52,cons(sK51,nil))
| ~ spl53_1 ),
inference(avatar_component_clause,[],[f545]) ).
fof(f549,definition,
( spl53_2
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl53_2])],[avatar_definition]) ).
fof(f552,plain,
( spl53_1
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f410,f549,f545]) ).
fof(f554,definition,
( spl53_3
<=> sK49 = app(cons(sK51,nil),sK52) ),
introduced(definition,[new_symbols(definition,[spl53_3])],[avatar_definition]) ).
fof(f556,plain,
( sK49 = app(cons(sK51,nil),sK52)
| ~ spl53_3 ),
inference(avatar_component_clause,[],[f554]) ).
fof(f557,plain,
( spl53_3
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f411,f549,f554]) ).
fof(f559,definition,
( spl53_4
<=> ssList(sK52) ),
introduced(definition,[new_symbols(definition,[spl53_4])],[avatar_definition]) ).
fof(f561,plain,
( ssList(sK52)
| ~ spl53_4 ),
inference(avatar_component_clause,[],[f559]) ).
fof(f562,plain,
( spl53_4
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f412,f549,f559]) ).
fof(f564,definition,
( spl53_5
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_5])],[avatar_definition]) ).
fof(f568,definition,
( spl53_6
<=> ! [X6] :
( segmentP(sK49,X6)
| ~ ssList(X6)
| ~ neq(X6,nil)
| segmentP(sK50,X6) ) ),
introduced(definition,[new_symbols(definition,[spl53_6])],[avatar_definition]) ).
fof(f569,plain,
( ! [X6] :
( ~ neq(X6,nil)
| ~ ssList(X6)
| segmentP(sK49,X6)
| segmentP(sK50,X6) )
| ~ spl53_6 ),
inference(avatar_component_clause,[],[f568]) ).
fof(f570,plain,
( spl53_5
| spl53_6 ),
inference(avatar_split_clause,[],[f536,f568,f564]) ).
fof(f572,definition,
( spl53_7
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl53_7])],[avatar_definition]) ).
fof(f573,plain,
( nil = sK49
| ~ spl53_7 ),
inference(avatar_component_clause,[],[f572]) ).
fof(f574,plain,
( nil != sK49
| spl53_7 ),
inference(avatar_component_clause,[],[f572]) ).
fof(f577,definition,
( spl53_8
<=> ssItem(sK51) ),
introduced(definition,[new_symbols(definition,[spl53_8])],[avatar_definition]) ).
fof(f579,plain,
( ssItem(sK51)
| ~ spl53_8 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f580,plain,
( spl53_8
| ~ spl53_2 ),
inference(avatar_split_clause,[],[f415,f549,f577]) ).
fof(f581,plain,
( ~ spl53_7
| spl53_2 ),
inference(avatar_split_clause,[],[f428,f549,f572]) ).
fof(f582,plain,
( spl53_5
| spl53_2 ),
inference(avatar_split_clause,[],[f427,f549,f564]) ).
fof(f583,plain,
( spl53_7
| ~ spl53_5 ),
inference(avatar_split_clause,[],[f418,f564,f572]) ).
fof(f589,definition,
( spl53_10
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl53_10])],[avatar_definition]) ).
fof(f590,plain,
( ssList(nil)
| ~ spl53_10 ),
inference(avatar_component_clause,[],[f589]) ).
fof(f618,plain,
spl53_10,
inference(avatar_split_clause,[],[f305,f589]) ).
fof(f621,plain,
( nil = app(cons(sK51,nil),sK52)
| ~ spl53_3
| ~ spl53_7 ),
inference(forward_demodulation,[],[f556,f573]) ).
fof(f626,definition,
( spl53_16
<=> segmentP(sK50,sK50) ),
introduced(definition,[new_symbols(definition,[spl53_16])],[avatar_definition]) ).
fof(f628,plain,
( segmentP(sK50,sK50)
| ~ spl53_16 ),
inference(avatar_component_clause,[],[f626]) ).
fof(f644,plain,
sK50 = app(nil,sK50),
inference(resolution,[],[f319,f421]) ).
fof(f645,plain,
( sK52 = app(nil,sK52)
| ~ spl53_4 ),
inference(resolution,[],[f319,f561]) ).
fof(f656,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f396,f422]) ).
fof(f657,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f396,f421]) ).
fof(f790,definition,
( spl53_19
<=> nil = sK52 ),
introduced(definition,[new_symbols(definition,[spl53_19])],[avatar_definition]) ).
fof(f791,plain,
( nil != sK52
| spl53_19 ),
inference(avatar_component_clause,[],[f790]) ).
fof(f792,plain,
( nil = sK52
| ~ spl53_19 ),
inference(avatar_component_clause,[],[f790]) ).
fof(f998,plain,
( nil != nil
| ~ ssList(sK52)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| ~ spl53_3
| ~ spl53_7 ),
inference(superposition,[],[f393,f621]) ).
fof(f1002,plain,
( ~ ssList(sK52)
| nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| ~ spl53_3
| ~ spl53_7 ),
inference(trivial_inequality_removal,[],[f998]) ).
fof(f1003,plain,
( nil = cons(sK51,nil)
| ~ ssList(cons(sK51,nil))
| ~ spl53_3
| ~ spl53_4
| ~ spl53_7 ),
inference(forward_subsumption_resolution,[],[f1002,f561]) ).
fof(f1005,definition,
( spl53_28
<=> ssList(cons(sK51,nil)) ),
introduced(definition,[new_symbols(definition,[spl53_28])],[avatar_definition]) ).
fof(f1006,plain,
( ssList(cons(sK51,nil))
| ~ spl53_28 ),
inference(avatar_component_clause,[],[f1005]) ).
fof(f1007,plain,
( ~ ssList(cons(sK51,nil))
| spl53_28 ),
inference(avatar_component_clause,[],[f1005]) ).
fof(f1009,definition,
( spl53_29
<=> nil = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_29])],[avatar_definition]) ).
fof(f1011,plain,
( nil = cons(sK51,nil)
| ~ spl53_29 ),
inference(avatar_component_clause,[],[f1009]) ).
fof(f1012,plain,
( ~ spl53_28
| spl53_29
| ~ spl53_3
| ~ spl53_4
| ~ spl53_7 ),
inference(avatar_split_clause,[],[f1003,f572,f559,f554,f1009,f1005]) ).
fof(f1036,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| spl53_28 ),
inference(resolution,[],[f1007,f304]) ).
fof(f1037,plain,
( ~ ssList(nil)
| ~ spl53_8
| spl53_28 ),
inference(forward_subsumption_resolution,[],[f1036,f579]) ).
fof(f1038,plain,
( $false
| ~ spl53_8
| ~ spl53_10
| spl53_28 ),
inference(forward_subsumption_resolution,[],[f1037,f590]) ).
fof(f1039,plain,
( ~ spl53_8
| ~ spl53_10
| spl53_28 ),
inference(avatar_contradiction_clause,[],[f1038]) ).
fof(f1128,plain,
( ~ singletonP(nil)
| ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl53_29 ),
inference(superposition,[],[f456,f1011]) ).
fof(f1143,plain,
( ~ ssItem(sK51)
| ~ ssList(nil)
| ~ spl53_29 ),
inference(forward_subsumption_resolution,[],[f1128,f503]) ).
fof(f1151,plain,
( ~ ssList(nil)
| ~ spl53_8
| ~ spl53_29 ),
inference(forward_subsumption_resolution,[],[f1143,f579]) ).
fof(f1155,plain,
( $false
| ~ spl53_8
| ~ spl53_10
| ~ spl53_29 ),
inference(forward_subsumption_resolution,[],[f1151,f590]) ).
fof(f1156,plain,
( ~ spl53_8
| ~ spl53_10
| ~ spl53_29 ),
inference(avatar_contradiction_clause,[],[f1155]) ).
fof(f1159,plain,
( sK49 = app(cons(sK51,nil),nil)
| ~ spl53_3
| ~ spl53_19 ),
inference(forward_demodulation,[],[f556,f792]) ).
fof(f1183,plain,
( ! [X0] :
( ~ ssList(X0)
| segmentP(sK49,X0)
| segmentP(sK50,X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0) )
| ~ spl53_6 ),
inference(resolution,[],[f569,f302]) ).
fof(f1185,plain,
( ! [X0] :
( ~ ssList(X0)
| segmentP(sK49,X0)
| segmentP(sK50,X0)
| ~ ssList(nil)
| nil = X0 )
| ~ spl53_6 ),
inference(duplicate_literal_removal,[],[f1183]) ).
fof(f1194,plain,
( ! [X0] :
( segmentP(sK49,X0)
| ~ ssList(X0)
| segmentP(sK50,X0)
| nil = X0 )
| ~ spl53_6
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f1185,f590]) ).
fof(f1617,plain,
( ! [X0] :
( sK50 != app(sK52,X0)
| ~ ssList(sK52)
| ~ ssList(X0)
| ~ ssList(cons(sK51,nil))
| cons(sK51,nil) = X0 )
| ~ spl53_1 ),
inference(superposition,[],[f390,f547]) ).
fof(f1624,plain,
( ! [X0] :
( sK50 != app(sK52,X0)
| ~ ssList(X0)
| ~ ssList(cons(sK51,nil))
| cons(sK51,nil) = X0 )
| ~ spl53_1
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f1617,f561]) ).
fof(f1636,plain,
( ! [X0] :
( sK50 != app(sK52,X0)
| ~ ssList(X0)
| cons(sK51,nil) = X0 )
| ~ spl53_1
| ~ spl53_4
| ~ spl53_28 ),
inference(forward_subsumption_resolution,[],[f1624,f1006]) ).
fof(f1938,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(app(app(X2,X0),X1),X0)
| ~ ssList(X1)
| ~ ssList(app(X2,X0)) ),
inference(resolution,[],[f465,f317]) ).
fof(f1939,plain,
( ! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK52)
| ~ ssList(X0)
| ~ ssList(cons(sK51,nil))
| ~ segmentP(app(sK49,X0),sK52) )
| ~ spl53_3 ),
inference(superposition,[],[f465,f556]) ).
fof(f1949,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(app(app(X2,X0),X1),X0)
| ~ ssList(app(X2,X0)) ),
inference(duplicate_literal_removal,[],[f1938]) ).
fof(f1954,plain,
( ! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ ssList(cons(sK51,nil))
| ~ segmentP(app(sK49,X0),sK52) )
| ~ spl53_3
| ~ spl53_4 ),
inference(forward_subsumption_resolution,[],[f1939,f561]) ).
fof(f1955,plain,
! [X2,X0,X1] :
( ~ segmentP(app(app(X2,X0),X1),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f1949,f317]) ).
fof(f1960,plain,
( ! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ segmentP(app(sK49,X0),sK52) )
| ~ spl53_3
| ~ spl53_4
| ~ spl53_28 ),
inference(forward_subsumption_resolution,[],[f1954,f1006]) ).
fof(f2126,definition,
( spl53_73
<=> sK50 = cons(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl53_73])],[avatar_definition]) ).
fof(f2128,plain,
( sK50 = cons(sK51,nil)
| ~ spl53_73 ),
inference(avatar_component_clause,[],[f2126]) ).
fof(f3449,plain,
( ~ ssList(sK49)
| segmentP(sK50,sK49)
| nil = sK49
| ~ ssList(sK49)
| ~ spl53_6
| ~ spl53_10 ),
inference(resolution,[],[f1194,f516]) ).
fof(f3453,plain,
( ~ ssList(sK49)
| segmentP(sK50,sK49)
| nil = sK49
| ~ spl53_6
| ~ spl53_10 ),
inference(duplicate_literal_removal,[],[f3449]) ).
fof(f3455,plain,
( segmentP(sK50,sK49)
| nil = sK49
| ~ spl53_6
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f3453,f422]) ).
fof(f3456,plain,
( segmentP(sK50,sK49)
| ~ spl53_6
| spl53_7
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f3455,f574]) ).
fof(f3486,definition,
( spl53_254
<=> sK49 = sK50 ),
introduced(definition,[new_symbols(definition,[spl53_254])],[avatar_definition]) ).
fof(f3488,plain,
( sK49 = sK50
| ~ spl53_254 ),
inference(avatar_component_clause,[],[f3486]) ).
fof(f4226,plain,
( ! [X0] :
( app(nil,X0) != sK50
| ~ ssList(X0)
| cons(sK51,nil) = X0 )
| ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28 ),
inference(forward_demodulation,[],[f1636,f792]) ).
fof(f4444,plain,
( sK50 != sK50
| ~ ssList(sK50)
| sK50 = cons(sK51,nil)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28 ),
inference(superposition,[],[f4226,f644]) ).
fof(f4446,plain,
( ~ ssList(sK50)
| sK50 = cons(sK51,nil)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28 ),
inference(trivial_inequality_removal,[],[f4444]) ).
fof(f4448,plain,
( sK50 = cons(sK51,nil)
| ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28 ),
inference(forward_subsumption_resolution,[],[f4446,f421]) ).
fof(f4451,plain,
( spl53_73
| ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28 ),
inference(avatar_split_clause,[],[f4448,f1005,f790,f559,f545,f2126]) ).
fof(f4480,plain,
( segmentP(sK50,sK50)
| ~ spl53_6
| spl53_7
| ~ spl53_10
| ~ spl53_254 ),
inference(superposition,[],[f3456,f3488]) ).
fof(f4482,plain,
( spl53_16
| ~ spl53_6
| spl53_7
| ~ spl53_10
| ~ spl53_254 ),
inference(avatar_split_clause,[],[f4480,f3486,f589,f572,f568,f626]) ).
fof(f8242,plain,
( ! [X0] :
( ~ segmentP(app(sK52,X0),sK52)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(sK52) )
| ~ spl53_4 ),
inference(superposition,[],[f1955,f645]) ).
fof(f8256,plain,
( ! [X0] :
( ~ segmentP(app(sK52,X0),sK52)
| ~ ssList(X0)
| ~ ssList(sK52) )
| ~ spl53_4
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f8242,f590]) ).
fof(f8272,plain,
( ! [X0] :
( ~ segmentP(app(sK52,X0),sK52)
| ~ ssList(X0) )
| ~ spl53_4
| ~ spl53_10 ),
inference(forward_subsumption_resolution,[],[f8256,f561]) ).
fof(f11058,plain,
( sK49 = app(sK50,nil)
| ~ spl53_3
| ~ spl53_19
| ~ spl53_73 ),
inference(superposition,[],[f1159,f2128]) ).
fof(f11147,plain,
( sK49 = sK50
| ~ spl53_3
| ~ spl53_19
| ~ spl53_73 ),
inference(forward_demodulation,[],[f11058,f657]) ).
fof(f11207,plain,
( spl53_254
| ~ spl53_3
| ~ spl53_19
| ~ spl53_73 ),
inference(avatar_split_clause,[],[f11147,f2126,f790,f554,f3486]) ).
fof(f11261,plain,
( ~ ssList(sK50)
| ~ spl53_16 ),
inference(resolution,[],[f628,f516]) ).
fof(f11265,plain,
( $false
| ~ spl53_16 ),
inference(forward_subsumption_resolution,[],[f11261,f421]) ).
fof(f11266,plain,
~ spl53_16,
inference(avatar_contradiction_clause,[],[f11265]) ).
fof(f11528,definition,
( spl53_889
<=> segmentP(sK49,sK52) ),
introduced(definition,[new_symbols(definition,[spl53_889])],[avatar_definition]) ).
fof(f11529,plain,
( ~ segmentP(sK49,sK52)
| spl53_889 ),
inference(avatar_component_clause,[],[f11528]) ).
fof(f11546,definition,
( spl53_893
<=> segmentP(sK50,sK52) ),
introduced(definition,[new_symbols(definition,[spl53_893])],[avatar_definition]) ).
fof(f11548,plain,
( segmentP(sK50,sK52)
| ~ spl53_893 ),
inference(avatar_component_clause,[],[f11546]) ).
fof(f12470,plain,
( ~ ssList(sK49)
| ~ ssList(nil)
| ~ segmentP(sK49,sK52)
| ~ spl53_3
| ~ spl53_4
| ~ spl53_28 ),
inference(superposition,[],[f1960,f656]) ).
fof(f12472,plain,
( ~ ssList(nil)
| ~ segmentP(sK49,sK52)
| ~ spl53_3
| ~ spl53_4
| ~ spl53_28 ),
inference(forward_subsumption_resolution,[],[f12470,f422]) ).
fof(f12474,plain,
( ~ segmentP(sK49,sK52)
| ~ spl53_3
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28 ),
inference(forward_subsumption_resolution,[],[f12472,f590]) ).
fof(f12475,plain,
( ~ spl53_889
| ~ spl53_3
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28 ),
inference(avatar_split_clause,[],[f12474,f1005,f589,f559,f554,f11528]) ).
fof(f12708,plain,
( ~ ssList(sK52)
| segmentP(sK50,sK52)
| nil = sK52
| ~ spl53_6
| ~ spl53_10
| spl53_889 ),
inference(resolution,[],[f11529,f1194]) ).
fof(f12719,plain,
( segmentP(sK50,sK52)
| nil = sK52
| ~ spl53_4
| ~ spl53_6
| ~ spl53_10
| spl53_889 ),
inference(forward_subsumption_resolution,[],[f12708,f561]) ).
fof(f12725,plain,
( segmentP(sK50,sK52)
| ~ spl53_4
| ~ spl53_6
| ~ spl53_10
| spl53_19
| spl53_889 ),
inference(forward_subsumption_resolution,[],[f12719,f791]) ).
fof(f12726,plain,
( spl53_893
| ~ spl53_4
| ~ spl53_6
| ~ spl53_10
| spl53_19
| spl53_889 ),
inference(avatar_split_clause,[],[f12725,f11528,f790,f589,f568,f559,f11546]) ).
fof(f35167,plain,
( ~ segmentP(sK50,sK52)
| ~ ssList(cons(sK51,nil))
| ~ spl53_1
| ~ spl53_4
| ~ spl53_10 ),
inference(superposition,[],[f8272,f547]) ).
fof(f35178,plain,
( ~ ssList(cons(sK51,nil))
| ~ spl53_1
| ~ spl53_4
| ~ spl53_10
| ~ spl53_893 ),
inference(forward_subsumption_resolution,[],[f35167,f11548]) ).
fof(f35195,plain,
( $false
| ~ spl53_1
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28
| ~ spl53_893 ),
inference(forward_subsumption_resolution,[],[f35178,f1006]) ).
fof(f35196,plain,
( ~ spl53_1
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28
| ~ spl53_893 ),
inference(avatar_contradiction_clause,[],[f35195]) ).
cnf(s1,plain,
( spl53_1
| ~ spl53_2 ),
inference(sat_conversion,[],[f552]) ).
cnf(s2,plain,
( ~ spl53_2
| spl53_3 ),
inference(sat_conversion,[],[f557]) ).
cnf(s3,plain,
( ~ spl53_2
| spl53_4 ),
inference(sat_conversion,[],[f562]) ).
cnf(s4,plain,
( spl53_5
| spl53_6 ),
inference(sat_conversion,[],[f570]) ).
cnf(s6,plain,
( ~ spl53_2
| spl53_8 ),
inference(sat_conversion,[],[f580]) ).
cnf(s7,plain,
( spl53_2
| ~ spl53_7 ),
inference(sat_conversion,[],[f581]) ).
cnf(s8,plain,
( spl53_2
| spl53_5 ),
inference(sat_conversion,[],[f582]) ).
cnf(s9,plain,
( ~ spl53_5
| spl53_7 ),
inference(sat_conversion,[],[f583]) ).
cnf(s18,plain,
spl53_10,
inference(sat_conversion,[],[f618]) ).
cnf(s31,plain,
( ~ spl53_3
| ~ spl53_4
| ~ spl53_7
| ~ spl53_28
| spl53_29 ),
inference(sat_conversion,[],[f1012]) ).
cnf(s34,plain,
( ~ spl53_8
| ~ spl53_10
| spl53_28 ),
inference(sat_conversion,[],[f1039]) ).
cnf(s42,plain,
( ~ spl53_8
| ~ spl53_10
| ~ spl53_29 ),
inference(sat_conversion,[],[f1156]) ).
cnf(s339,plain,
( ~ spl53_1
| ~ spl53_4
| ~ spl53_19
| ~ spl53_28
| spl53_73 ),
inference(sat_conversion,[],[f4451]) ).
cnf(s341,plain,
( ~ spl53_6
| spl53_7
| ~ spl53_10
| spl53_16
| ~ spl53_254 ),
inference(sat_conversion,[],[f4482]) ).
cnf(s762,plain,
( ~ spl53_3
| ~ spl53_19
| ~ spl53_73
| spl53_254 ),
inference(sat_conversion,[],[f11207]) ).
cnf(s775,plain,
~ spl53_16,
inference(sat_conversion,[],[f11266]) ).
cnf(s981,plain,
( ~ spl53_3
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28
| ~ spl53_889 ),
inference(sat_conversion,[],[f12475]) ).
cnf(s994,plain,
( ~ spl53_4
| ~ spl53_6
| ~ spl53_10
| spl53_19
| spl53_889
| spl53_893 ),
inference(sat_conversion,[],[f12726]) ).
cnf(s3492,plain,
( ~ spl53_1
| ~ spl53_4
| ~ spl53_10
| ~ spl53_28
| ~ spl53_893 ),
inference(sat_conversion,[],[f35196]) ).
cnf(s3521,plain,
( ~ spl53_6
| spl53_7
| ~ spl53_10
| ~ spl53_254 ),
inference(rat,[],[s341,s775]) ).
cnf(s3535,plain,
spl53_2,
inference(rat,[],[s9,s7,s8]) ).
cnf(s3536,plain,
spl53_8,
inference(rat,[],[s6,s3535]) ).
cnf(s3537,plain,
spl53_4,
inference(rat,[],[s3,s3535]) ).
cnf(s3538,plain,
spl53_3,
inference(rat,[],[s2,s3535]) ).
cnf(s3539,plain,
spl53_1,
inference(rat,[],[s1,s3535]) ).
cnf(s3544,plain,
~ spl53_29,
inference(rat,[],[s42,s18,s3536]) ).
cnf(s3545,plain,
spl53_28,
inference(rat,[],[s34,s18,s3536]) ).
cnf(s3557,plain,
~ spl53_889,
inference(rat,[],[s981,s3537,s3545,s18,s3538]) ).
cnf(s3558,plain,
~ spl53_7,
inference(rat,[],[s31,s3544,s3545,s3537,s3538]) ).
cnf(s3563,plain,
~ spl53_893,
inference(rat,[],[s3492,s3537,s3539,s18,s3545]) ).
cnf(s3584,plain,
~ spl53_5,
inference(rat,[],[s9,s3558]) ).
cnf(s3648,plain,
spl53_6,
inference(rat,[],[s4,s3584]) ).
cnf(s3691,plain,
spl53_19,
inference(rat,[],[s994,s3563,s3557,s3537,s18,s3648]) ).
cnf(s3692,plain,
~ spl53_254,
inference(rat,[],[s3521,s3558,s18,s3648]) ).
cnf(s3694,plain,
~ spl53_73,
inference(rat,[],[s762,s3692,s3538,s3691]) ).
cnf(s3696,plain,
$false,
inference(rat,[],[s339,s3537,s3545,s3539,s3694,s3691]) ).
fof(f35197,plain,
$false,
inference(avatar_sat_refutation,[],[s3696]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC063+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42 % Computer : n010.cluster.edu
% 0.10/0.42 % Model : x86_64 x86_64
% 0.10/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.42 % Memory : 8046.5625MB
% 0.10/0.42 % OS : Linux 6.8.0-71-generic
% 0.10/0.42 % CPULimit : 300
% 0.10/0.42 % WCLimit : 300
% 0.10/0.42 % DateTime : Mon Sep 28 07:40:48 UTC 2026
% 0.10/0.42 % CPUTime :
% 0.10/0.42 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.46 Running first-order model finding
% 0.10/0.46 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
% 4.90/1.26 % (1746913)Will run a generic schedule for satisfiability detection.
% 4.90/1.26 % (1746918)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3394492591_2999 on theBenchmark for (2999ds/0Mi)
% 4.90/1.26 % (1746919)% WARNING: option uhcvi not known.
% 4.90/1.26 % (1746919)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3000902020:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.90/1.26 % (1746922)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3872249726:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.90/1.26 % (1746920)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=266748945:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.90/1.26 % (1746921)dis+10_1_sil=32000:sp=arity:random_seed=3918570039:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.90/1.26 % (1746923)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4214159128:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.90/1.26 % (1746924)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1033171773:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.90/1.26 % TRYING [1]
% 4.90/1.26 % TRYING [2]
% 4.90/1.26 % TRYING [3]
% 4.90/1.26 % TRYING [4]
% 4.90/1.26 % TRYING [5]
% 4.90/1.26 % (1746921)Instruction limit reached!
% 4.90/1.26 % (1746921)------------------------------
% 4.90/1.26 % (1746921)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746921)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746921)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746921)Termination reason: Instruction limit
% 4.90/1.26 % (1746921)Termination phase: Saturation
% 4.90/1.26 % (1746921)Time elapsed: 0.062 s
% 4.90/1.26 % (1746921)Peak memory usage: 13 MB
% 4.90/1.26 % (1746921)Instructions burned: 105 (million)
% 4.90/1.26 % (1746922)Instruction limit reached!
% 4.90/1.26 % (1746922)------------------------------
% 4.90/1.26 % (1746922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746922)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746922)Termination reason: Instruction limit
% 4.90/1.26 % (1746922)Termination phase: Saturation
% 4.90/1.26 % (1746922)Time elapsed: 0.069 s
% 4.90/1.26 % (1746922)Peak memory usage: 13 MB
% 4.90/1.26 % (1746922)Instructions burned: 117 (million)
% 4.90/1.26 % (1746923)Instruction limit reached!
% 4.90/1.26 % (1746923)------------------------------
% 4.90/1.26 % (1746923)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746923)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746923)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746923)Termination reason: Instruction limit
% 4.90/1.26 % (1746923)Termination phase: Saturation
% 4.90/1.26 % (1746923)Time elapsed: 0.077 s
% 4.90/1.26 % (1746923)Peak memory usage: 14 MB
% 4.90/1.26 % (1746923)Instructions burned: 132 (million)
% 4.90/1.26 % (1746932)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3181202804:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.90/1.26 % (1746933)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2097201063:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.90/1.26 % (1746934)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=1885442036:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.90/1.26 % TRYING [1]
% 4.90/1.26 % TRYING [2]
% 4.90/1.26 % (1746924)Instruction limit reached!
% 4.90/1.26 % (1746924)------------------------------
% 4.90/1.26 % (1746924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746924)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746924)Termination reason: Instruction limit
% 4.90/1.26 % (1746924)Termination phase: Saturation
% 4.90/1.26 % (1746924)Time elapsed: 0.103 s
% 4.90/1.26 % (1746924)Peak memory usage: 15 MB
% 4.90/1.26 % (1746924)Instructions burned: 159 (million)
% 4.90/1.26 % TRYING [3]
% 4.90/1.26 % TRYING [6]
% 4.90/1.26 % TRYING [4]
% 4.90/1.26 % (1746938)ott-21_1_sil=16000:fs=off:random_seed=727933027:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.90/1.26 % (1746933)Instruction limit reached!
% 4.90/1.26 % (1746933)------------------------------
% 4.90/1.26 % (1746933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746933)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746933)Termination reason: Instruction limit
% 4.90/1.26 % (1746933)Termination phase: Saturation
% 4.90/1.26 % (1746933)Time elapsed: 0.074 s
% 4.90/1.26 % (1746933)Peak memory usage: 13 MB
% 4.90/1.26 % (1746933)Instructions burned: 132 (million)
% 4.90/1.26 % TRYING [5]
% 4.90/1.26 % (1746940)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1019549889:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.90/1.26 % (1746938)Instruction limit reached!
% 4.90/1.26 % (1746938)------------------------------
% 4.90/1.26 % (1746938)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746938)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746938)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746938)Termination reason: Instruction limit
% 4.90/1.26 % (1746938)Termination phase: Saturation
% 4.90/1.26 % (1746938)Time elapsed: 0.092 s
% 4.90/1.26 % (1746938)Peak memory usage: 13 MB
% 4.90/1.26 % (1746938)Instructions burned: 181 (million)
% 4.90/1.26 % (1746942)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3600829348:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.90/1.26 % TRYING [1]
% 4.90/1.26 % TRYING [2]
% 4.90/1.26 % TRYING [3]
% 4.90/1.26 % TRYING [7]
% 4.90/1.26 % TRYING [4]
% 4.90/1.26 % TRYING [6]
% 4.90/1.26 % (1746932)Instruction limit reached!
% 4.90/1.26 % (1746932)------------------------------
% 4.90/1.26 % (1746932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746932)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746932)Termination reason: Instruction limit
% 4.90/1.26 % (1746932)Termination phase: Finite model building constraint generation
% 4.90/1.26 % (1746932)Time elapsed: 0.302 s
% 4.90/1.26 % (1746932)Peak memory usage: 29 MB
% 4.90/1.26 % (1746932)Instructions burned: 715 (million)
% 4.90/1.26 % (1746944)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1503717999:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 4.90/1.26 % TRYING [5]
% 4.90/1.26 % (1746934)Instruction limit reached!
% 4.90/1.26 % (1746934)------------------------------
% 4.90/1.26 % (1746934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746934)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746934)Termination reason: Instruction limit
% 4.90/1.26 % (1746934)Termination phase: Saturation
% 4.90/1.26 % (1746934)Time elapsed: 0.370 s
% 4.90/1.26 % (1746934)Peak memory usage: 26 MB
% 4.90/1.26 % (1746934)Instructions burned: 684 (million)
% 4.90/1.26 % (1746946)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=1488180867:i=889:ins=1_2994 on theBenchmark for (2994ds/889Mi)
% 4.90/1.26 % (1746940)Instruction limit reached!
% 4.90/1.26 % (1746940)------------------------------
% 4.90/1.26 % (1746940)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746940)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746940)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746940)Termination reason: Instruction limit
% 4.90/1.26 % (1746940)Termination phase: Saturation
% 4.90/1.26 % (1746940)Time elapsed: 0.320 s
% 4.90/1.26 % (1746940)Peak memory usage: 14 MB
% 4.90/1.26 % (1746940)Instructions burned: 477 (million)
% 4.90/1.26 % (1746948)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=608664238: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)
% 4.90/1.26 % (1746942)Instruction limit reached!
% 4.90/1.26 % (1746942)------------------------------
% 4.90/1.26 % (1746942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746942)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746942)Termination reason: Instruction limit
% 4.90/1.26 % (1746942)Termination phase: Finite model building SAT solving
% 4.90/1.26 % (1746942)Time elapsed: 0.352 s
% 4.90/1.26 % (1746942)Peak memory usage: 23 MB
% 4.90/1.26 % (1746942)Instructions burned: 866 (million)
% 4.90/1.26 % TRYING [14]
% 4.90/1.26 % (1746950)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=2850048790:i=879:kws=inv_precedence:fsr=off_2993 on theBenchmark for (2993ds/879Mi)
% 4.90/1.26 % TRYING [8]
% 4.90/1.26 % (1746919) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1746913-1746919"...
% 4.90/1.26 % (1746919)...printing done.
% 4.90/1.26 % (1746919)Refutation found. Thanks to Tanya!
% 4.90/1.26 % SZS status Theorem for theBenchmark
% 4.90/1.26 % SZS output start Proof for theBenchmark
% See solution above
% 4.90/1.26 % (1746919)------------------------------
% 4.90/1.26 % (1746919)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.90/1.26 % (1746919)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.90/1.26 % (1746919)CaDiCaL version: 2.1.3
% 4.90/1.26 % (1746919)Termination reason: Refutation
% 4.90/1.26 % (1746919)Time elapsed: 0.740 s
% 4.90/1.26 % (1746919)Peak memory usage: 31 MB
% 4.90/1.26 % (1746919)Instructions burned: 1337 (million)
% 4.90/1.26 % (1746913)Success in time 0.79 s
% 4.90/1.26 % Vampire exiting
%------------------------------------------------------------------------------