%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC058+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 : n004.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:29 PM UTC 2026
% Result : Theorem 1.49s 0.69s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 23
% Syntax : Number of formulae : 186 ( 23 unt; 10 def)
% Number of atoms : 651 ( 71 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 860 ( 395 ~; 390 |; 29 &)
% ( 14 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 11 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 151 ( 0 sgn 139 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(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(f47,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( rearsegP(X0,X1)
& rearsegP(X1,X2) )
=> rearsegP(X0,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax47) ).
fof(f48,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( rearsegP(X0,X1)
& rearsegP(X1,X0) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax48) ).
fof(f50,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X0,X1)
=> rearsegP(app(X2,X0),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax50) ).
fof(f51,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax51) ).
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(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 != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ),
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 != X1
| nil = X0 )
& ( ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) ) ) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ rearsegP(X3,X2) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X2,X1) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
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(f159,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( rearsegP(X0,X2)
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f160,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( rearsegP(X0,X2)
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X2)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f159]) ).
fof(f161,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X0,X1)
| ~ rearsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f161]) ).
fof(f164,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( rearsegP(app(X2,X0),X1)
| ~ rearsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f165,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( rearsegP(app(X2,X0),X1)
| ~ rearsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f164]) ).
fof(f166,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f51]) ).
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(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 = X1
& nil != X0 )
| ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) ) ) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& rearsegP(X3,X2) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f237,plain,
! [X0,X1] :
( ~ rearsegP(X0,X1)
| ~ ssList(X1)
| app(sK6(X0,X1),X1) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f238,plain,
! [X0,X1] :
( ssList(sK6(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f239,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
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(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(f347,plain,
! [X2,X0,X1] :
( ~ rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ rearsegP(X0,X1)
| rearsegP(X0,X2) ),
inference(cnf_transformation,[],[f160]) ).
fof(f348,plain,
! [X0,X1] :
( ~ rearsegP(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ rearsegP(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f162]) ).
fof(f350,plain,
! [X2,X0,X1] :
( rearsegP(app(X2,X0),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f165]) ).
fof(f351,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f166]) ).
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(f396,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f410,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK48 ),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
( neq(sK48,nil)
| nil != sK47 ),
inference(cnf_transformation,[],[f221]) ).
fof(f415,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
( rearsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
( rearsegP(sK50,sK49)
| nil = sK50 ),
inference(cnf_transformation,[],[f221]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f221]) ).
fof(f420,plain,
ssList(sK50),
inference(cnf_transformation,[],[f221]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f427,plain,
( neq(sK50,nil)
| nil != sK49 ),
inference(definition_unfolding,[],[f412,f419,f418]) ).
fof(f428,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK49 ),
inference(definition_unfolding,[],[f411,f418,f419,f418]) ).
fof(f429,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK50 ),
inference(definition_unfolding,[],[f410,f418,f419,f419]) ).
fof(f434,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f239]) ).
fof(f435,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(f463,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f465,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f467,definition,
( spl51_2
<=> ! [X4] :
( ~ segmentP(sK49,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK50,X4) ) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f468,plain,
( ! [X4] :
( ~ segmentP(sK50,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK49,X4) )
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f467]) ).
fof(f469,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f429,f467,f463]) ).
fof(f471,definition,
( spl51_3
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f472,plain,
( nil = sK49
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f473,plain,
( nil != sK49
| spl51_3 ),
inference(avatar_component_clause,[],[f471]) ).
fof(f474,plain,
( ~ spl51_3
| spl51_2 ),
inference(avatar_split_clause,[],[f428,f467,f471]) ).
fof(f476,definition,
( spl51_4
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f478,plain,
( neq(sK50,nil)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f476]) ).
fof(f479,plain,
( ~ spl51_3
| spl51_4 ),
inference(avatar_split_clause,[],[f427,f476,f471]) ).
fof(f482,definition,
( spl51_5
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f484,plain,
( neq(sK49,nil)
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f486,plain,
( spl51_1
| spl51_5 ),
inference(avatar_split_clause,[],[f415,f482,f463]) ).
fof(f488,definition,
( spl51_6
<=> rearsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f490,plain,
( rearsegP(sK50,sK49)
| ~ spl51_6 ),
inference(avatar_component_clause,[],[f488]) ).
fof(f491,plain,
( spl51_3
| spl51_6 ),
inference(avatar_split_clause,[],[f416,f488,f471]) ).
fof(f492,plain,
( spl51_1
| spl51_6 ),
inference(avatar_split_clause,[],[f417,f488,f463]) ).
fof(f511,definition,
( spl51_11
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_11])],[avatar_definition]) ).
fof(f512,plain,
( ~ segmentP(nil,nil)
| spl51_11 ),
inference(avatar_component_clause,[],[f511]) ).
fof(f513,plain,
( segmentP(nil,nil)
| ~ spl51_11 ),
inference(avatar_component_clause,[],[f511]) ).
fof(f525,plain,
( ssList(nil)
| ~ spl51_1 ),
inference(superposition,[],[f420,f465]) ).
fof(f527,plain,
( neq(nil,nil)
| ~ spl51_1
| ~ spl51_4 ),
inference(forward_demodulation,[],[f478,f465]) ).
fof(f528,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK50,X4) )
| ~ spl51_2
| ~ spl51_3 ),
inference(forward_demodulation,[],[f468,f472]) ).
fof(f529,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl51_1
| ~ spl51_2
| ~ spl51_3 ),
inference(forward_demodulation,[],[f528,f465]) ).
fof(f530,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl51_1
| ~ spl51_2
| ~ spl51_3 ),
inference(duplicate_literal_removal,[],[f529]) ).
fof(f531,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_11 ),
inference(resolution,[],[f513,f530]) ).
fof(f532,plain,
( ~ neq(nil,nil)
| ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f531,f525]) ).
fof(f533,plain,
( $false
| ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_4
| ~ spl51_11 ),
inference(forward_subsumption_resolution,[],[f532,f527]) ).
fof(f534,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_4
| ~ spl51_11 ),
inference(avatar_contradiction_clause,[],[f533]) ).
fof(f538,plain,
( ~ ssList(nil)
| spl51_11 ),
inference(resolution,[],[f356,f512]) ).
fof(f540,plain,
( $false
| spl51_11 ),
inference(forward_subsumption_resolution,[],[f538,f305]) ).
fof(f541,plain,
spl51_11,
inference(avatar_contradiction_clause,[],[f540]) ).
fof(f611,plain,
! [X0] :
( ~ ssList(nil)
| app(sK6(X0,nil),nil) = X0
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(resolution,[],[f237,f351]) ).
fof(f614,plain,
( ~ ssList(sK49)
| sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_6 ),
inference(resolution,[],[f237,f490]) ).
fof(f617,plain,
! [X0] :
( ~ ssList(nil)
| app(sK6(X0,nil),nil) = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f611]) ).
fof(f619,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ ssList(sK50)
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f614,f421]) ).
fof(f621,plain,
! [X0] :
( ~ ssList(X0)
| app(sK6(X0,nil),nil) = X0 ),
inference(forward_subsumption_resolution,[],[f617,f305]) ).
fof(f622,plain,
( sK50 = app(sK6(sK50,sK49),sK49)
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f619,f420]) ).
fof(f640,plain,
sK49 = app(sK6(sK49,nil),nil),
inference(resolution,[],[f621,f421]) ).
fof(f651,plain,
! [X0] :
( rearsegP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(sK6(sK49,nil))
| ~ rearsegP(nil,X0)
| ~ ssList(nil) ),
inference(superposition,[],[f350,f640]) ).
fof(f654,plain,
! [X0] :
( rearsegP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(sK6(sK49,nil))
| ~ rearsegP(nil,X0) ),
inference(forward_subsumption_resolution,[],[f651,f305]) ).
fof(f658,definition,
( spl51_18
<=> ssList(sK6(sK49,nil)) ),
introduced(definition,[new_symbols(definition,[spl51_18])],[avatar_definition]) ).
fof(f660,plain,
( ~ ssList(sK6(sK49,nil))
| spl51_18 ),
inference(avatar_component_clause,[],[f658]) ).
fof(f662,definition,
( spl51_19
<=> ! [X0] :
( rearsegP(sK49,X0)
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl51_19])],[avatar_definition]) ).
fof(f663,plain,
( ! [X0] :
( ~ rearsegP(nil,X0)
| rearsegP(sK49,X0)
| ~ ssList(X0) )
| ~ spl51_19 ),
inference(avatar_component_clause,[],[f662]) ).
fof(f664,plain,
( ~ spl51_18
| spl51_19 ),
inference(avatar_split_clause,[],[f654,f662,f658]) ).
fof(f674,definition,
( spl51_22
<=> ssList(sK6(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_22])],[avatar_definition]) ).
fof(f675,plain,
( ssList(sK6(sK50,sK49))
| ~ spl51_22 ),
inference(avatar_component_clause,[],[f674]) ).
fof(f676,plain,
( ~ ssList(sK6(sK50,sK49))
| spl51_22 ),
inference(avatar_component_clause,[],[f674]) ).
fof(f681,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_22 ),
inference(resolution,[],[f676,f238]) ).
fof(f682,plain,
( ~ ssList(sK50)
| ~ rearsegP(sK50,sK49)
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f681,f421]) ).
fof(f683,plain,
( ~ rearsegP(sK50,sK49)
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f682,f420]) ).
fof(f684,plain,
( $false
| ~ spl51_6
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f683,f490]) ).
fof(f685,plain,
( ~ spl51_6
| spl51_22 ),
inference(avatar_contradiction_clause,[],[f684]) ).
fof(f688,plain,
( ~ ssList(nil)
| ~ ssList(sK49)
| ~ rearsegP(sK49,nil)
| spl51_18 ),
inference(resolution,[],[f660,f238]) ).
fof(f689,plain,
( ~ ssList(sK49)
| ~ rearsegP(sK49,nil)
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f688,f305]) ).
fof(f690,plain,
( ~ rearsegP(sK49,nil)
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f689,f421]) ).
fof(f691,plain,
( ~ ssList(sK49)
| spl51_18 ),
inference(resolution,[],[f690,f351]) ).
fof(f692,plain,
( $false
| spl51_18 ),
inference(forward_subsumption_resolution,[],[f691,f421]) ).
fof(f693,plain,
spl51_18,
inference(avatar_contradiction_clause,[],[f692]) ).
fof(f713,plain,
( rearsegP(sK49,nil)
| ~ ssList(nil)
| ~ ssList(nil)
| ~ spl51_19 ),
inference(resolution,[],[f663,f351]) ).
fof(f714,plain,
( rearsegP(sK49,nil)
| ~ ssList(nil)
| ~ spl51_19 ),
inference(duplicate_literal_removal,[],[f713]) ).
fof(f716,plain,
( rearsegP(sK49,nil)
| ~ spl51_19 ),
inference(forward_subsumption_resolution,[],[f714,f305]) ).
fof(f806,plain,
( ! [X0] :
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ rearsegP(X0,sK50)
| rearsegP(X0,sK49) )
| ~ spl51_6 ),
inference(resolution,[],[f347,f490]) ).
fof(f815,plain,
( ! [X0] :
( ~ ssList(sK49)
| ~ ssList(X0)
| ~ rearsegP(X0,sK50)
| rearsegP(X0,sK49) )
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f806,f420]) ).
fof(f818,plain,
( ! [X0] :
( ~ rearsegP(X0,sK50)
| ~ ssList(X0)
| rearsegP(X0,sK49) )
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f815,f421]) ).
fof(f828,plain,
( ! [X0] :
( ~ ssList(app(X0,sK50))
| rearsegP(app(X0,sK50),sK49)
| ~ ssList(sK50)
| ~ ssList(X0)
| ~ ssList(app(X0,sK50)) )
| ~ spl51_6 ),
inference(resolution,[],[f818,f434]) ).
fof(f832,plain,
( ! [X0] :
( ~ ssList(app(X0,sK50))
| rearsegP(app(X0,sK50),sK49)
| ~ ssList(sK50)
| ~ ssList(X0) )
| ~ spl51_6 ),
inference(duplicate_literal_removal,[],[f828]) ).
fof(f837,plain,
( ! [X0] :
( rearsegP(app(X0,sK50),sK49)
| ~ ssList(app(X0,sK50))
| ~ ssList(X0) )
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f832,f420]) ).
fof(f866,plain,
( ! [X0] :
( ~ ssList(app(X0,sK50))
| ~ ssList(X0)
| ~ ssList(app(X0,sK50))
| ~ ssList(sK49)
| ~ rearsegP(sK49,app(X0,sK50))
| sK49 = app(X0,sK50) )
| ~ spl51_6 ),
inference(resolution,[],[f837,f348]) ).
fof(f868,plain,
( ! [X0] :
( ~ ssList(app(X0,sK50))
| ~ ssList(X0)
| ~ ssList(sK49)
| ~ rearsegP(sK49,app(X0,sK50))
| sK49 = app(X0,sK50) )
| ~ spl51_6 ),
inference(duplicate_literal_removal,[],[f866]) ).
fof(f871,plain,
( ! [X0] :
( ~ rearsegP(sK49,app(X0,sK50))
| ~ ssList(X0)
| ~ ssList(app(X0,sK50))
| sK49 = app(X0,sK50) )
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f868,f421]) ).
fof(f1218,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f319,f421]) ).
fof(f1219,plain,
sK50 = app(nil,sK50),
inference(resolution,[],[f319,f420]) ).
fof(f1255,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f396,f421]) ).
fof(f1256,plain,
sK50 = app(sK50,nil),
inference(resolution,[],[f396,f420]) ).
fof(f1272,plain,
( ~ rearsegP(sK49,sK50)
| ~ ssList(nil)
| ~ ssList(sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(superposition,[],[f871,f1219]) ).
fof(f1530,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(f1538,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1530]) ).
fof(f1655,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(superposition,[],[f435,f1218]) ).
fof(f1688,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f1655,f421]) ).
fof(f1717,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f1688,f305]) ).
fof(f2715,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(resolution,[],[f1717,f317]) ).
fof(f2717,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49) ),
inference(duplicate_literal_removal,[],[f2715]) ).
fof(f2718,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2717,f421]) ).
fof(f2724,plain,
( segmentP(sK49,sK49)
| ~ ssList(nil) ),
inference(superposition,[],[f2718,f1255]) ).
fof(f2725,plain,
segmentP(sK49,sK49),
inference(forward_subsumption_resolution,[],[f2724,f305]) ).
fof(f7836,plain,
( ! [X0] :
( segmentP(app(sK50,X0),sK49)
| ~ ssList(sK6(sK50,sK49))
| ~ ssList(X0)
| ~ ssList(sK49) )
| ~ spl51_6 ),
inference(superposition,[],[f1538,f622]) ).
fof(f7855,plain,
( ! [X0] :
( segmentP(app(sK50,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) )
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7836,f675]) ).
fof(f7882,plain,
( ! [X0] :
( segmentP(app(sK50,X0),sK49)
| ~ ssList(X0) )
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7855,f421]) ).
fof(f7924,plain,
( segmentP(sK50,sK49)
| ~ ssList(nil)
| ~ spl51_6
| ~ spl51_22 ),
inference(superposition,[],[f7882,f1256]) ).
fof(f7925,plain,
( segmentP(sK50,sK49)
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7924,f305]) ).
fof(f7930,plain,
( ~ ssList(sK49)
| ~ neq(sK49,nil)
| ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_6
| ~ spl51_22 ),
inference(resolution,[],[f7925,f468]) ).
fof(f7939,plain,
( ~ neq(sK49,nil)
| ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7930,f421]) ).
fof(f7943,plain,
( ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7939,f484]) ).
fof(f7944,plain,
( $false
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f7943,f2725]) ).
fof(f7945,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(avatar_contradiction_clause,[],[f7944]) ).
fof(f8386,plain,
( ~ rearsegP(sK49,sK50)
| ~ ssList(sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f1272,f305]) ).
fof(f8398,plain,
( ~ rearsegP(sK49,sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f8386,f420]) ).
fof(f8405,plain,
( ~ rearsegP(sK49,nil)
| sK49 = sK50
| ~ spl51_1
| ~ spl51_6 ),
inference(forward_demodulation,[],[f8398,f465]) ).
fof(f8411,plain,
( sK49 = sK50
| ~ spl51_1
| ~ spl51_6
| ~ spl51_19 ),
inference(forward_subsumption_resolution,[],[f8405,f716]) ).
fof(f8417,plain,
( nil = sK49
| ~ spl51_1
| ~ spl51_6
| ~ spl51_19 ),
inference(forward_demodulation,[],[f8411,f465]) ).
fof(f8423,plain,
( $false
| ~ spl51_1
| spl51_3
| ~ spl51_6
| ~ spl51_19 ),
inference(forward_subsumption_resolution,[],[f8417,f473]) ).
fof(f8424,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_6
| ~ spl51_19 ),
inference(avatar_contradiction_clause,[],[f8423]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f469]) ).
cnf(s2,plain,
( spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f474]) ).
cnf(s3,plain,
( ~ spl51_3
| spl51_4 ),
inference(sat_conversion,[],[f479]) ).
cnf(s6,plain,
( spl51_1
| spl51_5 ),
inference(sat_conversion,[],[f486]) ).
cnf(s7,plain,
( spl51_3
| spl51_6 ),
inference(sat_conversion,[],[f491]) ).
cnf(s8,plain,
( spl51_1
| spl51_6 ),
inference(sat_conversion,[],[f492]) ).
cnf(s15,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_4
| ~ spl51_11 ),
inference(sat_conversion,[],[f534]) ).
cnf(s17,plain,
spl51_11,
inference(sat_conversion,[],[f541]) ).
cnf(s22,plain,
( ~ spl51_18
| spl51_19 ),
inference(sat_conversion,[],[f664]) ).
cnf(s25,plain,
( ~ spl51_6
| spl51_22 ),
inference(sat_conversion,[],[f685]) ).
cnf(s26,plain,
spl51_18,
inference(sat_conversion,[],[f693]) ).
cnf(s354,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(sat_conversion,[],[f7945]) ).
cnf(s461,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_6
| ~ spl51_19 ),
inference(sat_conversion,[],[f8424]) ).
cnf(s485,plain,
spl51_19,
inference(rat,[],[s22,s26]) ).
cnf(s492,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_4 ),
inference(rat,[],[s15,s17]) ).
cnf(s498,plain,
spl51_1,
inference(rat,[],[s354,s25,s1,s6,s8]) ).
cnf(s504,plain,
spl51_3,
inference(rat,[],[s7,s461,s498,s485]) ).
cnf(s505,plain,
spl51_4,
inference(rat,[],[s3,s504]) ).
cnf(s506,plain,
spl51_2,
inference(rat,[],[s2,s504]) ).
cnf(s507,plain,
$false,
inference(rat,[],[s492,s498,s504,s506,s505]) ).
fof(f8427,plain,
$false,
inference(avatar_sat_refutation,[],[s507]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC058+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.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:38:37 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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
% 1.49/0.69 % (186140)Will run a generic schedule for satisfiability detection.
% 1.49/0.69 % (186149)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2699421656:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.49/0.69 % (186146)% WARNING: option uhcvi not known.
% 1.49/0.69 % (186145)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2148355408_2999 on theBenchmark for (2999ds/0Mi)
% 1.49/0.69 % (186150)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1482301257:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.49/0.69 % (186147)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=823938030:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.49/0.69 % (186148)dis+10_1_sil=32000:sp=arity:random_seed=238878218:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.49/0.69 % (186151)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=392430165:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.49/0.69 % (186146)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=513706059:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.49/0.69 % TRYING [1]
% 1.49/0.69 % TRYING [2]
% 1.49/0.69 % TRYING [3]
% 1.49/0.69 % (186149)Instruction limit reached!
% 1.49/0.69 % (186149)------------------------------
% 1.49/0.69 % (186149)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186149)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186149)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186149)Termination reason: Instruction limit
% 1.49/0.69 % (186149)Termination phase: Saturation
% 1.49/0.69 % (186149)Time elapsed: 0.037 s
% 1.49/0.69 % (186149)Peak memory usage: 13 MB
% 1.49/0.69 % (186149)Instructions burned: 117 (million)
% 1.49/0.69 % TRYING [4]
% 1.49/0.69 % (186159)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2579940204:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.49/0.69 % TRYING [1]
% 1.49/0.69 % TRYING [2]
% 1.49/0.69 % TRYING [3]
% 1.49/0.69 % TRYING [4]
% 1.49/0.69 % (186148)Instruction limit reached!
% 1.49/0.69 % (186148)------------------------------
% 1.49/0.69 % (186148)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186148)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186148)Termination reason: Instruction limit
% 1.49/0.69 % (186148)Termination phase: Saturation
% 1.49/0.69 % (186148)Time elapsed: 0.061 s
% 1.49/0.69 % (186148)Peak memory usage: 13 MB
% 1.49/0.69 % (186148)Instructions burned: 104 (million)
% 1.49/0.69 % (186150)Instruction limit reached!
% 1.49/0.69 % (186150)------------------------------
% 1.49/0.69 % (186150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186150)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186150)Termination reason: Instruction limit
% 1.49/0.69 % (186150)Termination phase: Saturation
% 1.49/0.69 % (186150)Time elapsed: 0.074 s
% 1.49/0.69 % (186150)Peak memory usage: 14 MB
% 1.49/0.69 % (186150)Instructions burned: 132 (million)
% 1.49/0.69 % (186161)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1011300047:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.49/0.69 % TRYING [5]
% 1.49/0.69 % TRYING [5]
% 1.49/0.69 % (186162)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=2687318646:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.49/0.69 % (186151)Instruction limit reached!
% 1.49/0.69 % (186151)------------------------------
% 1.49/0.69 % (186151)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186151)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186151)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186151)Termination reason: Instruction limit
% 1.49/0.69 % (186151)Termination phase: Saturation
% 1.49/0.69 % (186151)Time elapsed: 0.098 s
% 1.49/0.69 % (186151)Peak memory usage: 15 MB
% 1.49/0.69 % (186151)Instructions burned: 165 (million)
% 1.49/0.69 % (186165)ott-21_1_sil=16000:fs=off:random_seed=410576366:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.49/0.69 % (186161)Instruction limit reached!
% 1.49/0.69 % (186161)------------------------------
% 1.49/0.69 % (186161)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186161)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186161)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186161)Termination reason: Instruction limit
% 1.49/0.69 % (186161)Termination phase: Saturation
% 1.49/0.69 % (186161)Time elapsed: 0.071 s
% 1.49/0.69 % (186161)Peak memory usage: 13 MB
% 1.49/0.69 % (186161)Instructions burned: 131 (million)
% 1.49/0.69 % (186167)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=305322793:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.49/0.69 % TRYING [6]
% 1.49/0.69 % (186159)Instruction limit reached!
% 1.49/0.69 % (186159)------------------------------
% 1.49/0.69 % (186159)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186159)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186159)Termination reason: Instruction limit
% 1.49/0.69 % (186159)Termination phase: Finite model building constraint generation
% 1.49/0.69 % (186159)Time elapsed: 0.162 s
% 1.49/0.69 % (186159)Peak memory usage: 27 MB
% 1.49/0.69 % (186159)Instructions burned: 720 (million)
% 1.49/0.69 % (186165)Instruction limit reached!
% 1.49/0.69 % (186165)------------------------------
% 1.49/0.69 % (186165)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186165)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186165)Termination reason: Instruction limit
% 1.49/0.69 % (186165)Termination phase: Saturation
% 1.49/0.69 % (186165)Time elapsed: 0.092 s
% 1.49/0.69 % (186165)Peak memory usage: 13 MB
% 1.49/0.69 % (186165)Instructions burned: 180 (million)
% 1.49/0.69 % TRYING [6]
% 1.49/0.69 % (186169)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1648136810:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.49/0.69 % TRYING [1]
% 1.49/0.69 % TRYING [2]
% 1.49/0.69 % TRYING [3]
% 1.49/0.69 % (186170)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3938529177:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.49/0.69 % (186162) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-186140-186162"...
% 1.49/0.69 % (186162)...printing done.
% 1.49/0.69 % (186162)Refutation found. Thanks to Tanya!
% 1.49/0.69 % SZS status Theorem for theBenchmark
% 1.49/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 1.49/0.69 % (186162)------------------------------
% 1.49/0.69 % (186162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.49/0.69 % (186162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/0.69 % (186162)CaDiCaL version: 2.1.3
% 1.49/0.69 % (186162)Termination reason: Refutation
% 1.49/0.69 % (186162)Time elapsed: 0.152 s
% 1.49/0.69 % (186162)Peak memory usage: 16 MB
% 1.49/0.69 % (186162)Instructions burned: 265 (million)
% 1.49/0.69 % (186140)Success in time 0.286 s
% 1.49/0.69 % Vampire exiting
%------------------------------------------------------------------------------