%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC059+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 : n005.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:43 PM UTC 2026
% Result : Theorem 1.57s 1.49s
% Output : CNFRefutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 44 ( 12 unt; 0 def)
% Number of atoms : 184 ( 50 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 238 ( 98 ~; 86 |; 45 &)
% ( 0 <=>; 9 =>; 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn 25 !; 10 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != 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)
=> ( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( ( ~ segmentP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f172,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ( segmentP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( ! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ( segmentP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& 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(f440,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X4] :
( ~ segmentP(sK53,X4)
| ~ segmentP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( nil != sK56
| nil = sK55 ),
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)
| nil = sK56 ),
inference(definition_unfolding,[],[f503,f508,f508]) ).
fof(f510,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f502,f508,f508,f507]) ).
fof(f511,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f501,f507,f508]) ).
fof(f512,plain,
! [X4] :
( ~ segmentP(sK55,X4)
| ~ segmentP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK55 ),
inference(definition_unfolding,[],[f500,f507,f508,f507]) ).
fof(f514,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f507]) ).
tcf(c_192,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f440]) ).
tcf(c_246,negated_conjecture,
( ( nil = sK55 )
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_247,negated_conjecture,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_248,negated_conjecture,
( segmentP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f504]) ).
tcf(c_249,negated_conjecture,
( neq(sK56,nil)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f509]) ).
tcf(c_250,negated_conjecture,
! [X0: $i] :
( ( nil = sK56 )
| ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_251,negated_conjecture,
( neq(sK56,nil)
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f511]) ).
tcf(c_252,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(X0,nil)
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f512]) ).
tcf(c_256,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f514]) ).
tcf(c_371,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_251,c_246]) ).
tcf(c_375,negated_conjecture,
neq(sK55,nil),
inference(global_subsumption_just,[status(thm)],[c_247,c_247,c_371]) ).
tcf(c_391,plain,
! [X0: $i] :
( ~ neq(X0,nil)
| ~ segmentP(sK55,X0)
| ~ segmentP(sK56,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_250,c_246,c_250,c_252]) ).
tcf(c_392,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(X0,nil) ),
inference(renaming,[status(thm)],[c_391]) ).
tcf(c_393,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_252,c_392]) ).
tcf(c_3290,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| ~ segmentP(sK55,X0)
| ( nil != nil )
| ( X0 != sK55 ) ),
inference(resolution_lifted,[status(thm)],[c_375,c_393]) ).
tcf(c_3291,plain,
( ~ ssList(sK55)
| ~ segmentP(sK56,sK55)
| ~ segmentP(sK55,sK55) ),
inference(unflattening,[status(thm)],[c_3290]) ).
tcf(c_3292,plain,
~ segmentP(sK55,sK55),
inference(global_subsumption_just,[status(thm)],[c_3291,c_256,c_248,c_371,c_3291]) ).
tcf(c_8913,plain,
~ segmentP(sK55,sK55),
inference(demodulation,[status(thm)],[c_3292]) ).
tcf(c_8919,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_256]) ).
tcf(c_11845,plain,
~ ssList(sK55),
inference(superposition,[status(thm)],[c_192,c_8913]) ).
tcf(c_11846,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11845,c_8919]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC059+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.58 % Computer : n005.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Thu Sep 24 16:09:47 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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.63
% 0.09/0.63 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.63
% 0.09/0.63 % Detected problem language: tptp
% 0.13/0.64 % Proving...
% 1.57/1.49 % SZS status Started for theBenchmark.p
% 1.57/1.49 % SZS status Theorem for theBenchmark.p
% 1.57/1.49
% 1.57/1.49 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.57/1.49
% 1.57/1.49 % ------ iProver source info
% 1.57/1.49
% 1.57/1.49 % git: date: 2026-07-19 20:42:38 +0200
% 1.57/1.49 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.57/1.49 % git: non_committed_changes: false
% 1.57/1.49
% 1.57/1.49 % ------ Parsing...
% 1.57/1.49 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.57/1.49
% 1.57/1.49 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 1.57/1.49
% 1.57/1.49 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.57/1.49
% 1.57/1.49 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.57/1.49 % ------ Proving...
% 1.57/1.49 % ------ Problem Properties
% 1.57/1.49
% 1.57/1.49 %
% 1.57/1.49 % clauses 188
% 1.57/1.49 % conjectures 3
% 1.57/1.49 % EPR 57
% 1.57/1.49 % Horn 120
% 1.57/1.49 % unary 22
% 1.57/1.49 % binary 41
% 1.57/1.49 % lits 630
% 1.57/1.49 % lits eq 81
% 1.57/1.49 % fd_pure 0
% 1.57/1.49 % fd_pseudo 0
% 1.57/1.49 % fd_cond 22
% 1.57/1.49 % fd_pseudo_cond 14
% 1.57/1.49 % AC symbols 0
% 1.57/1.49
% 1.57/1.49 % ------ Schedule dynamic 5 is on
% 1.57/1.49
% 1.57/1.49 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.57/1.49
% 1.57/1.49
% 1.57/1.49 % ------
% 1.57/1.49 % Current options:
% 1.57/1.49 % ------
% 1.57/1.49
% 1.57/1.49
% 1.57/1.49 %
% 1.57/1.49
% 1.57/1.49 % ------ Proving...
% 1.57/1.49 %
% 1.57/1.49
% 1.57/1.49 % SZS status Theorem for theBenchmark.p
% 1.57/1.49
% 1.57/1.49 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.57/1.49
% 1.57/1.49
%------------------------------------------------------------------------------