%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC348+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 : n020.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:24 PM UTC 2026
% Result : Theorem 1.25s 1.28s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 66 ( 22 unt; 0 def)
% Number of atoms : 208 ( 52 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 227 ( 85 ~; 85 |; 38 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn 42 !; 12 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax69) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| 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)
=> ( ( strictorderedP(X0)
& segmentP(X1,X0) )
| ( neq(X3,nil)
& ~ singletonP(X2) )
| ~ segmentP(X3,X2)
| 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)
& ( ~ strictorderedP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ strictorderedP(X0)
| ~ segmentP(X1,X0) )
& ( ~ neq(X3,nil)
| singletonP(X2) )
& segmentP(X3,X2)
& 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(f105,plain,
! [X0] :
( ~ ssList(X0)
| ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f106,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f117,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f168,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( ~ strictorderedP(sK0)
| ~ segmentP(sK1,sK0) )
& ( ~ neq(sK3,nil)
| singletonP(sK2) )
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f99]) ).
fof(f170,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(rectify,[],[f173]) ).
fof(f175,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ singletonP(X0)
| ( cons(sK8(X0),nil) = X0
& ssItem(sK8(X0)) ) )
& ( ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) )
| singletonP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X2,sK8(X0))],[f174]) ).
fof(f176,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ segmentP(nil,X0)
| nil = X0 )
& ( nil != X0
| segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f191,plain,
ssList(sK0),
inference(cnf_transformation,[],[f168]) ).
fof(f192,plain,
ssList(sK1),
inference(cnf_transformation,[],[f168]) ).
fof(f195,plain,
( ~ strictorderedP(sK0)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f196,plain,
( ~ neq(sK3,nil)
| singletonP(sK2) ),
inference(cnf_transformation,[],[f168]) ).
fof(f197,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f168]) ).
fof(f198,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f168]) ).
fof(f199,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f168]) ).
fof(f204,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f211,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f213,plain,
! [X0] :
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(sK8(X0),nil) = X0 ),
inference(cnf_transformation,[],[f175]) ).
fof(f214,plain,
! [X0] :
( ~ ssList(X0)
| ~ singletonP(X0)
| ssItem(sK8(X0)) ),
inference(cnf_transformation,[],[f175]) ).
fof(f216,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f176]) ).
fof(f232,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f233,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f117]) ).
fof(f280,plain,
( ~ strictorderedP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f195,f199,f198,f198]) ).
fof(f281,plain,
ssList(sK3),
inference(definition_unfolding,[],[f192,f199]) ).
fof(f282,plain,
ssList(sK2),
inference(definition_unfolding,[],[f191,f198]) ).
tcf(c_49,negated_conjecture,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f197]) ).
tcf(c_50,negated_conjecture,
( singletonP(sK2)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f196]) ).
tcf(c_51,negated_conjecture,
( ~ strictorderedP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(cnf_transformation,[],[f280]) ).
tcf(c_54,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f281]) ).
tcf(c_55,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f282]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f204]) ).
tcf(c_67,plain,
ssList(nil),
inference(cnf_transformation,[],[f211]) ).
tcf(c_70,plain,
! [X0: $i] :
( ssItem(sK8(X0))
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_71,plain,
! [X0: $i] :
( ( cons(sK8(X0),nil) = X0 )
| ~ ssList(X0)
| ~ singletonP(X0) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_73,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_87,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f232]) ).
tcf(c_88,plain,
! [X0: $i] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f233]) ).
tcf(c_181,negated_conjecture,
~ strictorderedP(sK2),
inference(global_subsumption_just,[status(thm)],[c_51,c_49,c_51]) ).
tcf(c_1350,plain,
! [X0: $i,X1: $i] :
( singletonP(sK2)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_59]) ).
tcf(c_1351,plain,
( singletonP(sK2)
| ( sK3 = nil )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_1350]) ).
tcf(c_1352,plain,
( singletonP(sK2)
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1351,c_54,c_67,c_1351]) ).
tcf(c_1387,plain,
! [X0: $i] :
( ssItem(sK8(X0))
| ( sK3 = nil )
| ~ ssList(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_1352,c_70]) ).
tcf(c_1388,plain,
( ssItem(sK8(sK2))
| ( sK3 = nil )
| ~ ssList(sK2) ),
inference(unflattening,[status(thm)],[c_1387]) ).
tcf(c_1389,plain,
( ssItem(sK8(sK2))
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_1388,c_55,c_1388]) ).
tcf(c_3970,plain,
( ( sK3 = nil )
| ( cons(sK8(sK2),nil) = sK2 )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_1352,c_71]) ).
tcf(c_3972,plain,
( ( sK3 = nil )
| ( cons(sK8(sK2),nil) = sK2 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3970,c_55]) ).
tcf(c_4202,plain,
( strictorderedP(sK2)
| ( sK3 = nil )
| ~ ssItem(sK8(sK2)) ),
inference(superposition,[status(thm)],[c_3972,c_88]) ).
tcf(c_4203,plain,
( ( sK3 = nil )
| ~ ssItem(sK8(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4202,c_181]) ).
tcf(c_4207,plain,
sK3 = nil,
inference(global_subsumption_just,[status(thm)],[c_4203,c_1389,c_4203]) ).
tcf(c_4214,plain,
segmentP(nil,sK2),
inference(demodulation,[status(thm)],[c_49,c_4207]) ).
tcf(c_4216,plain,
( ( sK2 = nil )
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_4214,c_73]) ).
tcf(c_4217,plain,
sK2 = nil,
inference(forward_subsumption_resolution,[status(thm)],[c_4216,c_55]) ).
tcf(c_4222,plain,
~ strictorderedP(nil),
inference(demodulation,[status(thm)],[c_181,c_4217]) ).
tcf(c_4224,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4222,c_87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC348+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/0.37 % Computer : n020.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 17:46:33 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.25/1.28 % SZS status Started for theBenchmark.p
% 1.25/1.28 % SZS status Theorem for theBenchmark.p
% 1.25/1.28
% 1.25/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.25/1.28
% 1.25/1.28 % ------ iProver source info
% 1.25/1.28
% 1.25/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.25/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.25/1.28 % git: non_committed_changes: false
% 1.25/1.28
% 1.25/1.28 % ------ Parsing...
% 1.25/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.25/1.28
% 1.25/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.25/1.28
% 1.25/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.25/1.28
% 1.25/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.25/1.28 % ------ Proving...
% 1.25/1.28 % ------ Problem Properties
% 1.25/1.28
% 1.25/1.28 %
% 1.25/1.28 % clauses 77
% 1.25/1.28 % conjectures 4
% 1.25/1.28 % EPR 26
% 1.25/1.28 % Horn 53
% 1.25/1.28 % unary 12
% 1.25/1.28 % binary 8
% 1.25/1.28 % lits 259
% 1.25/1.28 % lits eq 57
% 1.25/1.28 % fd_pure 0
% 1.25/1.28 % fd_pseudo 0
% 1.25/1.28 % fd_cond 16
% 1.25/1.28 % fd_pseudo_cond 8
% 1.25/1.28 % AC symbols 0
% 1.25/1.28
% 1.25/1.28 % ------ Schedule dynamic 5 is on
% 1.25/1.28
% 1.25/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.25/1.28
% 1.25/1.28
% 1.25/1.28 % ------
% 1.25/1.28 % Current options:
% 1.25/1.28 % ------
% 1.25/1.28
% 1.25/1.28
% 1.25/1.28 %
% 1.25/1.28
% 1.25/1.28 % ------ Proving...
% 1.25/1.28 %
% 1.25/1.28
% 1.25/1.28 % SZS status Theorem for theBenchmark.p
% 1.25/1.28
% 1.25/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.25/1.29
% 1.25/1.29
%------------------------------------------------------------------------------