%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC242+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 : n018.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:08:59 PM UTC 2026
% Result : Theorem 3.96s 1.28s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 52 ( 14 unt; 0 def)
% Number of atoms : 257 ( 56 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 351 ( 146 ~; 145 |; 50 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 89 ( 0 sgn 73 !; 16 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ? [X11] :
( lt(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ~ leq(X8,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X2
| ~ ssList(X10) ) ) )
& nil != X2 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( leq(X4,X7)
| ~ lt(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ! [X11] :
( ~ lt(X8,X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11)
| leq(X8,X11)
| ~ ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) ) ) )
| nil = X2 )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ? [X7] :
( ~ leq(X4,X7)
& lt(X4,X7)
& memberP(X6,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f136,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ( ssItem(sK5)
& ssList(sK6)
& ! [X11] :
( ~ lt(sK5,X11)
| ~ memberP(sK7,X11)
| ~ memberP(sK6,X11)
| leq(sK5,X11)
| ~ ssItem(X11) )
& sK2 = app(app(sK6,cons(sK5,nil)),sK7)
& ssList(sK7) )
| nil = sK2 )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ( ~ leq(X4,sK4(X4,X5,X6))
& lt(X4,sK4(X4,X5,X6))
& memberP(X6,sK4(X4,X5,X6))
& memberP(X5,sK4(X4,X5,X6))
& ssItem(sK4(X4,X5,X6)) )
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4(X4,X5,X6)),skolemize(X8,sK5),skolemize(X9,sK6),skolemize(X10,sK7)],[f98]) ).
fof(f153,plain,
( ssItem(sK5)
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f154,plain,
( ssList(sK6)
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f155,plain,
! [X11] :
( ~ lt(sK5,X11)
| ~ memberP(sK7,X11)
| ~ memberP(sK6,X11)
| leq(sK5,X11)
| ~ ssItem(X11)
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f156,plain,
( sK2 = app(app(sK6,cons(sK5,nil)),sK7)
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f157,plain,
( ssList(sK7)
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f158,plain,
! [X6,X4,X5] :
( ~ leq(X4,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f159,plain,
! [X6,X4,X5] :
( lt(X4,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f160,plain,
! [X6,X4,X5] :
( memberP(X6,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f161,plain,
! [X6,X4,X5] :
( memberP(X5,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f162,plain,
! [X6,X4,X5] :
( ssItem(sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f163,plain,
nil != sK0,
inference(cnf_transformation,[],[f136]) ).
fof(f164,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f136]) ).
fof(f212,plain,
nil != sK2,
inference(definition_unfolding,[],[f163,f164]) ).
fof(f213,plain,
! [X6,X4,X5] :
( ssItem(sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f162,f164]) ).
fof(f214,plain,
! [X6,X4,X5] :
( memberP(X5,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f161,f164]) ).
fof(f215,plain,
! [X6,X4,X5] :
( memberP(X6,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f160,f164]) ).
fof(f216,plain,
! [X6,X4,X5] :
( lt(X4,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f159,f164]) ).
fof(f217,plain,
! [X6,X4,X5] :
( ~ leq(X4,sK4(X4,X5,X6))
| app(app(X5,cons(X4,nil)),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f158,f164]) ).
tcf(c_50,negated_conjecture,
nil != sK2,
inference(cnf_transformation,[],[f212]) ).
tcf(c_51,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ssItem(sK4(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sK2 ) ),
inference(cnf_transformation,[],[f213]) ).
tcf(c_52,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sK4(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sK2 ) ),
inference(cnf_transformation,[],[f214]) ).
tcf(c_53,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X2,sK4(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sK2 ) ),
inference(cnf_transformation,[],[f215]) ).
tcf(c_54,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( lt(X1,sK4(X1,X0,X2))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sK2 ) ),
inference(cnf_transformation,[],[f216]) ).
tcf(c_55,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ leq(X1,sK4(X1,X0,X2))
| ( app(app(X0,cons(X1,nil)),X2) != sK2 ) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_56,negated_conjecture,
( ssList(sK7)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_57,negated_conjecture,
( ( nil = sK2 )
| ( app(app(sK6,cons(sK5,nil)),sK7) = sK2 ) ),
inference(cnf_transformation,[],[f156]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( leq(sK5,X0)
| ( nil = sK2 )
| ~ ssItem(X0)
| ~ lt(sK5,X0)
| ~ memberP(sK6,X0)
| ~ memberP(sK7,X0) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_59,negated_conjecture,
( ssList(sK6)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_60,negated_conjecture,
( ssItem(sK5)
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_136,negated_conjecture,
ssItem(sK5),
inference(global_subsumption_just,[status(thm)],[c_60,c_50,c_60]) ).
tcf(c_138,negated_conjecture,
ssList(sK6),
inference(global_subsumption_just,[status(thm)],[c_59,c_50,c_59]) ).
tcf(c_140,negated_conjecture,
ssList(sK7),
inference(global_subsumption_just,[status(thm)],[c_56,c_50,c_56]) ).
tcf(c_144,negated_conjecture,
app(app(sK6,cons(sK5,nil)),sK7) = sK2,
inference(global_subsumption_just,[status(thm)],[c_57,c_50,c_57]) ).
tcf(c_146,plain,
! [X0: $i] :
( leq(sK5,X0)
| ~ memberP(sK7,X0)
| ~ memberP(sK6,X0)
| ~ lt(sK5,X0)
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_50,c_58]) ).
tcf(c_147,negated_conjecture,
! [X0: $i] :
( leq(sK5,X0)
| ~ ssItem(X0)
| ~ lt(sK5,X0)
| ~ memberP(sK6,X0)
| ~ memberP(sK7,X0) ),
inference(renaming,[status(thm)],[c_146]) ).
tcf(c_2645,plain,
( ssItem(sK4(sK5,sK6,sK7))
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_144,c_51]) ).
tcf(c_2646,plain,
ssItem(sK4(sK5,sK6,sK7)),
inference(forward_subsumption_resolution,[status(thm)],[c_2645,c_136,c_138,c_140]) ).
tcf(c_2657,plain,
( memberP(sK6,sK4(sK5,sK6,sK7))
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_144,c_52]) ).
tcf(c_2658,plain,
memberP(sK6,sK4(sK5,sK6,sK7)),
inference(forward_subsumption_resolution,[status(thm)],[c_2657,c_136,c_138,c_140]) ).
tcf(c_2669,plain,
( memberP(sK7,sK4(sK5,sK6,sK7))
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_144,c_53]) ).
tcf(c_2670,plain,
memberP(sK7,sK4(sK5,sK6,sK7)),
inference(forward_subsumption_resolution,[status(thm)],[c_2669,c_136,c_138,c_140]) ).
tcf(c_2681,plain,
( lt(sK5,sK4(sK5,sK6,sK7))
| ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_144,c_54]) ).
tcf(c_2682,plain,
lt(sK5,sK4(sK5,sK6,sK7)),
inference(forward_subsumption_resolution,[status(thm)],[c_2681,c_136,c_138,c_140]) ).
tcf(c_2693,plain,
( ~ ssItem(sK5)
| ~ ssList(sK6)
| ~ ssList(sK7)
| ~ leq(sK5,sK4(sK5,sK6,sK7)) ),
inference(superposition,[status(thm)],[c_144,c_55]) ).
tcf(c_2694,plain,
~ leq(sK5,sK4(sK5,sK6,sK7)),
inference(forward_subsumption_resolution,[status(thm)],[c_2693,c_136,c_138,c_140]) ).
tcf(c_2739,plain,
( leq(sK5,sK4(sK5,sK6,sK7))
| ~ ssItem(sK4(sK5,sK6,sK7))
| ~ lt(sK5,sK4(sK5,sK6,sK7))
| ~ memberP(sK6,sK4(sK5,sK6,sK7)) ),
inference(superposition,[status(thm)],[c_2670,c_147]) ).
tcf(c_2740,plain,
( leq(sK5,sK4(sK5,sK6,sK7))
| ~ lt(sK5,sK4(sK5,sK6,sK7)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2739,c_2646,c_2658]) ).
tcf(c_2743,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2740,c_2694,c_2682]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC242+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.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 17:12:49 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.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 3.96/1.28 % SZS status Started for theBenchmark.p
% 3.96/1.28 % SZS status Theorem for theBenchmark.p
% 3.96/1.28
% 3.96/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.96/1.28
% 3.96/1.28 % ------ iProver source info
% 3.96/1.28
% 3.96/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.96/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.96/1.28 % git: non_committed_changes: false
% 3.96/1.28
% 3.96/1.28 % ------ Parsing...
% 3.96/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.96/1.28
% 3.96/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 %
% 3.96/1.28
% 3.96/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.96/1.28
% 3.96/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.28 % ------ Proving...
% 3.96/1.28 % ------ Problem Properties
% 3.96/1.28
% 3.96/1.28 %
% 3.96/1.28 % clauses 56
% 3.96/1.28 % conjectures 13
% 3.96/1.28 % EPR 21
% 3.96/1.28 % Horn 50
% 3.96/1.28 % unary 12
% 3.96/1.28 % binary 5
% 3.96/1.28 % lits 197
% 3.96/1.28 % lits eq 36
% 3.96/1.28 % fd_pure 0
% 3.96/1.28 % fd_pseudo 0
% 3.96/1.28 % fd_cond 4
% 3.96/1.28 % fd_pseudo_cond 7
% 3.96/1.28 % AC symbols 0
% 3.96/1.28
% 3.96/1.28 % ------ Schedule dynamic 5 is on
% 3.96/1.28
% 3.96/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.96/1.28
% 3.96/1.28
% 3.96/1.28 % ------
% 3.96/1.28 % Current options:
% 3.96/1.28 % ------
% 3.96/1.28
% 3.96/1.28
% 3.96/1.28 %
% 3.96/1.28
% 3.96/1.28 % ------ Proving...
% 3.96/1.28 %
% 3.96/1.28
% 3.96/1.28 % SZS status Theorem for theBenchmark.p
% 3.96/1.28
% 3.96/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.28
% 3.96/1.28
%------------------------------------------------------------------------------