%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC364+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 : n005.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:28 PM UTC 2026
% Result : Theorem 1.22s 1.28s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f552ERROR: Could not build tree for root c_3401ERROR: 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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ! [X4] :
( ssItem(X4)
=> app(cons(X4,nil),X2) != X3 )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,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(f119,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f201,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( ssItem(X4)
& app(cons(X4,nil),X2) = X3 )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ? [X4] :
( ssItem(X4)
& app(cons(X4,nil),X2) = X3 )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f246,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,[],[f103]) ).
fof(f247,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,[],[f246]) ).
fof(f248,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK13(X0,X1),X1),sK14(X0,X1)) = X0
& ssList(sK14(X0,X1))
& ssList(sK13(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14]),skolemize(X4,sK13(X0,X1)),skolemize(X5,sK14(X0,X1))],[f247]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( ~ neq(sK56,nil)
& neq(sK54,nil) )
| ( ~ segmentP(sK54,sK53)
& ssItem(sK57)
& sK56 = app(cons(sK57,nil),sK55)
& neq(sK54,nil) ) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f318,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,[],[f248]) ).
fof(f388,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( ~ neq(sK56,nil)
| sK56 = app(cons(sK57,nil),sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f515,plain,
( ~ neq(sK56,nil)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f509,f508]) ).
fof(f516,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f509]) ).
fof(f517,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f508]) ).
fof(f523,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,[],[f318]) ).
tcf(c_67,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,[],[f523]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f388]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_232,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f482]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f552]) ).
tcf(c_248,negated_conjecture,
( ( app(cons(sK57,nil),sK55) = sK56 )
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f504]) ).
tcf(c_250,negated_conjecture,
( ssItem(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_252,negated_conjecture,
( ~ segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f515]) ).
tcf(c_255,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f516]) ).
tcf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f517]) ).
tcf(c_340,plain,
app(sK56,nil) = sK56,
inference(superposition,[status(thm)],[c_255,c_232]) ).
tcf(c_379,negated_conjecture,
app(cons(sK57,nil),sK55) = sK56,
inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).
tcf(c_550,plain,
! [X0: $i] :
( segmentP(app(sK56,X0),sK55)
| ~ ssList(sK55)
| ~ ssList(X0)
| ~ ssList(cons(sK57,nil))
| ~ ssList(app(app(cons(sK57,nil),sK55),X0)) ),
inference(superposition,[status(thm)],[c_379,c_67]) ).
tcf(c_1203,plain,
! [X0: $i] :
( segmentP(app(sK56,X0),sK55)
| ~ ssList(app(app(cons(sK57,nil),sK55),X0))
| ~ ssList(cons(sK57,nil))
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_550,c_256,c_550]) ).
tcf(c_1204,plain,
! [X0: $i] :
( segmentP(app(sK56,X0),sK55)
| ~ ssList(X0)
| ~ ssList(cons(sK57,nil))
| ~ ssList(app(app(cons(sK57,nil),sK55),X0)) ),
inference(renaming,[status(thm)],[c_1203]) ).
tcf(c_1210,plain,
! [X0: $i] :
( segmentP(app(sK56,X0),sK55)
| ~ ssList(X0)
| ~ ssList(cons(sK57,nil))
| ~ ssList(app(sK56,X0)) ),
inference(light_normalisation,[status(thm)],[c_1204,c_379]) ).
tcf(c_1219,plain,
( segmentP(sK56,sK55)
| ~ ssList(nil)
| ~ ssList(app(sK56,nil))
| ~ ssList(cons(sK57,nil)) ),
inference(superposition,[status(thm)],[c_340,c_1210]) ).
tcf(c_3392,plain,
( ~ ssList(app(sK56,nil))
| ~ ssList(cons(sK57,nil)) ),
inference(global_subsumption_just,[status(thm)],[c_1219,c_141,c_246,c_252,c_1219]) ).
tcf(c_3396,plain,
( ~ ssList(sK56)
| ~ ssList(cons(sK57,nil)) ),
inference(light_normalisation,[status(thm)],[c_3392,c_340]) ).
tcf(c_3399,plain,
~ ssList(cons(sK57,nil)),
inference(forward_subsumption_resolution,[status(thm)],[c_3396,c_255]) ).
tcf(c_3400,plain,
( ~ ssList(nil)
| ~ ssItem(sK57) ),
inference(superposition,[status(thm)],[c_140,c_3399]) ).
tcf(c_3401,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3400,c_250,c_246,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC364+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.36 % Computer : n005.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 17:51:02 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.11/0.41
% 0.11/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.41
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.22/1.28 % SZS status Started for theBenchmark.p
% 1.22/1.28 % SZS status Theorem for theBenchmark.p
% 1.22/1.28
% 1.22/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.22/1.28
% 1.22/1.28 % ------ iProver source info
% 1.22/1.28
% 1.22/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.22/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.22/1.28 % git: non_committed_changes: false
% 1.22/1.28
% 1.22/1.28 % ------ Parsing...
% 1.22/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.22/1.28 % ------ Proving...
% 1.22/1.28 % ------ Problem Properties
% 1.22/1.28
% 1.22/1.28 %
% 1.22/1.28 % clauses 208
% 1.22/1.28 % conjectures 11
% 1.22/1.28 % EPR 73
% 1.22/1.28 % Horn 135
% 1.22/1.28 % unary 17
% 1.22/1.28 % binary 59
% 1.22/1.28 % lits 687
% 1.22/1.28 % lits eq 83
% 1.22/1.28 % fd_pure 0
% 1.22/1.28 % fd_pseudo 0
% 1.22/1.28 % fd_cond 21
% 1.22/1.28 % fd_pseudo_cond 17
% 1.22/1.28 % AC symbols 0
% 1.22/1.28
% 1.22/1.28 % ------ Input Options Time Limit: Unbounded
% 1.22/1.28
% 1.22/1.28
% 1.22/1.28 % ------
% 1.22/1.28 % Current options:
% 1.22/1.28 % ------
% 1.22/1.28
% 1.22/1.28
% 1.22/1.28 %
% 1.22/1.28
% 1.22/1.28 % ------ Proving...
% 1.22/1.28 %
% 1.22/1.28
% 1.22/1.28 % SZS status Theorem for theBenchmark.p
% 1.22/1.28
% 1.22/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.22/1.29
% 1.22/1.29
%------------------------------------------------------------------------------