%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC054+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:42 PM UTC 2026
% Result : Theorem 2.09s 6.32s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 6 unt; 0 def)
% Number of atoms : 168 ( 44 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 226 ( 95 ~; 87 |; 38 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 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 22 !; 7 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ( ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f295,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ( ( ! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ( segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil)
& ssList(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(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)],[f221]) ).
fof(f498,plain,
! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK53 ),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
! [X5] :
( ~ segmentP(sK53,X5)
| ~ segmentP(sK54,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK54 ),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
( ~ neq(sK56,nil)
| segmentP(sK55,sK57) ),
inference(cnf_transformation,[],[f295]) ).
fof(f503,plain,
( ~ neq(sK56,nil)
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f295]) ).
fof(f504,plain,
( ~ neq(sK56,nil)
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f295]) ).
fof(f505,plain,
( ~ neq(sK56,nil)
| ssList(sK57) ),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f508,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f295]) ).
fof(f510,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f501,f508,f508]) ).
fof(f511,plain,
! [X5] :
( ~ segmentP(sK55,X5)
| ~ segmentP(sK56,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK56 ),
inference(definition_unfolding,[],[f500,f508,f508,f507]) ).
fof(f512,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f499,f507,f508]) ).
fof(f513,plain,
! [X5] :
( ~ segmentP(sK55,X5)
| ~ segmentP(sK56,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK55 ),
inference(definition_unfolding,[],[f498,f507,f508,f507]) ).
tcf(c_247,negated_conjecture,
( ( nil = sK55 )
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_248,negated_conjecture,
( ssList(sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_249,negated_conjecture,
( neq(sK57,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f504]) ).
tcf(c_250,negated_conjecture,
( segmentP(sK56,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_251,negated_conjecture,
( segmentP(sK55,sK57)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_252,negated_conjecture,
( neq(sK56,nil)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_253,negated_conjecture,
! [X0: $i] :
( ( nil = sK56 )
| ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f511]) ).
tcf(c_254,negated_conjecture,
( neq(sK56,nil)
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f512]) ).
tcf(c_255,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil)
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f513]) ).
tcf(c_367,negated_conjecture,
ssList(sK57),
inference(global_subsumption_just,[status(thm)],[c_248,c_248,c_252,c_254,c_247]) ).
tcf(c_375,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_254,c_247]) ).
tcf(c_381,negated_conjecture,
neq(sK57,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_375]) ).
tcf(c_397,plain,
! [X0: $i] :
( ~ neq(X0,nil)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_253,c_247,c_253,c_255]) ).
tcf(c_398,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil) ),
inference(renaming,[status(thm)],[c_397]) ).
tcf(c_399,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_255,c_398]) ).
tcf(c_3300,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ( nil != nil )
| ( X0 != sK57 ) ),
inference(resolution_lifted,[status(thm)],[c_381,c_399]) ).
tcf(c_3301,plain,
( ~ ssList(sK57)
| ~ segmentP(sK55,sK57)
| ~ segmentP(sK56,sK57) ),
inference(unflattening,[status(thm)],[c_3300]) ).
tcf(c_3302,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3301,c_375,c_367,c_250,c_251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC054+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.10/5.40 % Computer : n018.cluster.edu
% 0.10/5.40 % Model : x86_64 x86_64
% 0.10/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.40 % Memory : 8046.5625MB
% 0.10/5.40 % OS : Linux 6.8.0-71-generic
% 0.10/5.40 % CPULimit : 300
% 0.10/5.40 % WCLimit : 300
% 0.10/5.40 % DateTime : Thu Sep 24 16:09:54 UTC 2026
% 0.10/5.40 % CPUTime :
% 0.10/5.40 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.44 Running first-order theorem proving
% 0.10/5.44 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.10/5.46
% 0.10/5.46 % ======== iProver multi-core TPTP/SMT =========
% 0.10/5.46
% 0.10/5.46 % Detected problem language: tptp
% 0.10/5.47 % Proving...
% 2.09/6.32 % SZS status Started for theBenchmark.p
% 2.09/6.32 % SZS status Theorem for theBenchmark.p
% 2.09/6.32
% 2.09/6.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.09/6.32
% 2.09/6.32 % ------ iProver source info
% 2.09/6.32
% 2.09/6.32 % git: date: 2026-07-19 20:42:38 +0200
% 2.09/6.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.09/6.32 % git: non_committed_changes: false
% 2.09/6.32
% 2.09/6.32 % ------ Parsing...
% 2.09/6.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.09/6.32
% 2.09/6.32 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 2.09/6.32
% 2.09/6.32 % SZS status Theorem for theBenchmark.p
% 2.09/6.32
% 2.09/6.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.09/6.32
% 2.09/6.32
%------------------------------------------------------------------------------