%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC204+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 : 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:51 PM UTC 2026
% Result : Theorem 4.55s 6.31s
% Output : CNFRefutation 4.55s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f213ERROR: Could not build tree for root c_2785ERROR: 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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f75,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax75) ).
fof(f76,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax76) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( neq(X0,nil)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& 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) )
& ( neq(X0,nil)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& app(X2,X5) = X4
& tl(X3) = X5
& ssList(X5) )
& X3 != 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) )
| ( ~ neq(X0,nil)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ neq(X0,nil)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| app(X2,X5) != X4
| tl(X3) != X5
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f108,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f110,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f111,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(ennf_transformation,[],[f78]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(flattening,[],[f118]) ).
fof(f122,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(ennf_transformation,[],[f76]) ).
fof(f123,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( tl(X0) = X1
& ssList(X1) ) ),
inference(flattening,[],[f122]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f126,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(flattening,[],[f125]) ).
fof(f129,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) != X0 ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(ennf_transformation,[],[f75]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ? [X1] :
( hd(X0) = X1
& ssItem(X1) ) ),
inference(flattening,[],[f133]) ).
fof(f138,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5) )
| sK3 = X4
| ~ ssList(X4) )
& 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(f142,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f145,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( tl(X0) = sK8(X0)
& ssList(sK8(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X1,sK8(X0))],[f123]) ).
fof(f146,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ( hd(X0) = sK9(X0)
& ssItem(sK9(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X1,sK9(X0))],[f134]) ).
fof(f147,plain,
ssList(sK0),
inference(cnf_transformation,[],[f138]) ).
fof(f148,plain,
ssList(sK1),
inference(cnf_transformation,[],[f138]) ).
fof(f151,plain,
( ~ neq(sK3,nil)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f138]) ).
fof(f153,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f154,plain,
! [X4,X5] :
( neq(sK1,nil)
| ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f157,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f158,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f170,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f108]) ).
fof(f172,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f110]) ).
fof(f174,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f181,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f183,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f119]) ).
fof(f185,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| tl(X0) = sK8(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f186,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(sK8(X0)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f188,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssList(tl(X0)) ),
inference(cnf_transformation,[],[f126]) ).
fof(f191,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) != X0 ),
inference(cnf_transformation,[],[f129]) ).
fof(f194,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| hd(X0) = sK9(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f195,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ssItem(sK9(X0)) ),
inference(cnf_transformation,[],[f146]) ).
fof(f200,plain,
! [X4,X5] :
( neq(sK3,nil)
| ~ neq(nil,sK3)
| app(sK2,X5) != X4
| tl(sK3) != X5
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f154,f158]) ).
fof(f202,plain,
( ~ neq(sK3,nil)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f151,f157]) ).
fof(f203,plain,
ssList(sK3),
inference(definition_unfolding,[],[f148,f158]) ).
fof(f204,plain,
ssList(sK2),
inference(definition_unfolding,[],[f147,f157]) ).
fof(f205,plain,
! [X4] :
( neq(sK3,nil)
| ~ neq(nil,sK3)
| app(sK2,tl(sK3)) != X4
| ~ ssList(tl(sK3))
| sK3 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f200]) ).
fof(f206,plain,
( neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssList(tl(sK3))
| sK3 = app(sK2,tl(sK3))
| ~ ssList(app(sK2,tl(sK3))) ),
inference(equality_resolution,[],[f205]) ).
fof(f207,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| app(sK2,tl(sK3)) != X4
| ~ ssList(tl(sK3))
| sK3 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f153]) ).
fof(f208,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssList(tl(sK3))
| sK3 = app(sK2,tl(sK3))
| ~ ssList(app(sK2,tl(sK3))) ),
inference(equality_resolution,[],[f207]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f213]) ).
tcf(c_50,negated_conjecture,
( neq(sK3,nil)
| ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3))
| ~ neq(nil,sK3)
| ~ ssList(app(sK2,tl(sK3))) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_51,negated_conjecture,
( ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3))
| ~ neq(nil,sK3)
| ~ neq(sK3,nil)
| ~ ssList(app(sK2,tl(sK3))) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_53,negated_conjecture,
( ~ neq(sK2,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_56,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f203]) ).
tcf(c_57,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f204]) ).
tcf(c_69,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_73,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_80,plain,
ssList(nil),
inference(cnf_transformation,[],[f181]) ).
tcf(c_82,plain,
! [X0: $i] :
( ( X0 = nil )
| ( cons(hd(X0),tl(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_84,plain,
! [X0: $i] :
( ssList(sK8(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_85,plain,
! [X0: $i] :
( ( X0 = nil )
| ( tl(X0) = sK8(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_87,plain,
! [X0: $i] :
( ssList(tl(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != X1 ) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_93,plain,
! [X0: $i] :
( ssItem(sK9(X0))
| ( X0 = nil )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_94,plain,
! [X0: $i] :
( ( X0 = nil )
| ( hd(X0) = sK9(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_128,negated_conjecture,
~ neq(sK2,nil),
inference(global_subsumption_just,[status(thm)],[c_53,c_49,c_53]) ).
tcf(c_132,negated_conjecture,
neq(sK3,nil),
inference(global_subsumption_just,[status(thm)],[c_50,c_49]) ).
tcf(c_134,negated_conjecture,
( ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3))
| ~ neq(nil,sK3)
| ~ ssList(app(sK2,tl(sK3))) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_49,c_51]) ).
tcf(c_685,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_132,c_73]) ).
tcf(c_686,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_685]) ).
tcf(c_687,plain,
sK3 != nil,
inference(global_subsumption_just,[status(thm)],[c_686,c_56,c_686]) ).
tcf(c_711,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(tl(sK3))
| ~ ssList(app(sK2,tl(sK3)))
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_134,c_72]) ).
tcf(c_712,plain,
( ( sK3 = nil )
| ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssList(tl(sK3))
| ~ ssList(app(sK2,tl(sK3))) ),
inference(unflattening,[status(thm)],[c_711]) ).
tcf(c_713,plain,
( ~ ssList(app(sK2,tl(sK3)))
| ~ ssList(tl(sK3))
| ( app(sK2,tl(sK3)) = sK3 ) ),
inference(global_subsumption_just,[status(thm)],[c_712,c_56,c_80,c_686,c_712]) ).
tcf(c_714,plain,
( ( app(sK2,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3))
| ~ ssList(app(sK2,tl(sK3))) ),
inference(renaming,[status(thm)],[c_713]) ).
tcf(c_735,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != sK2 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_128,c_72]) ).
tcf(c_736,plain,
( ( nil = sK2 )
| ~ ssList(sK2)
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_735]) ).
tcf(c_737,plain,
nil = sK2,
inference(global_subsumption_just,[status(thm)],[c_736,c_57,c_80,c_736]) ).
tcf(c_1108,plain,
( ( app(nil,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3))
| ~ ssList(app(nil,tl(sK3))) ),
inference(light_normalisation,[status(thm)],[c_714,c_737]) ).
tcf(c_2297,plain,
( ( app(nil,tl(sK3)) = sK3 )
| ~ ssList(nil)
| ~ ssList(tl(sK3)) ),
inference(superposition,[status(thm)],[c_71,c_1108]) ).
tcf(c_2298,plain,
( ( app(nil,tl(sK3)) = sK3 )
| ~ ssList(tl(sK3)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2297,c_80]) ).
tcf(c_2355,plain,
( ( sK3 = nil )
| ( app(nil,tl(sK3)) = sK3 )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_87,c_2298]) ).
tcf(c_2358,plain,
app(nil,tl(sK3)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_2355,c_687,c_56]) ).
tcf(c_2405,plain,
( ( sK3 = nil )
| ( tl(sK3) = sK8(sK3) ) ),
inference(superposition,[status(thm)],[c_56,c_85]) ).
tcf(c_2412,plain,
tl(sK3) = sK8(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_2405,c_687]) ).
tcf(c_2434,plain,
( ssList(tl(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_2412,c_84]) ).
tcf(c_2435,plain,
ssList(tl(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_2434,c_687,c_56]) ).
tcf(c_2489,plain,
( ( sK3 = nil )
| ( hd(sK3) = sK9(sK3) ) ),
inference(superposition,[status(thm)],[c_56,c_94]) ).
tcf(c_2496,plain,
hd(sK3) = sK9(sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_2489,c_687]) ).
tcf(c_2563,plain,
app(nil,tl(sK3)) = tl(sK3),
inference(superposition,[status(thm)],[c_2435,c_69]) ).
tcf(c_2565,plain,
tl(sK3) = sK3,
inference(light_normalisation,[status(thm)],[c_2563,c_2358]) ).
tcf(c_2583,plain,
( ssItem(hd(sK3))
| ( sK3 = nil )
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_2496,c_93]) ).
tcf(c_2584,plain,
ssItem(hd(sK3)),
inference(forward_subsumption_resolution,[status(thm)],[c_2583,c_687,c_56]) ).
tcf(c_2688,plain,
( ( sK3 = nil )
| ( cons(hd(sK3),tl(sK3)) = sK3 ) ),
inference(superposition,[status(thm)],[c_56,c_82]) ).
tcf(c_2695,plain,
( ( sK3 = nil )
| ( cons(hd(sK3),sK3) = sK3 ) ),
inference(light_normalisation,[status(thm)],[c_2688,c_2565]) ).
tcf(c_2696,plain,
cons(hd(sK3),sK3) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_2695,c_687]) ).
tcf(c_2783,plain,
( ~ ssList(sK3)
| ~ ssItem(hd(sK3)) ),
inference(superposition,[status(thm)],[c_2696,c_90]) ).
tcf(c_2785,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2783,c_56,c_2584]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC204+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.10/5.37 % Computer : n002.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 17:00:29 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.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.14/5.43
% 0.14/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.43
% 0.14/5.43 % Detected problem language: tptp
% 0.14/5.44 % Proving...
% 4.55/6.31 % SZS status Started for theBenchmark.p
% 4.55/6.31 % SZS status Theorem for theBenchmark.p
% 4.55/6.31
% 4.55/6.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.55/6.31
% 4.55/6.31 % ------ iProver source info
% 4.55/6.31
% 4.55/6.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.55/6.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.55/6.31 % git: non_committed_changes: false
% 4.55/6.31
% 4.55/6.31 % ------ Parsing...
% 4.55/6.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.55/6.31
% 4.55/6.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 4 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 %
% 4.55/6.31
% 4.55/6.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.55/6.31
% 4.55/6.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.55/6.31 % ------ Proving...
% 4.55/6.31 % ------ Problem Properties
% 4.55/6.31
% 4.55/6.31 %
% 4.55/6.31 % clauses 39
% 4.55/6.31 % conjectures 1
% 4.55/6.31 % EPR 7
% 4.55/6.31 % Horn 26
% 4.55/6.31 % unary 8
% 4.55/6.31 % binary 2
% 4.55/6.31 % lits 119
% 4.55/6.31 % lits eq 49
% 4.55/6.31 % fd_pure 0
% 4.55/6.31 % fd_pseudo 0
% 4.55/6.31 % fd_cond 12
% 4.55/6.31 % fd_pseudo_cond 5
% 4.55/6.31 % AC symbols 0
% 4.55/6.31
% 4.55/6.31 % ------ Schedule dynamic 5 is on
% 4.55/6.31
% 4.55/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.55/6.31
% 4.55/6.31
% 4.55/6.31 % ------
% 4.55/6.31 % Current options:
% 4.55/6.31 % ------
% 4.55/6.31
% 4.55/6.31
% 4.55/6.31 %
% 4.55/6.31
% 4.55/6.31 % ------ Proving...
% 4.55/6.31 %
% 4.55/6.31
% 4.55/6.31 % SZS status Theorem for theBenchmark.p
% 4.55/6.31
% 4.55/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.55/6.32
% 4.55/6.32
%------------------------------------------------------------------------------