%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC014+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 : n026.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:07:31 PM UTC 2026
% Result : Theorem 8.55s 1.73s
% Output : CNFRefutation 8.55s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f216ERROR: Could not build tree for root c_13732ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax25) ).
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(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| cons(X6,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( neq(nil,X1)
& app(X0,X5) = X4
& tl(X1) = X5
& ssList(X5) )
& X1 = X4
& ssList(X4) )
| ~ 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(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| cons(X6,nil) != X2 ) ) )
| ? [X4] :
( ? [X5] :
( neq(nil,X1)
& app(X0,X5) = X4
& tl(X1) = X5
& ssList(X5) )
& X1 = X4
& ssList(X4) )
| ~ 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(X3,nil)
& neq(X1,nil) )
| ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& cons(X6,nil) = X2 ) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| app(X0,X5) != X4
| tl(X1) != X5
| ~ ssList(X5) )
| X1 != X4
| ~ ssList(X4) )
& 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(X3,nil)
& neq(X1,nil) )
| ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& cons(X6,nil) = X2 ) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| app(X0,X5) != X4
| tl(X1) != X5
| ~ ssList(X5) )
| X1 != X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(ennf_transformation,[],[f76]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(flattening,[],[f126]) ).
fof(f128,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f143,plain,
( ssList(sK3)
& ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& ( ( ~ neq(sK6,nil)
& neq(sK4,nil) )
| sP0(sK4,sK3,sK5,sK6) )
& sK3 = sK5
& sK4 = sK6 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f139]) ).
fof(f148,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f150,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( tl(X0) = sK11(X0)
& ssList(sK11(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK11]),skolemize(X1,sK11(X0))],[f127]) ).
fof(f159,plain,
ssList(sK4),
inference(cnf_transformation,[],[f143]) ).
fof(f162,plain,
( ~ neq(sK6,nil)
| sP0(sK4,sK3,sK5,sK6) ),
inference(cnf_transformation,[],[f143]) ).
fof(f163,plain,
( neq(sK4,nil)
| sP0(sK4,sK3,sK5,sK6) ),
inference(cnf_transformation,[],[f143]) ).
fof(f164,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f143]) ).
fof(f165,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f143]) ).
fof(f169,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f189,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
fof(f192,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f196,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| tl(X0) = sK11(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f197,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(sK11(X0)) ),
inference(cnf_transformation,[],[f150]) ).
fof(f198,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f128]) ).
fof(f205,plain,
( neq(sK6,nil)
| sP0(sK6,sK5,sK5,sK6) ),
inference(definition_unfolding,[],[f163,f165,f164,f165]) ).
fof(f206,plain,
( ~ neq(sK6,nil)
| sP0(sK6,sK5,sK5,sK6) ),
inference(definition_unfolding,[],[f162,f165,f164]) ).
fof(f207,plain,
ssList(sK6),
inference(definition_unfolding,[],[f159,f165]) ).
tcf(c_55,negated_conjecture,
( neq(sK6,nil)
| sP0(sK6,sK5,sK5,sK6) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_56,negated_conjecture,
( sP0(sK6,sK5,sK5,sK6)
| ~ neq(sK6,nil) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_59,negated_conjecture,
ssList(sK6),
inference(cnf_transformation,[],[f207]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_84,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_87,plain,
ssList(nil),
inference(cnf_transformation,[],[f192]) ).
tcf(c_91,plain,
! [X0: $i] :
( ssList(sK11(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f197]) ).
tcf(c_92,plain,
! [X0: $i] :
( ( X0 = nil )
| ( tl(X0) = sK11(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f196]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i] :
( ( tl(cons(X1,X0)) = X0 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_134,negated_conjecture,
sP0(sK6,sK5,sK5,sK6),
inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_56]) ).
tcf(c_136,negated_conjecture,
sP0(sK6,sK5,sK5,sK6),
inference(global_subsumption_just,[status(thm)],[c_56,c_134]) ).
tcf(c_2064,plain,
( ( nil = sK6 )
| ( tl(sK6) = sK11(sK6) ) ),
inference(superposition,[status(thm)],[c_59,c_92]) ).
fof(f138,definition,
! [X1,X0,X2,X3] :
( ~ sP0(X1,X0,X2,X3)
| ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& cons(X6,nil) = X2 ) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| app(X0,X5) != X4
| tl(X1) != X5
| ~ ssList(X5) )
| X1 != X4
| ~ ssList(X4) )
& neq(X1,nil) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f139,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,X0,X2,X3) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(definition_folding,[],[f99,f138]) ).
fof(f140,plain,
! [X1,X0,X2,X3] :
( ~ sP0(X1,X0,X2,X3)
| ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& cons(X6,nil) = X2 ) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X1)
| app(X0,X5) != X4
| tl(X1) != X5
| ~ ssList(X5) )
| X1 != X4
| ~ ssList(X4) )
& neq(X1,nil) ) ),
inference(nnf_transformation,[],[f138]) ).
fof(f141,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X3
& cons(X6,nil) = X2 ) )
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X0)
| app(X1,X5) != X4
| tl(X0) != X5
| ~ ssList(X5) )
| X0 != X4
| ~ ssList(X4) )
& neq(X0,nil) ) ),
inference(rectify,[],[f140]) ).
fof(f142,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ssItem(sK1(X2,X3))
& ssList(sK2(X2,X3))
& app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X3
& cons(sK1(X2,X3),nil) = X2
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X0)
| app(X1,X5) != X4
| tl(X0) != X5
| ~ ssList(X5) )
| X0 != X4
| ~ ssList(X4) )
& neq(X0,nil) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X6,sK1(X2,X3)),skolemize(X7,sK2(X2,X3))],[f141]) ).
fof(f152,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X2,X3)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f153,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X2,X3)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f154,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X3 ),
inference(cnf_transformation,[],[f142]) ).
fof(f155,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(sK1(X2,X3),nil) = X2 ),
inference(cnf_transformation,[],[f142]) ).
fof(f156,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ sP0(X0,X1,X2,X3)
| ~ neq(nil,X0)
| app(X1,X5) != X4
| tl(X0) != X5
| ~ ssList(X5)
| X0 != X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f142]) ).
fof(f157,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X0,nil) ),
inference(cnf_transformation,[],[f142]) ).
fof(f209,plain,
! [X2,X3,X1,X4,X5] :
( ~ sP0(X4,X1,X2,X3)
| ~ neq(nil,X4)
| app(X1,X5) != X4
| tl(X4) != X5
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(equality_resolution,[],[f156]) ).
fof(f210,plain,
! [X2,X3,X1,X4] :
( ~ sP0(X4,X1,X2,X3)
| ~ neq(nil,X4)
| app(X1,tl(X4)) != X4
| ~ ssList(tl(X4))
| ~ ssList(X4) ),
inference(equality_resolution,[],[f209]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( neq(X0,nil)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssList(X1)
| ~ ssList(tl(X1))
| ~ neq(nil,X1)
| ~ sP0(X1,X0,X2,X3)
| ( app(X0,tl(X1)) != X1 ) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(sK1(X2,X3),nil) = X2 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X3 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_705,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X2,X3))
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_136]) ).
tcf(c_706,plain,
ssItem(sK1(sK5,sK6)),
inference(unflattening,[status(thm)],[c_705]) ).
tcf(c_710,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X2,X3))
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_136]) ).
tcf(c_711,plain,
ssList(sK2(sK5,sK6)),
inference(unflattening,[status(thm)],[c_710]) ).
tcf(c_715,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(cons(sK1(X2,X3),nil),sK2(X2,X3)) = X3 )
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_136]) ).
tcf(c_716,plain,
app(cons(sK1(sK5,sK6),nil),sK2(sK5,sK6)) = sK6,
inference(unflattening,[status(thm)],[c_715]) ).
tcf(c_720,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( cons(sK1(X2,X3),nil) = X2 )
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_136]) ).
tcf(c_721,plain,
cons(sK1(sK5,sK6),nil) = sK5,
inference(unflattening,[status(thm)],[c_720]) ).
tcf(c_725,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( neq(X0,nil)
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK5 )
| ( X0 != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_136]) ).
tcf(c_726,plain,
neq(sK6,nil),
inference(unflattening,[status(thm)],[c_725]) ).
tcf(c_730,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssList(X1)
| ~ ssList(tl(X1))
| ~ neq(nil,X1)
| ( X3 != sK6 )
| ( X2 != sK5 )
| ( X1 != sK6 )
| ( X0 != sK5 )
| ( app(X0,tl(X1)) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_136]) ).
tcf(c_731,plain,
( ~ ssList(sK6)
| ~ ssList(tl(sK6))
| ~ neq(nil,sK6)
| ( app(sK5,tl(sK6)) != sK6 ) ),
inference(unflattening,[status(thm)],[c_730]) ).
tcf(c_732,plain,
( ( app(sK5,tl(sK6)) != sK6 )
| ~ neq(nil,sK6)
| ~ ssList(tl(sK6)) ),
inference(global_subsumption_just,[status(thm)],[c_731,c_59,c_731]) ).
tcf(c_733,plain,
( ~ ssList(tl(sK6))
| ~ neq(nil,sK6)
| ( app(sK5,tl(sK6)) != sK6 ) ),
inference(renaming,[status(thm)],[c_732]) ).
tcf(c_759,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != sK6 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_726,c_84]) ).
tcf(c_760,plain,
( ~ ssList(nil)
| ( nil != sK6 ) ),
inference(unflattening,[status(thm)],[c_759]) ).
tcf(c_761,plain,
nil != sK6,
inference(global_subsumption_just,[status(thm)],[c_760,c_87,c_760]) ).
tcf(c_791,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(tl(sK6))
| ( X1 != sK6 )
| ( X0 != nil )
| ( app(sK5,tl(sK6)) != sK6 ) ),
inference(resolution_lifted,[status(thm)],[c_83,c_733]) ).
tcf(c_792,plain,
( ( nil = sK6 )
| ~ ssList(sK6)
| ~ ssList(nil)
| ~ ssList(tl(sK6))
| ( app(sK5,tl(sK6)) != sK6 ) ),
inference(unflattening,[status(thm)],[c_791]) ).
tcf(c_793,plain,
( ( app(sK5,tl(sK6)) != sK6 )
| ~ ssList(tl(sK6)) ),
inference(global_subsumption_just,[status(thm)],[c_792,c_59,c_87,c_760,c_792]) ).
tcf(c_794,plain,
( ~ ssList(tl(sK6))
| ( app(sK5,tl(sK6)) != sK6 ) ),
inference(renaming,[status(thm)],[c_793]) ).
tcf(c_1106,plain,
app(sK5,sK2(sK5,sK6)) = sK6,
inference(light_normalisation,[status(thm)],[c_716,c_721]) ).
tcf(c_1978,plain,
! [X0: $i] :
( ( app(cons(sK1(sK5,sK6),nil),X0) = cons(sK1(sK5,sK6),X0) )
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_706,c_64]) ).
tcf(c_1983,plain,
! [X0: $i] :
( ( cons(sK1(sK5,sK6),X0) = app(sK5,X0) )
| ~ ssList(X0) ),
inference(light_normalisation,[status(thm)],[c_1978,c_721]) ).
tcf(c_2074,plain,
tl(sK6) = sK11(sK6),
inference(forward_subsumption_resolution,[status(thm)],[c_2064,c_761]) ).
tcf(c_2105,plain,
( ssList(tl(sK6))
| ( nil = sK6 )
| ~ ssList(sK6) ),
inference(superposition,[status(thm)],[c_2074,c_91]) ).
tcf(c_2106,plain,
ssList(tl(sK6)),
inference(forward_subsumption_resolution,[status(thm)],[c_2105,c_761,c_59]) ).
tcf(c_2107,plain,
app(sK5,tl(sK6)) != sK6,
inference(backward_subsumption_resolution,[status(thm)],[c_794,c_2106]) ).
tcf(c_2135,plain,
! [X0: $i] :
( ( tl(cons(sK1(sK5,sK6),X0)) = X0 )
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_706,c_93]) ).
tcf(c_7475,plain,
tl(cons(sK1(sK5,sK6),sK2(sK5,sK6))) = sK2(sK5,sK6),
inference(superposition,[status(thm)],[c_711,c_2135]) ).
tcf(c_10288,plain,
cons(sK1(sK5,sK6),sK2(sK5,sK6)) = app(sK5,sK2(sK5,sK6)),
inference(superposition,[status(thm)],[c_711,c_1983]) ).
tcf(c_10305,plain,
cons(sK1(sK5,sK6),sK2(sK5,sK6)) = sK6,
inference(light_normalisation,[status(thm)],[c_10288,c_1106]) ).
tcf(c_13701,plain,
sK2(sK5,sK6) = tl(sK6),
inference(light_normalisation,[status(thm)],[c_7475,c_10305]) ).
tcf(c_13730,plain,
app(sK5,tl(sK6)) = sK6,
inference(demodulation,[status(thm)],[c_1106,c_13701]) ).
tcf(c_13732,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13730,c_2107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC014+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.09/0.35 % Computer : n026.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 15:57:39 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/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.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 8.55/1.73 % SZS status Started for theBenchmark.p
% 8.55/1.73 % SZS status Theorem for theBenchmark.p
% 8.55/1.73
% 8.55/1.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.55/1.73
% 8.55/1.73 % ------ iProver source info
% 8.55/1.73
% 8.55/1.73 % git: date: 2026-07-19 20:42:38 +0200
% 8.55/1.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.55/1.73 % git: non_committed_changes: false
% 8.55/1.73
% 8.55/1.73 % ------ Parsing...
% 8.55/1.73 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.55/1.73
% 8.55/1.73 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 1 sf_s rm: 3 0s sf_e pe_s pe_e %
% 8.55/1.73
% 8.55/1.73 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.55/1.73
% 8.55/1.73 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.55/1.73 % ------ Proving...
% 8.55/1.73 % ------ Problem Properties
% 8.55/1.73
% 8.55/1.73 %
% 8.55/1.73 % clauses 43
% 8.55/1.73 % conjectures 2
% 8.55/1.73 % EPR 7
% 8.55/1.73 % Horn 30
% 8.55/1.73 % unary 12
% 8.55/1.73 % binary 3
% 8.55/1.73 % lits 122
% 8.55/1.73 % lits eq 50
% 8.55/1.73 % fd_pure 0
% 8.55/1.73 % fd_pseudo 0
% 8.55/1.73 % fd_cond 12
% 8.55/1.73 % fd_pseudo_cond 5
% 8.55/1.73 % AC symbols 0
% 8.55/1.73
% 8.55/1.73 % ------ Schedule dynamic 5 is on
% 8.55/1.73
% 8.55/1.73 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.55/1.73
% 8.55/1.73
% 8.55/1.73 % ------
% 8.55/1.73 % Current options:
% 8.55/1.73 % ------
% 8.55/1.73
% 8.55/1.73
% 8.55/1.73 %
% 8.55/1.73
% 8.55/1.73 % ------ Proving...
% 8.55/1.73 %
% 8.55/1.73
% 8.55/1.73 % SZS status Theorem for theBenchmark.p
% 8.55/1.73
% 8.55/1.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.55/1.73
% 8.55/1.73
%------------------------------------------------------------------------------