%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC402+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 : n011.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:38 PM UTC 2026
% Result : Theorem 2.18s 1.31s
% Output : CNFRefutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of formulae : 48 ( 20 unt; 0 def)
% Number of atoms : 250 ( 40 equ)
% Maximal formula atoms : 29 ( 5 avg)
% Number of connectives : 333 ( 131 ~; 127 |; 60 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 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 : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 73 !; 23 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X14] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| 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] :
( ( nil = X2
& nil != X3 )
| ! [X14] :
( memberP(X1,X14)
| ~ memberP(X0,X14)
| ~ ssItem(X14) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f132,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f146,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X14] :
( ~ memberP(X1,X14)
& memberP(X0,X14)
& ssItem(X14) )
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X5
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X6,X8)
| app(cons(X8,nil),X9) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(X7,cons(X6,nil)) != X4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& totalorderedP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) ) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f276,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ memberP(app(X1,X2),X0)
| memberP(X2,X0)
| memberP(X1,X0) )
& ( ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) )
| memberP(app(X1,X2),X0) ) ) ) ) ),
inference(nnf_transformation,[],[f146]) ).
fof(f277,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( ~ memberP(app(X1,X2),X0)
| memberP(X2,X0)
| memberP(X1,X0) )
& ( ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) )
| memberP(app(X1,X2),X0) ) ) ) ) ),
inference(flattening,[],[f276]) ).
fof(f295,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ( nil != sK55
| nil = sK56 )
& ~ memberP(sK54,sK59)
& memberP(sK53,sK59)
& ssItem(sK59)
& ssList(sK57)
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ leq(X12,X10)
| app(X13,cons(X12,nil)) != sK55
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != sK58
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ leq(X6,X8)
| app(cons(X8,nil),X9) != sK55
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(X7,cons(X6,nil)) != sK57
| ~ ssList(X7) )
| ~ ssItem(X6) )
& totalorderedP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57),skolemize(X5,sK58),skolemize(X14,sK59)],[f221]) ).
fof(f400,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f132]) ).
fof(f413,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X2,X0)
| memberP(app(X1,X2),X0) ),
inference(cnf_transformation,[],[f277]) ).
fof(f414,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X0)
| memberP(app(X1,X2),X0) ),
inference(cnf_transformation,[],[f277]) ).
fof(f495,plain,
ssList(sK53),
inference(cnf_transformation,[],[f295]) ).
fof(f499,plain,
~ memberP(sK54,sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f500,plain,
memberP(sK53,sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f501,plain,
ssItem(sK59),
inference(cnf_transformation,[],[f295]) ).
fof(f502,plain,
ssList(sK57),
inference(cnf_transformation,[],[f295]) ).
fof(f506,plain,
sK56 = app(app(sK57,sK55),sK58),
inference(cnf_transformation,[],[f295]) ).
fof(f507,plain,
ssList(sK58),
inference(cnf_transformation,[],[f295]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f295]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f295]) ).
fof(f511,plain,
memberP(sK55,sK59),
inference(definition_unfolding,[],[f500,f508]) ).
fof(f512,plain,
~ memberP(sK56,sK59),
inference(definition_unfolding,[],[f499,f509]) ).
fof(f514,plain,
ssList(sK55),
inference(definition_unfolding,[],[f495,f508]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f400]) ).
tcf(c_165,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X0,X2),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(X0,X1) ),
inference(cnf_transformation,[],[f414]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(app(X2,X0),X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(X0,X1) ),
inference(cnf_transformation,[],[f413]) ).
tcf(c_247,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f507]) ).
tcf(c_248,negated_conjecture,
app(app(sK57,sK55),sK58) = sK56,
inference(cnf_transformation,[],[f506]) ).
tcf(c_252,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f502]) ).
tcf(c_253,negated_conjecture,
ssItem(sK59),
inference(cnf_transformation,[],[f501]) ).
tcf(c_254,negated_conjecture,
memberP(sK55,sK59),
inference(cnf_transformation,[],[f511]) ).
tcf(c_255,negated_conjecture,
~ memberP(sK56,sK59),
inference(cnf_transformation,[],[f512]) ).
tcf(c_259,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f514]) ).
tcf(c_465,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssList(sK58)
| ~ ssItem(X0)
| ~ ssList(app(sK57,sK55))
| ~ memberP(app(sK57,sK55),X0) ),
inference(superposition,[status(thm)],[c_248,c_165]) ).
tcf(c_956,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ memberP(app(sK57,sK55),X0)
| ~ ssList(app(sK57,sK55))
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_465,c_247,c_465]) ).
tcf(c_957,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ ssList(app(sK57,sK55))
| ~ memberP(app(sK57,sK55),X0) ),
inference(renaming,[status(thm)],[c_956]) ).
tcf(c_968,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssList(sK55)
| ~ ssList(sK57)
| ~ ssItem(X0)
| ~ memberP(sK55,X0)
| ~ ssList(app(sK57,sK55)) ),
inference(superposition,[status(thm)],[c_166,c_957]) ).
tcf(c_1013,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssList(sK58)
| ~ ssItem(X0)
| ~ ssList(app(sK57,sK55))
| ~ memberP(app(sK57,sK55),X0) ),
inference(superposition,[status(thm)],[c_248,c_165]) ).
tcf(c_1914,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ memberP(app(sK57,sK55),X0)
| ~ ssList(app(sK57,sK55))
| ~ ssItem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_1013,c_957]) ).
tcf(c_1915,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ ssList(app(sK57,sK55))
| ~ memberP(app(sK57,sK55),X0) ),
inference(renaming,[status(thm)],[c_1914]) ).
tcf(c_1925,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssList(sK55)
| ~ ssList(sK57)
| ~ ssItem(X0)
| ~ memberP(sK55,X0)
| ~ ssList(app(sK57,sK55)) ),
inference(superposition,[status(thm)],[c_166,c_1915]) ).
tcf(c_2328,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ memberP(sK55,X0)
| ~ ssList(app(sK57,sK55)) ),
inference(global_subsumption_just,[status(thm)],[c_968,c_259,c_252,c_968]) ).
tcf(c_2339,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssList(sK55)
| ~ ssList(sK57)
| ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(superposition,[status(thm)],[c_153,c_2328]) ).
tcf(c_3885,plain,
! [X0: $i] :
( memberP(sK56,X0)
| ~ ssItem(X0)
| ~ memberP(sK55,X0) ),
inference(global_subsumption_just,[status(thm)],[c_1925,c_259,c_252,c_2339]) ).
tcf(c_3894,plain,
( memberP(sK56,sK59)
| ~ ssItem(sK59) ),
inference(superposition,[status(thm)],[c_254,c_3885]) ).
tcf(c_3895,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3894,c_255,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC402+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.58 % Computer : n011.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 18:03:43 UTC 2026
% 0.09/0.59 % CPUTime :
% 0.09/0.59 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.62 Running first-order theorem proving
% 0.09/0.62 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.15/0.64
% 0.15/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.64
% 0.15/0.64 % Detected problem language: tptp
% 0.15/0.65 % Proving...
% 2.18/1.31 % SZS status Started for theBenchmark.p
% 2.18/1.31 % SZS status Theorem for theBenchmark.p
% 2.18/1.31
% 2.18/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.18/1.31
% 2.18/1.31 % ------ iProver source info
% 2.18/1.31
% 2.18/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 2.18/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.18/1.31 % git: non_committed_changes: false
% 2.18/1.31
% 2.18/1.31 % ------ Parsing...
% 2.18/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.18/1.31 % ------ Proving...
% 2.18/1.31 % ------ Problem Properties
% 2.18/1.31
% 2.18/1.31 %
% 2.18/1.31 % clauses 211
% 2.18/1.31 % conjectures 14
% 2.18/1.31 % EPR 75
% 2.18/1.31 % Horn 140
% 2.18/1.31 % unary 23
% 2.18/1.31 % binary 54
% 2.18/1.31 % lits 697
% 2.18/1.31 % lits eq 88
% 2.18/1.31 % fd_pure 0
% 2.18/1.31 % fd_pseudo 0
% 2.18/1.31 % fd_cond 21
% 2.18/1.31 % fd_pseudo_cond 17
% 2.18/1.31 % AC symbols 0
% 2.18/1.31
% 2.18/1.31 % ------ Input Options Time Limit: Unbounded
% 2.18/1.31
% 2.18/1.31
% 2.18/1.31 % ------
% 2.18/1.31 % Current options:
% 2.18/1.31 % ------
% 2.18/1.31
% 2.18/1.31
% 2.18/1.31 %
% 2.18/1.31
% 2.18/1.31 % ------ Proving...
% 2.18/1.31 %
% 2.18/1.31
% 2.18/1.31 % SZS status Theorem for theBenchmark.p
% 2.18/1.31
% 2.18/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.18/1.32
% 2.18/1.32
%------------------------------------------------------------------------------