%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC071-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 : n007.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:46 PM UTC 2026
% Result : Unsatisfiable 2.98s 1.10s
% Output : CNFRefutation 2.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 71 ( 21 unt; 0 def)
% Number of atoms : 168 ( 64 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 178 ( 81 ~; 97 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f98,axiom,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| cons(X0,X1) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssItem(X0)
| nil != cons(X0,X1) ),
inference(reorient_equations,[],[f98]) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
! [X0] :
( ~ segmentP(sk1,X0)
| ~ segmentP(sk2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
( nil = sk4
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( nil = sk4
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f213,plain,
( nil = sk4
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f212]) ).
fof(f214,negated_conjecture,
( nil = sk4
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f215,plain,
( nil = sk4
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f214]) ).
fof(f218,negated_conjecture,
( nil = sk3
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
fof(f219,negated_conjecture,
( nil = sk3
| ssList(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
fof(f220,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
fof(f221,plain,
( nil = sk3
| sk3 = cons(sk5,nil) ),
inference(reorient_equations,[],[f220]) ).
fof(f222,negated_conjecture,
( nil = sk3
| app(app(sk6,sk3),sk7) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).
fof(f223,plain,
( nil = sk3
| sk4 = app(app(sk6,sk3),sk7) ),
inference(reorient_equations,[],[f222]) ).
fof(f228,plain,
! [X0] :
( ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f229,plain,
( nil != sk3
| nil != sk4 ),
inference(definition_unfolding,[],[f207,f204,f205]) ).
fof(f230,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]) ).
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,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f228]) ).
tcf(c_261,negated_conjecture,
( ( sk4 != nil )
| ( sk3 != nil ) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_262,negated_conjecture,
( ssItem(sk5)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f208]) ).
tcf(c_263,negated_conjecture,
( ssItem(sk5)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_264,negated_conjecture,
( ssList(sk6)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_265,negated_conjecture,
( ssList(sk7)
| ( sk4 = nil ) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_266,negated_conjecture,
( ( sk4 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_267,negated_conjecture,
( ( sk4 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_270,negated_conjecture,
( ssList(sk6)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_271,negated_conjecture,
( ssList(sk7)
| ( sk3 = nil ) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_272,negated_conjecture,
( ( sk3 = nil )
| ( cons(sk5,nil) = sk3 ) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_273,negated_conjecture,
( ( sk3 = nil )
| ( app(app(sk6,sk3),sk7) = sk4 ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_276,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_277,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_278,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,[],[f230]) ).
tcf(c_284,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_289,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_355,negated_conjecture,
ssList(sk7),
inference(global_subsumption_just,[status(thm)],[c_271,c_271,c_265,c_261]) ).
tcf(c_357,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_270,c_270,c_264,c_261]) ).
tcf(c_359,negated_conjecture,
ssList(sk7),
inference(global_subsumption_just,[status(thm)],[c_265,c_355]) ).
tcf(c_361,negated_conjecture,
ssList(sk6),
inference(global_subsumption_just,[status(thm)],[c_264,c_357]) ).
tcf(c_363,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_263,c_263,c_262,c_261]) ).
tcf(c_365,negated_conjecture,
ssItem(sk5),
inference(global_subsumption_just,[status(thm)],[c_262,c_363]) ).
tcf(c_371,negated_conjecture,
cons(sk5,nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_272,c_272,c_266,c_261]) ).
tcf(c_373,negated_conjecture,
cons(sk5,nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_266,c_371]) ).
tcf(c_375,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(global_subsumption_just,[status(thm)],[c_273,c_261,c_273,c_267]) ).
tcf(c_377,negated_conjecture,
app(app(sk6,sk3),sk7) = sk4,
inference(global_subsumption_just,[status(thm)],[c_267,c_375]) ).
tcf(c_1187,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0)
| ( X2 != nil )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_260,c_289]) ).
tcf(c_1188,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(unflattening,[status(thm)],[c_1187]) ).
tcf(c_1190,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ segmentP(sk3,X0)
| ~ segmentP(sk4,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_1188,c_277,c_1188]) ).
tcf(c_1191,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(renaming,[status(thm)],[c_1190]) ).
tcf(c_2874,plain,
( ~ ssItem(sk5)
| ~ ssList(nil)
| ( sk3 != nil ) ),
inference(superposition,[status(thm)],[c_373,c_276]) ).
tcf(c_2875,plain,
sk3 != nil,
inference(forward_subsumption_resolution,[status(thm)],[c_2874,c_365,c_277]) ).
tcf(c_3271,plain,
( ( sk3 = nil )
| ~ ssList(sk3)
| ~ segmentP(sk4,sk3)
| ~ segmentP(sk3,sk3) ),
inference(instantiation,[status(thm)],[c_1191]) ).
tcf(c_3818,plain,
( segmentP(sk3,sk3)
| ~ ssList(sk3) ),
inference(instantiation,[status(thm)],[c_284]) ).
tcf(c_4202,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(app(app(sk6,sk3),sk7)) ),
inference(superposition,[status(thm)],[c_377,c_278]) ).
tcf(c_4234,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk7)
| ~ ssList(sk6)
| ~ ssList(sk4)
| ~ ssList(sk3) ),
inference(light_normalisation,[status(thm)],[c_4202,c_377]) ).
tcf(c_4235,plain,
segmentP(sk4,sk3),
inference(forward_subsumption_resolution,[status(thm)],[c_4234,c_359,c_361,c_259,c_258]) ).
tcf(c_4341,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_4235,c_3818,c_3271,c_2875,c_258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC071-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.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 16:11:53 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 2.98/1.10 % SZS status Started for theBenchmark.p
% 2.98/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.98/1.10
% 2.98/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.98/1.10
% 2.98/1.10 % ------ iProver source info
% 2.98/1.10
% 2.98/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 2.98/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.98/1.10 % git: non_committed_changes: false
% 2.98/1.10
% 2.98/1.10 % ------ Parsing...% successful
% 2.98/1.10
% 2.98/1.10
% 2.98/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.98/1.10
% 2.98/1.10 % ------ 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 %
% 2.98/1.10
% 2.98/1.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.98/1.10
% 2.98/1.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.98/1.10 % ------ Proving...
% 2.98/1.10 % ------ Problem Properties
% 2.98/1.10
% 2.98/1.10 %
% 2.98/1.10 % clauses 53
% 2.98/1.10 % conjectures 10
% 2.98/1.10 % EPR 26
% 2.98/1.10 % Horn 50
% 2.98/1.10 % unary 10
% 2.98/1.10 % binary 8
% 2.98/1.10 % lits 185
% 2.98/1.10 % lits eq 30
% 2.98/1.10 % fd_pure 0
% 2.98/1.10 % fd_pseudo 0
% 2.98/1.10 % fd_cond 4
% 2.98/1.10 % fd_pseudo_cond 8
% 2.98/1.10 % AC symbols 0
% 2.98/1.10
% 2.98/1.10 % ------ Schedule dynamic 5 is on
% 2.98/1.10
% 2.98/1.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.98/1.10
% 2.98/1.10
% 2.98/1.10 % ------
% 2.98/1.10 % Current options:
% 2.98/1.10 % ------
% 2.98/1.10
% 2.98/1.10
% 2.98/1.10 %
% 2.98/1.10
% 2.98/1.10 % ------ Proving...
% 2.98/1.10 %
% 2.98/1.10
% 2.98/1.10 % SZS status Unsatisfiable for theBenchmark.p
% 2.98/1.10
% 2.98/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.98/1.10
% 2.98/1.10
%------------------------------------------------------------------------------