%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC053+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:41 PM UTC 2026
% Result : Theorem 1.25s 1.29s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f242ERROR: Could not build tree for root c_7907ERROR: 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(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,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)
=> ( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,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)
& ( ( ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssList(X4)
& frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssList(X4)
& frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f115,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f125,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f139,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f141,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ( ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ( nil = sK2
& nil = sK3 )
| ( ssList(sK4)
& frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil) ) )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f99]) ).
fof(f149,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(f150,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,[],[f149]) ).
fof(f151,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f150]) ).
fof(f153,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f125]) ).
fof(f154,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(rectify,[],[f153]) ).
fof(f155,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1))
& ssList(sK10(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f154]) ).
fof(f156,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f133]) ).
fof(f157,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil != app(X0,X1)
| ( nil = X0
& nil = X1 ) )
& ( nil != X0
| nil != X1
| nil = app(X0,X1) ) ) ) ),
inference(flattening,[],[f156]) ).
fof(f158,plain,
ssList(sK0),
inference(cnf_transformation,[],[f141]) ).
fof(f159,plain,
ssList(sK1),
inference(cnf_transformation,[],[f141]) ).
fof(f162,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK0 ),
inference(cnf_transformation,[],[f141]) ).
fof(f163,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f141]) ).
fof(f164,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK1 ),
inference(cnf_transformation,[],[f141]) ).
fof(f166,plain,
( nil = sK2
| ssList(sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f167,plain,
( nil = sK3
| ssList(sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f168,plain,
( nil = sK2
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f169,plain,
( nil = sK3
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f170,plain,
( nil = sK2
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f171,plain,
( nil = sK3
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f172,plain,
( nil = sK2
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f141]) ).
fof(f173,plain,
( nil = sK3
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f141]) ).
fof(f174,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f141]) ).
fof(f175,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f141]) ).
fof(f187,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f198,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| app(X1,sK9(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f151]) ).
fof(f199,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| ssList(sK9(X0,X1)) ),
inference(cnf_transformation,[],[f151]) ).
fof(f211,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f155]) ).
fof(f219,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != app(X0,X1)
| nil = X0 ),
inference(cnf_transformation,[],[f157]) ).
fof(f225,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f139]) ).
fof(f228,plain,
! [X5] :
( ~ segmentP(sK2,X5)
| ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK3 ),
inference(definition_unfolding,[],[f164,f175,f175,f174]) ).
fof(f229,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f163,f174,f175]) ).
fof(f230,plain,
! [X5] :
( ~ segmentP(sK2,X5)
| ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK2 ),
inference(definition_unfolding,[],[f162,f174,f175,f174]) ).
fof(f231,plain,
ssList(sK3),
inference(definition_unfolding,[],[f159,f175]) ).
fof(f232,plain,
ssList(sK2),
inference(definition_unfolding,[],[f158,f174]) ).
fof(f239,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f211]) ).
tcf(c_49,negated_conjecture,
( neq(sK4,nil)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_50,negated_conjecture,
( neq(sK4,nil)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_51,negated_conjecture,
( frontsegP(sK3,sK4)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f171]) ).
tcf(c_52,negated_conjecture,
( frontsegP(sK3,sK4)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_53,negated_conjecture,
( frontsegP(sK2,sK4)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_54,negated_conjecture,
( frontsegP(sK2,sK4)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_55,negated_conjecture,
( ssList(sK4)
| ( nil = sK3 ) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_56,negated_conjecture,
( ssList(sK4)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( ( nil = sK3 )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_59,negated_conjecture,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_60,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f230]) ).
tcf(c_63,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f231]) ).
tcf(c_64,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f232]) ).
tcf(c_69,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f242]) ).
tcf(c_76,plain,
ssList(nil),
inference(cnf_transformation,[],[f187]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( ssList(sK9(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_89,plain,
! [X0: $i,X1: $i] :
( ( app(X1,sK9(X0,X1)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f239]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i] :
( ( X0 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_114,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f225]) ).
tcf(c_985,plain,
! [X0: $i] :
( ( nil = sK2 )
| ( nil = sK3 )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( nil != nil )
| ( X0 != sK4 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_58]) ).
tcf(c_986,plain,
( ( nil = sK2 )
| ( nil = sK3 )
| ~ ssList(sK4)
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(unflattening,[status(thm)],[c_985]) ).
tcf(c_987,plain,
( ( nil = sK2 )
| ( nil = sK3 )
| ~ segmentP(sK3,sK4)
| ~ segmentP(sK2,sK4) ),
inference(global_subsumption_just,[status(thm)],[c_986,c_55,c_986]) ).
tcf(c_988,plain,
( ( nil = sK2 )
| ( nil = sK3 )
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(renaming,[status(thm)],[c_987]) ).
tcf(c_1001,plain,
! [X0: $i] :
( ( nil = sK3 )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( nil != sK2 )
| ( nil != nil )
| ( X0 != sK4 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_60]) ).
tcf(c_1002,plain,
( ( nil = sK3 )
| ~ ssList(sK4)
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4)
| ( nil != sK2 ) ),
inference(unflattening,[status(thm)],[c_1001]) ).
tcf(c_1003,plain,
( ( nil = sK3 )
| ~ segmentP(sK3,sK4)
| ~ segmentP(sK2,sK4) ),
inference(global_subsumption_just,[status(thm)],[c_1002,c_55,c_988,c_1002]) ).
tcf(c_1004,plain,
( ( nil = sK3 )
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(renaming,[status(thm)],[c_1003]) ).
tcf(c_1029,plain,
! [X0: $i] :
( ( nil = sK2 )
| ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK4 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_69]) ).
tcf(c_1030,plain,
( ( nil = sK2 )
| ~ ssList(sK4)
| ( sK4 != nil ) ),
inference(unflattening,[status(thm)],[c_1029]) ).
tcf(c_1031,plain,
( ( nil = sK2 )
| ( sK4 != nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1030,c_56,c_1030]) ).
tcf(c_1050,plain,
! [X0: $i] :
( ( nil = sK3 )
| ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK4 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_69]) ).
tcf(c_1051,plain,
( ( nil = sK3 )
| ~ ssList(sK4)
| ( sK4 != nil ) ),
inference(unflattening,[status(thm)],[c_1050]) ).
tcf(c_1052,plain,
( ( nil = sK3 )
| ( sK4 != nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1051,c_55,c_1051]) ).
tcf(c_1101,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( nil != sK2 )
| ( X0 != sK3 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_69]) ).
tcf(c_1102,plain,
( ~ ssList(nil)
| ( nil != sK2 )
| ( nil != sK3 ) ),
inference(unflattening,[status(thm)],[c_1101]) ).
tcf(c_1236,plain,
sK4 != nil,
inference(global_subsumption_just,[status(thm)],[c_1052,c_76,c_56,c_55,c_1030,c_1051,c_1102]) ).
tcf(c_1238,plain,
sK4 != nil,
inference(global_subsumption_just,[status(thm)],[c_1031,c_1236]) ).
tcf(c_1240,negated_conjecture,
ssList(sK4),
inference(global_subsumption_just,[status(thm)],[c_56,c_76,c_56,c_55,c_1102]) ).
tcf(c_1242,negated_conjecture,
ssList(sK4),
inference(global_subsumption_just,[status(thm)],[c_55,c_1240]) ).
tcf(c_1244,negated_conjecture,
frontsegP(sK2,sK4),
inference(global_subsumption_just,[status(thm)],[c_54,c_76,c_54,c_53,c_1102]) ).
tcf(c_1246,negated_conjecture,
frontsegP(sK2,sK4),
inference(global_subsumption_just,[status(thm)],[c_53,c_1244]) ).
tcf(c_1248,negated_conjecture,
frontsegP(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_52,c_76,c_52,c_51,c_1102]) ).
tcf(c_1250,negated_conjecture,
frontsegP(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_51,c_1248]) ).
tcf(c_3709,plain,
app(nil,sK4) = sK4,
inference(superposition,[status(thm)],[c_1242,c_114]) ).
tcf(c_4431,plain,
( ( app(sK4,sK9(sK3,sK4)) = sK3 )
| ~ ssList(sK3)
| ~ ssList(sK4) ),
inference(superposition,[status(thm)],[c_1250,c_89]) ).
tcf(c_4432,plain,
( ( app(sK4,sK9(sK2,sK4)) = sK2 )
| ~ ssList(sK2)
| ~ ssList(sK4) ),
inference(superposition,[status(thm)],[c_1246,c_89]) ).
tcf(c_4458,plain,
app(sK4,sK9(sK2,sK4)) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_4432,c_64,c_1242]) ).
tcf(c_4459,plain,
app(sK4,sK9(sK3,sK4)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_4431,c_63,c_1242]) ).
tcf(c_5004,plain,
( ( sK4 = nil )
| ~ ssList(sK4)
| ~ ssList(sK9(sK3,sK4))
| ( nil != sK3 ) ),
inference(superposition,[status(thm)],[c_4459,c_110]) ).
tcf(c_5008,plain,
( ~ ssList(sK9(sK3,sK4))
| ( nil != sK3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5004,c_1238,c_1242]) ).
tcf(c_6741,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(nil)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK4),X0)) ),
inference(superposition,[status(thm)],[c_3709,c_97]) ).
tcf(c_6780,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(nil)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(app(sK4,X0)) ),
inference(light_normalisation,[status(thm)],[c_6741,c_3709]) ).
tcf(c_6781,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(X0)
| ~ ssList(app(sK4,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6780,c_76,c_1242]) ).
tcf(c_7534,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK9(sK3,sK4))
| ~ ssList(app(sK4,sK9(sK3,sK4))) ),
inference(superposition,[status(thm)],[c_4459,c_6781]) ).
tcf(c_7535,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK9(sK2,sK4))
| ~ ssList(app(sK4,sK9(sK2,sK4))) ),
inference(superposition,[status(thm)],[c_4458,c_6781]) ).
tcf(c_7542,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK2)
| ~ ssList(sK9(sK2,sK4)) ),
inference(light_normalisation,[status(thm)],[c_7535,c_4458]) ).
tcf(c_7543,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK9(sK2,sK4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7542,c_64]) ).
tcf(c_7546,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK3)
| ~ ssList(sK9(sK3,sK4)) ),
inference(light_normalisation,[status(thm)],[c_7534,c_4459]) ).
tcf(c_7547,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK9(sK3,sK4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7546,c_63]) ).
tcf(c_7885,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK2)
| ~ ssList(sK4)
| ~ frontsegP(sK2,sK4) ),
inference(superposition,[status(thm)],[c_88,c_7543]) ).
tcf(c_7886,plain,
segmentP(sK2,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_7885,c_64,c_1242,c_1246]) ).
tcf(c_7904,plain,
~ ssList(sK9(sK3,sK4)),
inference(global_subsumption_just,[status(thm)],[c_7547,c_1004,c_5008,c_7547,c_7886]) ).
tcf(c_7906,plain,
( ~ ssList(sK3)
| ~ ssList(sK4)
| ~ frontsegP(sK3,sK4) ),
inference(superposition,[status(thm)],[c_88,c_7904]) ).
tcf(c_7907,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7906,c_63,c_1242,c_1250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC053+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.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 16:10:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.25/1.29 % SZS status Started for theBenchmark.p
% 1.25/1.29 % SZS status Theorem for theBenchmark.p
% 1.25/1.29
% 1.25/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.25/1.29
% 1.25/1.29 % ------ iProver source info
% 1.25/1.29
% 1.25/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.25/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.25/1.29 % git: non_committed_changes: false
% 1.25/1.29
% 1.25/1.29 % ------ Parsing...
% 1.25/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.25/1.29
% 1.25/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 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.25/1.29
% 1.25/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.25/1.29
% 1.25/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.25/1.29 % ------ Proving...
% 1.25/1.29 % ------ Problem Properties
% 1.25/1.29
% 1.25/1.29 %
% 1.25/1.29 % clauses 59
% 1.25/1.29 % conjectures 5
% 1.25/1.29 % EPR 28
% 1.25/1.29 % Horn 55
% 1.25/1.29 % unary 13
% 1.25/1.29 % binary 7
% 1.25/1.29 % lits 192
% 1.25/1.29 % lits eq 42
% 1.25/1.29 % fd_pure 0
% 1.25/1.29 % fd_pseudo 0
% 1.25/1.29 % fd_cond 8
% 1.25/1.29 % fd_pseudo_cond 7
% 1.25/1.29 % AC symbols 0
% 1.25/1.29
% 1.25/1.29 % ------ Schedule dynamic 5 is on
% 1.25/1.29
% 1.25/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 % ------
% 1.25/1.29 % Current options:
% 1.25/1.29 % ------
% 1.25/1.29
% 1.25/1.29
% 1.25/1.29 %
% 1.25/1.29
% 1.25/1.29 % ------ Proving...
% 1.25/1.29 %
% 1.25/1.29
% 1.25/1.29 % SZS status Theorem for theBenchmark.p
% 1.25/1.29
% 1.25/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.25/1.29
% 1.25/1.29
%------------------------------------------------------------------------------