%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC389-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 : n013.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:35 PM UTC 2026
% Result : Unsatisfiable 1.13s 1.07s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f244ERROR: Could not build tree for root c_15148ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f56,axiom,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f119,axiom,
! [X0,X1] :
( singletonP(X1)
| ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,nil) != X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
fof(f187,axiom,
! [X2,X3,X0,X1] :
( segmentP(X3,X1)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| app(app(X0,X1),X2) != X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f208,negated_conjecture,
( nil = sk4
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil = sk4
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f211,plain,
( nil = sk4
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
( nil = sk4
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( nil = sk4
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f212]) ).
fof(f216,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f217,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f220,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f221,plain,
( nil = sk3
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f220]) ).
fof(f224,negated_conjecture,
( neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
fof(f225,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
fof(f228,plain,
( neq(sk4,nil)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f224,f204,f205,f204]) ).
fof(f229,plain,
( ~ singletonP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f225,f204,f205,f205]) ).
fof(f235,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f187]) ).
fof(f239,plain,
! [X0] :
( singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f119]) ).
tcf(c_258,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_259,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_260,negated_conjecture,
( ssItem(sk5)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_262,negated_conjecture,
( ssList(sk6)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_263,negated_conjecture,
( ssList(sk7)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_264,negated_conjecture,
( ( sk4 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_265,negated_conjecture,
( ( sk4 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_268,negated_conjecture,
( ssList(sk6)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_269,negated_conjecture,
( ssList(sk7)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_271,negated_conjecture,
( ( sk3 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_274,negated_conjecture,
( neq(sk4,nil)
| ~ segmentP(sk4,sk3) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_275,negated_conjecture,
( ~ singletonP(sk3)
| ~ segmentP(sk4,sk3) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_277,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_283,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_309,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,[],[f235]) ).
tcf(c_316,plain,
! [X0: $i] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_318,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_321,plain,
! [X0: $i] :
( singletonP(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(cnf_transformation,[],[f239]) ).
tcf(c_327,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_316]) ).
tcf(c_1296,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,sk3)
| ( X0 != nil )
| ( X0 != sk4 ) ),
inference(resolution_lifted,[status(thm)],[c_274,c_318]) ).
tcf(c_1297,plain,
( ~ ssList(sk4)
| ~ segmentP(sk4,sk3)
| ( sk4 != nil ) ),
inference(unflattening,[status(thm)],[c_1296]) ).
tcf(c_1298,plain,
( ( sk4 != nil )
| ~ segmentP(sk4,sk3) ),
inference(global_subsumption_just,[status(thm)],[c_1297,c_259,c_1297]) ).
tcf(c_1299,plain,
( ~ segmentP(sk4,sk3)
| ( sk4 != nil ) ),
inference(renaming,[status(thm)],[c_1298]) ).
tcf(c_2194,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( segmentP(X0,X2)
| ~ segmentP(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_3433,plain,
! [X0: $i] :
( singletonP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_283,c_321]) ).
tcf(c_3436,plain,
! [X0: $i] :
( singletonP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3433,c_277]) ).
tcf(c_3447,plain,
( singletonP(sk3)
| ( sk4 = nil )
| ~ ssItem(sk5) ),
inference(superposition,[status(thm)],[c_264,c_3436]) ).
tcf(c_3460,plain,
( singletonP(sk3)
| ( sk4 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_3447,c_260,c_3447]) ).
tcf(c_3799,plain,
! [X0: $i,X1: $i] :
( segmentP(sk4,sk3)
| ~ segmentP(X1,X0)
| ( sk4 != X1 )
| ( sk3 != X0 ) ),
inference(instantiation,[status(thm)],[c_2194]) ).
tcf(c_3800,plain,
( segmentP(sk4,sk3)
| ~ segmentP(nil,nil)
| ( sk4 != nil )
| ( sk3 != nil ) ),
inference(instantiation,[status(thm)],[c_3799]) ).
tcf(c_5109,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_262,c_277,c_268,c_262,c_327,c_275,c_1299,c_3460,c_3800]) ).
tcf(c_5155,negated_conjecture,
ssList(sk7),
inference(global_subsumption_just,[status(thm)],[c_263,c_277,c_269,c_263,c_327,c_275,c_1299,c_3460,c_3800]) ).
tcf(c_5171,negated_conjecture,
~ segmentP(sk4,sk3),
inference(global_subsumption_just,[status(thm)],[c_275,c_275,c_1299,c_3460]) ).
tcf(c_5179,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(global_subsumption_just,[status(thm)],[c_265,c_277,c_327,c_271,c_265,c_3800,c_5171]) ).
tcf(c_15103,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(app(app(sk6,sk3),sk7)) ),
inference(superposition,[status(thm)],[c_5179,c_309]) ).
tcf(c_15147,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(light_normalisation,[status(thm)],[c_15103,c_5179]) ).
tcf(c_15148,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_15147,c_5171,c_5155,c_5109,c_259,c_258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC389-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.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Thu Sep 24 17:59:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.40
% 0.13/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.40
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.13/1.07 % SZS status Started for theBenchmark.p
% 1.13/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.07
% 1.13/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.13/1.07
% 1.13/1.07 % ------ iProver source info
% 1.13/1.07
% 1.13/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 1.13/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.13/1.07 % git: non_committed_changes: false
% 1.13/1.07
% 1.13/1.07 % ------ Parsing...% successful
% 1.13/1.07
% 1.13/1.07
% 1.13/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.13/1.07
% 1.13/1.07 % ------ 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 %
% 1.13/1.07
% 1.13/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.13/1.07
% 1.13/1.07 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.13/1.07 % ------ Proving...
% 1.13/1.07 % ------ Problem Properties
% 1.13/1.07
% 1.13/1.07 %
% 1.13/1.07 % clauses 62
% 1.13/1.07 % conjectures 17
% 1.13/1.07 % EPR 32
% 1.13/1.07 % Horn 49
% 1.13/1.07 % unary 6
% 1.13/1.07 % binary 19
% 1.13/1.07 % lits 212
% 1.13/1.07 % lits eq 44
% 1.13/1.07 % fd_pure 0
% 1.13/1.07 % fd_pseudo 0
% 1.13/1.07 % fd_cond 3
% 1.13/1.07 % fd_pseudo_cond 8
% 1.13/1.07 % AC symbols 0
% 1.13/1.07
% 1.13/1.07 % ------ Schedule dynamic 5 is on
% 1.13/1.07
% 1.13/1.07 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.13/1.07
% 1.13/1.07
% 1.13/1.07 % ------
% 1.13/1.07 % Current options:
% 1.13/1.07 % ------
% 1.13/1.07
% 1.13/1.07
% 1.13/1.07 %
% 1.13/1.07
% 1.13/1.07 % ------ Proving...
% 1.13/1.07 %
% 1.13/1.07
% 1.13/1.07 % SZS status Unsatisfiable for theBenchmark.p
% 1.13/1.07
% 1.13/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.13/1.07
% 1.13/1.07
%------------------------------------------------------------------------------