%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC069+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 : n008.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:45 PM UTC 2026
% Result : Theorem 1.81s 1.28s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 47 ( 15 unt; 0 def)
% Number of atoms : 191 ( 54 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 236 ( 92 ~; 81 |; 49 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 38 ( 0 sgn 26 !; 12 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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 = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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 = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,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 != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,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 != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f100,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f130,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ neq(sK3,nil)
| ( ssList(sK4)
& segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4)],[f99]) ).
fof(f132,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f142,plain,
ssList(sK1),
inference(cnf_transformation,[],[f130]) ).
fof(f145,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f146,plain,
( ~ neq(sK3,nil)
| segmentP(sK2,sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f147,plain,
( ~ neq(sK3,nil)
| segmentP(sK3,sK4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f148,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f130]) ).
fof(f149,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f150,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f151,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f130]) ).
fof(f152,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f130]) ).
fof(f153,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f130]) ).
fof(f158,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f132]) ).
fof(f165,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f192,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f151,f153,f152]) ).
fof(f193,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f149,f153,f152]) ).
fof(f194,plain,
ssList(sK3),
inference(definition_unfolding,[],[f142,f153]) ).
tcf(c_49,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f192]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK2 )
| ( nil != sK3 ) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_51,negated_conjecture,
( ( nil != sK2 )
| ( nil != sK3 ) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_52,negated_conjecture,
( neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_53,negated_conjecture,
( segmentP(sK3,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_54,negated_conjecture,
( segmentP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f146]) ).
tcf(c_55,negated_conjecture,
( ssList(sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f145]) ).
tcf(c_58,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f194]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
tcf(c_71,plain,
ssList(nil),
inference(cnf_transformation,[],[f165]) ).
tcf(c_124,negated_conjecture,
nil != sK3,
inference(global_subsumption_just,[status(thm)],[c_50,c_50,c_51]) ).
tcf(c_128,negated_conjecture,
nil != sK3,
inference(global_subsumption_just,[status(thm)],[c_51,c_124]) ).
tcf(c_2059,plain,
( segmentP(sK2,sK4)
| ( nil = sK3 )
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_63,c_54]) ).
tcf(c_2060,plain,
( segmentP(sK3,sK4)
| ( nil = sK3 )
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_63,c_53]) ).
tcf(c_2061,plain,
( neq(sK4,nil)
| ( nil = sK3 )
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_63,c_52]) ).
tcf(c_2062,plain,
( ssList(sK4)
| ( nil = sK3 )
| ~ ssList(sK3)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_63,c_55]) ).
tcf(c_2065,plain,
ssList(sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_2062,c_128,c_58,c_71]) ).
tcf(c_2066,plain,
neq(sK4,nil),
inference(forward_subsumption_resolution,[status(thm)],[c_2061,c_128,c_58,c_71]) ).
tcf(c_2067,plain,
segmentP(sK3,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_2060,c_128,c_58,c_71]) ).
tcf(c_2068,plain,
segmentP(sK2,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_2059,c_128,c_58,c_71]) ).
tcf(c_2079,plain,
( ~ ssList(sK4)
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(superposition,[status(thm)],[c_2066,c_49]) ).
tcf(c_2080,plain,
( ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2079,c_2065]) ).
tcf(c_2083,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2080,c_2067,c_2068]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC069+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.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % 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 16:13:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.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.81/1.28 % SZS status Started for theBenchmark.p
% 1.81/1.28 % SZS status Theorem for theBenchmark.p
% 1.81/1.28
% 1.81/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.81/1.28
% 1.81/1.28 % ------ iProver source info
% 1.81/1.28
% 1.81/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.81/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.81/1.28 % git: non_committed_changes: false
% 1.81/1.28
% 1.81/1.28 % ------ Parsing...
% 1.81/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.81/1.28
% 1.81/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.81/1.28
% 1.81/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.81/1.28
% 1.81/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.81/1.28 % ------ Proving...
% 1.81/1.28 % ------ Problem Properties
% 1.81/1.28
% 1.81/1.28 %
% 1.81/1.28 % clauses 46
% 1.81/1.28 % conjectures 8
% 1.81/1.28 % EPR 22
% 1.81/1.28 % Horn 41
% 1.81/1.28 % unary 9
% 1.81/1.28 % binary 10
% 1.81/1.28 % lits 140
% 1.81/1.28 % lits eq 31
% 1.81/1.28 % fd_pure 0
% 1.81/1.28 % fd_pseudo 0
% 1.81/1.28 % fd_cond 5
% 1.81/1.28 % fd_pseudo_cond 7
% 1.81/1.28 % AC symbols 0
% 1.81/1.28
% 1.81/1.28 % ------ Schedule dynamic 5 is on
% 1.81/1.28
% 1.81/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.81/1.28
% 1.81/1.28
% 1.81/1.28 % ------
% 1.81/1.28 % Current options:
% 1.81/1.28 % ------
% 1.81/1.28
% 1.81/1.28
% 1.81/1.28 %
% 1.81/1.28
% 1.81/1.28 % ------ Proving...
% 1.81/1.28 %
% 1.81/1.28
% 1.81/1.28 % SZS status Theorem for theBenchmark.p
% 1.81/1.28
% 1.81/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.81/1.28
% 1.81/1.28
%------------------------------------------------------------------------------