%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC333+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 : n014.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:20 PM UTC 2026
% Result : Theorem 0.57s 1.39s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 173 ( 14 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 229 ( 88 ~; 80 |; 51 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 16 !; 12 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0)
& ! [X5] :
( ssList(X5)
=> ( ~ totalorderedP(X5)
| ~ segmentP(X5,X0)
| ~ segmentP(X1,X5)
| ~ neq(X0,X5) ) ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| 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)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0)
& ! [X5] :
( ssList(X5)
=> ( ~ totalorderedP(X5)
| ~ segmentP(X5,X0)
| ~ segmentP(X1,X5)
| ~ neq(X0,X5) ) ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| 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)
& ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| ? [X5] :
( ssList(X5)
& totalorderedP(X5)
& segmentP(X5,X0)
& segmentP(X1,X5)
& neq(X0,X5) ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| ? [X5] :
( ssList(X5)
& totalorderedP(X5)
& segmentP(X5,X0)
& segmentP(X1,X5)
& neq(X0,X5) ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| ( ssList(sK57)
& totalorderedP(sK57)
& segmentP(sK57,sK53)
& segmentP(sK54,sK57)
& neq(sK53,sK57) ) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ segmentP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) )
& totalorderedP(sK55)
& segmentP(sK56,sK55)
& 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,
( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| ssList(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| totalorderedP(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| segmentP(sK57,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| segmentP(sK54,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( ~ totalorderedP(sK53)
| ~ segmentP(sK54,sK53)
| neq(sK53,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK55)
| ~ segmentP(sK56,X4)
| ~ neq(sK55,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
totalorderedP(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
( ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55)
| neq(sK55,sK57) ),
inference(definition_unfolding,[],[f504,f508,f509,f508,f508]) ).
fof(f511,plain,
( ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55)
| segmentP(sK56,sK57) ),
inference(definition_unfolding,[],[f503,f509,f509,f508,f508]) ).
fof(f512,plain,
( ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55)
| segmentP(sK57,sK55) ),
inference(definition_unfolding,[],[f502,f508,f509,f508,f508]) ).
fof(f513,plain,
( ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55)
| totalorderedP(sK57) ),
inference(definition_unfolding,[],[f501,f509,f508,f508]) ).
fof(f514,plain,
( ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55)
| ssList(sK57) ),
inference(definition_unfolding,[],[f500,f509,f508,f508]) ).
tcf(c_246,negated_conjecture,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f507]) ).
tcf(c_247,negated_conjecture,
totalorderedP(sK55),
inference(cnf_transformation,[],[f506]) ).
tcf(c_248,negated_conjecture,
! [X0: $i] :
( ~ totalorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(X0,sK55)
| ~ neq(sK55,X0) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_249,negated_conjecture,
( neq(sK55,sK57)
| ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_250,negated_conjecture,
( segmentP(sK56,sK57)
| ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f511]) ).
tcf(c_251,negated_conjecture,
( segmentP(sK57,sK55)
| ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f512]) ).
tcf(c_252,negated_conjecture,
( totalorderedP(sK57)
| ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f513]) ).
tcf(c_253,negated_conjecture,
( ssList(sK57)
| ~ totalorderedP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f514]) ).
tcf(c_381,negated_conjecture,
neq(sK55,sK57),
inference(global_subsumption_just,[status(thm)],[c_249,c_247,c_246,c_249]) ).
tcf(c_3277,plain,
! [X0: $i] :
( ~ totalorderedP(X0)
| ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(X0,sK55)
| ( sK55 != sK55 )
| ( X0 != sK57 ) ),
inference(resolution_lifted,[status(thm)],[c_248,c_381]) ).
tcf(c_3278,plain,
( ~ totalorderedP(sK57)
| ~ ssList(sK57)
| ~ segmentP(sK57,sK55)
| ~ segmentP(sK56,sK57) ),
inference(unflattening,[status(thm)],[c_3277]) ).
tcf(c_3279,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3278,c_250,c_251,c_252,c_253,c_246,c_247]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n014.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Thu Sep 24 17:40:18 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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.22/0.50
% 0.22/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.22/0.50
% 0.22/0.50 % Detected problem language: tptp
% 0.22/0.52 % Proving...
% 0.57/1.39 % SZS status Started for theBenchmark.p
% 0.57/1.39 % SZS status Theorem for theBenchmark.p
% 0.57/1.39
% 0.57/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.57/1.39
% 0.57/1.39 % ------ iProver source info
% 0.57/1.39
% 0.57/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 0.57/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.57/1.39 % git: non_committed_changes: false
% 0.57/1.39
% 0.57/1.39 % ------ Parsing...
% 0.57/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.57/1.39
% 0.57/1.39 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s%
% 0.57/1.39
% 0.57/1.39 % SZS status Theorem for theBenchmark.p
% 0.57/1.39
% 0.57/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.57/1.39
% 0.57/1.39
%------------------------------------------------------------------------------