%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC366+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 : n001.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:29 PM UTC 2026
% Result : Theorem 3.83s 1.23s
% Output : CNFRefutation 3.83s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f555ERROR: Could not build tree for root c_12288ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax6) ).
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(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( rearsegP(X1,X0)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& app(X5,X2) = X4
& ssList(X5) )
& X3 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( rearsegP(X1,X0)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& app(X5,X2) = X4
& ssList(X5) )
& X3 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(flattening,[],[f126]) ).
fof(f132,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ rearsegP(X1,X0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ rearsegP(X1,X0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f243,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f102]) ).
fof(f244,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ? [X3] :
( app(X3,X1) = X0
& ssList(X3) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(rectify,[],[f243]) ).
fof(f245,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ rearsegP(X0,X1)
| ( app(sK12(X0,X1),X1) = X0
& ssList(sK12(X0,X1)) ) )
& ( ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) )
| rearsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK12]),skolemize(X3,sK12(X0,X1))],[f244]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ rearsegP(sK54,sK53)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK55) != X4
| ~ ssList(X5) )
| sK56 = X4
| ~ ssList(X4) )
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56 ),
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(f314,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| rearsegP(X0,X1) ),
inference(cnf_transformation,[],[f245]) ).
fof(f387,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f273]) ).
fof(f388,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(hd(X0)) ),
inference(cnf_transformation,[],[f127]) ).
fof(f401,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| ~ rearsegP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X6,X4,X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK55) != X4
| ~ ssList(X5)
| sK56 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
! [X6,X4,X5] :
( neq(sK54,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK55) != X4
| ~ ssList(X5)
| sK56 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
! [X6,X4,X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK55) != X4
| ~ ssList(X5)
| sK56 = X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f503,f507]) ).
fof(f512,plain,
( ~ neq(sK56,nil)
| ~ rearsegP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f507,f506]) ).
fof(f513,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f507]) ).
fof(f514,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f506]) ).
fof(f519,plain,
! [X2,X1] :
( ~ ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X2,X1),X1) ),
inference(equality_resolution,[],[f314]) ).
fof(f542,plain,
! [X6,X5] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| ~ ssList(X5)
| sK56 = app(X5,sK55)
| ~ ssList(app(X5,sK55)) ),
inference(equality_resolution,[],[f510]) ).
fof(f543,plain,
! [X6] :
( neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| ~ ssItem(X6)
| ~ ssList(cons(X6,nil))
| sK56 = app(cons(X6,nil),sK55)
| ~ ssList(app(cons(X6,nil),sK55)) ),
inference(equality_resolution,[],[f542]) ).
fof(f544,plain,
( neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK56 = app(cons(hd(sK56),nil),sK55)
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(equality_resolution,[],[f543]) ).
fof(f545,plain,
! [X6,X5] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| ~ ssList(X5)
| sK56 = app(X5,sK55)
| ~ ssList(app(X5,sK55)) ),
inference(equality_resolution,[],[f502]) ).
fof(f546,plain,
! [X6] :
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| hd(sK56) != X6
| ~ ssItem(X6)
| ~ ssList(cons(X6,nil))
| sK56 = app(cons(X6,nil),sK55)
| ~ ssList(app(cons(X6,nil),sK55)) ),
inference(equality_resolution,[],[f545]) ).
fof(f547,plain,
( ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| sK56 = app(cons(hd(sK56),nil),sK55)
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(equality_resolution,[],[f546]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f519]) ).
tcf(c_138,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f387]) ).
tcf(c_139,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f550]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f388]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_149,plain,
! [X0: $i] :
( ssItem(hd(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f397]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f401]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f555]) ).
tcf(c_247,negated_conjecture,
( neq(sK56,nil)
| ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(cnf_transformation,[],[f544]) ).
tcf(c_248,negated_conjecture,
( ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ neq(sK56,nil)
| ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(cnf_transformation,[],[f547]) ).
tcf(c_250,negated_conjecture,
( ~ rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f512]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f513]) ).
tcf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f514]) ).
tcf(c_369,negated_conjecture,
~ rearsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_250,c_246,c_250]) ).
tcf(c_377,plain,
! [X0: $i,X1: $i] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_64,c_153,c_64]) ).
tcf(c_383,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_247,c_246]) ).
tcf(c_385,plain,
( ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ ssList(app(cons(hd(sK56),nil),sK55))
| ~ ssList(cons(hd(sK56),nil))
| ~ neq(nil,sK56) ),
inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).
tcf(c_386,negated_conjecture,
( ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ neq(nil,sK56)
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(renaming,[status(thm)],[c_385]) ).
tcf(c_3226,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55))
| ( X1 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_138,c_386]) ).
tcf(c_3227,plain,
( ( nil = sK56 )
| ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssList(sK56)
| ~ ssList(nil)
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(unflattening,[status(thm)],[c_3226]) ).
tcf(c_3228,plain,
( ( nil = sK56 )
| ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(global_subsumption_just,[status(thm)],[c_3227,c_253,c_141,c_3227]) ).
tcf(c_3249,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_383]) ).
tcf(c_3250,plain,
( ~ ssList(nil)
| ( nil != sK56 ) ),
inference(unflattening,[status(thm)],[c_3249]) ).
tcf(c_3251,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3250,c_141,c_3250]) ).
tcf(c_3256,plain,
( ( app(cons(hd(sK56),nil),sK55) = sK56 )
| ~ ssItem(hd(sK56))
| ~ ssList(cons(hd(sK56),nil))
| ~ ssList(app(cons(hd(sK56),nil),sK55)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_3228,c_3251]) ).
tcf(c_8860,definition,
iPr_def_10 = hd(sK56),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8861,definition,
iPr_def_11 = cons(iPr_def_10,nil),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8862,definition,
iPr_def_12 = app(iPr_def_11,sK55),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_8863,plain,
( ( iPr_def_12 = sK56 )
| ~ ssList(iPr_def_12)
| ~ ssList(iPr_def_11)
| ~ ssItem(iPr_def_10) ),
inference(demodulation,[status(thm)],[c_3256,c_8860,c_8861,c_8862]) ).
tcf(c_8864,plain,
nil != sK56,
inference(demodulation,[status(thm)],[c_3251]) ).
tcf(c_8865,negated_conjecture,
~ rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_369]) ).
tcf(c_8866,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_8867,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
tcf(c_11846,plain,
( rearsegP(iPr_def_12,sK55)
| ~ ssList(iPr_def_11)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_8862,c_377]) ).
tcf(c_11847,plain,
( rearsegP(iPr_def_12,sK55)
| ~ ssList(iPr_def_11) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11846,c_8866]) ).
tcf(c_12178,plain,
( ssList(iPr_def_11)
| ~ ssList(nil)
| ~ ssItem(iPr_def_10) ),
inference(superposition,[status(thm)],[c_8861,c_140]) ).
tcf(c_12181,plain,
( ssList(iPr_def_11)
| ~ ssItem(iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12178,c_141]) ).
tcf(c_12217,plain,
( ssItem(iPr_def_10)
| ( nil = sK56 )
| ~ ssList(sK56) ),
inference(superposition,[status(thm)],[c_8860,c_149]) ).
tcf(c_12218,plain,
ssItem(iPr_def_10),
inference(forward_subsumption_resolution,[status(thm)],[c_12217,c_8864,c_8867]) ).
tcf(c_12223,plain,
( ( sK56 = iPr_def_12 )
| ~ ssList(iPr_def_12)
| ~ ssList(iPr_def_11) ),
inference(backward_subsumption_resolution,[status(thm)],[c_8863,c_12218]) ).
tcf(c_12227,plain,
( ( sK56 = iPr_def_12 )
| ~ ssList(iPr_def_12) ),
inference(global_subsumption_just,[status(thm)],[c_12223,c_12181,c_12218,c_12223]) ).
tcf(c_12233,plain,
ssList(iPr_def_11),
inference(global_subsumption_just,[status(thm)],[c_12181,c_12181,c_12218]) ).
tcf(c_12235,plain,
rearsegP(iPr_def_12,sK55),
inference(backward_subsumption_resolution,[status(thm)],[c_11847,c_12233]) ).
tcf(c_12263,plain,
( ssList(iPr_def_12)
| ~ ssList(iPr_def_11)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_8862,c_153]) ).
tcf(c_12272,plain,
ssList(iPr_def_12),
inference(forward_subsumption_resolution,[status(thm)],[c_12263,c_12233,c_8866]) ).
tcf(c_12279,plain,
sK56 = iPr_def_12,
inference(backward_subsumption_resolution,[status(thm)],[c_12227,c_12272]) ).
tcf(c_12286,plain,
~ rearsegP(iPr_def_12,sK55),
inference(demodulation,[status(thm)],[c_8865,c_12279]) ).
tcf(c_12288,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12286,c_12235]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC366+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.12/0.37 % Computer : n001.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Thu Sep 24 17:57:23 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.42
% 0.12/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.42
% 0.12/0.42 % Detected problem language: tptp
% 0.12/0.43 % Proving...
% 3.83/1.23 % SZS status Started for theBenchmark.p
% 3.83/1.23 % SZS status Theorem for theBenchmark.p
% 3.83/1.23
% 3.83/1.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.83/1.23
% 3.83/1.23 % ------ iProver source info
% 3.83/1.23
% 3.83/1.23 % git: date: 2026-07-19 20:42:38 +0200
% 3.83/1.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.83/1.23 % git: non_committed_changes: false
% 3.83/1.23
% 3.83/1.23 % ------ Parsing...
% 3.83/1.23 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.83/1.23
% 3.83/1.23 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.83/1.23
% 3.83/1.23 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.83/1.23
% 3.83/1.23 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.83/1.23 % ------ Proving...
% 3.83/1.23 % ------ Problem Properties
% 3.83/1.23
% 3.83/1.23 %
% 3.83/1.23 % clauses 188
% 3.83/1.23 % conjectures 3
% 3.83/1.23 % EPR 54
% 3.83/1.23 % Horn 120
% 3.83/1.23 % unary 23
% 3.83/1.23 % binary 40
% 3.83/1.23 % lits 629
% 3.83/1.23 % lits eq 83
% 3.83/1.23 % fd_pure 0
% 3.83/1.23 % fd_pseudo 0
% 3.83/1.23 % fd_cond 21
% 3.83/1.23 % fd_pseudo_cond 14
% 3.83/1.23 % AC symbols 0
% 3.83/1.23
% 3.83/1.23 % ------ Schedule dynamic 5 is on
% 3.83/1.23
% 3.83/1.23 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.83/1.23
% 3.83/1.23
% 3.83/1.23 % ------
% 3.83/1.23 % Current options:
% 3.83/1.23 % ------
% 3.83/1.23
% 3.83/1.23
% 3.83/1.23 %
% 3.83/1.23
% 3.83/1.23 % ------ Proving...
% 3.83/1.23 %
% 3.83/1.23
% 3.83/1.23 % SZS status Theorem for theBenchmark.p
% 3.83/1.23
% 3.83/1.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.83/1.23
%------------------------------------------------------------------------------