%------------------------------------------------------------------------------
% File : Vampire---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 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:02:24 PM UTC 2026
% Result : Theorem 2.44s 1.17s
% Output : Refutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of formulae : 107 ( 22 unt; 8 def)
% Number of atoms : 390 ( 66 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 478 ( 195 ~; 182 |; 70 &)
% ( 12 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 109 ( 0 sgn 81 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
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/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(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(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(f246,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f103]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK13(X0,X1))
& ssList(sK14(X0,X1))
& app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& sK56 = app(sK55,sK57)
& strictorderedP(sK55)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(cons(X6,nil),X7) != sK57
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(X9,cons(X8,nil)) != sK55
| ~ lt(X8,X6) ) ) ) )
& ssList(sK57)
& ( nil = sK56
| nil != sK55 )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57)],[f222]) ).
fof(f318,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f401,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f403,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f440,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f442,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK56
| nil != sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssList(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f514,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f318]) ).
fof(f544,definition,
( spl58_1
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl58_1])],[avatar_definition]) ).
fof(f546,plain,
( nil != sK55
| spl58_1 ),
inference(avatar_component_clause,[],[f544]) ).
fof(f548,definition,
( spl58_2
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl58_2])],[avatar_definition]) ).
fof(f550,plain,
( nil = sK56
| ~ spl58_2 ),
inference(avatar_component_clause,[],[f548]) ).
fof(f551,plain,
( ~ spl58_1
| spl58_2 ),
inference(avatar_split_clause,[],[f500,f548,f544]) ).
fof(f553,definition,
( spl58_3
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl58_3])],[avatar_definition]) ).
fof(f554,plain,
( ssList(nil)
| ~ spl58_3 ),
inference(avatar_component_clause,[],[f553]) ).
fof(f586,plain,
spl58_3,
inference(avatar_split_clause,[],[f389,f553]) ).
fof(f589,plain,
sK54 = app(sK55,sK57),
inference(forward_demodulation,[],[f504,f508]) ).
fof(f590,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4) ),
inference(forward_demodulation,[],[f505,f507]) ).
fof(f591,plain,
( ~ ssList(sK55)
| ~ ssList(sK55)
| ~ neq(sK55,nil)
| ~ segmentP(sK54,sK55) ),
inference(resolution,[],[f440,f590]) ).
fof(f592,plain,
( ~ ssList(sK55)
| ~ neq(sK55,nil)
| ~ segmentP(sK54,sK55) ),
inference(duplicate_literal_removal,[],[f591]) ).
fof(f593,plain,
( ~ neq(sK55,nil)
| ~ segmentP(sK54,sK55) ),
inference(forward_subsumption_resolution,[],[f592,f498]) ).
fof(f595,definition,
( spl58_10
<=> segmentP(sK54,sK55) ),
introduced(definition,[new_symbols(definition,[spl58_10])],[avatar_definition]) ).
fof(f597,plain,
( ~ segmentP(sK54,sK55)
| spl58_10 ),
inference(avatar_component_clause,[],[f595]) ).
fof(f599,definition,
( spl58_11
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl58_11])],[avatar_definition]) ).
fof(f601,plain,
( ~ neq(sK55,nil)
| spl58_11 ),
inference(avatar_component_clause,[],[f599]) ).
fof(f602,plain,
( ~ spl58_10
| ~ spl58_11 ),
inference(avatar_split_clause,[],[f593,f599,f595]) ).
fof(f603,plain,
( ~ ssList(sK55)
| ~ ssList(nil)
| ~ neq(nil,nil)
| ~ segmentP(sK54,nil) ),
inference(resolution,[],[f442,f590]) ).
fof(f604,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ segmentP(sK54,nil) ),
inference(forward_subsumption_resolution,[],[f603,f498]) ).
fof(f605,plain,
( ~ neq(nil,nil)
| ~ segmentP(sK54,nil)
| ~ spl58_3 ),
inference(forward_subsumption_resolution,[],[f604,f554]) ).
fof(f607,definition,
( spl58_12
<=> segmentP(sK54,nil) ),
introduced(definition,[new_symbols(definition,[spl58_12])],[avatar_definition]) ).
fof(f609,plain,
( ~ segmentP(sK54,nil)
| spl58_12 ),
inference(avatar_component_clause,[],[f607]) ).
fof(f611,definition,
( spl58_13
<=> neq(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl58_13])],[avatar_definition]) ).
fof(f613,plain,
( ~ neq(nil,nil)
| spl58_13 ),
inference(avatar_component_clause,[],[f611]) ).
fof(f614,plain,
( ~ spl58_12
| ~ spl58_13
| ~ spl58_3 ),
inference(avatar_split_clause,[],[f605,f553,f611,f607]) ).
fof(f615,plain,
( ~ ssList(sK54)
| spl58_12 ),
inference(resolution,[],[f609,f442]) ).
fof(f616,plain,
( $false
| spl58_12 ),
inference(forward_subsumption_resolution,[],[f615,f497]) ).
fof(f617,plain,
spl58_12,
inference(avatar_contradiction_clause,[],[f616]) ).
fof(f1758,definition,
( spl58_44
<=> nil = sK54 ),
introduced(definition,[new_symbols(definition,[spl58_44])],[avatar_definition]) ).
fof(f1760,plain,
( nil = sK54
| ~ spl58_44 ),
inference(avatar_component_clause,[],[f1758]) ).
fof(f1811,plain,
( nil = sK54
| ~ spl58_2 ),
inference(superposition,[],[f508,f550]) ).
fof(f1813,plain,
( spl58_44
| ~ spl58_2 ),
inference(avatar_split_clause,[],[f1811,f548,f1758]) ).
fof(f1816,plain,
( neq(nil,nil)
| ~ spl58_44 ),
inference(superposition,[],[f506,f1760]) ).
fof(f1852,plain,
( $false
| spl58_13
| ~ spl58_44 ),
inference(forward_subsumption_resolution,[],[f1816,f613]) ).
fof(f1853,plain,
( spl58_13
| ~ spl58_44 ),
inference(avatar_contradiction_clause,[],[f1852]) ).
fof(f1922,plain,
( nil = sK55
| ~ ssList(nil)
| ~ ssList(sK55)
| spl58_11 ),
inference(resolution,[],[f601,f387]) ).
fof(f1925,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| spl58_1
| spl58_11 ),
inference(forward_subsumption_resolution,[],[f1922,f546]) ).
fof(f1935,plain,
( ~ ssList(sK55)
| spl58_1
| ~ spl58_3
| spl58_11 ),
inference(forward_subsumption_resolution,[],[f1925,f554]) ).
fof(f1936,plain,
( $false
| spl58_1
| ~ spl58_3
| spl58_11 ),
inference(forward_subsumption_resolution,[],[f1935,f498]) ).
fof(f1937,plain,
( spl58_1
| ~ spl58_3
| spl58_11 ),
inference(avatar_contradiction_clause,[],[f1936]) ).
fof(f2052,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f514,f403]) ).
fof(f2062,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f2052]) ).
fof(f2072,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f2062,f401]) ).
fof(f2080,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl58_3 ),
inference(forward_subsumption_resolution,[],[f2072,f554]) ).
fof(f3027,plain,
( segmentP(sK54,sK55)
| ~ ssList(sK55)
| ~ ssList(sK57)
| ~ spl58_3 ),
inference(superposition,[],[f2080,f589]) ).
fof(f3043,plain,
( ~ ssList(sK55)
| ~ ssList(sK57)
| ~ spl58_3
| spl58_10 ),
inference(forward_subsumption_resolution,[],[f3027,f597]) ).
fof(f3055,plain,
( ~ ssList(sK57)
| ~ spl58_3
| spl58_10 ),
inference(forward_subsumption_resolution,[],[f3043,f498]) ).
fof(f3066,plain,
( $false
| ~ spl58_3
| spl58_10 ),
inference(forward_subsumption_resolution,[],[f3055,f501]) ).
fof(f3067,plain,
( ~ spl58_3
| spl58_10 ),
inference(avatar_contradiction_clause,[],[f3066]) ).
cnf(s1,plain,
( ~ spl58_1
| spl58_2 ),
inference(sat_conversion,[],[f551]) ).
cnf(s10,plain,
spl58_3,
inference(sat_conversion,[],[f586]) ).
cnf(s11,plain,
( ~ spl58_10
| ~ spl58_11 ),
inference(sat_conversion,[],[f602]) ).
cnf(s12,plain,
( ~ spl58_3
| ~ spl58_12
| ~ spl58_13 ),
inference(sat_conversion,[],[f614]) ).
cnf(s13,plain,
spl58_12,
inference(sat_conversion,[],[f617]) ).
cnf(s54,plain,
( ~ spl58_2
| spl58_44 ),
inference(sat_conversion,[],[f1813]) ).
cnf(s57,plain,
( spl58_13
| ~ spl58_44 ),
inference(sat_conversion,[],[f1853]) ).
cnf(s70,plain,
( spl58_1
| ~ spl58_3
| spl58_11 ),
inference(sat_conversion,[],[f1937]) ).
cnf(s112,plain,
( ~ spl58_3
| spl58_10 ),
inference(sat_conversion,[],[f3067]) ).
cnf(s116,plain,
( ~ spl58_3
| ~ spl58_13 ),
inference(rat,[],[s12,s13]) ).
cnf(s117,plain,
spl58_10,
inference(rat,[],[s112,s10]) ).
cnf(s118,plain,
~ spl58_13,
inference(rat,[],[s116,s10]) ).
cnf(s119,plain,
~ spl58_11,
inference(rat,[],[s11,s117]) ).
cnf(s120,plain,
~ spl58_44,
inference(rat,[],[s57,s118]) ).
cnf(s121,plain,
spl58_1,
inference(rat,[],[s70,s10,s119]) ).
cnf(s122,plain,
~ spl58_2,
inference(rat,[],[s54,s120]) ).
cnf(s127,plain,
$false,
inference(rat,[],[s1,s122,s121]) ).
fof(f3071,plain,
$false,
inference(avatar_sat_refutation,[],[s127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC092+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 28 07:49:31 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.44/1.17 % (1616160)Detected formulas, will run a generic FOF schedule.
% 2.44/1.17 % (1616170)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=660300682:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.44/1.17 % (1616165)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=1944474055:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.44/1.17 % (1616168)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1248090135:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.44/1.17 % (1616167)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=987841796:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.44/1.17 % (1616171)dis-21_1_sil=8000:lcm=predicate:random_seed=2970285389: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)
% 2.44/1.17 % (1616166)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=2273209285:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.44/1.17 % (1616169)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1562897270:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.44/1.17 % (1616170)First to succeed.
% 2.44/1.17 % (1616170)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1616160"
% 2.44/1.17 % (1616169)Also succeeded, but the first one will report.
% 2.44/1.17 % (1616168)Instruction limit reached!
% 2.44/1.17 % (1616168)------------------------------
% 2.44/1.17 % (1616168)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.17 % (1616168)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.17 % (1616168)CaDiCaL version: 2.1.3
% 2.44/1.17 % (1616168)Termination reason: Instruction limit
% 2.44/1.17 % (1616168)Termination phase: Saturation
% 2.44/1.17 % (1616168)Time elapsed: 0.071 s
% 2.44/1.17 % (1616168)Peak memory usage: 89 MB
% 2.44/1.17 % (1616168)Instructions burned: 111 (million)
% 2.44/1.17 % (1616171)Instruction limit reached!
% 2.44/1.17 % (1616171)------------------------------
% 2.44/1.17 % (1616171)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.44/1.17 % (1616171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.44/1.17 % (1616171)CaDiCaL version: 2.1.3
% 2.44/1.17 % (1616171)Termination reason: Instruction limit
% 2.44/1.17 % (1616171)Termination phase: Saturation
% 2.44/1.17 % (1616171)Time elapsed: 0.074 s
% 2.44/1.17 % (1616171)Peak memory usage: 90 MB
% 2.44/1.17 % (1616171)Instructions burned: 130 (million)
% 2.44/1.17 % (1616170)Refutation found. Thanks to Tanya!
% 2.44/1.17 % SZS status Theorem for theBenchmark
% 2.44/1.17 % SZS output start Proof for theBenchmark
% See solution above
% 2.97/1.36 % (1616170)------------------------------
% 2.97/1.36 % (1616170)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.97/1.36 % (1616170)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.97/1.36 % (1616170)CaDiCaL version: 2.1.3
% 2.97/1.36 % (1616170)Termination reason: Refutation
% 2.97/1.36 % (1616170)Time elapsed: 0.034 s
% 2.97/1.36 % (1616170)Peak memory usage: 91 MB
% 2.97/1.36 % (1616170)Instructions burned: 94 (million)
% 2.97/1.36 % (1616170)------------------------------
% 2.97/1.36 % (1616170)------------------------------
% 2.97/1.36 % (1616160)Success in time 0.342 s
% 2.97/1.36 % Vampire exiting
%------------------------------------------------------------------------------