TSTP Solution File: SWC235+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC235+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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 : Thu Aug 31 20:41:53 EDT 2023
% Result : Theorem 141.87s 19.76s
% Output : CNFRefutation 141.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 115 ( 17 unt; 0 def)
% Number of atoms : 784 ( 298 equ)
% Maximal formula atoms : 64 ( 6 avg)
% Number of connectives : 1072 ( 403 ~; 364 |; 265 &)
% ( 0 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 365 ( 0 sgn; 195 !; 96 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax38) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X13] :
( ? [X14] :
( ? [X15] :
( app(X15,cons(X13,nil)) = X2
& ssList(X15) )
& app(cons(X13,nil),X14) = X9
& ssList(X14) )
& ssItem(X13) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( app(cons(X10,nil),X12) = X2
& ssList(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ equalelemsP(X2)
| app(app(X8,X2),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| 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 )
| ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( ? [X13] :
( ? [X14] :
( ? [X15] :
( app(X15,cons(X13,nil)) = X2
& ssList(X15) )
& app(cons(X13,nil),X14) = X9
& ssList(X14) )
& ssItem(X13) )
| ? [X10] :
( ? [X11] :
( ? [X12] :
( app(cons(X10,nil),X12) = X2
& ssList(X12) )
& app(X11,cons(X10,nil)) = X8
& ssList(X11) )
& ssItem(X10) )
| ~ equalelemsP(X2)
| app(app(X8,X2),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( lt(X4,X7)
| ~ leq(X4,X7)
| ~ memberP(X6,X7)
| ~ memberP(X5,X7) ) )
& app(app(X5,cons(X4,nil)),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X2
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(cons(X9,nil),X11) = X2
& ssList(X11) )
& app(X10,cons(X9,nil)) = X4
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ? [X12] :
( ? [X13] :
( ? [X14] :
( ! [X15] :
( ssItem(X15)
=> ( lt(X12,X15)
| ~ leq(X12,X15)
| ~ memberP(X14,X15)
| ~ memberP(X13,X15) ) )
& app(app(X13,cons(X12,nil)),X14) = X0
& ssList(X14) )
& ssList(X13) )
& ssItem(X12) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f124,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f125,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f149,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f199,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != X0
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != X0
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f318,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
& ssList(sK49(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f319,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK49(X0)) = X0
& ssItem(X2) )
=> ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f320,plain,
! [X0] :
( ( cons(sK50(X0),sK49(X0)) = X0
& ssItem(sK50(X0))
& ssList(sK49(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK49,sK50])],[f125,f319,f318]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != X0
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X12,X13,X14] :
( ? [X15] :
( ~ lt(X12,X15)
& leq(X12,X15)
& memberP(X14,X15)
& memberP(X13,X15)
& ssItem(X15) )
=> ( ~ lt(X12,sK59(X12,X13,X14))
& leq(X12,sK59(X12,X13,X14))
& memberP(X14,sK59(X12,X13,X14))
& memberP(X13,sK59(X12,X13,X14))
& ssItem(sK59(X12,X13,X14)) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ( nil != sK55
| nil = sK56 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58)
& ssList(sK57)
& ! [X12] :
( ! [X13] :
( ! [X14] :
( ( ~ lt(X12,sK59(X12,X13,X14))
& leq(X12,sK59(X12,X13,X14))
& memberP(X14,sK59(X12,X13,X14))
& memberP(X13,sK59(X12,X13,X14))
& ssItem(sK59(X12,X13,X14)) )
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14) )
| ~ ssList(X13) )
| ~ ssItem(X12) )
& nil != sK53
& 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])],[f223,f350,f349,f348,f347,f346,f345,f344]) ).
fof(f443,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f444,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f448,plain,
! [X0] :
( ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f449,plain,
! [X0] :
( ssItem(sK50(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f450,plain,
! [X0] :
( cons(sK50(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f456,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f458,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f474,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f532,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f537,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f551,plain,
ssList(sK53),
inference(cnf_transformation,[],[f351]) ).
fof(f556,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f351]) ).
fof(f557,plain,
nil != sK53,
inference(cnf_transformation,[],[f351]) ).
fof(f558,plain,
! [X14,X12,X13] :
( ssItem(sK59(X12,X13,X14))
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14)
| ~ ssList(X13)
| ~ ssItem(X12) ),
inference(cnf_transformation,[],[f351]) ).
fof(f559,plain,
! [X14,X12,X13] :
( memberP(X13,sK59(X12,X13,X14))
| app(app(X13,cons(X12,nil)),X14) != sK53
| ~ ssList(X14)
| ~ ssList(X13)
| ~ ssItem(X12) ),
inference(cnf_transformation,[],[f351]) ).
fof(f573,plain,
! [X14,X12,X13] :
( memberP(X13,sK59(X12,X13,X14))
| app(app(X13,cons(X12,nil)),X14) != sK55
| ~ ssList(X14)
| ~ ssList(X13)
| ~ ssItem(X12) ),
inference(definition_unfolding,[],[f559,f556]) ).
fof(f574,plain,
! [X14,X12,X13] :
( ssItem(sK59(X12,X13,X14))
| app(app(X13,cons(X12,nil)),X14) != sK55
| ~ ssList(X14)
| ~ ssList(X13)
| ~ ssItem(X12) ),
inference(definition_unfolding,[],[f558,f556]) ).
fof(f575,plain,
nil != sK55,
inference(definition_unfolding,[],[f557,f556]) ).
fof(f577,plain,
ssList(sK55),
inference(definition_unfolding,[],[f551,f556]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f443]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f444]) ).
cnf(c_145,plain,
( ~ ssList(X0)
| cons(sK50(X0),sK49(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f450]) ).
cnf(c_146,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK50(X0)) ),
inference(cnf_transformation,[],[f449]) ).
cnf(c_147,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK49(X0)) ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f456]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f458]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f474]) ).
cnf(c_227,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = cons(X0,X1) ),
inference(cnf_transformation,[],[f532]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f537]) ).
cnf(c_256,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sK59(X1,X0,X2)) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_257,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ssItem(sK59(X1,X0,X2)) ),
inference(cnf_transformation,[],[f574]) ).
cnf(c_258,negated_conjecture,
nil != sK55,
inference(cnf_transformation,[],[f575]) ).
cnf(c_262,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f577]) ).
cnf(c_9155,negated_conjecture,
ssList(sK55),
inference(subtyping,[status(esa)],[c_262]) ).
cnf(c_9157,negated_conjecture,
nil != sK55,
inference(subtyping,[status(esa)],[c_258]) ).
cnf(c_9158,negated_conjecture,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK55
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssItem(sK59(X0_14,X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_257]) ).
cnf(c_9159,negated_conjecture,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != sK55
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| memberP(X0_13,sK59(X0_14,X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_256]) ).
cnf(c_9180,plain,
( ~ ssList(X0_13)
| app(X0_13,nil) = X0_13 ),
inference(subtyping,[status(esa)],[c_232]) ).
cnf(c_9184,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| app(cons(X0_14,nil),X0_13) = cons(X0_14,X0_13) ),
inference(subtyping,[status(esa)],[c_227]) ).
cnf(c_9229,plain,
( ~ memberP(nil,X0_14)
| ~ ssItem(X0_14) ),
inference(subtyping,[status(esa)],[c_171]) ).
cnf(c_9245,plain,
( ~ ssList(X0_13)
| app(nil,X0_13) = X0_13 ),
inference(subtyping,[status(esa)],[c_155]) ).
cnf(c_9247,plain,
( ~ ssList(X0_13)
| ~ ssList(X1_13)
| ssList(app(X0_13,X1_13)) ),
inference(subtyping,[status(esa)],[c_153]) ).
cnf(c_9253,plain,
( ~ ssList(X0_13)
| X0_13 = nil
| ssList(sK49(X0_13)) ),
inference(subtyping,[status(esa)],[c_147]) ).
cnf(c_9254,plain,
( ~ ssList(X0_13)
| X0_13 = nil
| ssItem(sK50(X0_13)) ),
inference(subtyping,[status(esa)],[c_146]) ).
cnf(c_9255,plain,
( ~ ssList(X0_13)
| cons(sK50(X0_13),sK49(X0_13)) = X0_13
| X0_13 = nil ),
inference(subtyping,[status(esa)],[c_145]) ).
cnf(c_9260,plain,
( ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ssList(cons(X0_14,X0_13)) ),
inference(subtyping,[status(esa)],[c_140]) ).
cnf(c_9338,plain,
X0_13 = X0_13,
theory(equality) ).
cnf(c_9340,plain,
( X0_13 != X1_13
| X2_13 != X1_13
| X2_13 = X0_13 ),
theory(equality) ).
cnf(c_9344,plain,
( X0_13 != X1_13
| X2_13 != X3_13
| app(X0_13,X2_13) = app(X1_13,X3_13) ),
theory(equality) ).
cnf(c_9367,plain,
nil = nil,
inference(instantiation,[status(thm)],[c_9338]) ).
cnf(c_12383,plain,
( nil != X0_13
| sK55 != X0_13
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_9340]) ).
cnf(c_12384,plain,
( nil != nil
| sK55 != nil
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_12383]) ).
cnf(c_12791,plain,
( ~ ssList(sK55)
| cons(sK50(sK55),sK49(sK55)) = sK55
| sK55 = nil ),
inference(instantiation,[status(thm)],[c_9255]) ).
cnf(c_12796,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssItem(sK50(sK55)) ),
inference(instantiation,[status(thm)],[c_9254]) ).
cnf(c_12797,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssList(sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_9253]) ).
cnf(c_14581,plain,
( cons(X0_14,X0_13) != X1_13
| X2_13 != X1_13
| X2_13 = cons(X0_14,X0_13) ),
inference(instantiation,[status(thm)],[c_9340]) ).
cnf(c_16385,plain,
sK55 = sK55,
inference(instantiation,[status(thm)],[c_9338]) ).
cnf(c_21753,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| X0_13 != sK55
| X0_13 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_14581]) ).
cnf(c_25958,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| sK55 != sK55
| sK55 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_21753]) ).
cnf(c_27490,plain,
( ~ ssList(X0_13)
| app(sK49(X0_13),nil) = sK49(X0_13)
| X0_13 = nil ),
inference(superposition,[status(thm)],[c_9253,c_9180]) ).
cnf(c_47864,plain,
( app(sK49(sK55),nil) = sK49(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_9155,c_27490]) ).
cnf(c_47906,plain,
app(sK49(sK55),nil) = sK49(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_47864,c_9157]) ).
cnf(c_92988,plain,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != X2_13
| sK55 != X2_13
| app(app(X0_13,cons(X0_14,nil)),X1_13) = sK55 ),
inference(instantiation,[status(thm)],[c_9340]) ).
cnf(c_93274,plain,
( X0_13 != X1_13
| sK55 != X1_13
| sK55 = X0_13 ),
inference(instantiation,[status(thm)],[c_9340]) ).
cnf(c_93737,plain,
( ~ ssList(cons(X0_14,X0_13))
| app(nil,cons(X0_14,X0_13)) = cons(X0_14,X0_13) ),
inference(instantiation,[status(thm)],[c_9245]) ).
cnf(c_95703,plain,
( app(X0_13,cons(X0_14,nil)) != X1_13
| X2_13 != X3_13
| app(app(X0_13,cons(X0_14,nil)),X2_13) = app(X1_13,X3_13) ),
inference(instantiation,[status(thm)],[c_9344]) ).
cnf(c_104145,plain,
( app(nil,cons(X0_14,nil)) != cons(X0_14,nil)
| X0_13 != X1_13
| app(app(nil,cons(X0_14,nil)),X0_13) = app(cons(X0_14,nil),X1_13) ),
inference(instantiation,[status(thm)],[c_95703]) ).
cnf(c_127897,plain,
( ~ ssList(cons(sK50(sK55),X0_13))
| app(nil,cons(sK50(sK55),X0_13)) = cons(sK50(sK55),X0_13) ),
inference(instantiation,[status(thm)],[c_93737]) ).
cnf(c_127899,plain,
( ~ ssList(cons(sK50(sK55),nil))
| app(nil,cons(sK50(sK55),nil)) = cons(sK50(sK55),nil) ),
inference(instantiation,[status(thm)],[c_127897]) ).
cnf(c_135447,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssList(cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_9260]) ).
cnf(c_155127,plain,
( X0_13 != cons(sK50(sK55),sK49(sK55))
| sK55 != cons(sK50(sK55),sK49(sK55))
| sK55 = X0_13 ),
inference(instantiation,[status(thm)],[c_93274]) ).
cnf(c_155572,plain,
( app(cons(sK50(sK55),nil),sK49(sK55)) != cons(sK50(sK55),sK49(sK55))
| sK55 != cons(sK50(sK55),sK49(sK55))
| sK55 = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_155127]) ).
cnf(c_155573,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| app(cons(sK50(sK55),nil),sK49(sK55)) = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_9184]) ).
cnf(c_175643,plain,
( app(app(X0_13,cons(X0_14,nil)),X1_13) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(X0_13,cons(X0_14,nil)),X1_13) = sK55 ),
inference(instantiation,[status(thm)],[c_92988]) ).
cnf(c_180229,plain,
( app(app(nil,cons(sK50(sK55),nil)),X0_13) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(nil,cons(sK50(sK55),nil)),X0_13) = sK55 ),
inference(instantiation,[status(thm)],[c_175643]) ).
cnf(c_180230,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| X0_13 != sK49(sK55)
| app(app(nil,cons(sK50(sK55),nil)),X0_13) = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_104145]) ).
cnf(c_187974,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| app(sK49(sK55),nil) != sK49(sK55)
| app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) = app(cons(sK50(sK55),nil),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_180230]) ).
cnf(c_208699,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != app(cons(sK50(sK55),nil),sK49(sK55))
| sK55 != app(cons(sK50(sK55),nil),sK49(sK55))
| app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) = sK55 ),
inference(instantiation,[status(thm)],[c_180229]) ).
cnf(c_272048,plain,
( ~ ssList(sK49(sK55))
| ~ ssList(nil)
| ssList(app(sK49(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_9247]) ).
cnf(c_306030,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != sK55
| ~ ssList(app(sK49(sK55),nil))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| memberP(nil,sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9159]) ).
cnf(c_306031,plain,
( app(app(nil,cons(sK50(sK55),nil)),app(sK49(sK55),nil)) != sK55
| ~ ssList(app(sK49(sK55),nil))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssItem(sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9158]) ).
cnf(c_308665,plain,
( ~ memberP(nil,sK59(sK50(sK55),nil,app(sK49(sK55),nil)))
| ~ ssItem(sK59(sK50(sK55),nil,app(sK49(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_9229]) ).
cnf(c_308666,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_308665,c_306030,c_306031,c_272048,c_208699,c_187974,c_155573,c_155572,c_135447,c_127899,c_47906,c_25958,c_16385,c_12791,c_12796,c_12797,c_12384,c_9157,c_9367,c_141,c_262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC235+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 17:06:40 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 141.87/19.76 % SZS status Started for theBenchmark.p
% 141.87/19.76 % SZS status Theorem for theBenchmark.p
% 141.87/19.76
% 141.87/19.76 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 141.87/19.76
% 141.87/19.76 ------ iProver source info
% 141.87/19.76
% 141.87/19.76 git: date: 2023-05-31 18:12:56 +0000
% 141.87/19.76 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 141.87/19.76 git: non_committed_changes: false
% 141.87/19.76 git: last_make_outside_of_git: false
% 141.87/19.76
% 141.87/19.76 ------ Parsing...
% 141.87/19.76 ------ Clausification by vclausify_rel & Parsing by iProver...
% 141.87/19.76
% 141.87/19.76 ------ 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
% 141.87/19.76
% 141.87/19.76 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 141.87/19.76
% 141.87/19.76 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 141.87/19.76 ------ Proving...
% 141.87/19.76 ------ Problem Properties
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76 clauses 194
% 141.87/19.76 conjectures 14
% 141.87/19.76 EPR 55
% 141.87/19.76 Horn 126
% 141.87/19.76 unary 23
% 141.87/19.76 binary 40
% 141.87/19.76 lits 660
% 141.87/19.76 lits eq 89
% 141.87/19.76 fd_pure 0
% 141.87/19.76 fd_pseudo 0
% 141.87/19.76 fd_cond 21
% 141.87/19.76 fd_pseudo_cond 14
% 141.87/19.76 AC symbols 0
% 141.87/19.76
% 141.87/19.76 ------ Input Options Time Limit: Unbounded
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76 ------
% 141.87/19.76 Current options:
% 141.87/19.76 ------
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76 ------ Proving...
% 141.87/19.76
% 141.87/19.76
% 141.87/19.76 % SZS status Theorem for theBenchmark.p
% 141.87/19.76
% 141.87/19.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 141.95/19.76
% 141.95/19.77
%------------------------------------------------------------------------------