%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC092+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:04:38 PM UTC 2026
% Result : Theorem 4.08s 1.40s
% Output : Refutation 4.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of formulae : 110 ( 25 unt; 5 def)
% Number of atoms : 373 ( 55 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 456 ( 193 ~; 184 |; 46 &)
% ( 9 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 6 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn 92 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( app(X2,X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X2
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X3
& nil = 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
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ( app(X2,X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X2
& lt(X8,X6) ) ) ) ) ) )
| ( nil != X3
& nil = 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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ? [X5] :
( app(X2,X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ lt(X8,X6) ) ) ) )
& ssList(X5) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ? [X5] :
( app(X2,X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != X5
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != X2
| ~ lt(X8,X6) ) ) ) )
& ssList(X5) )
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f235,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f236,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK5(X0,X1))
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f237,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f303,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f357,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f358,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(f359,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f412,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
ssList(sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK50 = app(sK49,sK51),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
( nil != sK49
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f426,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f418,f420]) ).
fof(f427,plain,
! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(sK50,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f412,f419,f420]) ).
fof(f431,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f237]) ).
fof(f463,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(app(X1,X2),X1) ),
inference(consistent_polarity_flipping,[],[f431]) ).
fof(f464,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| frontsegP(X0,X1) ),
inference(consistent_polarity_flipping,[],[f236]) ).
fof(f465,plain,
! [X0,X1] :
( frontsegP(X0,X1)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f235]) ).
fof(f508,plain,
! [X0,X1] :
( ~ neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(consistent_polarity_flipping,[],[f303]) ).
fof(f576,plain,
~ neq(sK50,nil),
inference(consistent_polarity_flipping,[],[f426]) ).
fof(f577,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| neq(X4,nil)
| ~ ssList(X4) ),
inference(consistent_polarity_flipping,[],[f427]) ).
fof(f587,definition,
( spl52_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f589,plain,
( nil = sK50
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f587]) ).
fof(f591,definition,
( spl52_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f593,plain,
( nil != sK49
| spl52_2 ),
inference(avatar_component_clause,[],[f591]) ).
fof(f594,plain,
( spl52_1
| ~ spl52_2 ),
inference(avatar_split_clause,[],[f416,f591,f587]) ).
fof(f600,definition,
( spl52_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f601,plain,
( ssList(nil)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f629,plain,
spl52_4,
inference(avatar_split_clause,[],[f306,f600]) ).
fof(f630,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| neq(sK50,nil)
| ~ ssList(sK50) ),
inference(resolution,[],[f357,f577]) ).
fof(f631,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| neq(sK50,nil) ),
inference(duplicate_literal_removal,[],[f630]) ).
fof(f632,plain,
( ~ segmentP(sK49,sK50)
| neq(sK50,nil) ),
inference(forward_subsumption_resolution,[],[f631,f417]) ).
fof(f633,plain,
~ segmentP(sK49,sK50),
inference(forward_subsumption_resolution,[],[f632,f576]) ).
fof(f642,definition,
( spl52_11
<=> segmentP(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl52_11])],[avatar_definition]) ).
fof(f643,plain,
( segmentP(sK49,nil)
| ~ spl52_11 ),
inference(avatar_component_clause,[],[f642]) ).
fof(f644,plain,
( ~ segmentP(sK49,nil)
| spl52_11 ),
inference(avatar_component_clause,[],[f642]) ).
fof(f646,plain,
( ~ ssList(sK49)
| spl52_11 ),
inference(resolution,[],[f644,f359]) ).
fof(f647,plain,
( $false
| spl52_11 ),
inference(forward_subsumption_resolution,[],[f646,f421]) ).
fof(f648,plain,
spl52_11,
inference(avatar_contradiction_clause,[],[f647]) ).
fof(f662,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f421]) ).
fof(f755,plain,
( ~ segmentP(sK49,nil)
| ~ spl52_1 ),
inference(superposition,[],[f633,f589]) ).
fof(f758,plain,
( $false
| ~ spl52_1
| ~ spl52_11 ),
inference(forward_subsumption_resolution,[],[f755,f643]) ).
fof(f759,plain,
( ~ spl52_1
| ~ spl52_11 ),
inference(avatar_contradiction_clause,[],[f758]) ).
fof(f1146,plain,
! [X2,X1] :
( ~ frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(forward_subsumption_resolution,[],[f463,f318]) ).
fof(f1155,plain,
( ~ frontsegP(sK50,sK49)
| ~ ssList(sK51)
| ~ ssList(sK49) ),
inference(superposition,[],[f1146,f415]) ).
fof(f1160,plain,
( ~ frontsegP(sK50,sK49)
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f1155,f413]) ).
fof(f1161,plain,
~ frontsegP(sK50,sK49),
inference(forward_subsumption_resolution,[],[f1160,f421]) ).
fof(f1338,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50) ),
inference(resolution,[],[f465,f1161]) ).
fof(f1343,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50) ),
inference(forward_subsumption_resolution,[],[f1338,f421]) ).
fof(f1347,plain,
sK50 = app(sK49,sK5(sK50,sK49)),
inference(forward_subsumption_resolution,[],[f1343,f417]) ).
fof(f1860,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X0) ),
inference(resolution,[],[f358,f357]) ).
fof(f1864,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f1860]) ).
fof(f8570,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(superposition,[],[f1864,f662]) ).
fof(f8593,plain,
( ! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) )
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f8570,f601]) ).
fof(f8604,plain,
( ! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) )
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f8593,f421]) ).
fof(f39633,definition,
( spl52_4145
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_4145])],[avatar_definition]) ).
fof(f39634,plain,
( ssList(sK5(sK50,sK49))
| ~ spl52_4145 ),
inference(avatar_component_clause,[],[f39633]) ).
fof(f39635,plain,
( ~ ssList(sK5(sK50,sK49))
| spl52_4145 ),
inference(avatar_component_clause,[],[f39633]) ).
fof(f39854,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| frontsegP(sK50,sK49)
| spl52_4145 ),
inference(resolution,[],[f39635,f464]) ).
fof(f39855,plain,
( ~ ssList(sK50)
| frontsegP(sK50,sK49)
| spl52_4145 ),
inference(forward_subsumption_resolution,[],[f39854,f421]) ).
fof(f39856,plain,
( frontsegP(sK50,sK49)
| spl52_4145 ),
inference(forward_subsumption_resolution,[],[f39855,f417]) ).
fof(f39857,plain,
( $false
| spl52_4145 ),
inference(forward_subsumption_resolution,[],[f39856,f1161]) ).
fof(f39858,plain,
spl52_4145,
inference(avatar_contradiction_clause,[],[f39857]) ).
fof(f48179,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl52_4 ),
inference(superposition,[],[f8604,f1347]) ).
fof(f48186,plain,
( segmentP(sK50,sK49)
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48179,f39634]) ).
fof(f48292,plain,
( ~ segmentP(sK49,sK49)
| neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl52_4
| ~ spl52_4145 ),
inference(resolution,[],[f48186,f577]) ).
fof(f48304,plain,
( neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48292,f357]) ).
fof(f48310,plain,
( neq(sK49,nil)
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48304,f421]) ).
fof(f48317,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49)
| ~ spl52_4
| ~ spl52_4145 ),
inference(resolution,[],[f48310,f508]) ).
fof(f48320,plain,
( nil = sK49
| ~ ssList(sK49)
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48317,f601]) ).
fof(f48330,plain,
( ~ ssList(sK49)
| spl52_2
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48320,f593]) ).
fof(f48331,plain,
( $false
| spl52_2
| ~ spl52_4
| ~ spl52_4145 ),
inference(forward_subsumption_resolution,[],[f48330,f421]) ).
fof(f48332,plain,
( spl52_2
| ~ spl52_4
| ~ spl52_4145 ),
inference(avatar_contradiction_clause,[],[f48331]) ).
cnf(s1,plain,
( spl52_1
| ~ spl52_2 ),
inference(sat_conversion,[],[f594]) ).
cnf(s10,plain,
spl52_4,
inference(sat_conversion,[],[f629]) ).
cnf(s12,plain,
spl52_11,
inference(sat_conversion,[],[f648]) ).
cnf(s15,plain,
( ~ spl52_1
| ~ spl52_11 ),
inference(sat_conversion,[],[f759]) ).
cnf(s3928,plain,
spl52_4145,
inference(sat_conversion,[],[f39858]) ).
cnf(s5324,plain,
( spl52_2
| ~ spl52_4
| ~ spl52_4145 ),
inference(sat_conversion,[],[f48332]) ).
cnf(s5397,plain,
~ spl52_1,
inference(rat,[],[s15,s12]) ).
cnf(s5450,plain,
spl52_2,
inference(rat,[],[s5324,s3928,s10]) ).
cnf(s5478,plain,
$false,
inference(rat,[],[s1,s5450,s5397]) ).
fof(f48333,plain,
$false,
inference(avatar_sat_refutation,[],[s5478]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC092+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n016.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 07:54:33 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.08/1.40 % (3461010)Will run a generic schedule for satisfiability detection.
% 4.08/1.40 % (3461021)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=886224258:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.08/1.40 % (3461016)% WARNING: option uhcvi not known.
% 4.08/1.40 % (3461019)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1188263300:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.08/1.40 % (3461015)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1785528534_2999 on theBenchmark for (2999ds/0Mi)
% 4.08/1.40 % (3461016)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=527454566:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.08/1.40 % (3461018)dis+10_1_sil=32000:sp=arity:random_seed=1105296362:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.08/1.40 % (3461017)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4232964908:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.08/1.40 % (3461020)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3892834789:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.08/1.40 % TRYING [1]
% 4.08/1.40 % TRYING [2]
% 4.08/1.40 % TRYING [3]
% 4.08/1.40 % TRYING [4]
% 4.08/1.40 % (3461021)Instruction limit reached!
% 4.08/1.40 % (3461021)------------------------------
% 4.08/1.40 % (3461021)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461021)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461021)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461021)Termination reason: Instruction limit
% 4.08/1.40 % (3461021)Termination phase: Saturation
% 4.08/1.40 % (3461021)Time elapsed: 0.057 s
% 4.08/1.40 % (3461021)Peak memory usage: 15 MB
% 4.08/1.40 % (3461021)Instructions burned: 161 (million)
% 4.08/1.40 % (3461018)Instruction limit reached!
% 4.08/1.40 % (3461018)------------------------------
% 4.08/1.40 % (3461018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461018)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461018)Termination reason: Instruction limit
% 4.08/1.40 % (3461018)Termination phase: Saturation
% 4.08/1.40 % (3461018)Time elapsed: 0.061 s
% 4.08/1.40 % (3461018)Peak memory usage: 13 MB
% 4.08/1.40 % (3461018)Instructions burned: 104 (million)
% 4.08/1.40 % (3461029)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=865999443:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.08/1.40 % (3461019)Instruction limit reached!
% 4.08/1.40 % (3461019)------------------------------
% 4.08/1.40 % (3461019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461019)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461019)Termination reason: Instruction limit
% 4.08/1.40 % (3461019)Termination phase: Saturation
% 4.08/1.40 % (3461019)Time elapsed: 0.070 s
% 4.08/1.40 % (3461019)Peak memory usage: 13 MB
% 4.08/1.40 % (3461019)Instructions burned: 116 (million)
% 4.08/1.40 % TRYING [1]
% 4.08/1.40 % TRYING [2]
% 4.08/1.40 % TRYING [3]
% 4.08/1.40 % (3461020)Instruction limit reached!
% 4.08/1.40 % (3461020)------------------------------
% 4.08/1.40 % (3461020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461020)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461020)Termination reason: Instruction limit
% 4.08/1.40 % (3461020)Termination phase: Saturation
% 4.08/1.40 % (3461020)Time elapsed: 0.076 s
% 4.08/1.40 % (3461020)Peak memory usage: 14 MB
% 4.08/1.40 % (3461020)Instructions burned: 131 (million)
% 4.08/1.40 % (3461031)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3427031665:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 4.08/1.40 % TRYING [4]
% 4.08/1.40 % TRYING [5]
% 4.08/1.40 % (3461032)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=1533074415:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.08/1.40 % (3461033)ott-21_1_sil=16000:fs=off:random_seed=93125287:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 4.08/1.40 % TRYING [5]
% 4.08/1.40 % (3461031)Instruction limit reached!
% 4.08/1.40 % (3461031)------------------------------
% 4.08/1.40 % (3461031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461031)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461031)Termination reason: Instruction limit
% 4.08/1.40 % (3461031)Termination phase: Saturation
% 4.08/1.40 % (3461031)Time elapsed: 0.074 s
% 4.08/1.40 % (3461031)Peak memory usage: 13 MB
% 4.08/1.40 % (3461031)Instructions burned: 132 (million)
% 4.08/1.40 % (3461037)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1386609516:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 4.08/1.40 % (3461033)Instruction limit reached!
% 4.08/1.40 % (3461033)------------------------------
% 4.08/1.40 % (3461033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461033)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461033)Termination reason: Instruction limit
% 4.08/1.40 % (3461033)Termination phase: Saturation
% 4.08/1.40 % (3461033)Time elapsed: 0.090 s
% 4.08/1.40 % (3461033)Peak memory usage: 13 MB
% 4.08/1.40 % (3461033)Instructions burned: 182 (million)
% 4.08/1.40 % TRYING [6]
% 4.08/1.40 % (3461039)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1056689415:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 4.08/1.40 % (3461029)Instruction limit reached!
% 4.08/1.40 % (3461029)------------------------------
% 4.08/1.40 % (3461029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461029)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461029)Termination reason: Instruction limit
% 4.08/1.40 % (3461029)Termination phase: Finite model building constraint generation
% 4.08/1.40 % (3461029)Time elapsed: 0.154 s
% 4.08/1.40 % (3461029)Peak memory usage: 29 MB
% 4.08/1.40 % (3461029)Instructions burned: 716 (million)
% 4.08/1.40 % TRYING [6]
% 4.08/1.40 % TRYING [1]
% 4.08/1.40 % TRYING [2]
% 4.08/1.40 % (3461041)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=885095907:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 4.08/1.40 % TRYING [3]
% 4.08/1.40 % TRYING [4]
% 4.08/1.40 % TRYING [5]
% 4.08/1.40 % (3461032)Instruction limit reached!
% 4.08/1.40 % (3461032)------------------------------
% 4.08/1.40 % (3461032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461032)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461032)Termination reason: Instruction limit
% 4.08/1.40 % (3461032)Termination phase: Saturation
% 4.08/1.40 % (3461032)Time elapsed: 0.368 s
% 4.08/1.40 % (3461032)Peak memory usage: 24 MB
% 4.08/1.40 % (3461032)Instructions burned: 685 (million)
% 4.08/1.40 % (3461043)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3102307353:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 4.08/1.40 % (3461037)Instruction limit reached!
% 4.08/1.40 % (3461037)------------------------------
% 4.08/1.40 % (3461037)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461037)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461037)Termination reason: Instruction limit
% 4.08/1.40 % (3461037)Termination phase: Saturation
% 4.08/1.40 % (3461037)Time elapsed: 0.336 s
% 4.08/1.40 % (3461037)Peak memory usage: 15 MB
% 4.08/1.40 % (3461037)Instructions burned: 477 (million)
% 4.08/1.40 % TRYING [7]
% 4.08/1.40 % (3461045)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=2769101960: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.08/1.40 % (3461039)Instruction limit reached!
% 4.08/1.40 % (3461039)------------------------------
% 4.08/1.40 % (3461039)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461039)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461039)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461039)Termination reason: Instruction limit
% 4.08/1.40 % (3461039)Termination phase: Finite model building SAT solving
% 4.08/1.40 % (3461039)Time elapsed: 0.343 s
% 4.08/1.40 % (3461039)Peak memory usage: 23 MB
% 4.08/1.40 % (3461039)Instructions burned: 866 (million)
% 4.08/1.40 % (3461041)Instruction limit reached!
% 4.08/1.40 % (3461041)------------------------------
% 4.08/1.40 % (3461041)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461041)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461041)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461041)Termination reason: Instruction limit
% 4.08/1.40 % (3461041)Termination phase: Saturation
% 4.08/1.40 % (3461041)Time elapsed: 0.339 s
% 4.08/1.40 % (3461041)Peak memory usage: 28 MB
% 4.08/1.40 % (3461041)Instructions burned: 1180 (million)
% 4.08/1.40 % (3461047)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=578916832:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 4.08/1.40 % (3461048)fmb+10_1_sil=64000:random_seed=4125585906:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 4.08/1.40 % TRYING [14]
% 4.08/1.40 % TRYING [1]
% 4.08/1.40 % TRYING [2]
% 4.08/1.40 % TRYING [3]
% 4.08/1.40 % TRYING [4]
% 4.08/1.40 % TRYING [5]
% 4.08/1.40 % (3461043)Instruction limit reached!
% 4.08/1.40 % (3461043)------------------------------
% 4.08/1.40 % (3461043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461043)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461043)Termination reason: Instruction limit
% 4.08/1.40 % (3461043)Termination phase: Finite model building constraint generation
% 4.08/1.40 % (3461043)Time elapsed: 0.327 s
% 4.08/1.40 % (3461043)Peak memory usage: 70 MB
% 4.08/1.40 % (3461043)Instructions burned: 892 (million)
% 4.08/1.40 % (3461051)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=704265942:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 4.08/1.40 % TRYING [6]
% 4.08/1.40 % TRYING [20]
% 4.08/1.40 % (3461045)Instruction limit reached!
% 4.08/1.40 % (3461045)------------------------------
% 4.08/1.40 % (3461045)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461045)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461045)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461045)Termination reason: Instruction limit
% 4.08/1.40 % (3461045)Termination phase: Saturation
% 4.08/1.40 % (3461045)Time elapsed: 0.361 s
% 4.08/1.40 % (3461045)Peak memory usage: 22 MB
% 4.08/1.40 % (3461045)Instructions burned: 693 (million)
% 4.08/1.40 % (3461053)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1670709463:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 4.08/1.40 % (3461016) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3461010-3461016"...
% 4.08/1.40 % TRYING [8]
% 4.08/1.40 % (3461016)...printing done.
% 4.08/1.40 % (3461016)Refutation found. Thanks to Tanya!
% 4.08/1.40 % SZS status Theorem for theBenchmark
% 4.08/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 4.08/1.40 % (3461016)------------------------------
% 4.08/1.40 % (3461016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.08/1.40 % (3461016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.08/1.40 % (3461016)CaDiCaL version: 2.1.3
% 4.08/1.40 % (3461016)Termination reason: Refutation
% 4.08/1.40 % (3461016)Time elapsed: 0.932 s
% 4.08/1.40 % (3461016)Peak memory usage: 38 MB
% 4.08/1.40 % (3461016)Instructions burned: 1801 (million)
% 4.08/1.40 % (3461010)Success in time 0.982 s
% 4.08/1.40 % Vampire exiting
%------------------------------------------------------------------------------