%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC385+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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:34 PM UTC 2026
% Result : Theorem 1.29s 1.18s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 8 unt; 0 def)
% Number of atoms : 78 ( 12 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 88 ( 28 ~; 21 |; 31 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 0 ( 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 8 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X0)
& singletonP(X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| ~ 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)
& ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& 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)
& ( ~ segmentP(X1,X0)
| ~ singletonP(X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ segmentP(sK54,sK53)
| ~ singletonP(sK53) )
& ( ~ neq(sK56,nil)
| singletonP(sK55) )
& segmentP(sK56,sK55)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f500,plain,
( ~ segmentP(sK54,sK53)
| ~ singletonP(sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ neq(sK56,nil)
| singletonP(sK55) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f503,f505]) ).
fof(f507,plain,
( ~ segmentP(sK56,sK55)
| ~ singletonP(sK55) ),
inference(definition_unfolding,[],[f500,f504,f505,f504]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f506]) ).
tcf(c_247,negated_conjecture,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f502]) ).
tcf(c_248,negated_conjecture,
( singletonP(sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_249,negated_conjecture,
( ~ singletonP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f507]) ).
tcf(c_274,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_249,c_248,c_246,c_247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC385+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n004.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 17:57:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 1.29/1.18 % SZS status Started for theBenchmark.p
% 1.29/1.18 % SZS status Theorem for theBenchmark.p
% 1.29/1.18
% 1.29/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.29/1.18
% 1.29/1.18 % ------ iProver source info
% 1.29/1.18
% 1.29/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.29/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.29/1.18 % git: non_committed_changes: false
% 1.29/1.18
% 1.29/1.18 % ------ Parsing...
% 1.29/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.29/1.18
% 1.29/1.18 % ------ Preprocessing...%
% 1.29/1.18
% 1.29/1.18 % SZS status Theorem for theBenchmark.p
% 1.29/1.18
% 1.29/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.29/1.18
% 1.29/1.18
%------------------------------------------------------------------------------