%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC181+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 : 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:08:17 PM UTC 2026
% Result : Theorem 1.15s 1.74s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 67 ( 13 unt; 0 def)
% Number of atoms : 428 ( 87 equ)
% Maximal formula atoms : 27 ( 6 avg)
% Number of connectives : 581 ( 220 ~; 221 |; 107 &)
% ( 6 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 5 ( 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 : 19 ( 19 usr; 7 con; 0-2 aty)
% Number of variables : 194 ( 0 sgn 146 !; 48 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(f13,axiom,
! [X0] :
( ssList(X0)
=> ( duplicatefreeP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> X1 != X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax13) ).
fof(f90,axiom,
! [X0] :
( ssItem(X0)
=> ~ lt(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax90) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| duplicatefreeP(X0)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(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] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| 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)
=> ( ( nil = X2
& nil != X3 )
| duplicatefreeP(X0)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(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] :
( lt(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| 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)
& ( nil != X2
| nil = X3 )
& ~ duplicatefreeP(X0)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(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] :
( ~ lt(X6,X8)
| app(cons(X8,nil),X9) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(X7,cons(X6,nil)) != X4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& ~ duplicatefreeP(X0)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(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] :
( ~ lt(X6,X8)
| app(cons(X8,nil),X9) != X2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(X7,cons(X6,nil)) != X4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& strictorderedP(X2)
& app(app(X4,X2),X5) = X3 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f123,plain,
! [X0] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(ennf_transformation,[],[f90]) ).
fof(f130,plain,
! [X0] :
( ~ ssList(X0)
| ( strictorderedP(X0)
<=> ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2) ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f131,plain,
! [X0] :
( ~ ssList(X0)
| ( strictorderedP(X0)
<=> ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2) ) ) ) ) ) ) ),
inference(flattening,[],[f130]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| ( duplicatefreeP(X0)
<=> ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| X1 != X2 ) ) ) ) ) ) ),
inference(ennf_transformation,[],[f13]) ).
fof(f134,plain,
! [X0] :
( ~ ssList(X0)
| ( duplicatefreeP(X0)
<=> ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| X1 != X2 ) ) ) ) ) ) ),
inference(flattening,[],[f133]) ).
fof(f158,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK3)
& ( nil != sK2
| nil = sK3 )
& ~ duplicatefreeP(sK0)
& ssList(sK4)
& ssList(sK5)
& ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != sK2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != sK5
| ~ ssList(X11) )
| ~ ssItem(X10) )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ lt(X6,X8)
| app(cons(X8,nil),X9) != sK2
| ~ ssList(X9) )
| ~ ssItem(X8) )
| app(X7,cons(X6,nil)) != sK4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& strictorderedP(sK2)
& sK3 = app(app(sK4,sK2),sK5)
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f99]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ strictorderedP(X0)
| ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| lt(X1,X2) ) ) ) ) ) )
& ( ? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ~ lt(X1,X2) ) ) ) ) )
| strictorderedP(X0) ) ) ),
inference(nnf_transformation,[],[f131]) ).
fof(f168,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ strictorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ) ) ) ) ) )
& ( ? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ~ lt(X1,X2) ) ) ) ) )
| strictorderedP(X0) ) ) ),
inference(rectify,[],[f167]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ strictorderedP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ) ) ) ) ) )
& ( ( ssItem(sK10(X0))
& ssItem(sK11(X0))
& ssList(sK12(X0))
& ssList(sK13(X0))
& ssList(sK14(X0))
& app(app(sK12(X0),cons(sK10(X0),sK13(X0))),cons(sK11(X0),sK14(X0))) = X0
& ~ lt(sK10(X0),sK11(X0)) )
| strictorderedP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13,sK14]),skolemize(X1,sK10(X0)),skolemize(X2,sK11(X0)),skolemize(X3,sK12(X0)),skolemize(X4,sK13(X0)),skolemize(X5,sK14(X0))],[f168]) ).
fof(f170,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ duplicatefreeP(X0)
| ! [X1] :
( ~ ssItem(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssList(X3)
| ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ~ ssList(X5)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| X1 != X2 ) ) ) ) ) )
& ( ? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& X1 = X2 ) ) ) ) )
| duplicatefreeP(X0) ) ) ),
inference(nnf_transformation,[],[f134]) ).
fof(f171,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ duplicatefreeP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| X6 != X7 ) ) ) ) ) )
& ( ? [X1] :
( ssItem(X1)
& ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& X1 = X2 ) ) ) ) )
| duplicatefreeP(X0) ) ) ),
inference(rectify,[],[f170]) ).
fof(f172,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ duplicatefreeP(X0)
| ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( ~ ssList(X9)
| ! [X10] :
( ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| X6 != X7 ) ) ) ) ) )
& ( ( ssItem(sK15(X0))
& ssItem(sK16(X0))
& ssList(sK17(X0))
& ssList(sK18(X0))
& ssList(sK19(X0))
& app(app(sK17(X0),cons(sK15(X0),sK18(X0))),cons(sK16(X0),sK19(X0))) = X0
& sK15(X0) = sK16(X0) )
| duplicatefreeP(X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16,sK17,sK18,sK19]),skolemize(X1,sK15(X0)),skolemize(X2,sK16(X0)),skolemize(X3,sK17(X0)),skolemize(X4,sK18(X0)),skolemize(X5,sK19(X0))],[f171]) ).
fof(f175,plain,
ssList(sK0),
inference(cnf_transformation,[],[f158]) ).
fof(f180,plain,
~ duplicatefreeP(sK0),
inference(cnf_transformation,[],[f158]) ).
fof(f185,plain,
strictorderedP(sK2),
inference(cnf_transformation,[],[f158]) ).
fof(f187,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f158]) ).
fof(f217,plain,
! [X0] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(cnf_transformation,[],[f123]) ).
fof(f227,plain,
! [X10,X0,X8,X6,X9,X7] :
( ~ ssList(X0)
| ~ strictorderedP(X0)
| ~ ssItem(X6)
| ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| lt(X6,X7) ),
inference(cnf_transformation,[],[f169]) ).
fof(f238,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK15(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f239,plain,
! [X0] :
( ~ ssList(X0)
| ssItem(sK16(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f240,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK17(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f241,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK18(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f242,plain,
! [X0] :
( ~ ssList(X0)
| ssList(sK19(X0))
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f243,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK17(X0),cons(sK15(X0),sK18(X0))),cons(sK16(X0),sK19(X0))) = X0
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f244,plain,
! [X0] :
( ~ ssList(X0)
| sK15(X0) = sK16(X0)
| duplicatefreeP(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f260,plain,
~ duplicatefreeP(sK2),
inference(definition_unfolding,[],[f180,f187]) ).
fof(f262,plain,
ssList(sK2),
inference(definition_unfolding,[],[f175,f187]) ).
fof(f268,plain,
! [X10,X8,X6,X9,X7] :
( ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssItem(X6)
| ~ ssItem(X7)
| ~ ssList(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| lt(X6,X7) ),
inference(equality_resolution,[],[f227]) ).
tcf(c_50,negated_conjecture,
strictorderedP(sK2),
inference(cnf_transformation,[],[f185]) ).
tcf(c_55,negated_conjecture,
~ duplicatefreeP(sK2),
inference(cnf_transformation,[],[f260]) ).
tcf(c_60,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f262]) ).
tcf(c_89,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ lt(X0,X0) ),
inference(cnf_transformation,[],[f217]) ).
tcf(c_105,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( lt(X1,X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X3,X4)))
| ~ strictorderedP(app(app(X0,cons(X1,X2)),cons(X3,X4))) ),
inference(cnf_transformation,[],[f268]) ).
tcf(c_108,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ( sK15(X0) = sK16(X0) )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_109,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ( app(app(sK17(X0),cons(sK15(X0),sK18(X0))),cons(sK16(X0),sK19(X0))) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f243]) ).
tcf(c_110,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ssList(sK19(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f242]) ).
tcf(c_111,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ssList(sK18(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f241]) ).
tcf(c_112,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ssList(sK17(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f240]) ).
tcf(c_113,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ssItem(sK16(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
tcf(c_114,plain,
! [X0: $i] :
( duplicatefreeP(X0)
| ssItem(sK15(X0))
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f238]) ).
tcf(c_1179,plain,
! [X0: $i] :
( ssItem(sK15(X0))
| ~ ssList(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_114]) ).
tcf(c_1180,plain,
( ssItem(sK15(sK2))
| ~ ssList(sK2) ),
inference(unflattening,[status(thm)],[c_1179]) ).
tcf(c_1193,plain,
! [X0: $i] :
( ssList(sK17(X0))
| ~ ssList(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_112]) ).
tcf(c_1194,plain,
( ssList(sK17(sK2))
| ~ ssList(sK2) ),
inference(unflattening,[status(thm)],[c_1193]) ).
tcf(c_1200,plain,
! [X0: $i] :
( ssList(sK18(X0))
| ~ ssList(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_111]) ).
tcf(c_1201,plain,
( ssList(sK18(sK2))
| ~ ssList(sK2) ),
inference(unflattening,[status(thm)],[c_1200]) ).
tcf(c_1207,plain,
! [X0: $i] :
( ssList(sK19(X0))
| ~ ssList(X0)
| ( X0 != sK2 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_110]) ).
tcf(c_1208,plain,
( ssList(sK19(sK2))
| ~ ssList(sK2) ),
inference(unflattening,[status(thm)],[c_1207]) ).
tcf(c_4301,plain,
( duplicatefreeP(sK2)
| ( sK15(sK2) = sK16(sK2) ) ),
inference(superposition,[status(thm)],[c_60,c_108]) ).
tcf(c_4314,plain,
sK15(sK2) = sK16(sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_4301,c_55]) ).
tcf(c_4366,plain,
( duplicatefreeP(sK2)
| ssItem(sK15(sK2))
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_4314,c_113]) ).
tcf(c_4367,plain,
ssItem(sK15(sK2)),
inference(forward_subsumption_resolution,[status(thm)],[c_4366,c_55,c_60]) ).
tcf(c_5462,plain,
( ~ ssItem(sK15(sK2))
| ~ lt(sK15(sK2),sK15(sK2)) ),
inference(instantiation,[status(thm)],[c_89]) ).
tcf(c_8181,plain,
( duplicatefreeP(sK2)
| ( app(app(sK17(sK2),cons(sK15(sK2),sK18(sK2))),cons(sK16(sK2),sK19(sK2))) = sK2 ) ),
inference(superposition,[status(thm)],[c_60,c_109]) ).
tcf(c_8199,plain,
( duplicatefreeP(sK2)
| ( app(app(sK17(sK2),cons(sK15(sK2),sK18(sK2))),cons(sK15(sK2),sK19(sK2))) = sK2 ) ),
inference(light_normalisation,[status(thm)],[c_8181,c_4314]) ).
tcf(c_8200,plain,
app(app(sK17(sK2),cons(sK15(sK2),sK18(sK2))),cons(sK15(sK2),sK19(sK2))) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_8199,c_55]) ).
tcf(c_11940,plain,
( lt(sK15(sK2),sK15(sK2))
| ~ strictorderedP(sK2)
| ~ ssList(sK19(sK2))
| ~ ssList(sK18(sK2))
| ~ ssList(sK17(sK2))
| ~ ssItem(sK15(sK2))
| ~ ssList(app(app(sK17(sK2),cons(sK15(sK2),sK18(sK2))),cons(sK15(sK2),sK19(sK2)))) ),
inference(superposition,[status(thm)],[c_8200,c_105]) ).
tcf(c_11943,plain,
( lt(sK15(sK2),sK15(sK2))
| ~ ssList(sK2)
| ~ strictorderedP(sK2)
| ~ ssList(sK19(sK2))
| ~ ssList(sK18(sK2))
| ~ ssList(sK17(sK2))
| ~ ssItem(sK15(sK2)) ),
inference(light_normalisation,[status(thm)],[c_11940,c_8200]) ).
tcf(c_11944,plain,
( lt(sK15(sK2),sK15(sK2))
| ~ ssList(sK19(sK2))
| ~ ssList(sK18(sK2))
| ~ ssList(sK17(sK2)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11943,c_60,c_50,c_4367]) ).
tcf(c_11975,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11944,c_5462,c_1208,c_1201,c_1194,c_1180,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC181+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.11/0.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 16:50:54 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 1.15/1.74 % SZS status Started for theBenchmark.p
% 1.15/1.74 % SZS status Theorem for theBenchmark.p
% 1.15/1.74
% 1.15/1.74 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.15/1.74
% 1.15/1.74 % ------ iProver source info
% 1.15/1.74
% 1.15/1.74 % git: date: 2026-07-19 20:42:38 +0200
% 1.15/1.74 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.15/1.74 % git: non_committed_changes: false
% 1.15/1.74
% 1.15/1.74 % ------ Parsing...
% 1.15/1.74 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.15/1.74
% 1.15/1.74 % ------ 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.15/1.74
% 1.15/1.74 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.15/1.74
% 1.15/1.74 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.15/1.74 % ------ Proving...
% 1.15/1.74 % ------ Problem Properties
% 1.15/1.74
% 1.15/1.74 %
% 1.15/1.74 % clauses 77
% 1.15/1.74 % conjectures 9
% 1.15/1.74 % EPR 22
% 1.15/1.74 % Horn 47
% 1.15/1.74 % unary 15
% 1.15/1.74 % binary 6
% 1.15/1.74 % lits 253
% 1.15/1.74 % lits eq 60
% 1.15/1.74 % fd_pure 0
% 1.15/1.74 % fd_pseudo 0
% 1.15/1.74 % fd_cond 15
% 1.15/1.74 % fd_pseudo_cond 7
% 1.15/1.74 % AC symbols 0
% 1.15/1.74
% 1.15/1.74 % ------ Schedule dynamic 5 is on
% 1.15/1.74
% 1.15/1.74 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.15/1.74
% 1.15/1.74
% 1.15/1.74 % ------
% 1.15/1.74 % Current options:
% 1.15/1.74 % ------
% 1.15/1.74
% 1.15/1.74
% 1.15/1.74 %
% 1.15/1.74
% 1.15/1.74 % ------ Proving...
% 1.15/1.74 %
% 1.15/1.74
% 1.15/1.74 % SZS status Theorem for theBenchmark.p
% 1.15/1.74
% 1.15/1.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.15/1.74
% 1.15/1.74
%------------------------------------------------------------------------------