TSTP Solution File: SWC402+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC402+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:12:21 EDT 2024
% Result : Theorem 7.65s 1.54s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/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,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X2
& nil != X3 )
| ! [X4] :
( memberP(X1,X4)
| ~ memberP(X0,X4)
| ~ ssItem(X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( leq(X9,X7)
& app(X10,cons(X9,nil)) = X2
& ssList(X10) )
& ssItem(X9) )
& app(cons(X7,nil),X8) = X6
& ssList(X8) )
& ssItem(X7) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X11,X13)
& app(cons(X13,nil),X14) = X2
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X5
& ssList(X12) )
& ssItem(X11) )
| ~ totalorderedP(X2)
| app(app(X5,X2),X6) != X3
| ~ ssList(X6) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(X0,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(X1,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != X2
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != X2
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(X2)
& app(app(X5,X2),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& app(app(X5,sK55),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& app(app(X5,sK55),X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& app(app(X5,sK55),X6) = sK56
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ~ memberP(sK54,X4)
& memberP(sK53,X4)
& ssItem(X4) )
=> ( ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != X5
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& app(app(X5,sK55),X6) = sK56
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK58
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& sK56 = app(app(sK58,sK55),X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != X6
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK58
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& sK56 = app(app(sK58,sK55),X6)
& ssList(X6) )
=> ( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK59
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK58
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& sK56 = app(app(sK58,sK55),sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( nil != sK55
| nil = sK56 )
& ~ memberP(sK54,sK57)
& memberP(sK53,sK57)
& ssItem(sK57)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( ~ leq(X9,X7)
| app(X10,cons(X9,nil)) != sK55
| ~ ssList(X10) )
| ~ ssItem(X9) )
| app(cons(X7,nil),X8) != sK59
| ~ ssList(X8) )
| ~ ssItem(X7) )
& ! [X11] :
( ! [X12] :
( ! [X13] :
( ! [X14] :
( ~ leq(X11,X13)
| app(cons(X13,nil),X14) != sK55
| ~ ssList(X14) )
| ~ ssItem(X13) )
| app(X12,cons(X11,nil)) != sK58
| ~ ssList(X12) )
| ~ ssItem(X11) )
& totalorderedP(sK55)
& sK56 = app(app(sK58,sK55),sK59)
& ssList(sK59)
& ssList(sK58)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f455,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f468,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f469,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f550,plain,
ssList(sK53),
inference(cnf_transformation,[],[f350]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
ssList(sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
ssList(sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
sK56 = app(app(sK58,sK55),sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f563,plain,
memberP(sK53,sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f564,plain,
~ memberP(sK54,sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f566,plain,
~ memberP(sK56,sK57),
inference(definition_unfolding,[],[f564,f554]) ).
fof(f567,plain,
memberP(sK55,sK57),
inference(definition_unfolding,[],[f563,f555]) ).
fof(f569,plain,
ssList(sK55),
inference(definition_unfolding,[],[f550,f555]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f455]) ).
cnf(c_165,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X2,X0),X1) ),
inference(cnf_transformation,[],[f469]) ).
cnf(c_166,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,X2),X1) ),
inference(cnf_transformation,[],[f468]) ).
cnf(c_247,negated_conjecture,
~ memberP(sK56,sK57),
inference(cnf_transformation,[],[f566]) ).
cnf(c_248,negated_conjecture,
memberP(sK55,sK57),
inference(cnf_transformation,[],[f567]) ).
cnf(c_249,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f562]) ).
cnf(c_253,negated_conjecture,
app(app(sK58,sK55),sK59) = sK56,
inference(cnf_transformation,[],[f558]) ).
cnf(c_254,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f557]) ).
cnf(c_255,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f556]) ).
cnf(c_259,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f569]) ).
cnf(c_8931,plain,
app(sK58,sK55) = sP0_iProver_def,
definition ).
cnf(c_8932,plain,
app(sP0_iProver_def,sK59) = sP1_iProver_def,
definition ).
cnf(c_8933,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_259]) ).
cnf(c_8935,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_255]) ).
cnf(c_8936,negated_conjecture,
ssList(sK59),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8937,negated_conjecture,
sP1_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_253,c_8931,c_8932]) ).
cnf(c_8941,negated_conjecture,
ssItem(sK57),
inference(demodulation,[status(thm)],[c_249]) ).
cnf(c_8942,negated_conjecture,
memberP(sK55,sK57),
inference(demodulation,[status(thm)],[c_248]) ).
cnf(c_8943,negated_conjecture,
~ memberP(sK56,sK57),
inference(demodulation,[status(thm)],[c_247]) ).
cnf(c_11829,plain,
~ memberP(sP1_iProver_def,sK57),
inference(light_normalisation,[status(thm)],[c_8943,c_8937]) ).
cnf(c_12383,plain,
( ~ ssList(sK55)
| ~ ssList(sK58)
| ssList(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_8931,c_153]) ).
cnf(c_12397,plain,
ssList(sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_12383,c_8935,c_8933]) ).
cnf(c_18363,plain,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| ~ ssList(sK55)
| ~ ssList(sK58)
| memberP(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_8931,c_165]) ).
cnf(c_18389,plain,
( ~ memberP(sK55,X0)
| ~ ssItem(X0)
| memberP(sP0_iProver_def,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_18363,c_8935,c_8933]) ).
cnf(c_18475,plain,
( ~ memberP(sP0_iProver_def,X0)
| ~ ssItem(X0)
| ~ ssList(sK59)
| ~ ssList(sP0_iProver_def)
| memberP(sP1_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_8932,c_166]) ).
cnf(c_18496,plain,
( ~ memberP(sP0_iProver_def,X0)
| ~ ssItem(X0)
| memberP(sP1_iProver_def,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_18475,c_12397,c_8936]) ).
cnf(c_21016,plain,
( ~ ssItem(sK57)
| memberP(sP0_iProver_def,sK57) ),
inference(superposition,[status(thm)],[c_8942,c_18389]) ).
cnf(c_21017,plain,
memberP(sP0_iProver_def,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_21016,c_8941]) ).
cnf(c_21234,plain,
( ~ ssItem(sK57)
| memberP(sP1_iProver_def,sK57) ),
inference(superposition,[status(thm)],[c_21017,c_18496]) ).
cnf(c_21235,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_21234,c_11829,c_8941]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC402+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:25:58 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.65/1.54 % SZS status Started for theBenchmark.p
% 7.65/1.54 % SZS status Theorem for theBenchmark.p
% 7.65/1.54
% 7.65/1.54 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.65/1.54
% 7.65/1.54 ------ iProver source info
% 7.65/1.54
% 7.65/1.54 git: date: 2024-05-02 19:28:25 +0000
% 7.65/1.54 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.65/1.54 git: non_committed_changes: false
% 7.65/1.54
% 7.65/1.54 ------ Parsing...
% 7.65/1.54 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.65/1.54
% 7.65/1.54 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 7.65/1.54
% 7.65/1.54 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.65/1.54
% 7.65/1.54 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.65/1.54 ------ Proving...
% 7.65/1.54 ------ Problem Properties
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54 clauses 194
% 7.65/1.54 conjectures 12
% 7.65/1.54 EPR 59
% 7.65/1.54 Horn 126
% 7.65/1.54 unary 27
% 7.65/1.54 binary 41
% 7.65/1.54 lits 645
% 7.65/1.54 lits eq 87
% 7.65/1.54 fd_pure 0
% 7.65/1.54 fd_pseudo 0
% 7.65/1.54 fd_cond 21
% 7.65/1.54 fd_pseudo_cond 14
% 7.65/1.54 AC symbols 0
% 7.65/1.54
% 7.65/1.54 ------ Schedule dynamic 5 is on
% 7.65/1.54
% 7.65/1.54 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54 ------
% 7.65/1.54 Current options:
% 7.65/1.54 ------
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54 ------ Proving...
% 7.65/1.54
% 7.65/1.54
% 7.65/1.54 % SZS status Theorem for theBenchmark.p
% 7.65/1.54
% 7.65/1.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.65/1.54
% 7.65/1.55
%------------------------------------------------------------------------------