%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC083+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:02:21 PM UTC 2026
% Result : Theorem 1.49s 1.30s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 10
% Syntax : Number of formulae : 104 ( 27 unt; 0 def)
% Number of atoms : 362 ( 76 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 459 ( 201 ~; 184 |; 44 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 121 ( 104 !; 17 ?)
% 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/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f79,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,X1) = app(X0,X1)
=> X2 = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
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)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X3 ) ) ) ) ) ) ),
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
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ~ ssList(X7)
| app(app(X5,X6),X7) != X2
| app(X5,X7) != X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ? [X5] :
( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(app(X5,X6),X7) = X2
& app(X5,X7) = X3 )
& ssList(X6) )
& ssList(X5) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f106,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X2 = X0
| app(X2,X1) != app(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f105]) ).
fof(f107,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f116,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f121,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(f129,plain,
( ssList(sK3)
& sK1 = sK3
& sK0 = sK2
& neq(sK1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK1,X4)
| ~ segmentP(sK0,X4) )
& ssList(sK6)
& sK2 = app(app(sK4,sK5),sK6)
& sK3 = app(sK4,sK6)
& ssList(sK5)
& ssList(sK4)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4),skolemize(X6,sK5),skolemize(X7,sK6)],[f98]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f110]) ).
fof(f135,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,[],[f121]) ).
fof(f136,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,[],[f135]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK7(X0,X1))
& ssList(sK8(X0,X1))
& app(app(sK7(X0,X1),X1),sK8(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X4,sK7(X0,X1)),skolemize(X5,sK8(X0,X1))],[f136]) ).
fof(f142,plain,
ssList(sK2),
inference(cnf_transformation,[],[f129]) ).
fof(f143,plain,
ssList(sK4),
inference(cnf_transformation,[],[f129]) ).
fof(f144,plain,
ssList(sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f145,plain,
sK3 = app(sK4,sK6),
inference(cnf_transformation,[],[f129]) ).
fof(f146,plain,
sK2 = app(app(sK4,sK5),sK6),
inference(cnf_transformation,[],[f129]) ).
fof(f147,plain,
ssList(sK6),
inference(cnf_transformation,[],[f129]) ).
fof(f148,plain,
! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK1,X4)
| ~ segmentP(sK0,X4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f149,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f129]) ).
fof(f150,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f151,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f152,plain,
ssList(sK3),
inference(cnf_transformation,[],[f129]) ).
fof(f153,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f157,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f160,plain,
! [X2,X0,X1] :
( app(X2,X1) != app(X0,X1)
| X0 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f161,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f163,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f165,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f168,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f173,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f179,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,[],[f137]) ).
fof(f191,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f149,f151]) ).
fof(f192,plain,
! [X4] :
( ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| ~ segmentP(sK2,X4) ),
inference(definition_unfolding,[],[f148,f151,f150]) ).
fof(f200,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f179]) ).
fof(f207,plain,
( ~ ssList(sK3)
| ~ neq(sK3,nil)
| ~ ssList(sK3)
| ~ segmentP(sK2,sK3) ),
inference(resolution,[],[f173,f192]) ).
fof(f208,plain,
( ~ ssList(sK3)
| ~ neq(sK3,nil)
| ~ segmentP(sK2,sK3) ),
inference(duplicate_literal_removal,[],[f207]) ).
fof(f209,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK2,sK3) ),
inference(forward_subsumption_resolution,[],[f208,f152]) ).
fof(f210,plain,
~ segmentP(sK2,sK3),
inference(forward_subsumption_resolution,[],[f209,f191]) ).
fof(f325,plain,
! [X0] :
( sK3 != app(X0,sK6)
| sK4 = X0
| ~ ssList(X0)
| ~ ssList(sK6)
| ~ ssList(sK4) ),
inference(superposition,[],[f160,f145]) ).
fof(f336,plain,
! [X0] :
( sK3 != app(X0,sK6)
| sK4 = X0
| ~ ssList(X0)
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f325,f147]) ).
fof(f343,plain,
! [X0] :
( sK3 != app(X0,sK6)
| sK4 = X0
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f336,f143]) ).
fof(f356,plain,
! [X0] :
( app(sK4,app(sK6,X0)) = app(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK6)
| ~ ssList(sK4) ),
inference(superposition,[],[f157,f145]) ).
fof(f360,plain,
( sK2 = app(sK4,app(sK5,sK6))
| ~ ssList(sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(superposition,[],[f146,f157]) ).
fof(f388,plain,
( sK2 = app(sK4,app(sK5,sK6))
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f360,f147]) ).
fof(f392,plain,
! [X0] :
( app(sK4,app(sK6,X0)) = app(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f356,f147]) ).
fof(f397,plain,
( sK2 = app(sK4,app(sK5,sK6))
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f388,f144]) ).
fof(f400,plain,
! [X0] :
( app(sK4,app(sK6,X0)) = app(sK3,X0)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f392,f143]) ).
fof(f401,plain,
sK2 = app(sK4,app(sK5,sK6)),
inference(forward_subsumption_resolution,[],[f397,f143]) ).
fof(f558,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1))
| ~ ssList(X0) ),
inference(superposition,[],[f200,f161]) ).
fof(f564,plain,
! [X0] :
( segmentP(app(sK3,X0),sK6)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(sK6)
| ~ ssList(app(sK3,X0)) ),
inference(superposition,[],[f200,f145]) ).
fof(f565,plain,
! [X0] :
( segmentP(app(sK2,X0),sK6)
| ~ ssList(app(sK4,sK5))
| ~ ssList(X0)
| ~ ssList(sK6)
| ~ ssList(app(sK2,X0)) ),
inference(superposition,[],[f200,f146]) ).
fof(f578,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(duplicate_literal_removal,[],[f558]) ).
fof(f583,plain,
! [X0] :
( segmentP(app(sK2,X0),sK6)
| ~ ssList(app(sK4,sK5))
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[],[f565,f147]) ).
fof(f584,plain,
! [X0] :
( segmentP(app(sK3,X0),sK6)
| ~ ssList(X0)
| ~ ssList(sK6)
| ~ ssList(app(sK3,X0)) ),
inference(forward_subsumption_resolution,[],[f564,f143]) ).
fof(f588,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(forward_subsumption_resolution,[],[f578,f168]) ).
fof(f592,plain,
! [X0] :
( segmentP(app(sK3,X0),sK6)
| ~ ssList(X0)
| ~ ssList(app(sK3,X0)) ),
inference(forward_subsumption_resolution,[],[f584,f147]) ).
fof(f593,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f588,f163]) ).
fof(f615,plain,
( app(sK4,sK6) = app(sK3,nil)
| ~ ssList(nil)
| ~ ssList(sK6) ),
inference(superposition,[],[f400,f153]) ).
fof(f637,plain,
( app(sK4,sK6) = app(sK3,nil)
| ~ ssList(sK6) ),
inference(forward_subsumption_resolution,[],[f615,f168]) ).
fof(f638,plain,
app(sK4,sK6) = app(sK3,nil),
inference(forward_subsumption_resolution,[],[f637,f147]) ).
fof(f639,plain,
sK3 = app(sK3,nil),
inference(forward_demodulation,[],[f638,f145]) ).
fof(f641,plain,
( segmentP(sK3,sK6)
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssList(sK3) ),
inference(superposition,[],[f592,f153]) ).
fof(f642,plain,
( segmentP(sK3,sK6)
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f641]) ).
fof(f644,plain,
( segmentP(sK3,sK6)
| ~ ssList(sK3) ),
inference(forward_subsumption_resolution,[],[f642,f168]) ).
fof(f646,plain,
segmentP(sK3,sK6),
inference(forward_subsumption_resolution,[],[f644,f152]) ).
fof(f647,plain,
( ~ neq(sK6,nil)
| ~ ssList(sK6)
| ~ segmentP(sK2,sK6) ),
inference(resolution,[],[f646,f192]) ).
fof(f650,plain,
( ~ segmentP(sK2,sK6)
| ~ neq(sK6,nil) ),
inference(forward_subsumption_resolution,[],[f647,f147]) ).
fof(f687,plain,
( segmentP(sK2,sK6)
| ~ ssList(app(sK4,sK5))
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ ssList(sK2) ),
inference(superposition,[],[f583,f153]) ).
fof(f688,plain,
( segmentP(sK2,sK6)
| ~ ssList(app(sK4,sK5))
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(duplicate_literal_removal,[],[f687]) ).
fof(f690,plain,
( segmentP(sK2,sK6)
| ~ ssList(app(sK4,sK5))
| ~ ssList(sK2) ),
inference(forward_subsumption_resolution,[],[f688,f168]) ).
fof(f692,plain,
( ~ ssList(app(sK4,sK5))
| segmentP(sK2,sK6) ),
inference(forward_subsumption_resolution,[],[f690,f142]) ).
fof(f711,plain,
( segmentP(sK2,sK6)
| ~ ssList(sK5)
| ~ ssList(sK4) ),
inference(resolution,[],[f692,f163]) ).
fof(f712,plain,
( segmentP(sK2,sK6)
| ~ ssList(sK4) ),
inference(forward_subsumption_resolution,[],[f711,f144]) ).
fof(f713,plain,
segmentP(sK2,sK6),
inference(forward_subsumption_resolution,[],[f712,f143]) ).
fof(f722,plain,
~ neq(sK6,nil),
inference(resolution,[],[f713,f650]) ).
fof(f729,plain,
( nil = sK6
| ~ ssList(nil)
| ~ ssList(sK6) ),
inference(resolution,[],[f722,f165]) ).
fof(f730,plain,
( nil = sK6
| ~ ssList(sK6) ),
inference(forward_subsumption_resolution,[],[f729,f168]) ).
fof(f731,plain,
nil = sK6,
inference(forward_subsumption_resolution,[],[f730,f147]) ).
fof(f762,plain,
sK3 = app(sK3,sK6),
inference(superposition,[],[f639,f731]) ).
fof(f862,plain,
( sK3 != sK3
| sK3 = sK4
| ~ ssList(sK3) ),
inference(superposition,[],[f343,f762]) ).
fof(f874,plain,
( sK3 = sK4
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f862]) ).
fof(f880,plain,
sK3 = sK4,
inference(forward_subsumption_resolution,[],[f874,f152]) ).
fof(f893,plain,
( segmentP(sK2,sK4)
| ~ ssList(app(sK5,sK6))
| ~ ssList(sK4) ),
inference(superposition,[],[f593,f401]) ).
fof(f913,plain,
( segmentP(sK2,sK4)
| ~ ssList(app(sK5,sK6)) ),
inference(forward_subsumption_resolution,[],[f893,f143]) ).
fof(f932,plain,
~ segmentP(sK2,sK4),
inference(superposition,[],[f210,f880]) ).
fof(f1097,plain,
~ ssList(app(sK5,sK6)),
inference(forward_subsumption_resolution,[],[f913,f932]) ).
fof(f1145,plain,
( ~ ssList(sK6)
| ~ ssList(sK5) ),
inference(resolution,[],[f1097,f163]) ).
fof(f1146,plain,
~ ssList(sK5),
inference(forward_subsumption_resolution,[],[f1145,f147]) ).
fof(f1147,plain,
$false,
inference(forward_subsumption_resolution,[],[f1146,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC083+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 28 07:48:25 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 1.49/1.30 % (1614469)Detected formulas, will run a generic FOF schedule.
% 1.49/1.30 % (1614476)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=3688158008:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.49/1.30 % (1614478)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3052238499:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.49/1.30 % (1614480)dis-21_1_sil=8000:lcm=predicate:random_seed=3126904126: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)
% 1.49/1.30 % (1614475)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=2938312528:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.49/1.30 % (1614477)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2781098997:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.49/1.30 % (1614479)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3434642692:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.49/1.30 % (1614474)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=2777695365:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.49/1.30 % (1614478)First to succeed.
% 1.49/1.30 % (1614478)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1614469"
% 1.49/1.30 % (1614479)Also succeeded, but the first one will report.
% 1.49/1.30 % (1614477)Instruction limit reached!
% 1.49/1.30 % (1614477)------------------------------
% 1.49/1.30 % (1614477)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.49/1.30 % (1614477)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/1.30 % (1614477)CaDiCaL version: 2.1.3
% 1.49/1.30 % (1614477)Termination reason: Instruction limit
% 1.49/1.30 % (1614477)Termination phase: Saturation
% 1.49/1.30 % (1614477)Time elapsed: 0.068 s
% 1.49/1.30 % (1614477)Peak memory usage: 89 MB
% 1.49/1.30 % (1614477)Instructions burned: 109 (million)
% 1.49/1.30 % (1614480)Instruction limit reached!
% 1.49/1.30 % (1614480)------------------------------
% 1.49/1.30 % (1614480)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.49/1.30 % (1614480)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.49/1.30 % (1614480)CaDiCaL version: 2.1.3
% 1.49/1.30 % (1614480)Termination reason: Instruction limit
% 1.49/1.30 % (1614480)Termination phase: Saturation
% 1.49/1.30 % (1614480)Time elapsed: 0.075 s
% 1.49/1.30 % (1614480)Peak memory usage: 90 MB
% 1.49/1.30 % (1614480)Instructions burned: 129 (million)
% 1.49/1.30 % (1614489)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1125646561:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 1.49/1.30 % (1614488)lrs+10_1_sil=8000:sp=occurrence:random_seed=3851064345:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 1.49/1.30 % (1614478)Refutation found. Thanks to Tanya!
% 1.49/1.30 % SZS status Theorem for theBenchmark
% 1.49/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/1.40 % (1614478)------------------------------
% 0.17/1.40 % (1614478)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.17/1.40 % (1614478)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/1.40 % (1614478)CaDiCaL version: 2.1.3
% 0.17/1.40 % (1614478)Termination reason: Refutation
% 0.17/1.40 % (1614478)Time elapsed: 0.021 s
% 0.17/1.40 % (1614478)Peak memory usage: 88 MB
% 0.17/1.40 % (1614478)Instructions burned: 30 (million)
% 0.17/1.40 % (1614478)------------------------------
% 0.17/1.40 % (1614478)------------------------------
% 0.17/1.40 % (1614469)Success in time 0.448 s
% 0.17/1.40 % Vampire exiting
%------------------------------------------------------------------------------