%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC046+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 : n012.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:39 PM UTC 2026
% Result : Theorem 3.57s 1.09s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f234ERROR: Could not build tree for root c_2448ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( ( ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
| ~ memberP(X3,X4) )
& memberP(X2,X4) )
| ( memberP(X3,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ! [X4] :
( ( ( ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssList(X5)
& segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f98]) ).
fof(f100,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ! [X4] :
( ( ( ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
& memberP(X3,X4) )
| ~ memberP(X2,X4) )
& ( ~ memberP(X3,X4)
| ? [X5] :
( ssList(X5)
& segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f99]) ).
fof(f104,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(ennf_transformation,[],[f20]) ).
fof(f105,plain,
! [X0] :
( ~ ssList(X0)
| ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ),
inference(flattening,[],[f104]) ).
fof(f119,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f133,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ! [X4] :
( ( ( ( ! [X6] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
& memberP(sK3,X4) )
| ~ memberP(sK2,X4) )
& ( ~ memberP(sK3,X4)
| ( ssList(sK4(X4))
& segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil))) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ),
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(X5,sK4(X4))],[f100]) ).
fof(f135,plain,
! [X0] :
( ~ ssList(X0)
| ( cons(sK8(X0),sK7(X0)) = X0
& ssItem(sK8(X0))
& ssList(sK7(X0)) )
| nil = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7,sK8]),skolemize(X1,sK7(X0)),skolemize(X2,sK8(X0))],[f105]) ).
fof(f149,plain,
ssList(sK0),
inference(cnf_transformation,[],[f133]) ).
fof(f153,plain,
! [X6,X4] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f133]) ).
fof(f154,plain,
! [X4] :
( memberP(sK3,X4)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f133]) ).
fof(f157,plain,
nil != sK0,
inference(cnf_transformation,[],[f133]) ).
fof(f158,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f133]) ).
fof(f159,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f133]) ).
fof(f160,plain,
nil = sK1,
inference(cnf_transformation,[],[f133]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK8(X0),sK7(X0)) = X0
| nil = X0 ),
inference(cnf_transformation,[],[f135]) ).
fof(f168,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK8(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f135]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK7(X0))
| nil = X0 ),
inference(cnf_transformation,[],[f135]) ).
fof(f184,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f206,plain,
nil = sK3,
inference(definition_unfolding,[],[f160,f159]) ).
fof(f207,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f157,f206,f158]) ).
fof(f209,plain,
! [X6,X4] :
( ~ segmentP(sK3,app(app(cons(X4,sK3),X6),cons(X4,sK3)))
| ~ ssList(X6)
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f153,f206,f206]) ).
fof(f211,plain,
ssList(sK2),
inference(definition_unfolding,[],[f149,f158]) ).
fof(f214,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK7(X0))
| sK3 = X0 ),
inference(definition_unfolding,[],[f169,f206]) ).
fof(f215,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK8(X0))
| sK3 = X0 ),
inference(definition_unfolding,[],[f168,f206]) ).
fof(f216,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK8(X0),sK7(X0)) = X0
| sK3 = X0 ),
inference(definition_unfolding,[],[f167,f206]) ).
fof(f223,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(definition_unfolding,[],[f184,f206]) ).
tcf(c_49,negated_conjecture,
sK2 != sK3,
inference(cnf_transformation,[],[f207]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] :
( memberP(sK3,X0)
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i] :
( ~ ssList(X1)
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ segmentP(sK3,app(app(cons(X0,sK3),X1),cons(X0,sK3))) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_57,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f211]) ).
tcf(c_64,negated_conjecture,
! [X0: $i] :
( ssList(sK7(X0))
| ( X0 = sK3 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_65,negated_conjecture,
! [X0: $i] :
( ssItem(sK8(X0))
| ( X0 = sK3 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_66,negated_conjecture,
! [X0: $i] :
( ( X0 = sK3 )
| ( cons(sK8(X0),sK7(X0)) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_81,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK3,X0) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_82,plain,
! [X0: $i,X1: $i] :
( memberP(cons(X0,X1),X0)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_134,plain,
! [X0: $i] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_81,c_52]) ).
tcf(c_135,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(renaming,[status(thm)],[c_134]) ).
tcf(c_139,plain,
! [X0: $i] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_53,c_135]) ).
tcf(c_140,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(renaming,[status(thm)],[c_139]) ).
tcf(c_2292,plain,
( ( sK2 = sK3 )
| ( cons(sK8(sK2),sK7(sK2)) = sK2 ) ),
inference(superposition,[status(thm)],[c_57,c_66]) ).
tcf(c_2294,plain,
cons(sK8(sK2),sK7(sK2)) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_2292,c_49]) ).
tcf(c_2418,plain,
( memberP(sK2,sK8(sK2))
| ~ ssList(sK7(sK2))
| ~ ssItem(sK8(sK2)) ),
inference(superposition,[status(thm)],[c_2294,c_82]) ).
tcf(c_2438,plain,
( ~ ssList(sK7(sK2))
| ~ ssItem(sK8(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2418,c_140]) ).
tcf(c_2445,plain,
( ( sK2 = sK3 )
| ~ ssList(sK2)
| ~ ssList(sK7(sK2)) ),
inference(superposition,[status(thm)],[c_65,c_2438]) ).
tcf(c_2446,plain,
~ ssList(sK7(sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_2445,c_49,c_57]) ).
tcf(c_2447,plain,
( ( sK2 = sK3 )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_64,c_2446]) ).
tcf(c_2448,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2447,c_49,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC046+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Thu Sep 24 16:04:50 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.33 Running first-order theorem proving
% 0.03/0.33 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.06/0.33
% 0.06/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.06/0.33
% 0.06/0.33 % Detected problem language: tptp
% 0.06/0.34 % Proving...
% 3.57/1.09 % SZS status Started for theBenchmark.p
% 3.57/1.09 % SZS status Theorem for theBenchmark.p
% 3.57/1.09
% 3.57/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.57/1.09
% 3.57/1.09 % ------ iProver source info
% 3.57/1.09
% 3.57/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 3.57/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.57/1.09 % git: non_committed_changes: false
% 3.57/1.09
% 3.57/1.09 % ------ Parsing...
% 3.57/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.57/1.09
% 3.57/1.09 % ------ 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 %
% 3.57/1.09
% 3.57/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.57/1.09
% 3.57/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.57/1.09 % ------ Proving...
% 3.57/1.09 % ------ Problem Properties
% 3.57/1.09
% 3.57/1.09 %
% 3.57/1.09 % clauses 48
% 3.57/1.09 % conjectures 18
% 3.57/1.09 % EPR 14
% 3.57/1.09 % Horn 43
% 3.57/1.09 % unary 8
% 3.57/1.09 % binary 6
% 3.57/1.09 % lits 166
% 3.57/1.09 % lits eq 31
% 3.57/1.09 % fd_pure 0
% 3.57/1.09 % fd_pseudo 0
% 3.57/1.09 % fd_cond 5
% 3.57/1.09 % fd_pseudo_cond 6
% 3.57/1.09 % AC symbols 0
% 3.57/1.09
% 3.57/1.09 % ------ Schedule dynamic 5 is on
% 3.57/1.09
% 3.57/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.57/1.09
% 3.57/1.09
% 3.57/1.09 % ------
% 3.57/1.09 % Current options:
% 3.57/1.09 % ------
% 3.57/1.09
% 3.57/1.09
% 3.57/1.09 %
% 3.57/1.09
% 3.57/1.09 % ------ Proving...
% 3.57/1.09 %
% 3.57/1.09
% 3.57/1.09 % SZS status Theorem for theBenchmark.p
% 3.57/1.09
% 3.57/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.09
% 3.57/1.09
%------------------------------------------------------------------------------