%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC270+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:03:13 PM UTC 2026
% Result : Theorem 3.19s 1.06s
% Output : Refutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 93 ( 20 unt; 6 def)
% Number of atoms : 409 ( 37 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 526 ( 210 ~; 216 |; 64 &)
% ( 14 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 7 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 4 con; 0-2 aty)
% Number of variables : 132 ( 0 sgn 108 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax11) ).
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax12) ).
fof(f93,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax93) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
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
| ~ segmentP(X3,X2)
| ~ strictorderedP(X2)
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& segmentP(X3,X2)
& strictorderedP(X2)
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f111,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f112,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f115,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f12]) ).
fof(f116,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f115]) ).
fof(f151,plain,
! [X0] :
( ! [X1] :
( ( lt(X0,X1)
<=> ( X0 != X1
& leq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f93]) ).
fof(f168,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& segmentP(sK3,sK2)
& strictorderedP(sK2)
& ~ totalorderedP(sK0)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f98]) ).
fof(f175,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f112]) ).
fof(f176,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ leq(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f175]) ).
fof(f177,plain,
! [X0] :
( ( ( totalorderedP(X0)
| ( ~ leq(sK6(X0),sK7(X0))
& app(app(sK8(X0),cons(sK6(X0),sK9(X0))),cons(sK7(X0),sK10(X0))) = X0
& ssList(sK10(X0))
& ssList(sK9(X0))
& ssList(sK8(X0))
& ssItem(sK7(X0))
& ssItem(sK6(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( leq(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ totalorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10]),skolemize(X1,sK6(X0)),skolemize(X2,sK7(X0)),skolemize(X3,sK8(X0)),skolemize(X4,sK9(X0)),skolemize(X5,sK10(X0))],[f176]) ).
fof(f180,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f116]) ).
fof(f181,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f180]) ).
fof(f182,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK11(X0),sK12(X0))
& app(app(sK13(X0),cons(sK11(X0),sK14(X0))),cons(sK12(X0),sK15(X0))) = X0
& ssList(sK15(X0))
& ssList(sK14(X0))
& ssList(sK13(X0))
& ssItem(sK12(X0))
& ssItem(sK11(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11,sK12,sK13,sK14,sK15]),skolemize(X1,sK11(X0)),skolemize(X2,sK12(X0)),skolemize(X3,sK13(X0)),skolemize(X4,sK14(X0)),skolemize(X5,sK15(X0))],[f181]) ).
fof(f188,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f151]) ).
fof(f189,plain,
! [X0] :
( ! [X1] :
( ( ( lt(X0,X1)
| X0 = X1
| ~ leq(X0,X1) )
& ( ( X0 != X1
& leq(X0,X1) )
| ~ lt(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f188]) ).
fof(f191,plain,
ssList(sK0),
inference(cnf_transformation,[],[f168]) ).
fof(f194,plain,
~ totalorderedP(sK0),
inference(cnf_transformation,[],[f168]) ).
fof(f195,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f168]) ).
fof(f197,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f168]) ).
fof(f219,plain,
! [X0] :
( ssItem(sK6(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f220,plain,
! [X0] :
( ssItem(sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f221,plain,
! [X0] :
( ssList(sK8(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f222,plain,
! [X0] :
( ssList(sK9(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f223,plain,
! [X0] :
( ssList(sK10(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f224,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK8(X0),cons(sK6(X0),sK9(X0))),cons(sK7(X0),sK10(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f225,plain,
! [X0] :
( ~ leq(sK6(X0),sK7(X0))
| totalorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f177]) ).
fof(f233,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f274,plain,
! [X0,X1] :
( ~ lt(X0,X1)
| leq(X0,X1)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f189]) ).
fof(f287,plain,
~ totalorderedP(sK2),
inference(definition_unfolding,[],[f194,f197]) ).
fof(f289,plain,
ssList(sK2),
inference(definition_unfolding,[],[f191,f197]) ).
fof(f297,plain,
! [X10,X8,X6,X9,X7] :
( ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| lt(X6,X7)
| ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10))) ),
inference(equality_resolution,[],[f233]) ).
fof(f1127,plain,
( sK2 = app(app(sK8(sK2),cons(sK6(sK2),sK9(sK2))),cons(sK7(sK2),sK10(sK2)))
| totalorderedP(sK2) ),
inference(resolution,[],[f224,f289]) ).
fof(f1143,plain,
sK2 = app(app(sK8(sK2),cons(sK6(sK2),sK9(sK2))),cons(sK7(sK2),sK10(sK2))),
inference(forward_subsumption_resolution,[],[f1127,f287]) ).
fof(f1976,plain,
( ~ strictorderedP(sK2)
| ~ ssList(sK10(sK2))
| ~ ssList(sK9(sK2))
| ~ ssList(sK8(sK2))
| ~ ssItem(sK7(sK2))
| ~ ssItem(sK6(sK2))
| lt(sK6(sK2),sK7(sK2))
| ~ ssList(sK2) ),
inference(superposition,[],[f297,f1143]) ).
fof(f1996,definition,
( spl22_97
<=> ssList(sK8(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_97])],[avatar_definition]) ).
fof(f1998,plain,
( ~ ssList(sK8(sK2))
| spl22_97 ),
inference(avatar_component_clause,[],[f1996]) ).
fof(f2031,definition,
( spl22_105
<=> ssItem(sK7(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_105])],[avatar_definition]) ).
fof(f2032,plain,
( ssItem(sK7(sK2))
| ~ spl22_105 ),
inference(avatar_component_clause,[],[f2031]) ).
fof(f2033,plain,
( ~ ssItem(sK7(sK2))
| spl22_105 ),
inference(avatar_component_clause,[],[f2031]) ).
fof(f2035,definition,
( spl22_106
<=> ssList(sK10(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_106])],[avatar_definition]) ).
fof(f2037,plain,
( ~ ssList(sK10(sK2))
| spl22_106 ),
inference(avatar_component_clause,[],[f2035]) ).
fof(f2046,plain,
( ~ ssList(sK10(sK2))
| ~ ssList(sK9(sK2))
| ~ ssList(sK8(sK2))
| ~ ssItem(sK7(sK2))
| ~ ssItem(sK6(sK2))
| lt(sK6(sK2),sK7(sK2))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f1976,f195]) ).
fof(f2052,plain,
( ~ ssList(sK10(sK2))
| ~ ssList(sK9(sK2))
| ~ ssList(sK8(sK2))
| ~ ssItem(sK7(sK2))
| ~ ssItem(sK6(sK2))
| lt(sK6(sK2),sK7(sK2)) ),
inference(forward_subsumption_resolution,[],[f2046,f289]) ).
fof(f2054,definition,
( spl22_110
<=> lt(sK6(sK2),sK7(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_110])],[avatar_definition]) ).
fof(f2056,plain,
( lt(sK6(sK2),sK7(sK2))
| ~ spl22_110 ),
inference(avatar_component_clause,[],[f2054]) ).
fof(f2058,definition,
( spl22_111
<=> ssItem(sK6(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_111])],[avatar_definition]) ).
fof(f2059,plain,
( ssItem(sK6(sK2))
| ~ spl22_111 ),
inference(avatar_component_clause,[],[f2058]) ).
fof(f2060,plain,
( ~ ssItem(sK6(sK2))
| spl22_111 ),
inference(avatar_component_clause,[],[f2058]) ).
fof(f2062,definition,
( spl22_112
<=> ssList(sK9(sK2)) ),
introduced(definition,[new_symbols(definition,[spl22_112])],[avatar_definition]) ).
fof(f2064,plain,
( ~ ssList(sK9(sK2))
| spl22_112 ),
inference(avatar_component_clause,[],[f2062]) ).
fof(f2065,plain,
( spl22_110
| ~ spl22_111
| ~ spl22_105
| ~ spl22_97
| ~ spl22_112
| ~ spl22_106 ),
inference(avatar_split_clause,[],[f2052,f2035,f2062,f1996,f2031,f2058,f2054]) ).
fof(f2066,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| spl22_97 ),
inference(resolution,[],[f1998,f221]) ).
fof(f2067,plain,
( ~ ssList(sK2)
| spl22_97 ),
inference(forward_subsumption_resolution,[],[f2066,f287]) ).
fof(f2068,plain,
( $false
| spl22_97 ),
inference(forward_subsumption_resolution,[],[f2067,f289]) ).
fof(f2069,plain,
spl22_97,
inference(avatar_contradiction_clause,[],[f2068]) ).
fof(f2187,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| spl22_112 ),
inference(resolution,[],[f2064,f222]) ).
fof(f2188,plain,
( ~ ssList(sK2)
| spl22_112 ),
inference(forward_subsumption_resolution,[],[f2187,f287]) ).
fof(f2189,plain,
( $false
| spl22_112 ),
inference(forward_subsumption_resolution,[],[f2188,f289]) ).
fof(f2190,plain,
spl22_112,
inference(avatar_contradiction_clause,[],[f2189]) ).
fof(f2222,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| spl22_105 ),
inference(resolution,[],[f2033,f220]) ).
fof(f2223,plain,
( ~ ssList(sK2)
| spl22_105 ),
inference(forward_subsumption_resolution,[],[f2222,f287]) ).
fof(f2224,plain,
( $false
| spl22_105 ),
inference(forward_subsumption_resolution,[],[f2223,f289]) ).
fof(f2225,plain,
spl22_105,
inference(avatar_contradiction_clause,[],[f2224]) ).
fof(f2298,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| spl22_106 ),
inference(resolution,[],[f2037,f223]) ).
fof(f2299,plain,
( ~ ssList(sK2)
| spl22_106 ),
inference(forward_subsumption_resolution,[],[f2298,f287]) ).
fof(f2300,plain,
( $false
| spl22_106 ),
inference(forward_subsumption_resolution,[],[f2299,f289]) ).
fof(f2301,plain,
spl22_106,
inference(avatar_contradiction_clause,[],[f2300]) ).
fof(f2477,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| spl22_111 ),
inference(resolution,[],[f2060,f219]) ).
fof(f2478,plain,
( ~ ssList(sK2)
| spl22_111 ),
inference(forward_subsumption_resolution,[],[f2477,f287]) ).
fof(f2479,plain,
( $false
| spl22_111 ),
inference(forward_subsumption_resolution,[],[f2478,f289]) ).
fof(f2480,plain,
spl22_111,
inference(avatar_contradiction_clause,[],[f2479]) ).
fof(f3047,plain,
( leq(sK6(sK2),sK7(sK2))
| ~ ssItem(sK7(sK2))
| ~ ssItem(sK6(sK2))
| ~ spl22_110 ),
inference(resolution,[],[f2056,f274]) ).
fof(f3048,plain,
( leq(sK6(sK2),sK7(sK2))
| ~ ssItem(sK6(sK2))
| ~ spl22_105
| ~ spl22_110 ),
inference(forward_subsumption_resolution,[],[f3047,f2032]) ).
fof(f3052,plain,
( leq(sK6(sK2),sK7(sK2))
| ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(forward_subsumption_resolution,[],[f3048,f2059]) ).
fof(f3330,plain,
( totalorderedP(sK2)
| ~ ssList(sK2)
| ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(resolution,[],[f3052,f225]) ).
fof(f3336,plain,
( ~ ssList(sK2)
| ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(forward_subsumption_resolution,[],[f3330,f287]) ).
fof(f3339,plain,
( $false
| ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(forward_subsumption_resolution,[],[f3336,f289]) ).
fof(f3340,plain,
( ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(avatar_contradiction_clause,[],[f3339]) ).
cnf(s104,plain,
( ~ spl22_97
| ~ spl22_105
| ~ spl22_106
| spl22_110
| ~ spl22_111
| ~ spl22_112 ),
inference(sat_conversion,[],[f2065]) ).
cnf(s105,plain,
spl22_97,
inference(sat_conversion,[],[f2069]) ).
cnf(s116,plain,
spl22_112,
inference(sat_conversion,[],[f2190]) ).
cnf(s117,plain,
spl22_105,
inference(sat_conversion,[],[f2225]) ).
cnf(s118,plain,
spl22_106,
inference(sat_conversion,[],[f2301]) ).
cnf(s133,plain,
spl22_111,
inference(sat_conversion,[],[f2480]) ).
cnf(s172,plain,
( ~ spl22_105
| ~ spl22_110
| ~ spl22_111 ),
inference(sat_conversion,[],[f3340]) ).
cnf(s174,plain,
~ spl22_110,
inference(rat,[],[s172,s133,s117]) ).
cnf(s175,plain,
$false,
inference(rat,[],[s104,s116,s133,s174,s118,s117,s105]) ).
fof(f3350,plain,
$false,
inference(avatar_sat_refutation,[],[s175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC270+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.17 % Computer : n014.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 08:47:46 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.20 Running first-order theorem proving
% 0.07/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.19/1.06 % (1641815)Detected formulas, will run a generic FOF schedule.
% 3.19/1.06 % (1641823)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=45003366:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.19/1.06 % (1641823)Instruction limit reached!
% 3.19/1.06 % (1641823)------------------------------
% 3.19/1.06 % (1641823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.06 % (1641823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.06 % (1641823)CaDiCaL version: 2.1.3
% 3.19/1.06 % (1641823)Termination reason: Instruction limit
% 3.19/1.06 % (1641823)Termination phase: Saturation
% 3.19/1.06 % (1641823)Time elapsed: 0.036 s
% 3.19/1.06 % (1641823)Peak memory usage: 89 MB
% 3.19/1.06 % (1641823)Instructions burned: 113 (million)
% 3.19/1.06 % (1641826)dis-21_1_sil=8000:lcm=predicate:random_seed=2103721594:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.19/1.06 % (1641821)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3857715374:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.19/1.06 % (1641825)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1904720445:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.19/1.06 % (1641824)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2993644001:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.19/1.06 % (1641820)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2376707520:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.19/1.06 % (1641822)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1854826913:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.19/1.06 % (1641824)Instruction limit reached!
% 3.19/1.06 % (1641824)------------------------------
% 3.19/1.06 % (1641824)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.06 % (1641824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.06 % (1641824)CaDiCaL version: 2.1.3
% 3.19/1.06 % (1641824)Termination reason: Instruction limit
% 3.19/1.06 % (1641824)Termination phase: Saturation
% 3.19/1.06 % (1641824)Time elapsed: 0.052 s
% 3.19/1.06 % (1641824)Peak memory usage: 88 MB
% 3.19/1.06 % (1641824)Instructions burned: 121 (million)
% 3.19/1.06 % (1641826)Instruction limit reached!
% 3.19/1.06 % (1641826)------------------------------
% 3.19/1.06 % (1641826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.06 % (1641826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.06 % (1641826)CaDiCaL version: 2.1.3
% 3.19/1.06 % (1641826)Termination reason: Instruction limit
% 3.19/1.06 % (1641826)Termination phase: Saturation
% 3.19/1.06 % (1641826)Time elapsed: 0.069 s
% 3.19/1.06 % (1641826)Peak memory usage: 91 MB
% 3.19/1.06 % (1641826)Instructions burned: 129 (million)
% 3.19/1.06 % (1641828)lrs+10_1_sil=8000:sp=occurrence:random_seed=2364389960:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.19/1.06 % (1641825)Instruction limit reached!
% 3.19/1.06 % (1641825)------------------------------
% 3.19/1.06 % (1641825)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.19/1.06 % (1641825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.19/1.06 % (1641825)CaDiCaL version: 2.1.3
% 3.19/1.06 % (1641825)Termination reason: Instruction limit
% 3.19/1.06 % (1641825)Termination phase: Saturation
% 3.19/1.06 % (1641825)Time elapsed: 0.085 s
% 3.19/1.06 % (1641825)Peak memory usage: 90 MB
% 3.19/1.06 % (1641825)Instructions burned: 139 (million)
% 3.19/1.06 % (1641828)First to succeed.
% 3.19/1.06 % (1641828)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1641815"
% 3.19/1.06 % (1641835)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2889738428:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.19/1.06 % (1641837)lrs+1011_1_sil=32000:sp=occurrence:random_seed=2366023865:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.19/1.06 % (1641838)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=4150678189:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.19/1.06 % (1641828)Refutation found. Thanks to Tanya!
% 3.19/1.06 % SZS status Theorem for theBenchmark
% 3.19/1.06 % SZS output start Proof for theBenchmark
% See solution above
% 3.58/1.26 % (1641828)------------------------------
% 3.58/1.26 % (1641828)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.58/1.26 % (1641828)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.58/1.26 % (1641828)CaDiCaL version: 2.1.3
% 3.58/1.26 % (1641828)Termination reason: Refutation
% 3.58/1.26 % (1641828)Time elapsed: 0.039 s
% 3.58/1.26 % (1641828)Peak memory usage: 92 MB
% 3.58/1.26 % (1641828)Instructions burned: 120 (million)
% 3.58/1.26 % (1641828)------------------------------
% 3.58/1.26 % (1641828)------------------------------
% 3.58/1.26 % (1641815)Success in time 0.425 s
% 3.58/1.26 % Vampire exiting
%------------------------------------------------------------------------------