%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC347+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 : n006.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:24 PM UTC 2026
% Result : Theorem 3.74s 1.36s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 190 ( 44 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 236 ( 89 ~; 81 |; 49 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn 57 !; 18 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| 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)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f172,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ) ) ) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ) ) ) ),
inference(flattening,[],[f173]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ strictorderedP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ strictorderedP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ssList(X4)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ strictorderedP(sK53)
| ~ segmentP(sK54,sK53) )
& ( nil != sK55
| nil = sK56 )
& ssList(sK57)
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& 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(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f403,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f440,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f441,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X0,X1)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ strictorderedP(sK53)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
strictorderedP(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
( ~ strictorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f507,f506,f506]) ).
fof(f510,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f506]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_155,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f403]) ).
tcf(c_192,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f440]) ).
tcf(c_193,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f441]) ).
tcf(c_246,negated_conjecture,
app(sK55,sK57) = sK56,
inference(cnf_transformation,[],[f505]) ).
tcf(c_247,negated_conjecture,
strictorderedP(sK55),
inference(cnf_transformation,[],[f504]) ).
tcf(c_249,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f502]) ).
tcf(c_251,negated_conjecture,
( ~ strictorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f508]) ).
tcf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f510]) ).
tcf(c_354,plain,
app(nil,sK55) = sK55,
inference(superposition,[status(thm)],[c_255,c_155]) ).
tcf(c_744,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK55,X1),X0)
| ~ ssList(sK55)
| ~ ssList(nil)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sK55,X0) ),
inference(superposition,[status(thm)],[c_354,c_193]) ).
tcf(c_1899,plain,
! [X0: $i,X1: $i] :
( segmentP(app(sK55,X1),X0)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sK55,X0) ),
inference(global_subsumption_just,[status(thm)],[c_744,c_255,c_141,c_744]) ).
tcf(c_1910,plain,
! [X0: $i] :
( segmentP(sK56,X0)
| ~ ssList(sK57)
| ~ ssList(X0)
| ~ segmentP(sK55,X0) ),
inference(superposition,[status(thm)],[c_246,c_1899]) ).
tcf(c_6004,plain,
! [X0: $i] :
( segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_1910,c_249,c_1910]) ).
tcf(c_6005,plain,
! [X0: $i] :
( segmentP(sK56,X0)
| ~ ssList(X0)
| ~ segmentP(sK55,X0) ),
inference(renaming,[status(thm)],[c_6004]) ).
tcf(c_6012,plain,
( segmentP(sK56,sK55)
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_192,c_6005]) ).
tcf(c_6015,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6012,c_251,c_247,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC347+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 17:44:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.14/0.44
% 0.14/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.44
% 0.14/0.44 % Detected problem language: tptp
% 0.14/0.46 % Proving...
% 3.74/1.36 % SZS status Started for theBenchmark.p
% 3.74/1.36 % SZS status Theorem for theBenchmark.p
% 3.74/1.36
% 3.74/1.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.74/1.36
% 3.74/1.36 % ------ iProver source info
% 3.74/1.36
% 3.74/1.36 % git: date: 2026-07-19 20:42:38 +0200
% 3.74/1.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.74/1.36 % git: non_committed_changes: false
% 3.74/1.36
% 3.74/1.36 % ------ Parsing...
% 3.74/1.36 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.74/1.36 % ------ Proving...
% 3.74/1.36 % ------ Problem Properties
% 3.74/1.36
% 3.74/1.36 %
% 3.74/1.36 % clauses 207
% 3.74/1.36 % conjectures 10
% 3.74/1.36 % EPR 72
% 3.74/1.36 % Horn 136
% 3.74/1.36 % unary 19
% 3.74/1.36 % binary 55
% 3.74/1.36 % lits 688
% 3.74/1.36 % lits eq 86
% 3.74/1.36 % fd_pure 0
% 3.74/1.36 % fd_pseudo 0
% 3.74/1.36 % fd_cond 21
% 3.74/1.36 % fd_pseudo_cond 17
% 3.74/1.36 % AC symbols 0
% 3.74/1.36
% 3.74/1.36 % ------ Input Options Time Limit: Unbounded
% 3.74/1.36
% 3.74/1.36
% 3.74/1.36 % ------
% 3.74/1.36 % Current options:
% 3.74/1.36 % ------
% 3.74/1.36
% 3.74/1.36
% 3.74/1.36 %
% 3.74/1.36
% 3.74/1.36 % ------ Proving...
% 3.74/1.36 %
% 3.74/1.36
% 3.74/1.36 % SZS status Theorem for theBenchmark.p
% 3.74/1.36
% 3.74/1.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.36
% 3.74/1.36
%------------------------------------------------------------------------------