%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC082+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 : n018.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:49 PM UTC 2026
% Result : Theorem 2.50s 1.47s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 133 ( 24 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 169 ( 61 ~; 52 |; 46 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 17 !; 12 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ 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)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ neq(X3,nil)
| ? [X5] :
( ssList(X5)
& segmentP(X2,X5)
& segmentP(X3,X5)
& neq(X5,nil) ) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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)
| ? [X5] :
( ssList(X5)
& segmentP(X2,X5)
& segmentP(X3,X5)
& neq(X5,nil) ) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ neq(sK56,nil)
| ( ssList(sK57)
& segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil) ) )
& ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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(X5,sK57)],[f222]) ).
fof(f500,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f506,f508]) ).
fof(f510,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f505,f508,f507]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f509]) ).
tcf(c_247,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_249,negated_conjecture,
( neq(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_250,negated_conjecture,
( segmentP(sK56,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_251,negated_conjecture,
( segmentP(sK55,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_252,negated_conjecture,
( ssList(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_375,negated_conjecture,
neq(sK57,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_246,c_249]) ).
tcf(c_3288,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ( nil != nil )
| ( X0 != sK57 ) ),
inference(resolution_lifted,[status(thm)],[c_247,c_375]) ).
tcf(c_3289,plain,
( ~ ssList(sK57)
| ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57) ),
inference(unflattening,[status(thm)],[c_3288]) ).
tcf(c_3290,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3289,c_250,c_251,c_252,c_246]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC082+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.54 % Computer : n018.cluster.edu
% 0.11/0.54 % Model : x86_64 x86_64
% 0.11/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54 % Memory : 8046.5625MB
% 0.11/0.54 % OS : Linux 6.8.0-71-generic
% 0.11/0.54 % CPULimit : 300
% 0.11/0.54 % WCLimit : 300
% 0.11/0.54 % DateTime : Thu Sep 24 16:19:34 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.58 Running first-order theorem proving
% 0.14/0.58 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.59
% 0.14/0.59 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.59
% 0.14/0.59 % Detected problem language: tptp
% 0.14/0.61 % Proving...
% 2.50/1.47 % SZS status Started for theBenchmark.p
% 2.50/1.47 % SZS status Theorem for theBenchmark.p
% 2.50/1.47
% 2.50/1.47 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.50/1.47
% 2.50/1.47 % ------ iProver source info
% 2.50/1.47
% 2.50/1.47 % git: date: 2026-07-19 20:42:38 +0200
% 2.50/1.47 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.50/1.47 % git: non_committed_changes: false
% 2.50/1.47
% 2.50/1.47 % ------ Parsing...
% 2.50/1.47 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.50/1.47
% 2.50/1.47 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 2.50/1.47
% 2.50/1.47 % SZS status Theorem for theBenchmark.p
% 2.50/1.47
% 2.50/1.47 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.47
% 2.50/1.47
%------------------------------------------------------------------------------