%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC124+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 : n015.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:59 PM UTC 2026
% Result : Theorem 4.23s 11.30s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f291ERROR: Could not build tree for root c_7969ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ totalorderedP(X2)
| app(X2,X4) != X3 ) )
| ~ 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)
=> ( ( segmentP(X1,X0)
& neq(X0,nil) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ totalorderedP(X2)
| app(X2,X4) != X3 ) )
| ~ 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)
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& 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)
& ( ~ segmentP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(X2)
& app(X2,X4) = X3 )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f116,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f129,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(f167,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) )
& ( nil != sK2
| nil = sK3 )
& ssList(sK4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& totalorderedP(sK2)
& sK3 = app(sK2,sK4)
& neq(sK1,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(f172,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f175,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,[],[f129]) ).
fof(f176,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,[],[f175]) ).
fof(f177,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10]),skolemize(X4,sK9(X0,X1)),skolemize(X5,sK10(X0,X1))],[f176]) ).
fof(f187,plain,
ssList(sK0),
inference(cnf_transformation,[],[f167]) ).
fof(f188,plain,
ssList(sK1),
inference(cnf_transformation,[],[f167]) ).
fof(f191,plain,
( ~ segmentP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f167]) ).
fof(f192,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f167]) ).
fof(f193,plain,
ssList(sK4),
inference(cnf_transformation,[],[f167]) ).
fof(f196,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f167]) ).
fof(f197,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f167]) ).
fof(f198,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f167]) ).
fof(f199,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f167]) ).
fof(f220,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f223,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f172]) ).
fof(f226,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f237,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,[],[f177]) ).
fof(f276,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f197,f199]) ).
fof(f277,plain,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(definition_unfolding,[],[f191,f198,f199,f198]) ).
fof(f278,plain,
ssList(sK3),
inference(definition_unfolding,[],[f188,f199]) ).
fof(f279,plain,
ssList(sK2),
inference(definition_unfolding,[],[f187,f198]) ).
fof(f285,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,[],[f237]) ).
tcf(c_49,negated_conjecture,
neq(sK3,nil),
inference(cnf_transformation,[],[f276]) ).
tcf(c_50,negated_conjecture,
app(sK2,sK4) = sK3,
inference(cnf_transformation,[],[f196]) ).
tcf(c_53,negated_conjecture,
ssList(sK4),
inference(cnf_transformation,[],[f193]) ).
tcf(c_54,negated_conjecture,
( ( sK3 = nil )
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_55,negated_conjecture,
( ~ segmentP(sK3,sK2)
| ~ neq(sK2,nil) ),
inference(cnf_transformation,[],[f277]) ).
tcf(c_58,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f278]) ).
tcf(c_59,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f279]) ).
tcf(c_80,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f220]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_83,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f291]) ).
tcf(c_86,plain,
ssList(nil),
inference(cnf_transformation,[],[f226]) ).
tcf(c_94,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,[],[f285]) ).
tcf(c_1274,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_83]) ).
tcf(c_1275,plain,
( ~ ssList(sK3)
| ( sK3 != nil ) ),
inference(unflattening,[status(thm)],[c_1274]) ).
tcf(c_1294,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sK3,sK2)
| ( X1 != sK2 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_82]) ).
tcf(c_1295,plain,
( ( nil = sK2 )
| ~ ssList(sK2)
| ~ ssList(nil)
| ~ segmentP(sK3,sK2) ),
inference(unflattening,[status(thm)],[c_1294]) ).
tcf(c_1296,plain,
~ segmentP(sK3,sK2),
inference(global_subsumption_just,[status(thm)],[c_1295,c_59,c_58,c_86,c_54,c_1275,c_1295]) ).
tcf(c_3591,plain,
app(nil,sK2) = sK2,
inference(superposition,[status(thm)],[c_59,c_80]) ).
tcf(c_7512,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(sK2)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK2),X0)) ),
inference(superposition,[status(thm)],[c_3591,c_94]) ).
tcf(c_7525,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(sK2)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(light_normalisation,[status(thm)],[c_7512,c_3591]) ).
tcf(c_7526,plain,
! [X0: $i] :
( segmentP(app(sK2,X0),sK2)
| ~ ssList(X0)
| ~ ssList(app(sK2,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7525,c_59,c_86]) ).
tcf(c_7961,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(app(sK2,sK4)) ),
inference(superposition,[status(thm)],[c_50,c_7526]) ).
tcf(c_7968,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK3) ),
inference(light_normalisation,[status(thm)],[c_7961,c_50]) ).
tcf(c_7969,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7968,c_1296,c_53,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC124+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/10.39 % Computer : n015.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Thu Sep 24 16:34:21 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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/10.44
% 0.15/10.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.44
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.45 % Proving...
% 4.23/11.30 % SZS status Started for theBenchmark.p
% 4.23/11.30 % SZS status Theorem for theBenchmark.p
% 4.23/11.30
% 4.23/11.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.23/11.30
% 4.23/11.30 % ------ iProver source info
% 4.23/11.30
% 4.23/11.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.23/11.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.23/11.30 % git: non_committed_changes: false
% 4.23/11.30
% 4.23/11.30 % ------ Parsing...
% 4.23/11.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.23/11.30
% 4.23/11.30 % ------ 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 %
% 4.23/11.30
% 4.23/11.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.23/11.30
% 4.23/11.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.23/11.30 % ------ Proving...
% 4.23/11.30 % ------ Problem Properties
% 4.23/11.30
% 4.23/11.30 %
% 4.23/11.30 % clauses 77
% 4.23/11.30 % conjectures 6
% 4.23/11.30 % EPR 27
% 4.23/11.30 % Horn 54
% 4.23/11.30 % unary 15
% 4.23/11.30 % binary 7
% 4.23/11.30 % lits 258
% 4.23/11.30 % lits eq 60
% 4.23/11.30 % fd_pure 0
% 4.23/11.30 % fd_pseudo 0
% 4.23/11.30 % fd_cond 16
% 4.23/11.30 % fd_pseudo_cond 8
% 4.23/11.30 % AC symbols 0
% 4.23/11.30
% 4.23/11.30 % ------ Schedule dynamic 5 is on
% 4.23/11.30
% 4.23/11.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.23/11.30
% 4.23/11.30
% 4.23/11.30 % ------
% 4.23/11.30 % Current options:
% 4.23/11.30 % ------
% 4.23/11.30
% 4.23/11.30
% 4.23/11.30 %
% 4.23/11.30
% 4.23/11.30 % ------ Proving...
% 4.23/11.30 %
% 4.23/11.30
% 4.23/11.30 % SZS status Theorem for theBenchmark.p
% 4.23/11.30
% 4.23/11.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.23/11.30
% 4.23/11.30
%------------------------------------------------------------------------------