TSTP Solution File: SWC343+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC343+1 : TPTP v8.2.0. 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 : Mon Jun 24 16:24:41 EDT 2024
% Result : Theorem 3.99s 1.14s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ? [X9] :
( strictorderedP(X0)
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X0 ) ) )
| app(cons(X10,nil),X11) != X9 ) ) )
& app(X0,X9) = X1
& ssList(X9) ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| 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)
=> ( ( ( nil = X1
| nil != X0 )
& ? [X9] :
( strictorderedP(X0)
& ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssList(X11)
=> ( ! [X12] :
( ssItem(X12)
=> ! [X13] :
( ssList(X13)
=> ( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X0 ) ) )
| app(cons(X10,nil),X11) != X9 ) ) )
& app(X0,X9) = X1
& ssList(X9) ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ? [X4] :
( strictorderedP(X0)
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X0 ) ) )
| app(cons(X5,nil),X6) != X4 ) ) )
& app(X0,X4) = X1
& ssList(X4) ) )
| ( nil = X2
& nil != X3 )
| ! [X9] :
( ssList(X9)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( lt(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X9
& ssList(X11) )
& ssItem(X10) )
| ~ strictorderedP(X2)
| app(X2,X9) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ! [X4] :
( ~ strictorderedP(X0)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X0
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| app(X0,X4) != X1
| ~ ssList(X4) ) )
& ( nil != X2
| nil = X3 )
& ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(X2,X9) = X3
& ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ! [X4] :
( ~ strictorderedP(X0)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X0
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| app(X0,X4) != X1
| ~ ssList(X4) ) )
& ( nil != X2
| nil = X3 )
& ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(X2,X9) = X3
& ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X0,X1] :
( ! [X4] :
( ~ strictorderedP(X0)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X0
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| app(X0,X4) != X1
| ~ ssList(X4) )
| ~ sP6(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| sP6(X0,X1) )
& ( nil != X2
| nil = X3 )
& ? [X9] :
( ! [X10] :
( ! [X11] :
( ! [X12] :
( ! [X13] :
( ~ lt(X12,X10)
| app(X13,cons(X12,nil)) != X2
| ~ ssList(X13) )
| ~ ssItem(X12) )
| app(cons(X10,nil),X11) != X9
| ~ ssList(X11) )
| ~ ssItem(X10) )
& strictorderedP(X2)
& app(X2,X9) = X3
& ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X0,X1] :
( ! [X4] :
( ~ strictorderedP(X0)
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X0
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| app(X0,X4) != X1
| ~ ssList(X4) )
| ~ sP6(X0,X1) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1] :
( ! [X2] :
( ~ strictorderedP(X0)
| ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( lt(X5,X3)
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
& app(cons(X3,nil),X4) = X2
& ssList(X4) )
& ssItem(X3) )
| app(X0,X2) != X1
| ~ ssList(X2) )
| ~ sP6(X0,X1) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( lt(X5,X3)
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
& app(cons(X3,nil),X4) = X2
& ssList(X4) )
& ssItem(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( lt(X5,sK54(X0,X2))
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
& app(cons(sK54(X0,X2),nil),X4) = X2
& ssList(X4) )
& ssItem(sK54(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( lt(X5,sK54(X0,X2))
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
& app(cons(sK54(X0,X2),nil),X4) = X2
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( lt(X5,sK54(X0,X2))
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
& app(cons(sK54(X0,X2),nil),sK55(X0,X2)) = X2
& ssList(sK55(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X2] :
( ? [X5] :
( ? [X6] :
( lt(X5,sK54(X0,X2))
& app(X6,cons(X5,nil)) = X0
& ssList(X6) )
& ssItem(X5) )
=> ( ? [X6] :
( lt(sK56(X0,X2),sK54(X0,X2))
& app(X6,cons(sK56(X0,X2),nil)) = X0
& ssList(X6) )
& ssItem(sK56(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
! [X0,X2] :
( ? [X6] :
( lt(sK56(X0,X2),sK54(X0,X2))
& app(X6,cons(sK56(X0,X2),nil)) = X0
& ssList(X6) )
=> ( lt(sK56(X0,X2),sK54(X0,X2))
& app(sK57(X0,X2),cons(sK56(X0,X2),nil)) = X0
& ssList(sK57(X0,X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f352,plain,
! [X0,X1] :
( ! [X2] :
( ~ strictorderedP(X0)
| ( lt(sK56(X0,X2),sK54(X0,X2))
& app(sK57(X0,X2),cons(sK56(X0,X2),nil)) = X0
& ssList(sK57(X0,X2))
& ssItem(sK56(X0,X2))
& app(cons(sK54(X0,X2),nil),sK55(X0,X2)) = X2
& ssList(sK55(X0,X2))
& ssItem(sK54(X0,X2)) )
| app(X0,X2) != X1
| ~ ssList(X2) )
| ~ sP6(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55,sK56,sK57])],[f347,f351,f350,f349,f348]) ).
fof(f353,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| sP6(X0,X1) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f234]) ).
fof(f354,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| sP6(X0,X1) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK58 )
| sP6(sK58,X1) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK58 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK58 )
| sP6(sK58,X1) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK58 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK58 = X2
& sK59 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f356,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK58 = X2
& sK59 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != sK60
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& app(sK60,X4) = X3
& ssList(X4) )
& sK58 = sK60
& sK59 = X3
& ssList(X3) )
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f357,plain,
( ? [X3] :
( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != sK60
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& app(sK60,X4) = X3
& ssList(X4) )
& sK58 = sK60
& sK59 = X3
& ssList(X3) )
=> ( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != sK60
| nil = sK61 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& app(sK60,X4) = sK61
& ssList(X4) )
& sK58 = sK60
& sK59 = sK61
& ssList(sK61) ) ),
introduced(choice_axiom,[]) ).
fof(f358,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& app(sK60,X4) = sK61
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK62
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& sK61 = app(sK60,sK62)
& ssList(sK62) ) ),
introduced(choice_axiom,[]) ).
fof(f359,plain,
( ( ( nil != sK59
& nil = sK58 )
| sP6(sK58,sK59) )
& ( nil != sK60
| nil = sK61 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK62
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK60)
& sK61 = app(sK60,sK62)
& ssList(sK62)
& sK58 = sK60
& sK59 = sK61
& ssList(sK61)
& ssList(sK60)
& ssList(sK59)
& ssList(sK58) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK58,sK59,sK60,sK61,sK62])],[f353,f358,f357,f356,f355,f354]) ).
fof(f559,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| ssItem(sK54(X0,X2))
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f560,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| ssList(sK55(X0,X2))
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f561,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| app(cons(sK54(X0,X2),nil),sK55(X0,X2)) = X2
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f562,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| ssItem(sK56(X0,X2))
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f563,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| ssList(sK57(X0,X2))
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f564,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| app(sK57(X0,X2),cons(sK56(X0,X2),nil)) = X0
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f565,plain,
! [X2,X0,X1] :
( ~ strictorderedP(X0)
| lt(sK56(X0,X2),sK54(X0,X2))
| app(X0,X2) != X1
| ~ ssList(X2)
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f352]) ).
fof(f570,plain,
sK59 = sK61,
inference(cnf_transformation,[],[f359]) ).
fof(f571,plain,
sK58 = sK60,
inference(cnf_transformation,[],[f359]) ).
fof(f572,plain,
ssList(sK62),
inference(cnf_transformation,[],[f359]) ).
fof(f573,plain,
sK61 = app(sK60,sK62),
inference(cnf_transformation,[],[f359]) ).
fof(f574,plain,
strictorderedP(sK60),
inference(cnf_transformation,[],[f359]) ).
fof(f575,plain,
! [X8,X6,X7,X5] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK60
| ~ ssList(X8)
| ~ ssItem(X7)
| app(cons(X5,nil),X6) != sK62
| ~ ssList(X6)
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f359]) ).
fof(f576,plain,
( nil != sK60
| nil = sK61 ),
inference(cnf_transformation,[],[f359]) ).
fof(f577,plain,
( nil = sK58
| sP6(sK58,sK59) ),
inference(cnf_transformation,[],[f359]) ).
fof(f578,plain,
( nil != sK59
| sP6(sK58,sK59) ),
inference(cnf_transformation,[],[f359]) ).
fof(f579,plain,
( nil != sK61
| sP6(sK60,sK61) ),
inference(definition_unfolding,[],[f578,f570,f571,f570]) ).
fof(f580,plain,
( nil = sK60
| sP6(sK60,sK61) ),
inference(definition_unfolding,[],[f577,f571,f571,f570]) ).
fof(f610,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| lt(sK56(X0,X2),sK54(X0,X2))
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f565]) ).
fof(f611,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| app(sK57(X0,X2),cons(sK56(X0,X2),nil)) = X0
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f564]) ).
fof(f612,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| ssList(sK57(X0,X2))
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f563]) ).
fof(f613,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| ssItem(sK56(X0,X2))
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f562]) ).
fof(f614,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| app(cons(sK54(X0,X2),nil),sK55(X0,X2)) = X2
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f561]) ).
fof(f615,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| ssList(sK55(X0,X2))
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f560]) ).
fof(f616,plain,
! [X2,X0] :
( ~ strictorderedP(X0)
| ssItem(sK54(X0,X2))
| ~ ssList(X2)
| ~ sP6(X0,app(X0,X2)) ),
inference(equality_resolution,[],[f559]) ).
cnf(c_246,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| lt(sK56(X0,X1),sK54(X0,X1)) ),
inference(cnf_transformation,[],[f610]) ).
cnf(c_247,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| app(sK57(X0,X1),cons(sK56(X0,X1),nil)) = X0 ),
inference(cnf_transformation,[],[f611]) ).
cnf(c_248,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssList(sK57(X0,X1)) ),
inference(cnf_transformation,[],[f612]) ).
cnf(c_249,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssItem(sK56(X0,X1)) ),
inference(cnf_transformation,[],[f613]) ).
cnf(c_250,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f614]) ).
cnf(c_251,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f615]) ).
cnf(c_252,plain,
( ~ sP6(X0,app(X0,X1))
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f616]) ).
cnf(c_253,negated_conjecture,
( nil != sK61
| sP6(sK60,sK61) ),
inference(cnf_transformation,[],[f579]) ).
cnf(c_254,negated_conjecture,
( nil = sK60
| sP6(sK60,sK61) ),
inference(cnf_transformation,[],[f580]) ).
cnf(c_255,negated_conjecture,
( nil != sK60
| nil = sK61 ),
inference(cnf_transformation,[],[f576]) ).
cnf(c_256,negated_conjecture,
( app(cons(X0,nil),X1) != sK62
| app(X2,cons(X3,nil)) != sK60
| ~ lt(X3,X0)
| ~ ssItem(X0)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f575]) ).
cnf(c_257,negated_conjecture,
strictorderedP(sK60),
inference(cnf_transformation,[],[f574]) ).
cnf(c_258,negated_conjecture,
app(sK60,sK62) = sK61,
inference(cnf_transformation,[],[f573]) ).
cnf(c_259,negated_conjecture,
ssList(sK62),
inference(cnf_transformation,[],[f572]) ).
cnf(c_383,negated_conjecture,
sP6(sK60,sK61),
inference(global_subsumption_just,[status(thm)],[c_254,c_254,c_253,c_255]) ).
cnf(c_385,negated_conjecture,
sP6(sK60,sK61),
inference(global_subsumption_just,[status(thm)],[c_253,c_383]) ).
cnf(c_3370,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_252,c_385]) ).
cnf(c_3371,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| ssItem(sK54(sK60,X0)) ),
inference(unflattening,[status(thm)],[c_3370]) ).
cnf(c_3373,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| ssItem(sK54(sK60,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_3371,c_257,c_3371]) ).
cnf(c_3374,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ssItem(sK54(sK60,X0)) ),
inference(renaming,[status(thm)],[c_3373]) ).
cnf(c_3385,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_251,c_385]) ).
cnf(c_3386,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| ssList(sK55(sK60,X0)) ),
inference(unflattening,[status(thm)],[c_3385]) ).
cnf(c_3388,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| ssList(sK55(sK60,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_3386,c_257,c_3386]) ).
cnf(c_3389,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ssList(sK55(sK60,X0)) ),
inference(renaming,[status(thm)],[c_3388]) ).
cnf(c_3400,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| app(cons(sK54(X0,X1),nil),sK55(X0,X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_250,c_385]) ).
cnf(c_3401,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| app(cons(sK54(sK60,X0),nil),sK55(sK60,X0)) = X0 ),
inference(unflattening,[status(thm)],[c_3400]) ).
cnf(c_3403,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| app(cons(sK54(sK60,X0),nil),sK55(sK60,X0)) = X0 ),
inference(global_subsumption_just,[status(thm)],[c_3401,c_257,c_3401]) ).
cnf(c_3404,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| app(cons(sK54(sK60,X0),nil),sK55(sK60,X0)) = X0 ),
inference(renaming,[status(thm)],[c_3403]) ).
cnf(c_3415,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssItem(sK56(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_385]) ).
cnf(c_3416,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| ssItem(sK56(sK60,X0)) ),
inference(unflattening,[status(thm)],[c_3415]) ).
cnf(c_3418,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| ssItem(sK56(sK60,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_3416,c_257,c_3416]) ).
cnf(c_3419,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ssItem(sK56(sK60,X0)) ),
inference(renaming,[status(thm)],[c_3418]) ).
cnf(c_3430,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| ssList(sK57(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_248,c_385]) ).
cnf(c_3431,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| ssList(sK57(sK60,X0)) ),
inference(unflattening,[status(thm)],[c_3430]) ).
cnf(c_3433,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| ssList(sK57(sK60,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_3431,c_257,c_3431]) ).
cnf(c_3434,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ssList(sK57(sK60,X0)) ),
inference(renaming,[status(thm)],[c_3433]) ).
cnf(c_3445,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| app(sK57(X0,X1),cons(sK56(X0,X1),nil)) = X0 ),
inference(resolution_lifted,[status(thm)],[c_247,c_385]) ).
cnf(c_3446,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| app(sK57(sK60,X0),cons(sK56(sK60,X0),nil)) = sK60 ),
inference(unflattening,[status(thm)],[c_3445]) ).
cnf(c_3448,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| app(sK57(sK60,X0),cons(sK56(sK60,X0),nil)) = sK60 ),
inference(global_subsumption_just,[status(thm)],[c_3446,c_257,c_3446]) ).
cnf(c_3449,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| app(sK57(sK60,X0),cons(sK56(sK60,X0),nil)) = sK60 ),
inference(renaming,[status(thm)],[c_3448]) ).
cnf(c_3460,plain,
( app(X0,X1) != sK61
| X0 != sK60
| ~ ssList(X1)
| ~ strictorderedP(X0)
| lt(sK56(X0,X1),sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_246,c_385]) ).
cnf(c_3461,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| ~ strictorderedP(sK60)
| lt(sK56(sK60,X0),sK54(sK60,X0)) ),
inference(unflattening,[status(thm)],[c_3460]) ).
cnf(c_3463,plain,
( ~ ssList(X0)
| app(sK60,X0) != sK61
| lt(sK56(sK60,X0),sK54(sK60,X0)) ),
inference(global_subsumption_just,[status(thm)],[c_3461,c_257,c_3461]) ).
cnf(c_3464,plain,
( app(sK60,X0) != sK61
| ~ ssList(X0)
| lt(sK56(sK60,X0),sK54(sK60,X0)) ),
inference(renaming,[status(thm)],[c_3463]) ).
cnf(c_9201,plain,
app(sK60,sK62) = sP0_iProver_def,
definition ).
cnf(c_9204,negated_conjecture,
ssList(sK62),
inference(demodulation,[status(thm)],[c_259]) ).
cnf(c_9205,negated_conjecture,
sP0_iProver_def = sK61,
inference(demodulation,[status(thm)],[c_258,c_9201]) ).
cnf(c_9207,negated_conjecture,
( app(cons(X0,nil),X1) != sK62
| app(X2,cons(X3,nil)) != sK60
| ~ lt(X3,X0)
| ~ ssItem(X0)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(demodulation,[status(thm)],[c_256]) ).
cnf(c_12182,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| ssItem(sK54(sK60,X0)) ),
inference(light_normalisation,[status(thm)],[c_3374,c_9205]) ).
cnf(c_12192,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| ssList(sK55(sK60,X0)) ),
inference(light_normalisation,[status(thm)],[c_3389,c_9205]) ).
cnf(c_12202,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| ssItem(sK56(sK60,X0)) ),
inference(light_normalisation,[status(thm)],[c_3419,c_9205]) ).
cnf(c_12212,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| ssList(sK57(sK60,X0)) ),
inference(light_normalisation,[status(thm)],[c_3434,c_9205]) ).
cnf(c_12222,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| lt(sK56(sK60,X0),sK54(sK60,X0)) ),
inference(light_normalisation,[status(thm)],[c_3464,c_9205]) ).
cnf(c_12232,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| app(cons(sK54(sK60,X0),nil),sK55(sK60,X0)) = X0 ),
inference(light_normalisation,[status(thm)],[c_3404,c_9205]) ).
cnf(c_12242,plain,
( app(sK60,X0) != sP0_iProver_def
| ~ ssList(X0)
| app(sK57(sK60,X0),cons(sK56(sK60,X0),nil)) = sK60 ),
inference(light_normalisation,[status(thm)],[c_3449,c_9205]) ).
cnf(c_12252,plain,
( ~ ssList(sK62)
| app(sK57(sK60,sK62),cons(sK56(sK60,sK62),nil)) = sK60 ),
inference(superposition,[status(thm)],[c_9201,c_12242]) ).
cnf(c_12253,plain,
( ~ ssList(sK62)
| app(cons(sK54(sK60,sK62),nil),sK55(sK60,sK62)) = sK62 ),
inference(superposition,[status(thm)],[c_9201,c_12232]) ).
cnf(c_12254,plain,
( ~ ssList(sK62)
| lt(sK56(sK60,sK62),sK54(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_9201,c_12222]) ).
cnf(c_12255,plain,
( ~ ssList(sK62)
| ssList(sK57(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_9201,c_12212]) ).
cnf(c_12256,plain,
( ~ ssList(sK62)
| ssItem(sK56(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_9201,c_12202]) ).
cnf(c_12257,plain,
( ~ ssList(sK62)
| ssList(sK55(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_9201,c_12192]) ).
cnf(c_12258,plain,
( ~ ssList(sK62)
| ssItem(sK54(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_9201,c_12182]) ).
cnf(c_12259,plain,
ssItem(sK54(sK60,sK62)),
inference(forward_subsumption_resolution,[status(thm)],[c_12258,c_9204]) ).
cnf(c_12260,plain,
ssList(sK55(sK60,sK62)),
inference(forward_subsumption_resolution,[status(thm)],[c_12257,c_9204]) ).
cnf(c_12261,plain,
ssItem(sK56(sK60,sK62)),
inference(forward_subsumption_resolution,[status(thm)],[c_12256,c_9204]) ).
cnf(c_12262,plain,
ssList(sK57(sK60,sK62)),
inference(forward_subsumption_resolution,[status(thm)],[c_12255,c_9204]) ).
cnf(c_12263,plain,
lt(sK56(sK60,sK62),sK54(sK60,sK62)),
inference(forward_subsumption_resolution,[status(thm)],[c_12254,c_9204]) ).
cnf(c_12264,plain,
app(cons(sK54(sK60,sK62),nil),sK55(sK60,sK62)) = sK62,
inference(forward_subsumption_resolution,[status(thm)],[c_12253,c_9204]) ).
cnf(c_12265,plain,
app(sK57(sK60,sK62),cons(sK56(sK60,sK62),nil)) = sK60,
inference(forward_subsumption_resolution,[status(thm)],[c_12252,c_9204]) ).
cnf(c_12266,plain,
( app(X0,cons(X1,nil)) != sK60
| ~ lt(X1,sK54(sK60,sK62))
| ~ ssItem(sK54(sK60,sK62))
| ~ ssList(sK55(sK60,sK62))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(superposition,[status(thm)],[c_12264,c_9207]) ).
cnf(c_12267,plain,
( app(X0,cons(X1,nil)) != sK60
| ~ lt(X1,sK54(sK60,sK62))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12266,c_12260,c_12259]) ).
cnf(c_12281,plain,
( ~ lt(sK56(sK60,sK62),sK54(sK60,sK62))
| ~ ssItem(sK56(sK60,sK62))
| ~ ssList(sK57(sK60,sK62)) ),
inference(superposition,[status(thm)],[c_12265,c_12267]) ).
cnf(c_12282,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_12281,c_12262,c_12261,c_12263]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC343+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Jun 20 05:42:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.99/1.14 % SZS status Started for theBenchmark.p
% 3.99/1.14 % SZS status Theorem for theBenchmark.p
% 3.99/1.14
% 3.99/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.99/1.14
% 3.99/1.14 ------ iProver source info
% 3.99/1.14
% 3.99/1.14 git: date: 2024-06-12 09:56:46 +0000
% 3.99/1.14 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.99/1.14 git: non_committed_changes: false
% 3.99/1.14
% 3.99/1.14 ------ Parsing...
% 3.99/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.99/1.14
% 3.99/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 3.99/1.14
% 3.99/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.99/1.14
% 3.99/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.99/1.14 ------ Proving...
% 3.99/1.14 ------ Problem Properties
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14 clauses 195
% 3.99/1.14 conjectures 7
% 3.99/1.14 EPR 55
% 3.99/1.14 Horn 127
% 3.99/1.14 unary 22
% 3.99/1.14 binary 41
% 3.99/1.14 lits 654
% 3.99/1.14 lits eq 93
% 3.99/1.14 fd_pure 0
% 3.99/1.14 fd_pseudo 0
% 3.99/1.14 fd_cond 21
% 3.99/1.14 fd_pseudo_cond 14
% 3.99/1.14 AC symbols 0
% 3.99/1.14
% 3.99/1.14 ------ Schedule dynamic 5 is on
% 3.99/1.14
% 3.99/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14 ------
% 3.99/1.14 Current options:
% 3.99/1.14 ------
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14 ------ Proving...
% 3.99/1.14
% 3.99/1.14
% 3.99/1.14 % SZS status Theorem for theBenchmark.p
% 3.99/1.14
% 3.99/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.99/1.14
% 3.99/1.15
%------------------------------------------------------------------------------