TSTP Solution File: SWC223+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC223+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.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:11:39 EDT 2024
% Result : Theorem 138.15s 19.29s
% Output : CNFRefutation 138.15s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f602)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',ax20) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,X8) )
| ( memberP(X10,X11)
& ~ leq(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X7,X4)
| ~ 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/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( ( ( memberP(X9,X11)
& ~ leq(X11,X8) )
| ( memberP(X10,X11)
& ~ leq(X8,X11) ) )
& ssItem(X11) )
& app(app(X9,cons(X8,nil)),X10) = X2
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ssItem(X7)
=> ( leq(X7,X4)
| ~ 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)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( ! [X11] :
( ssItem(X11)
=> ( leq(X11,X8)
| ~ leq(X8,X11)
| ~ memberP(X10,X11)
| ~ memberP(X9,X11) ) )
& app(app(X9,cons(X8,nil)),X10) = X0
& ssList(X10) )
& ssList(X9) )
& ssItem(X8) )
| nil = X0
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
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(f177,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& 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] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f246,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f247,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f246]) ).
fof(f248,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f247,f248]) ).
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(f331,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f177]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != X0
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
! [X8,X9,X10] :
( ? [X11] :
( ~ leq(X11,X8)
& leq(X8,X11)
& memberP(X10,X11)
& memberP(X9,X11)
& ssItem(X11) )
=> ( ~ leq(sK57(X8,X9,X10),X8)
& leq(X8,sK57(X8,X9,X10))
& memberP(X10,sK57(X8,X9,X10))
& memberP(X9,sK57(X8,X9,X10))
& ssItem(sK57(X8,X9,X10)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& ! [X8] :
( ! [X9] :
( ! [X10] :
( ( ~ leq(sK57(X8,X9,X10),X8)
& leq(X8,sK57(X8,X9,X10))
& memberP(X10,sK57(X8,X9,X10))
& memberP(X9,sK57(X8,X9,X10))
& ssItem(sK57(X8,X9,X10)) )
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssItem(X8) )
& 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])],[f223,f348,f347,f346,f345,f344]) ).
fof(f362,plain,
! [X0,X1] :
( ssList(sK11(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f363,plain,
! [X0,X1] :
( app(X1,sK11(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f364,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f441,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f446,plain,
! [X0] :
( ssList(sK49(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f447,plain,
! [X0] :
( ssItem(sK50(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f448,plain,
! [X0] :
( cons(sK50(X0),sK49(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f320]) ).
fof(f454,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f456,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f472,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f496,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f497,plain,
! [X0] :
( segmentP(nil,X0)
| nil != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f549,plain,
ssList(sK53),
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
nil != sK53,
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
! [X10,X8,X9] :
( ssItem(sK57(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
! [X10,X8,X9] :
( memberP(X9,sK57(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK53
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(cnf_transformation,[],[f349]) ).
fof(f566,plain,
! [X10,X8,X9] :
( memberP(X9,sK57(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f557,f554]) ).
fof(f567,plain,
! [X10,X8,X9] :
( ssItem(sK57(X8,X9,X10))
| app(app(X9,cons(X8,nil)),X10) != sK55
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssItem(X8) ),
inference(definition_unfolding,[],[f556,f554]) ).
fof(f568,plain,
nil != sK55,
inference(definition_unfolding,[],[f555,f554]) ).
fof(f570,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f554]) ).
fof(f574,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f364]) ).
fof(f590,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f497]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f574]) ).
cnf(c_62,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X1,sK11(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f363]) ).
cnf(c_63,plain,
( ~ frontsegP(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssList(sK11(X0,X1)) ),
inference(cnf_transformation,[],[f362]) ).
cnf(c_140,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ssList(cons(X0,X1)) ),
inference(cnf_transformation,[],[f441]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_145,plain,
( ~ ssList(X0)
| cons(sK50(X0),sK49(X0)) = X0
| X0 = nil ),
inference(cnf_transformation,[],[f448]) ).
cnf(c_146,plain,
( ~ ssList(X0)
| X0 = nil
| ssItem(sK50(X0)) ),
inference(cnf_transformation,[],[f447]) ).
cnf(c_147,plain,
( ~ ssList(X0)
| X0 = nil
| ssList(sK49(X0)) ),
inference(cnf_transformation,[],[f446]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f454]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f456]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f472]) ).
cnf(c_177,plain,
( ~ frontsegP(X0,X1)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(cons(X2,X0),cons(X2,X1)) ),
inference(cnf_transformation,[],[f602]) ).
cnf(c_195,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(cnf_transformation,[],[f590]) ).
cnf(c_196,plain,
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| X0 = nil ),
inference(cnf_transformation,[],[f496]) ).
cnf(c_251,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sK57(X1,X0,X2)) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_252,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ssItem(sK57(X1,X0,X2)) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_253,negated_conjecture,
nil != sK55,
inference(cnf_transformation,[],[f568]) ).
cnf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f570]) ).
cnf(c_307,plain,
( ~ segmentP(nil,nil)
| ~ ssList(nil)
| nil = nil ),
inference(instantiation,[status(thm)],[c_196]) ).
cnf(c_383,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_9091,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_257]) ).
cnf(c_9093,negated_conjecture,
nil != sK55,
inference(demodulation,[status(thm)],[c_253]) ).
cnf(c_9094,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ssItem(sK57(X1,X0,X2)) ),
inference(demodulation,[status(thm)],[c_252]) ).
cnf(c_9095,negated_conjecture,
( app(app(X0,cons(X1,nil)),X2) != sK55
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(X0,sK57(X1,X0,X2)) ),
inference(demodulation,[status(thm)],[c_251]) ).
cnf(c_9101,plain,
X0 = X0,
theory(equality) ).
cnf(c_9103,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_9110,plain,
( X0 != X1
| X2 != X3
| ~ frontsegP(X1,X3)
| frontsegP(X0,X2) ),
theory(equality) ).
cnf(c_12596,plain,
( ~ ssList(X0)
| app(nil,sK49(X0)) = sK49(X0)
| X0 = nil ),
inference(superposition,[status(thm)],[c_147,c_155]) ).
cnf(c_13363,plain,
( app(nil,sK49(sK55)) = sK49(sK55)
| nil = sK55 ),
inference(superposition,[status(thm)],[c_9091,c_12596]) ).
cnf(c_13364,plain,
app(nil,sK49(sK55)) = sK49(sK55),
inference(forward_subsumption_resolution,[status(thm)],[c_13363,c_9093]) ).
cnf(c_13615,plain,
( ~ ssList(sK49(sK55))
| ~ ssList(nil)
| frontsegP(sK49(sK55),nil) ),
inference(superposition,[status(thm)],[c_13364,c_383]) ).
cnf(c_13618,plain,
( ~ ssList(sK49(sK55))
| frontsegP(sK49(sK55),nil) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13615,c_141]) ).
cnf(c_14052,plain,
( nil != X0
| sK55 != X0
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_9103]) ).
cnf(c_14053,plain,
( nil != nil
| sK55 != nil
| nil = sK55 ),
inference(instantiation,[status(thm)],[c_14052]) ).
cnf(c_14752,plain,
( ~ ssList(sK55)
| cons(sK50(sK55),sK49(sK55)) = sK55
| sK55 = nil ),
inference(instantiation,[status(thm)],[c_145]) ).
cnf(c_14762,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssList(sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_147]) ).
cnf(c_14763,plain,
( ~ ssList(sK55)
| sK55 = nil
| ssItem(sK50(sK55)) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_14769,plain,
( X0 != X1
| sK55 != X1
| sK55 = X0 ),
inference(instantiation,[status(thm)],[c_9103]) ).
cnf(c_23283,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ssList(cons(sK50(sK55),X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_23296,plain,
( ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssList(cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_23283]) ).
cnf(c_23336,plain,
( ~ frontsegP(X0,X1)
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(cons(sK50(sK55),X0),cons(sK50(sK55),X1)) ),
inference(instantiation,[status(thm)],[c_177]) ).
cnf(c_25829,plain,
sK55 = sK55,
inference(instantiation,[status(thm)],[c_9101]) ).
cnf(c_30163,plain,
( app(app(X0,cons(X1,nil)),sK11(sK55,app(X0,cons(X1,nil)))) != sK55
| ~ ssList(sK11(sK55,app(X0,cons(X1,nil))))
| ~ ssItem(X1)
| ~ ssList(X0)
| ssItem(sK57(X1,X0,sK11(sK55,app(X0,cons(X1,nil))))) ),
inference(instantiation,[status(thm)],[c_9094]) ).
cnf(c_36837,plain,
( ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| ssList(app(X1,cons(X0,nil))) ),
inference(instantiation,[status(thm)],[c_153]) ).
cnf(c_37239,plain,
( app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ssItem(sK57(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_30163]) ).
cnf(c_37240,plain,
( app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| ssItem(sK57(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_37239]) ).
cnf(c_42601,plain,
( X0 != sK55
| sK55 != sK55
| sK55 = X0 ),
inference(instantiation,[status(thm)],[c_14769]) ).
cnf(c_54381,plain,
( ~ frontsegP(sK55,app(X0,cons(sK50(sK55),nil)))
| ~ ssList(app(X0,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil)))) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_54382,plain,
( ~ frontsegP(sK55,app(nil,cons(sK50(sK55),nil)))
| ~ ssList(app(nil,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil)))) ),
inference(instantiation,[status(thm)],[c_54381]) ).
cnf(c_72187,plain,
( ~ ssList(cons(sK50(sK55),nil))
| ~ ssList(X0)
| ssList(app(X0,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_36837]) ).
cnf(c_72189,plain,
( ~ ssList(cons(sK50(sK55),nil))
| ~ ssList(nil)
| ssList(app(nil,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_72187]) ).
cnf(c_75576,plain,
( cons(sK50(sK55),sK49(sK55)) != sK55
| sK55 != sK55
| sK55 = cons(sK50(sK55),sK49(sK55)) ),
inference(instantiation,[status(thm)],[c_42601]) ).
cnf(c_158271,plain,
( ~ frontsegP(sK49(sK55),X0)
| ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| ~ ssList(X0)
| frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),X0)) ),
inference(instantiation,[status(thm)],[c_23336]) ).
cnf(c_158273,plain,
( ~ frontsegP(sK49(sK55),nil)
| ~ ssItem(sK50(sK55))
| ~ ssList(sK49(sK55))
| ~ ssList(nil)
| frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),nil)) ),
inference(instantiation,[status(thm)],[c_158271]) ).
cnf(c_193654,plain,
( ~ ssList(cons(X0,nil))
| app(nil,cons(X0,nil)) = cons(X0,nil) ),
inference(instantiation,[status(thm)],[c_155]) ).
cnf(c_196288,plain,
( app(app(X0,cons(sK50(sK55),nil)),X1) != sK55
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sK57(sK50(sK55),X0,X1)) ),
inference(instantiation,[status(thm)],[c_9095]) ).
cnf(c_204945,plain,
( ~ frontsegP(sK55,app(X0,cons(X1,nil)))
| ~ ssList(app(X0,cons(X1,nil)))
| ~ ssList(sK55)
| app(app(X0,cons(X1,nil)),sK11(sK55,app(X0,cons(X1,nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_213353,plain,
( app(X0,cons(X1,nil)) != X2
| sK55 != X3
| ~ frontsegP(X3,X2)
| frontsegP(sK55,app(X0,cons(X1,nil))) ),
inference(instantiation,[status(thm)],[c_9110]) ).
cnf(c_247094,plain,
( app(X0,cons(X1,nil)) != X2
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),X2)
| frontsegP(sK55,app(X0,cons(X1,nil))) ),
inference(instantiation,[status(thm)],[c_213353]) ).
cnf(c_269907,plain,
( ~ frontsegP(sK55,app(X0,cons(sK50(sK55),nil)))
| ~ ssList(app(X0,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_204945]) ).
cnf(c_269909,plain,
( app(app(X0,cons(sK50(sK55),nil)),sK11(sK55,app(X0,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(X0,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(X0)
| memberP(X0,sK57(sK50(sK55),X0,sK11(sK55,app(X0,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_196288]) ).
cnf(c_269913,plain,
( ~ frontsegP(sK55,app(nil,cons(sK50(sK55),nil)))
| ~ ssList(app(nil,cons(sK50(sK55),nil)))
| ~ ssList(sK55)
| app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) = sK55 ),
inference(instantiation,[status(thm)],[c_269907]) ).
cnf(c_269916,plain,
( app(app(nil,cons(sK50(sK55),nil)),sK11(sK55,app(nil,cons(sK50(sK55),nil)))) != sK55
| ~ ssList(sK11(sK55,app(nil,cons(sK50(sK55),nil))))
| ~ ssItem(sK50(sK55))
| ~ ssList(nil)
| memberP(nil,sK57(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_269909]) ).
cnf(c_276448,plain,
( app(X0,cons(sK50(sK55),nil)) != X1
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),X1)
| frontsegP(sK55,app(X0,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_247094]) ).
cnf(c_312117,plain,
( app(nil,cons(sK50(sK55),nil)) != cons(sK50(sK55),nil)
| sK55 != cons(sK50(sK55),sK49(sK55))
| ~ frontsegP(cons(sK50(sK55),sK49(sK55)),cons(sK50(sK55),nil))
| frontsegP(sK55,app(nil,cons(sK50(sK55),nil))) ),
inference(instantiation,[status(thm)],[c_276448]) ).
cnf(c_312118,plain,
( ~ ssList(cons(sK50(sK55),nil))
| app(nil,cons(sK50(sK55),nil)) = cons(sK50(sK55),nil) ),
inference(instantiation,[status(thm)],[c_193654]) ).
cnf(c_322492,plain,
( ~ memberP(nil,sK57(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil)))))
| ~ ssItem(sK57(sK50(sK55),nil,sK11(sK55,app(nil,cons(sK50(sK55),nil))))) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_322493,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_322492,c_312118,c_312117,c_269916,c_269913,c_158273,c_75576,c_72189,c_54382,c_37240,c_25829,c_23296,c_14752,c_14762,c_14763,c_14053,c_13618,c_307,c_195,c_253,c_141,c_257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC223+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 2 23:52:06 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 138.15/19.29 % SZS status Started for theBenchmark.p
% 138.15/19.29 % SZS status Theorem for theBenchmark.p
% 138.15/19.29
% 138.15/19.29 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 138.15/19.29
% 138.15/19.29 ------ iProver source info
% 138.15/19.29
% 138.15/19.29 git: date: 2024-05-02 19:28:25 +0000
% 138.15/19.29 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 138.15/19.29 git: non_committed_changes: false
% 138.15/19.29
% 138.15/19.29 ------ Parsing...
% 138.15/19.29 ------ Clausification by vclausify_rel & Parsing by iProver...
% 138.15/19.29
% 138.15/19.29 ------ 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
% 138.15/19.29
% 138.15/19.29 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 138.15/19.29
% 138.15/19.29 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 138.15/19.29 ------ Proving...
% 138.15/19.29 ------ Problem Properties
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 clauses 190
% 138.15/19.29 conjectures 10
% 138.15/19.29 EPR 52
% 138.15/19.29 Horn 122
% 138.15/19.29 unary 19
% 138.15/19.29 binary 40
% 138.15/19.29 lits 660
% 138.15/19.29 lits eq 86
% 138.15/19.29 fd_pure 0
% 138.15/19.29 fd_pseudo 0
% 138.15/19.29 fd_cond 21
% 138.15/19.29 fd_pseudo_cond 14
% 138.15/19.29 AC symbols 0
% 138.15/19.29
% 138.15/19.29 ------ Schedule dynamic 5 is on
% 138.15/19.29
% 138.15/19.29 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 ------
% 138.15/19.29 Current options:
% 138.15/19.29 ------
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 ------ Proving...
% 138.15/19.29 Proof_search_loop: time out after: 5701 full_loop iterations
% 138.15/19.29
% 138.15/19.29 ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 ------
% 138.15/19.29 Current options:
% 138.15/19.29 ------
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 ------ Proving...
% 138.15/19.29
% 138.15/19.29
% 138.15/19.29 % SZS status Theorem for theBenchmark.p
% 138.15/19.29
% 138.15/19.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 138.15/19.29
% 138.15/19.30
%------------------------------------------------------------------------------