%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC085+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 : n012.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:22 PM UTC 2026
% Result : Theorem 0.75s 0.86s
% Output : Refutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 15
% Syntax : Number of formulae : 115 ( 18 unt; 7 def)
% Number of atoms : 428 ( 59 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 543 ( 230 ~; 223 |; 60 &)
% ( 13 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 82 !; 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/theBenchmark.p',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/sandbox/benchmark/theBenchmark.p',ax7) ).
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(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
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) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ 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(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
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) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,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) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f240,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f101]) ).
fof(f241,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ? [X3] :
( ssList(X3)
& app(X1,X3) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f240]) ).
fof(f242,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) )
& ( ( ssList(sK11(X0,X1))
& app(X1,sK11(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X3,sK11(X0,X1))],[f241]) ).
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(f285,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& neq(sK54,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) )
& ( ( nil = sK56
& nil = sK55 )
| ( neq(sK55,nil)
& frontsegP(sK56,sK55) ) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f309,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| app(X1,sK11(X0,X1)) = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
fof(f310,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
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(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(f444,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f285]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( nil = sK55
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( nil = sK56
| frontsegP(sK56,sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( nil = sK56
| neq(sK55,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK54,X4)
| ~ segmentP(sK53,X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f513,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(f527,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f444]) ).
fof(f543,definition,
( spl57_1
<=> frontsegP(sK56,sK55) ),
introduced(definition,[new_symbols(definition,[spl57_1])],[avatar_definition]) ).
fof(f545,plain,
( frontsegP(sK56,sK55)
| ~ spl57_1 ),
inference(avatar_component_clause,[],[f543]) ).
fof(f547,definition,
( spl57_2
<=> nil = sK55 ),
introduced(definition,[new_symbols(definition,[spl57_2])],[avatar_definition]) ).
fof(f549,plain,
( nil = sK55
| ~ spl57_2 ),
inference(avatar_component_clause,[],[f547]) ).
fof(f550,plain,
( spl57_1
| spl57_2 ),
inference(avatar_split_clause,[],[f500,f547,f543]) ).
fof(f552,definition,
( spl57_3
<=> neq(sK55,nil) ),
introduced(definition,[new_symbols(definition,[spl57_3])],[avatar_definition]) ).
fof(f554,plain,
( neq(sK55,nil)
| ~ spl57_3 ),
inference(avatar_component_clause,[],[f552]) ).
fof(f555,plain,
( spl57_3
| spl57_2 ),
inference(avatar_split_clause,[],[f501,f547,f552]) ).
fof(f557,definition,
( spl57_4
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl57_4])],[avatar_definition]) ).
fof(f559,plain,
( nil = sK56
| ~ spl57_4 ),
inference(avatar_component_clause,[],[f557]) ).
fof(f560,plain,
( spl57_1
| spl57_4 ),
inference(avatar_split_clause,[],[f502,f557,f543]) ).
fof(f561,plain,
( spl57_3
| spl57_4 ),
inference(avatar_split_clause,[],[f503,f557,f552]) ).
fof(f563,definition,
( spl57_5
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl57_5])],[avatar_definition]) ).
fof(f564,plain,
( ssList(nil)
| ~ spl57_5 ),
inference(avatar_component_clause,[],[f563]) ).
fof(f582,definition,
( spl57_9
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl57_9])],[avatar_definition]) ).
fof(f584,plain,
( segmentP(nil,nil)
| ~ spl57_9 ),
inference(avatar_component_clause,[],[f582]) ).
fof(f585,plain,
( ~ spl57_5
| spl57_9 ),
inference(avatar_split_clause,[],[f527,f582,f563]) ).
fof(f596,plain,
spl57_5,
inference(avatar_split_clause,[],[f389,f563]) ).
fof(f598,plain,
neq(sK56,nil),
inference(superposition,[],[f505,f507]) ).
fof(f604,plain,
! [X4] :
( ~ segmentP(sK56,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK53,X4) ),
inference(forward_demodulation,[],[f504,f507]) ).
fof(f605,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK53,X4) )
| ~ spl57_4 ),
inference(forward_demodulation,[],[f604,f559]) ).
fof(f606,plain,
( ! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl57_4 ),
inference(forward_demodulation,[],[f605,f506]) ).
fof(f607,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl57_2
| ~ spl57_4 ),
inference(forward_demodulation,[],[f606,f549]) ).
fof(f608,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) )
| ~ spl57_2
| ~ spl57_4 ),
inference(duplicate_literal_removal,[],[f607]) ).
fof(f609,plain,
( neq(nil,nil)
| ~ spl57_4 ),
inference(forward_demodulation,[],[f598,f559]) ).
fof(f610,plain,
( ~ ssList(nil)
| ~ neq(nil,nil)
| ~ spl57_2
| ~ spl57_4
| ~ spl57_9 ),
inference(resolution,[],[f584,f608]) ).
fof(f611,plain,
( ~ neq(nil,nil)
| ~ spl57_2
| ~ spl57_4
| ~ spl57_5
| ~ spl57_9 ),
inference(forward_subsumption_resolution,[],[f610,f564]) ).
fof(f612,plain,
( $false
| ~ spl57_2
| ~ spl57_4
| ~ spl57_5
| ~ spl57_9 ),
inference(forward_subsumption_resolution,[],[f611,f609]) ).
fof(f613,plain,
( ~ spl57_2
| ~ spl57_4
| ~ spl57_5
| ~ spl57_9 ),
inference(avatar_contradiction_clause,[],[f612]) ).
fof(f616,plain,
! [X4] :
( ~ segmentP(sK56,X4)
| ~ segmentP(sK55,X4)
| ~ ssList(X4)
| ~ neq(X4,nil) ),
inference(forward_demodulation,[],[f604,f506]) ).
fof(f857,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(resolution,[],[f309,f545]) ).
fof(f862,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ ssList(sK56)
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f857,f498]) ).
fof(f866,plain,
( sK56 = app(sK55,sK11(sK56,sK55))
| ~ spl57_1 ),
inference(forward_subsumption_resolution,[],[f862,f499]) ).
fof(f874,definition,
( spl57_16
<=> ssList(sK11(sK56,sK55)) ),
introduced(definition,[new_symbols(definition,[spl57_16])],[avatar_definition]) ).
fof(f875,plain,
( ssList(sK11(sK56,sK55))
| ~ spl57_16 ),
inference(avatar_component_clause,[],[f874]) ).
fof(f876,plain,
( ~ ssList(sK11(sK56,sK55))
| spl57_16 ),
inference(avatar_component_clause,[],[f874]) ).
fof(f893,plain,
( ~ frontsegP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK56)
| spl57_16 ),
inference(resolution,[],[f876,f310]) ).
fof(f894,plain,
( ~ ssList(sK55)
| ~ ssList(sK56)
| ~ spl57_1
| spl57_16 ),
inference(forward_subsumption_resolution,[],[f893,f545]) ).
fof(f895,plain,
( ~ ssList(sK56)
| ~ spl57_1
| spl57_16 ),
inference(forward_subsumption_resolution,[],[f894,f498]) ).
fof(f896,plain,
( $false
| ~ spl57_1
| spl57_16 ),
inference(forward_subsumption_resolution,[],[f895,f499]) ).
fof(f897,plain,
( ~ spl57_1
| spl57_16 ),
inference(avatar_contradiction_clause,[],[f896]) ).
fof(f1711,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f513,f403]) ).
fof(f1718,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f1711]) ).
fof(f1727,plain,
! [X0,X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(forward_subsumption_resolution,[],[f1718,f401]) ).
fof(f1733,plain,
( ! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) )
| ~ spl57_5 ),
inference(forward_subsumption_resolution,[],[f1727,f564]) ).
fof(f2373,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_5 ),
inference(superposition,[],[f1733,f866]) ).
fof(f2385,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK11(sK56,sK55))
| ~ spl57_1
| ~ spl57_5 ),
inference(forward_subsumption_resolution,[],[f2373,f498]) ).
fof(f2394,plain,
( segmentP(sK56,sK55)
| ~ spl57_1
| ~ spl57_5
| ~ spl57_16 ),
inference(forward_subsumption_resolution,[],[f2385,f875]) ).
fof(f2402,plain,
( ~ segmentP(sK55,sK55)
| ~ ssList(sK55)
| ~ neq(sK55,nil)
| ~ spl57_1
| ~ spl57_5
| ~ spl57_16 ),
inference(resolution,[],[f2394,f616]) ).
fof(f2410,plain,
( ~ ssList(sK55)
| ~ neq(sK55,nil)
| ~ spl57_1
| ~ spl57_5
| ~ spl57_16 ),
inference(forward_subsumption_resolution,[],[f2402,f440]) ).
fof(f2414,plain,
( ~ neq(sK55,nil)
| ~ spl57_1
| ~ spl57_5
| ~ spl57_16 ),
inference(forward_subsumption_resolution,[],[f2410,f498]) ).
fof(f2415,plain,
( $false
| ~ spl57_1
| ~ spl57_3
| ~ spl57_5
| ~ spl57_16 ),
inference(forward_subsumption_resolution,[],[f2414,f554]) ).
fof(f2416,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_5
| ~ spl57_16 ),
inference(avatar_contradiction_clause,[],[f2415]) ).
cnf(s1,plain,
( spl57_1
| spl57_2 ),
inference(sat_conversion,[],[f550]) ).
cnf(s2,plain,
( spl57_2
| spl57_3 ),
inference(sat_conversion,[],[f555]) ).
cnf(s3,plain,
( spl57_1
| spl57_4 ),
inference(sat_conversion,[],[f560]) ).
cnf(s4,plain,
( spl57_3
| spl57_4 ),
inference(sat_conversion,[],[f561]) ).
cnf(s10,plain,
( ~ spl57_5
| spl57_9 ),
inference(sat_conversion,[],[f585]) ).
cnf(s13,plain,
spl57_5,
inference(sat_conversion,[],[f596]) ).
cnf(s16,plain,
( ~ spl57_2
| ~ spl57_4
| ~ spl57_5
| ~ spl57_9 ),
inference(sat_conversion,[],[f613]) ).
cnf(s21,plain,
( ~ spl57_1
| spl57_16 ),
inference(sat_conversion,[],[f897]) ).
cnf(s66,plain,
( ~ spl57_1
| ~ spl57_3
| ~ spl57_5
| ~ spl57_16 ),
inference(sat_conversion,[],[f2416]) ).
cnf(s69,plain,
spl57_9,
inference(rat,[],[s10,s13]) ).
cnf(s71,plain,
spl57_1,
inference(rat,[],[s16,s1,s3,s13,s69]) ).
cnf(s72,plain,
spl57_16,
inference(rat,[],[s21,s71]) ).
cnf(s73,plain,
~ spl57_3,
inference(rat,[],[s66,s72,s13,s71]) ).
cnf(s75,plain,
spl57_4,
inference(rat,[],[s4,s73]) ).
cnf(s76,plain,
spl57_2,
inference(rat,[],[s2,s73]) ).
cnf(s77,plain,
$false,
inference(rat,[],[s16,s69,s13,s75,s76]) ).
fof(f2417,plain,
$false,
inference(avatar_sat_refutation,[],[s77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 28 07:48:14 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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
% 0.75/0.86 % (3221691)Detected formulas, will run a generic FOF schedule.
% 0.75/0.86 % (3221696)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=1487399468:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.75/0.86 % (3221702)dis-21_1_sil=8000:lcm=predicate:random_seed=1530653377: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)
% 0.75/0.86 % (3221698)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=1522527499:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.75/0.86 % (3221697)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=3412576803:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.75/0.86 % (3221699)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2829583408:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.75/0.86 % (3221700)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=593257227:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.75/0.86 % (3221701)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=800682114:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.75/0.86 % (3221701)First to succeed.
% 0.75/0.86 % (3221701)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3221691"
% 0.75/0.86 % (3221700)Instruction limit reached!
% 0.75/0.86 % (3221700)------------------------------
% 0.75/0.86 % (3221700)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/0.86 % (3221700)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/0.86 % (3221700)CaDiCaL version: 2.1.3
% 0.75/0.86 % (3221700)Termination reason: Instruction limit
% 0.75/0.86 % (3221700)Termination phase: Saturation
% 0.75/0.86 % (3221700)Time elapsed: 0.034 s
% 0.75/0.86 % (3221700)Peak memory usage: 88 MB
% 0.75/0.86 % (3221700)Instructions burned: 120 (million)
% 0.75/0.86 % (3221699)Instruction limit reached!
% 0.75/0.86 % (3221699)------------------------------
% 0.75/0.86 % (3221699)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/0.86 % (3221699)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/0.86 % (3221699)CaDiCaL version: 2.1.3
% 0.75/0.86 % (3221699)Termination reason: Instruction limit
% 0.75/0.86 % (3221699)Termination phase: Saturation
% 0.75/0.86 % (3221699)Time elapsed: 0.036 s
% 0.75/0.86 % (3221699)Peak memory usage: 89 MB
% 0.75/0.86 % (3221699)Instructions burned: 109 (million)
% 0.75/0.86 % (3221702)Instruction limit reached!
% 0.75/0.86 % (3221702)------------------------------
% 0.75/0.86 % (3221702)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.75/0.86 % (3221702)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.75/0.86 % (3221702)CaDiCaL version: 2.1.3
% 0.75/0.86 % (3221702)Termination reason: Instruction limit
% 0.75/0.86 % (3221702)Termination phase: Saturation
% 0.75/0.86 % (3221702)Time elapsed: 0.041 s
% 0.75/0.86 % (3221702)Peak memory usage: 90 MB
% 0.75/0.86 % (3221702)Instructions burned: 130 (million)
% 0.75/0.86 % (3221711)lrs+10_1_sil=32000:urr=on:br=off:random_seed=4274368992:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 0.75/0.86 % (3221710)lrs+10_1_sil=8000:sp=occurrence:random_seed=248153573:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 0.75/0.86 % (3221712)lrs+1011_1_sil=32000:sp=occurrence:random_seed=230551308:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 0.75/0.86 % (3221701)Refutation found. Thanks to Tanya!
% 0.75/0.86 % SZS status Theorem for theBenchmark
% 0.75/0.86 % SZS output start Proof for theBenchmark
% See solution above
% 2.49/0.96 % (3221701)------------------------------
% 2.49/0.96 % (3221701)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.49/0.96 % (3221701)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.49/0.96 % (3221701)CaDiCaL version: 2.1.3
% 2.49/0.96 % (3221701)Termination reason: Refutation
% 2.49/0.96 % (3221701)Time elapsed: 0.028 s
% 2.49/0.96 % (3221701)Peak memory usage: 90 MB
% 2.49/0.96 % (3221701)Instructions burned: 77 (million)
% 2.49/0.96 % (3221701)------------------------------
% 2.49/0.96 % (3221701)------------------------------
% 2.49/0.96 % (3221691)Success in time 0.323 s
% 2.49/0.96 % Vampire exiting
%------------------------------------------------------------------------------