%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC214+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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 : Fri Sep 25 03:08:54 PM UTC 2026
% Result : Theorem 1.98s 1.06s
% Output : CNFRefutation 1.98s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f321ERROR: Could not build tree for root c_11751ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( neq(X0,nil)
| ? [X4] :
( strictorderedP(X4)
& segmentP(X4,X2)
& frontsegP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ strictorderedP(X2)
| ~ frontsegP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ neq(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ neq(X0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& strictorderedP(X2)
& frontsegP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| nil != cons(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(ennf_transformation,[],[f57]) ).
fof(f127,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f143,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f144,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f147,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(ennf_transformation,[],[f78]) ).
fof(f148,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(flattening,[],[f147]) ).
fof(f151,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(ennf_transformation,[],[f75]) ).
fof(f152,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(flattening,[],[f151]) ).
fof(f168,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(ennf_transformation,[],[f76]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(flattening,[],[f168]) ).
fof(f178,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ~ neq(sK0,nil)
& ! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& strictorderedP(sK2)
& frontsegP(sK3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f180,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f186,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f187,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X3] :
( app(X1,X3) = X0
& ssList(X3) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(rectify,[],[f186]) ).
fof(f188,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ( app(X1,sK8(X0,X1)) = X0
& ssList(sK8(X0,X1)) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X3,sK8(X0,X1))],[f187]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( hd(X0) = sK16(X0)
& ssItem(sK16(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK16]),skolemize(X1,sK16(X0))],[f152]) ).
fof(f203,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( tl(X0) = sK17(X0)
& ssList(sK17(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17]),skolemize(X1,sK17(X0))],[f169]) ).
fof(f204,plain,
ssList(sK0),
inference(cnf_transformation,[],[f178]) ).
fof(f205,plain,
ssList(sK1),
inference(cnf_transformation,[],[f178]) ).
fof(f208,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f178]) ).
fof(f209,plain,
! [X4] :
( ~ strictorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ frontsegP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f178]) ).
fof(f212,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f178]) ).
fof(f213,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f178]) ).
fof(f214,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f178]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f180]) ).
fof(f222,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f226,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f239,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
fof(f242,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[],[f117]) ).
fof(f257,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f127]) ).
fof(f271,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f135]) ).
fof(f279,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f143]) ).
fof(f280,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f282,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f148]) ).
fof(f284,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| hd(X0) = sK16(X0) ),
inference(cnf_transformation,[],[f200]) ).
fof(f285,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(sK16(X0)) ),
inference(cnf_transformation,[],[f200]) ).
fof(f297,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| tl(X0) = sK17(X0) ),
inference(cnf_transformation,[],[f203]) ).
fof(f298,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(sK17(X0)) ),
inference(cnf_transformation,[],[f203]) ).
fof(f304,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f212,f214]) ).
fof(f305,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f208,f213]) ).
fof(f306,plain,
ssList(sK3),
inference(definition_unfolding,[],[f205,f214]) ).
fof(f307,plain,
ssList(sK2),
inference(definition_unfolding,[],[f204,f213]) ).
fof(f312,plain,
! [X2,X1] :
( ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(equality_resolution,[],[f239]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f304]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ segmentP(X0,sK2)
| ~ frontsegP(sK3,X0)
| ~ neq(sK2,X0) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_53,negated_conjecture,
~ neq(sK2,nil),
inference(cnf_transformation,[],[f305]) ).
tcf(c_56,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f306]) ).
tcf(c_57,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f307]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_62,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f321]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_69,plain,
ssList(nil),
inference(cnf_transformation,[],[f226]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i,X2: $i] :
( frontsegP(cons(X2,X0),cons(X2,X1))
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f323]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f312]) ).
tcf(c_85,plain,
! [X0: $i] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
tcf(c_99,plain,
! [X0: $i] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f257]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f271]) ).
tcf(c_121,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f279]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f280]) ).
tcf(c_124,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(hd(X0),tl(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f282]) ).
tcf(c_126,plain,
! [X0: $i] :
( ssItem(sK16(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f285]) ).
tcf(c_127,plain,
! [X0: $i] :
( ( X0 = nil )
| ( hd(X0) = sK16(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f284]) ).
tcf(c_139,plain,
! [X0: $i] :
( ssList(sK17(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f298]) ).
tcf(c_140,plain,
! [X0: $i] :
( ( X0 = nil )
| ( tl(X0) = sK17(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f297]) ).
tcf(c_205,plain,
! [X0: $i,X1: $i] :
( frontsegP(app(X0,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_80,c_122,c_80]) ).
tcf(c_1491,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_62]) ).
tcf(c_1492,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_1491]) ).
tcf(c_1493,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_1492,c_56,c_1492]) ).
tcf(c_1522,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ segmentP(X0,sK2)
| ~ frontsegP(sK3,X0)
| ( X2 != sK2 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_61]) ).
tcf(c_1523,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ~ ssList(sK2)
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ segmentP(X0,sK2)
| ~ frontsegP(sK3,X0) ),
inference(unflattening,[status(thm)],[c_1522]) ).
tcf(c_1525,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ~ frontsegP(sK3,X0)
| ~ segmentP(X0,sK2)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_1523,c_57,c_1523]) ).
tcf(c_1526,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ segmentP(X0,sK2)
| ~ frontsegP(sK3,X0) ),
inference(renaming,[status(thm)],[c_1525]) ).
tcf(c_1554,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != sK2 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_61]) ).
tcf(c_1555,plain,
( ( nil = sK2 )
| ~ ssList(sK2)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_1554]) ).
tcf(c_1556,plain,
nil = sK2,
inference(global_subsumption_just,[status(thm)],[c_1555,c_57,c_69,c_1555]) ).
tcf(c_2461,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ segmentP(X0,nil)
| ~ frontsegP(sK3,X0) ),
inference(light_normalisation,[status(thm)],[c_1526,c_1556]) ).
tcf(c_2467,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ frontsegP(sK3,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2461,c_85]) ).
tcf(c_5621,plain,
( ( sK3 = nil )
| ( hd(sK3) = sK16(sK3) ) ),
inference(superposition,[status(thm)],[c_56,c_127]) ).
tcf(c_5631,plain,
hd(sK3) = sK16(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_5621,c_1493]) ).
tcf(c_5721,plain,
( ssItem(hd(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_5631,c_126]) ).
tcf(c_5722,plain,
ssItem(hd(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_5721,c_1493,c_56]) ).
tcf(c_5983,plain,
( ( sK3 = nil )
| ( tl(sK3) = sK17(sK3) ) ),
inference(superposition,[status(thm)],[c_56,c_140]) ).
tcf(c_5993,plain,
tl(sK3) = sK17(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_5983,c_1493]) ).
tcf(c_6184,plain,
( ssList(tl(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_5993,c_139]) ).
tcf(c_6185,plain,
ssList(tl(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_6184,c_1493,c_56]) ).
tcf(c_6194,plain,
app(nil,tl(sK3)) = tl(sK3),
inference(superposition,[status(thm)],[c_6185,c_121]) ).
tcf(c_6237,plain,
( frontsegP(tl(sK3),nil)
| ~ ssList(nil)
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_6194,c_205]) ).
tcf(c_6238,plain,
frontsegP(tl(sK3),nil),
inference(forward_subsumption_resolution,[status(thm)],[c_6237,c_69,c_6185]) ).
tcf(c_6517,plain,
( ( sK3 = nil )
| ( cons(hd(sK3),tl(sK3)) = sK3 ) ),
inference(superposition,[status(thm)],[c_56,c_124]) ).
tcf(c_6531,plain,
cons(hd(sK3),tl(sK3)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_6517,c_1493]) ).
tcf(c_7297,plain,
! [X0: $i] :
( ssList(cons(hd(sK3),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sK3)) ),
inference(instantiation,[status(thm)],[c_113]) ).
tcf(c_7298,plain,
( ssList(cons(hd(sK3),nil))
| ~ ssList(nil)
| ~ ssItem(hd(sK3)) ),
inference(instantiation,[status(thm)],[c_7297]) ).
tcf(c_7311,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ ssItem(hd(sK3))
| ( cons(hd(sK3),X0) != nil ) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_7312,plain,
( strictorderedP(cons(hd(sK3),nil))
| ~ ssItem(hd(sK3)) ),
inference(instantiation,[status(thm)],[c_99]) ).
tcf(c_7313,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sK3))
| ( cons(hd(sK3),nil) != nil ) ),
inference(instantiation,[status(thm)],[c_7311]) ).
tcf(c_8049,plain,
! [X0: $i] :
( frontsegP(sK3,cons(hd(sK3),X0))
| ~ ssList(X0)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ frontsegP(tl(sK3),X0) ),
inference(superposition,[status(thm)],[c_6531,c_73]) ).
tcf(c_8067,plain,
! [X0: $i] :
( frontsegP(sK3,cons(hd(sK3),X0))
| ~ ssList(X0)
| ~ frontsegP(tl(sK3),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_8049,c_5722,c_6185]) ).
tcf(c_11723,plain,
! [X0: $i] :
( ( cons(hd(sK3),X0) = nil )
| ~ ssList(X0)
| ~ frontsegP(tl(sK3),X0)
| ~ ssList(cons(hd(sK3),X0))
| ~ strictorderedP(cons(hd(sK3),X0)) ),
inference(superposition,[status(thm)],[c_8067,c_2467]) ).
tcf(c_11750,plain,
( ( cons(hd(sK3),nil) = nil )
| ~ ssList(nil)
| ~ frontsegP(tl(sK3),nil)
| ~ ssList(cons(hd(sK3),nil))
| ~ strictorderedP(cons(hd(sK3),nil)) ),
inference(instantiation,[status(thm)],[c_11723]) ).
tcf(c_11751,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11750,c_7313,c_7312,c_7298,c_6238,c_5722,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC214+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:04:19 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 1.98/1.06 % SZS status Started for theBenchmark.p
% 1.98/1.06 % SZS status Theorem for theBenchmark.p
% 1.98/1.06
% 1.98/1.06 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.98/1.06
% 1.98/1.06 % ------ iProver source info
% 1.98/1.06
% 1.98/1.06 % git: date: 2026-07-19 20:42:38 +0200
% 1.98/1.06 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.98/1.06 % git: non_committed_changes: false
% 1.98/1.06
% 1.98/1.06 % ------ Parsing...
% 1.98/1.06 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.98/1.06
% 1.98/1.06 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 7 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.98/1.06
% 1.98/1.06 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.98/1.06
% 1.98/1.06 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.98/1.06 % ------ Proving...
% 1.98/1.06 % ------ Problem Properties
% 1.98/1.06
% 1.98/1.06 %
% 1.98/1.06 % clauses 86
% 1.98/1.06 % conjectures 1
% 1.98/1.06 % EPR 31
% 1.98/1.06 % Horn 63
% 1.98/1.06 % unary 12
% 1.98/1.06 % binary 9
% 1.98/1.06 % lits 303
% 1.98/1.06 % lits eq 62
% 1.98/1.06 % fd_pure 0
% 1.98/1.06 % fd_pseudo 0
% 1.98/1.06 % fd_cond 18
% 1.98/1.06 % fd_pseudo_cond 10
% 1.98/1.06 % AC symbols 0
% 1.98/1.06
% 1.98/1.06 % ------ Schedule dynamic 5 is on
% 1.98/1.06
% 1.98/1.06 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.98/1.06
% 1.98/1.06
% 1.98/1.06 % ------
% 1.98/1.06 % Current options:
% 1.98/1.06 % ------
% 1.98/1.06
% 1.98/1.06
% 1.98/1.06 %
% 1.98/1.06
% 1.98/1.06 % ------ Proving...
% 1.98/1.06 %
% 1.98/1.06
% 1.98/1.06 % SZS status Theorem for theBenchmark.p
% 1.98/1.06
% 1.98/1.06 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.98/1.06
% 1.98/1.06
%------------------------------------------------------------------------------