%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC057+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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:28 PM UTC 2026
% Result : Theorem 1.39s 0.79s
% Output : Refutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 23
% Syntax : Number of formulae : 170 ( 22 unt; 12 def)
% Number of atoms : 539 ( 65 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 675 ( 306 ~; 302 |; 28 &)
% ( 16 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 13 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 100 ( 0 sgn 88 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f41,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( frontsegP(X0,X1)
& frontsegP(X1,X0) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax41) ).
fof(f43,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X0,X1)
=> frontsegP(app(X0,X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax43) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/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)
| ~ frontsegP(X3,X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ( 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)
| ~ frontsegP(X3,X2) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ frontsegP(X0,X1)
| ~ frontsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ frontsegP(X0,X1)
| ~ frontsegP(X1,X0)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f151]) ).
fof(f154,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f155,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f154]) ).
fof(f157,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
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)
& frontsegP(X3,X2) ) ) )
& 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] :
( ssList(sK5(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ 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(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(f338,plain,
! [X0,X1] :
( ~ frontsegP(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f152]) ).
fof(f340,plain,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f344,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f356,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
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,
( frontsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f221]) ).
fof(f417,plain,
( frontsegP(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(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
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f490,plain,
( frontsegP(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(f583,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ frontsegP(sK49,sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(resolution,[],[f338,f490]) ).
fof(f590,plain,
( ~ ssList(sK49)
| ~ frontsegP(sK49,sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f583,f420]) ).
fof(f591,plain,
( ~ frontsegP(sK49,sK50)
| sK49 = sK50
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f590,f421]) ).
fof(f593,definition,
( spl51_16
<=> sK49 = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_16])],[avatar_definition]) ).
fof(f595,plain,
( sK49 = sK50
| ~ spl51_16 ),
inference(avatar_component_clause,[],[f593]) ).
fof(f597,definition,
( spl51_17
<=> frontsegP(sK49,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_17])],[avatar_definition]) ).
fof(f599,plain,
( ~ frontsegP(sK49,sK50)
| spl51_17 ),
inference(avatar_component_clause,[],[f597]) ).
fof(f600,plain,
( spl51_16
| ~ spl51_17
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f591,f488,f597,f593]) ).
fof(f611,plain,
! [X0] :
( ~ ssList(nil)
| app(nil,sK5(X0,nil)) = X0
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(resolution,[],[f234,f344]) ).
fof(f614,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_6 ),
inference(resolution,[],[f234,f490]) ).
fof(f617,plain,
! [X0] :
( ~ ssList(nil)
| app(nil,sK5(X0,nil)) = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f611]) ).
fof(f619,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f614,f421]) ).
fof(f621,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,sK5(X0,nil)) = X0 ),
inference(forward_subsumption_resolution,[],[f617,f305]) ).
fof(f622,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f619,f420]) ).
fof(f640,plain,
sK49 = app(nil,sK5(sK49,nil)),
inference(resolution,[],[f621,f421]) ).
fof(f649,plain,
! [X0] :
( frontsegP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(sK5(sK49,nil))
| ~ frontsegP(nil,X0)
| ~ ssList(nil) ),
inference(superposition,[],[f340,f640]) ).
fof(f655,plain,
! [X0] :
( frontsegP(sK49,X0)
| ~ ssList(X0)
| ~ ssList(sK5(sK49,nil))
| ~ frontsegP(nil,X0) ),
inference(forward_subsumption_resolution,[],[f649,f305]) ).
fof(f666,definition,
( spl51_20
<=> ssList(sK5(sK49,nil)) ),
introduced(definition,[new_symbols(definition,[spl51_20])],[avatar_definition]) ).
fof(f668,plain,
( ~ ssList(sK5(sK49,nil))
| spl51_20 ),
inference(avatar_component_clause,[],[f666]) ).
fof(f670,definition,
( spl51_21
<=> ! [X0] :
( frontsegP(sK49,X0)
| ~ frontsegP(nil,X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl51_21])],[avatar_definition]) ).
fof(f671,plain,
( ! [X0] :
( ~ frontsegP(nil,X0)
| frontsegP(sK49,X0)
| ~ ssList(X0) )
| ~ spl51_21 ),
inference(avatar_component_clause,[],[f670]) ).
fof(f672,plain,
( ~ spl51_20
| spl51_21 ),
inference(avatar_split_clause,[],[f655,f670,f666]) ).
fof(f674,definition,
( spl51_22
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_22])],[avatar_definition]) ).
fof(f675,plain,
( ssList(sK5(sK50,sK49))
| ~ spl51_22 ),
inference(avatar_component_clause,[],[f674]) ).
fof(f676,plain,
( ~ ssList(sK5(sK50,sK49))
| spl51_22 ),
inference(avatar_component_clause,[],[f674]) ).
fof(f685,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_22 ),
inference(resolution,[],[f676,f235]) ).
fof(f686,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f685,f421]) ).
fof(f687,plain,
( ~ frontsegP(sK50,sK49)
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f686,f420]) ).
fof(f688,plain,
( $false
| ~ spl51_6
| spl51_22 ),
inference(forward_subsumption_resolution,[],[f687,f490]) ).
fof(f689,plain,
( ~ spl51_6
| spl51_22 ),
inference(avatar_contradiction_clause,[],[f688]) ).
fof(f702,plain,
( ~ ssList(nil)
| ~ ssList(sK49)
| ~ frontsegP(sK49,nil)
| spl51_20 ),
inference(resolution,[],[f668,f235]) ).
fof(f703,plain,
( ~ ssList(sK49)
| ~ frontsegP(sK49,nil)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f702,f305]) ).
fof(f704,plain,
( ~ frontsegP(sK49,nil)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f703,f421]) ).
fof(f705,plain,
( ~ ssList(sK49)
| spl51_20 ),
inference(resolution,[],[f704,f344]) ).
fof(f706,plain,
( $false
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f705,f421]) ).
fof(f707,plain,
spl51_20,
inference(avatar_contradiction_clause,[],[f706]) ).
fof(f726,plain,
( frontsegP(sK49,nil)
| ~ ssList(nil)
| ~ ssList(nil)
| ~ spl51_21 ),
inference(resolution,[],[f671,f344]) ).
fof(f727,plain,
( frontsegP(sK49,nil)
| ~ ssList(nil)
| ~ spl51_21 ),
inference(duplicate_literal_removal,[],[f726]) ).
fof(f729,plain,
( frontsegP(sK49,nil)
| ~ spl51_21 ),
inference(forward_subsumption_resolution,[],[f727,f305]) ).
fof(f1152,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f319,f421]) ).
fof(f1223,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f396,f421]) ).
fof(f2515,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(superposition,[],[f435,f1152]) ).
fof(f2521,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2515,f421]) ).
fof(f2546,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK49) ),
inference(forward_subsumption_resolution,[],[f2521,f305]) ).
fof(f2808,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(resolution,[],[f2546,f317]) ).
fof(f2810,plain,
( ~ ssList(sK50)
| ~ ssList(sK5(sK50,sK49))
| segmentP(sK50,sK49)
| ~ spl51_6 ),
inference(superposition,[],[f2546,f622]) ).
fof(f2812,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49) ),
inference(duplicate_literal_removal,[],[f2808]) ).
fof(f2813,plain,
( ~ ssList(sK5(sK50,sK49))
| segmentP(sK50,sK49)
| ~ spl51_6 ),
inference(forward_subsumption_resolution,[],[f2810,f420]) ).
fof(f2814,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2812,f421]) ).
fof(f2815,plain,
( segmentP(sK50,sK49)
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f2813,f675]) ).
fof(f2816,plain,
( ~ ssList(sK49)
| ~ neq(sK49,nil)
| ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_6
| ~ spl51_22 ),
inference(resolution,[],[f2815,f468]) ).
fof(f2825,plain,
( ~ neq(sK49,nil)
| ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f2816,f421]) ).
fof(f2829,plain,
( ~ segmentP(sK49,sK49)
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f2825,f484]) ).
fof(f2835,plain,
( segmentP(sK49,sK49)
| ~ ssList(nil) ),
inference(superposition,[],[f2814,f1223]) ).
fof(f2839,plain,
segmentP(sK49,sK49),
inference(forward_subsumption_resolution,[],[f2835,f305]) ).
fof(f2855,plain,
( $false
| ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(forward_subsumption_resolution,[],[f2829,f2839]) ).
fof(f2856,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(avatar_contradiction_clause,[],[f2855]) ).
fof(f3133,plain,
( ~ frontsegP(sK49,nil)
| ~ spl51_1
| spl51_17 ),
inference(forward_demodulation,[],[f599,f465]) ).
fof(f3134,plain,
( $false
| ~ spl51_1
| spl51_17
| ~ spl51_21 ),
inference(forward_subsumption_resolution,[],[f3133,f729]) ).
fof(f3135,plain,
( ~ spl51_1
| spl51_17
| ~ spl51_21 ),
inference(avatar_contradiction_clause,[],[f3134]) ).
fof(f3136,plain,
( nil = sK49
| ~ spl51_1
| ~ spl51_16 ),
inference(forward_demodulation,[],[f595,f465]) ).
fof(f3138,plain,
( $false
| ~ spl51_1
| spl51_3
| ~ spl51_16 ),
inference(forward_subsumption_resolution,[],[f3136,f473]) ).
fof(f3139,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_16 ),
inference(avatar_contradiction_clause,[],[f3138]) ).
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(s21,plain,
( ~ spl51_6
| spl51_16
| ~ spl51_17 ),
inference(sat_conversion,[],[f600]) ).
cnf(s23,plain,
( ~ spl51_20
| spl51_21 ),
inference(sat_conversion,[],[f672]) ).
cnf(s25,plain,
( ~ spl51_6
| spl51_22 ),
inference(sat_conversion,[],[f689]) ).
cnf(s27,plain,
spl51_20,
inference(sat_conversion,[],[f707]) ).
cnf(s96,plain,
( ~ spl51_2
| ~ spl51_5
| ~ spl51_6
| ~ spl51_22 ),
inference(sat_conversion,[],[f2856]) ).
cnf(s120,plain,
( ~ spl51_1
| spl51_17
| ~ spl51_21 ),
inference(sat_conversion,[],[f3135]) ).
cnf(s121,plain,
( ~ spl51_1
| spl51_3
| ~ spl51_16 ),
inference(sat_conversion,[],[f3139]) ).
cnf(s134,plain,
spl51_21,
inference(rat,[],[s23,s27]) ).
cnf(s142,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_3
| ~ spl51_4 ),
inference(rat,[],[s15,s17]) ).
cnf(s148,plain,
spl51_1,
inference(rat,[],[s96,s25,s1,s6,s8]) ).
cnf(s149,plain,
spl51_17,
inference(rat,[],[s120,s134,s148]) ).
cnf(s150,plain,
spl51_3,
inference(rat,[],[s21,s7,s121,s149,s148]) ).
cnf(s151,plain,
spl51_4,
inference(rat,[],[s3,s150]) ).
cnf(s152,plain,
spl51_2,
inference(rat,[],[s2,s150]) ).
cnf(s153,plain,
$false,
inference(rat,[],[s142,s152,s148,s150,s151]) ).
fof(f3140,plain,
$false,
inference(avatar_sat_refutation,[],[s153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC057+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41 % Computer : n002.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Mon Sep 28 07:41:37 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.46 Running first-order model finding
% 0.14/0.46 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.39/0.79 % (190651)Will run a generic schedule for satisfiability detection.
% 1.39/0.79 % (190660)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=288784207:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.39/0.79 % (190656)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1799552635_2999 on theBenchmark for (2999ds/0Mi)
% 1.39/0.79 % (190657)% WARNING: option uhcvi not known.
% 1.39/0.79 % (190662)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1920009918:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.39/0.79 % (190661)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2926296886:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.39/0.79 % (190658)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4262293496:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.39/0.79 % (190657)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3635220394:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.39/0.79 % (190659)dis+10_1_sil=32000:sp=arity:random_seed=4264745770:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.39/0.79 % TRYING [1]
% 1.39/0.79 % TRYING [2]
% 1.39/0.79 % TRYING [3]
% 1.39/0.79 % TRYING [4]
% 1.39/0.79 % (190660)Instruction limit reached!
% 1.39/0.79 % (190660)------------------------------
% 1.39/0.79 % (190660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190660)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190660)Termination reason: Instruction limit
% 1.39/0.79 % (190660)Termination phase: Saturation
% 1.39/0.79 % (190660)Time elapsed: 0.063 s
% 1.39/0.79 % (190660)Peak memory usage: 13 MB
% 1.39/0.79 % (190660)Instructions burned: 117 (million)
% 1.39/0.79 % (190670)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2197230171:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.39/0.79 % (190659)Instruction limit reached!
% 1.39/0.79 % (190659)------------------------------
% 1.39/0.79 % (190659)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190659)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190659)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190659)Termination reason: Instruction limit
% 1.39/0.79 % (190659)Termination phase: Saturation
% 1.39/0.79 % (190659)Time elapsed: 0.093 s
% 1.39/0.79 % (190659)Peak memory usage: 14 MB
% 1.39/0.79 % (190659)Instructions burned: 103 (million)
% 1.39/0.79 % TRYING [1]
% 1.39/0.79 % TRYING [2]
% 1.39/0.79 % TRYING [3]
% 1.39/0.79 % (190661)Instruction limit reached!
% 1.39/0.79 % (190661)------------------------------
% 1.39/0.79 % (190661)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190661)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190661)Termination reason: Instruction limit
% 1.39/0.79 % (190661)Termination phase: Saturation
% 1.39/0.79 % (190661)Time elapsed: 0.118 s
% 1.39/0.79 % (190661)Peak memory usage: 14 MB
% 1.39/0.79 % (190661)Instructions burned: 132 (million)
% 1.39/0.79 % TRYING [4]
% 1.39/0.79 % (190672)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3437033295:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.39/0.79 % TRYING [5]
% 1.39/0.79 % (190662)Instruction limit reached!
% 1.39/0.79 % (190662)------------------------------
% 1.39/0.79 % (190662)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190662)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190662)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190662)Termination reason: Instruction limit
% 1.39/0.79 % (190662)Termination phase: Saturation
% 1.39/0.79 % (190662)Time elapsed: 0.152 s
% 1.39/0.79 % (190662)Peak memory usage: 14 MB
% 1.39/0.79 % (190662)Instructions burned: 159 (million)
% 1.39/0.79 % (190673)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=120631664:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.39/0.79 % TRYING [5]
% 1.39/0.79 % (190675)ott-21_1_sil=16000:fs=off:random_seed=3570809080:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.39/0.79 % (190672)Instruction limit reached!
% 1.39/0.79 % (190672)------------------------------
% 1.39/0.79 % (190672)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190672)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190672)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190672)Termination reason: Instruction limit
% 1.39/0.79 % (190672)Termination phase: Saturation
% 1.39/0.79 % (190672)Time elapsed: 0.123 s
% 1.39/0.79 % (190672)Peak memory usage: 13 MB
% 1.39/0.79 % (190672)Instructions burned: 131 (million)
% 1.39/0.79 % (190673) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-190651-190673"...
% 1.39/0.79 % (190673)...printing done.
% 1.39/0.79 % (190673)Refutation found. Thanks to Tanya!
% 1.39/0.79 % SZS status Theorem for theBenchmark
% 1.39/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 1.39/0.79 % (190673)------------------------------
% 1.39/0.79 % (190673)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.39/0.79 % (190673)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.39/0.79 % (190673)CaDiCaL version: 2.1.3
% 1.39/0.79 % (190673)Termination reason: Refutation
% 1.39/0.79 % (190673)Time elapsed: 0.101 s
% 1.39/0.79 % (190673)Peak memory usage: 14 MB
% 1.39/0.79 % (190673)Instructions burned: 101 (million)
% 1.39/0.79 % (190651)Success in time 0.313 s
% 1.39/0.79 % Vampire exiting
%------------------------------------------------------------------------------