%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC314+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:09:16 PM UTC 2026
% Result : Theorem 8.56s 6.92s
% Output : CNFRefutation 8.56s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f219ERROR: Could not build tree for root c_5872ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f25,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> tl(cons(X1,X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( app(X9,cons(X8,nil)) = X0
| app(cons(X8,nil),X9) != X1
| ~ ssList(X9) ) ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil = X0
| nil != X1 )
& ! [X8] :
( ssItem(X8)
=> ! [X9] :
( app(X9,cons(X8,nil)) = X0
| app(cons(X8,nil),X9) != X1
| ~ ssList(X9) ) ) )
| ( neq(X3,nil)
& ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& ? [X7] :
( neq(nil,X3)
& hd(X3) = X7
& cons(X7,nil) = X6
& ssItem(X7) )
& app(X5,X6) = X4
& tl(X3) = X5
& ssList(X6) )
& ssList(X5) )
& X2 != X4
& ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( nil != X0
& nil = X1 )
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( app(X9,cons(X8,nil)) != X0
& app(cons(X8,nil),X9) = X1
& ssList(X9) ) ) )
& ( ~ neq(X3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| ! [X7] :
( ~ neq(nil,X3)
| hd(X3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(X3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| X2 = X4
| ~ ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| nil != cons(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f107,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f116,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| hd(cons(X1,X0)) = X1 ) ),
inference(ennf_transformation,[],[f23]) ).
fof(f128,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(ennf_transformation,[],[f22]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(flattening,[],[f128]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f136,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(flattening,[],[f135]) ).
fof(f137,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ( nil != sK0
& nil = sK1 )
| ( ssItem(sK4)
& sK0 != app(sK5,cons(sK4,nil))
& sK1 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) )
& ( ~ neq(sK3,nil)
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK3)
| ! [X7] :
( ~ neq(nil,sK3)
| hd(sK3) != X7
| cons(X7,nil) != X6
| ~ ssItem(X7) )
| app(X5,X6) != X4
| tl(sK3) != X5
| ~ ssList(X6) )
| ~ ssList(X5) )
| sK2 = X4
| ~ ssList(X4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X8,sK4),skolemize(X9,sK5)],[f98]) ).
fof(f142,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f117]) ).
fof(f147,plain,
ssList(sK1),
inference(cnf_transformation,[],[f137]) ).
fof(f149,plain,
( nil != sK0
| ssItem(sK4) ),
inference(cnf_transformation,[],[f137]) ).
fof(f150,plain,
( nil = sK1
| ssItem(sK4) ),
inference(cnf_transformation,[],[f137]) ).
fof(f151,plain,
( nil != sK0
| sK0 != app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f152,plain,
( nil = sK1
| sK0 != app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f137]) ).
fof(f153,plain,
( nil != sK0
| sK1 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f137]) ).
fof(f154,plain,
( nil = sK1
| sK1 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f137]) ).
fof(f155,plain,
( nil != sK0
| ssList(sK5) ),
inference(cnf_transformation,[],[f137]) ).
fof(f156,plain,
( nil = sK1
| ssList(sK5) ),
inference(cnf_transformation,[],[f137]) ).
fof(f158,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f137]) ).
fof(f159,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f137]) ).
fof(f160,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f137]) ).
fof(f165,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f167,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f174,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f107]) ).
fof(f183,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f116]) ).
fof(f185,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f188,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f194,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| hd(cons(X1,X0)) = X1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f195,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f129]) ).
fof(f199,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| tl(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f200,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f201,plain,
( nil = sK3
| ssList(sK5) ),
inference(definition_unfolding,[],[f156,f160]) ).
fof(f202,plain,
( nil != sK2
| ssList(sK5) ),
inference(definition_unfolding,[],[f155,f159]) ).
fof(f203,plain,
( nil = sK3
| sK3 = app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f154,f160,f160]) ).
fof(f204,plain,
( nil != sK2
| sK3 = app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f153,f160,f159]) ).
fof(f205,plain,
( nil = sK3
| sK2 != app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f152,f159,f160]) ).
fof(f206,plain,
( nil != sK2
| sK2 != app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f151,f159,f159]) ).
fof(f207,plain,
( nil = sK3
| ssItem(sK4) ),
inference(definition_unfolding,[],[f150,f160]) ).
fof(f208,plain,
( nil != sK2
| ssItem(sK4) ),
inference(definition_unfolding,[],[f149,f159]) ).
fof(f209,plain,
ssList(sK3),
inference(definition_unfolding,[],[f147,f160]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK2 )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f158]) ).
tcf(c_51,negated_conjecture,
( ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ neq(nil,sK3)
| ~ neq(sK3,nil)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(app(tl(sK3),cons(hd(sK3),nil))) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_52,negated_conjecture,
( ssList(sK5)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f201]) ).
tcf(c_53,negated_conjecture,
( ssList(sK5)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_54,negated_conjecture,
( ( sK3 = nil )
| ( app(cons(sK4,nil),sK5) = sK3 ) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_55,negated_conjecture,
( ( app(cons(sK4,nil),sK5) = sK3 )
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_56,negated_conjecture,
( ( sK3 = nil )
| ( app(sK5,cons(sK4,nil)) != sK2 ) ),
inference(cnf_transformation,[],[f205]) ).
tcf(c_57,negated_conjecture,
( ( nil != sK2 )
| ( app(sK5,cons(sK4,nil)) != sK2 ) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_58,negated_conjecture,
( ssItem(sK4)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f207]) ).
tcf(c_59,negated_conjecture,
( ssItem(sK4)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_61,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f209]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_89,plain,
ssList(nil),
inference(cnf_transformation,[],[f188]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( ( hd(cons(X1,X0)) = X1 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_96,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_100,plain,
! [X0: $i,X1: $i] :
( ( tl(cons(X1,X0)) = X0 )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_101,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_131,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_58,c_58,c_59,c_50]) ).
tcf(c_133,negated_conjecture,
ssList(sK5),
inference(global_subsumption_just,[status(thm)],[c_52,c_52,c_53,c_50]) ).
tcf(c_135,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_59,c_131]) ).
tcf(c_137,negated_conjecture,
ssList(sK5),
inference(global_subsumption_just,[status(thm)],[c_53,c_133]) ).
tcf(c_141,negated_conjecture,
app(cons(sK4,nil),sK5) = sK3,
inference(global_subsumption_just,[status(thm)],[c_54,c_50,c_54,c_55]) ).
tcf(c_143,negated_conjecture,
app(sK5,cons(sK4,nil)) != sK2,
inference(global_subsumption_just,[status(thm)],[c_56,c_50,c_56,c_57]) ).
tcf(c_145,negated_conjecture,
app(cons(sK4,nil),sK5) = sK3,
inference(global_subsumption_just,[status(thm)],[c_55,c_141]) ).
tcf(c_147,negated_conjecture,
app(sK5,cons(sK4,nil)) != sK2,
inference(global_subsumption_just,[status(thm)],[c_57,c_143]) ).
tcf(c_215,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ neq(nil,sK3)
| ~ neq(sK3,nil)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3))
| ~ ssList(cons(hd(sK3),nil)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_84]) ).
tcf(c_1989,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(nil)
| ~ neq(nil,sK3)
| ~ neq(sK3,nil)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_75,c_215]) ).
tcf(c_2003,plain,
( ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ neq(nil,sK3)
| ~ neq(sK3,nil)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1989,c_89]) ).
tcf(c_2135,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_85,c_2003]) ).
tcf(c_2138,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2135,c_89,c_61]) ).
tcf(c_2154,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_85,c_2138]) ).
tcf(c_2155,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssItem(hd(sK3))
| ~ ssList(tl(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2154,c_89,c_61]) ).
tcf(c_2172,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(sK3)
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_96,c_2155]) ).
tcf(c_2173,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(tl(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2172,c_61]) ).
tcf(c_2186,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_101,c_2173]) ).
tcf(c_2187,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(hd(sK3),nil)) = sK2 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2186,c_61]) ).
tcf(c_2257,plain,
! [X0: $i] :
( ( hd(cons(X0,sK5)) = X0 )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_137,c_95]) ).
tcf(c_2426,plain,
hd(cons(sK4,sK5)) = sK4,
inference(superposition,[status(thm)],[c_135,c_2257]) ).
tcf(c_2512,plain,
! [X0: $i] :
( ( tl(cons(X0,sK5)) = sK5 )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_137,c_100]) ).
tcf(c_2671,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sK5) = cons(X0,sK5) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_137,c_66]) ).
tcf(c_2991,plain,
tl(cons(sK4,sK5)) = sK5,
inference(superposition,[status(thm)],[c_135,c_2512]) ).
tcf(c_4220,plain,
app(cons(sK4,nil),sK5) = cons(sK4,sK5),
inference(superposition,[status(thm)],[c_135,c_2671]) ).
tcf(c_4228,plain,
cons(sK4,sK5) = sK3,
inference(light_normalisation,[status(thm)],[c_4220,c_145]) ).
tcf(c_4244,plain,
tl(sK3) = sK5,
inference(demodulation,[status(thm)],[c_2991,c_4228]) ).
tcf(c_4245,plain,
hd(sK3) = sK4,
inference(demodulation,[status(thm)],[c_2426,c_4228]) ).
tcf(c_4250,plain,
( ( sK3 = nil )
| ( app(tl(sK3),cons(sK4,nil)) = sK2 ) ),
inference(demodulation,[status(thm)],[c_2187,c_4245]) ).
tcf(c_4272,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| ( sK3 != nil ) ),
inference(superposition,[status(thm)],[c_4228,c_68]) ).
tcf(c_4274,plain,
sK3 != nil,
inference(forward_subsumption_resolution,[status(thm)],[c_4272,c_135,c_137]) ).
tcf(c_5872,plain,
$false,
inference(smt_impl_just,[status(thm)],[c_4274,c_4250,c_4244,c_147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC314+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n006.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 17:34:26 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.46
% 0.15/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.46
% 0.15/5.46 % Detected problem language: tptp
% 0.15/5.48 % Proving...
% 8.56/6.92 % SZS status Started for theBenchmark.p
% 8.56/6.92 % SZS status Theorem for theBenchmark.p
% 8.56/6.92
% 8.56/6.92 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.56/6.92
% 8.56/6.92 % ------ iProver source info
% 8.56/6.92
% 8.56/6.92 % git: date: 2026-07-19 20:42:38 +0200
% 8.56/6.92 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.56/6.92 % git: non_committed_changes: false
% 8.56/6.92
% 8.56/6.92 % ------ Parsing...
% 8.56/6.92 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.56/6.92
% 8.56/6.92 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 8.56/6.92
% 8.56/6.92 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.56/6.92
% 8.56/6.92 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.56/6.92 % ------ Proving...
% 8.56/6.92 % ------ Problem Properties
% 8.56/6.92
% 8.56/6.92 %
% 8.56/6.92 % clauses 47
% 8.56/6.92 % conjectures 7
% 8.56/6.92 % EPR 13
% 8.56/6.92 % Horn 32
% 8.56/6.92 % unary 11
% 8.56/6.92 % binary 5
% 8.56/6.92 % lits 139
% 8.56/6.92 % lits eq 53
% 8.56/6.92 % fd_pure 0
% 8.56/6.92 % fd_pseudo 0
% 8.56/6.92 % fd_cond 12
% 8.56/6.92 % fd_pseudo_cond 7
% 8.56/6.92 % AC symbols 0
% 8.56/6.92
% 8.56/6.92 % ------ Schedule dynamic 5 is on
% 8.56/6.92
% 8.56/6.92 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.56/6.92
% 8.56/6.92
% 8.56/6.92 % ------
% 8.56/6.92 % Current options:
% 8.56/6.92 % ------
% 8.56/6.92
% 8.56/6.92
% 8.56/6.92 %
% 8.56/6.92
% 8.56/6.92 % ------ Proving...
% 8.56/6.92 %
% 8.56/6.92
% 8.56/6.92 % SZS status Theorem for theBenchmark.p
% 8.56/6.92
% 8.56/6.92 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.56/6.93
% 8.56/6.93
%------------------------------------------------------------------------------