TSTP Solution File: SWC315+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC315+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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:58 EDT 2024
% Result : Theorem 19.78s 3.66s
% Output : CNFRefutation 20.73s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
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(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f27,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,app(X1,X0)) = app(cons(X2,X1),X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax27) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f44,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( frontsegP(X2,X3)
& X0 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax44) ).
fof(f80,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X1,X2) = app(X1,X0)
=> X0 = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax80) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) ) ) )
| ( ( nil = X0
| nil != X1 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) = X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) ) ) )
| ( ( nil = X0
| nil != X1 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) = X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3
| ~ ssList(X5) ) ) )
| ( ( nil = X0
| nil != X1 )
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) = X0
| app(cons(X6,nil),X7) != X1
| ~ ssList(X7) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(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(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f27]) ).
fof(f135,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( frontsegP(X2,X3)
& X0 = X1 ) )
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f197,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X0 = X2
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f80]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( X0 = X2
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f197]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != X0
& nil = X1 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != X0
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f245,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(f246,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,[],[f245]) ).
fof(f247,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f248,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])],[f246,f247]) ).
fof(f316,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f326,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( frontsegP(cons(X0,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| X0 != X1 )
& ( ( frontsegP(X2,X3)
& X0 = X1 )
| ~ frontsegP(cons(X0,X2),cons(X1,X3)) ) )
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f157]) ).
fof(f327,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( ( frontsegP(cons(X0,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| X0 != X1 )
& ( ( frontsegP(X2,X3)
& X0 = X1 )
| ~ frontsegP(cons(X0,X2),cons(X1,X3)) ) )
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f326]) ).
fof(f339,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f201]) ).
fof(f340,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f339]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != X0
& nil = X1 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != X0
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = X1 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = X1 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = sK54 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = sK54 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = sK54 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = sK54 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ~ neq(sK56,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = sK56
& ssList(X5) )
& ssItem(X4) ) )
& ( ( nil != sK53
& nil = sK54 )
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK55
& app(cons(X4,nil),X5) = sK56
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK55 = app(X5,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X5)
& ssList(X5) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( sK55 = app(X5,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X5)
& ssList(X5) )
=> ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) != sK53
& app(cons(X6,nil),X7) = sK54
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( sK53 != app(X7,cons(sK59,nil))
& sK54 = app(cons(sK59,nil),X7)
& ssList(X7) )
& ssItem(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ? [X7] :
( sK53 != app(X7,cons(sK59,nil))
& sK54 = app(cons(sK59,nil),X7)
& ssList(X7) )
=> ( sK53 != app(sK60,cons(sK59,nil))
& sK54 = app(cons(sK59,nil),sK60)
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
( ( ~ neq(sK56,nil)
| ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58)
& ssItem(sK57) ) )
& ( ( nil != sK53
& nil = sK54 )
| ( sK53 != app(sK60,cons(sK59,nil))
& sK54 = app(cons(sK59,nil),sK60)
& ssList(sK60)
& ssItem(sK59) ) )
& ( nil != sK56
| nil = sK55 )
& 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,sK60])],[f222,f350,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f366,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f248]) ).
fof(f442,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f316]) ).
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(f445,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f456,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f457,plain,
! [X2,X0,X1] :
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f458,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f480,plain,
! [X2,X3,X0,X1] :
( X0 = X1
| ~ frontsegP(cons(X0,X2),cons(X1,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f327]) ).
fof(f531,plain,
! [X2,X0,X1] :
( X0 = X2
| app(X1,X2) != app(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f535,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f340]) ).
fof(f552,plain,
ssList(sK54),
inference(cnf_transformation,[],[f351]) ).
fof(f555,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f351]) ).
fof(f556,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f351]) ).
fof(f557,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f351]) ).
fof(f558,plain,
( nil = sK54
| ssItem(sK59) ),
inference(cnf_transformation,[],[f351]) ).
fof(f559,plain,
( nil = sK54
| ssList(sK60) ),
inference(cnf_transformation,[],[f351]) ).
fof(f560,plain,
( nil = sK54
| sK54 = app(cons(sK59,nil),sK60) ),
inference(cnf_transformation,[],[f351]) ).
fof(f561,plain,
( nil = sK54
| sK53 != app(sK60,cons(sK59,nil)) ),
inference(cnf_transformation,[],[f351]) ).
fof(f562,plain,
( nil != sK53
| ssItem(sK59) ),
inference(cnf_transformation,[],[f351]) ).
fof(f563,plain,
( nil != sK53
| ssList(sK60) ),
inference(cnf_transformation,[],[f351]) ).
fof(f564,plain,
( nil != sK53
| sK54 = app(cons(sK59,nil),sK60) ),
inference(cnf_transformation,[],[f351]) ).
fof(f565,plain,
( nil != sK53
| sK53 != app(sK60,cons(sK59,nil)) ),
inference(cnf_transformation,[],[f351]) ).
fof(f566,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f351]) ).
fof(f567,plain,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f351]) ).
fof(f568,plain,
( ~ neq(sK56,nil)
| sK56 = app(cons(sK57,nil),sK58) ),
inference(cnf_transformation,[],[f351]) ).
fof(f569,plain,
( ~ neq(sK56,nil)
| sK55 = app(sK58,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f351]) ).
fof(f570,plain,
( nil != sK55
| sK55 != app(sK60,cons(sK59,nil)) ),
inference(definition_unfolding,[],[f565,f556,f556]) ).
fof(f571,plain,
( nil != sK55
| sK56 = app(cons(sK59,nil),sK60) ),
inference(definition_unfolding,[],[f564,f556,f555]) ).
fof(f572,plain,
( nil != sK55
| ssList(sK60) ),
inference(definition_unfolding,[],[f563,f556]) ).
fof(f573,plain,
( nil != sK55
| ssItem(sK59) ),
inference(definition_unfolding,[],[f562,f556]) ).
fof(f574,plain,
( nil = sK56
| sK55 != app(sK60,cons(sK59,nil)) ),
inference(definition_unfolding,[],[f561,f555,f556]) ).
fof(f575,plain,
( nil = sK56
| sK56 = app(cons(sK59,nil),sK60) ),
inference(definition_unfolding,[],[f560,f555,f555]) ).
fof(f576,plain,
( nil = sK56
| ssList(sK60) ),
inference(definition_unfolding,[],[f559,f555]) ).
fof(f577,plain,
( nil = sK56
| ssItem(sK59) ),
inference(definition_unfolding,[],[f558,f555]) ).
fof(f578,plain,
ssList(sK56),
inference(definition_unfolding,[],[f552,f555]) ).
fof(f583,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f366]) ).
cnf(c_61,plain,
( ~ ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(cnf_transformation,[],[f583]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f442]) ).
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_142,plain,
( cons(X0,X1) != X1
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f445]) ).
cnf(c_153,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ssList(app(X0,X1)) ),
inference(cnf_transformation,[],[f456]) ).
cnf(c_154,plain,
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| cons(X0,app(X2,X1)) = app(cons(X0,X2),X1) ),
inference(cnf_transformation,[],[f457]) ).
cnf(c_155,plain,
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f458]) ).
cnf(c_179,plain,
( ~ frontsegP(cons(X0,X1),cons(X2,X3))
| ~ ssItem(X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| X0 = X2 ),
inference(cnf_transformation,[],[f480]) ).
cnf(c_226,plain,
( app(X0,X1) != app(X0,X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f531]) ).
cnf(c_230,plain,
( app(X0,X1) != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = nil ),
inference(cnf_transformation,[],[f535]) ).
cnf(c_246,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = sK55 ),
inference(cnf_transformation,[],[f569]) ).
cnf(c_247,negated_conjecture,
( ~ neq(sK56,nil)
| app(cons(sK57,nil),sK58) = sK56 ),
inference(cnf_transformation,[],[f568]) ).
cnf(c_248,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_249,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_250,negated_conjecture,
( app(sK60,cons(sK59,nil)) != sK55
| nil != sK55 ),
inference(cnf_transformation,[],[f570]) ).
cnf(c_251,negated_conjecture,
( nil != sK55
| app(cons(sK59,nil),sK60) = sK56 ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_252,negated_conjecture,
( nil != sK55
| ssList(sK60) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_253,negated_conjecture,
( nil != sK55
| ssItem(sK59) ),
inference(cnf_transformation,[],[f573]) ).
cnf(c_254,negated_conjecture,
( app(sK60,cons(sK59,nil)) != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f574]) ).
cnf(c_255,negated_conjecture,
( app(cons(sK59,nil),sK60) = sK56
| nil = sK56 ),
inference(cnf_transformation,[],[f575]) ).
cnf(c_256,negated_conjecture,
( nil = sK56
| ssList(sK60) ),
inference(cnf_transformation,[],[f576]) ).
cnf(c_257,negated_conjecture,
( nil = sK56
| ssItem(sK59) ),
inference(cnf_transformation,[],[f577]) ).
cnf(c_258,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_261,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f578]) ).
cnf(c_369,negated_conjecture,
ssItem(sK59),
inference(global_subsumption_just,[status(thm)],[c_257,c_257,c_253,c_258]) ).
cnf(c_371,negated_conjecture,
ssList(sK60),
inference(global_subsumption_just,[status(thm)],[c_256,c_256,c_252,c_258]) ).
cnf(c_379,negated_conjecture,
ssItem(sK59),
inference(global_subsumption_just,[status(thm)],[c_253,c_369]) ).
cnf(c_381,negated_conjecture,
ssList(sK60),
inference(global_subsumption_just,[status(thm)],[c_252,c_371]) ).
cnf(c_389,negated_conjecture,
app(cons(sK59,nil),sK60) = sK56,
inference(global_subsumption_just,[status(thm)],[c_255,c_258,c_255,c_251]) ).
cnf(c_391,negated_conjecture,
app(sK60,cons(sK59,nil)) != sK55,
inference(global_subsumption_just,[status(thm)],[c_254,c_258,c_254,c_250]) ).
cnf(c_393,negated_conjecture,
app(cons(sK59,nil),sK60) = sK56,
inference(global_subsumption_just,[status(thm)],[c_251,c_389]) ).
cnf(c_395,negated_conjecture,
app(sK60,cons(sK59,nil)) != sK55,
inference(global_subsumption_just,[status(thm)],[c_250,c_391]) ).
cnf(c_400,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(app(X0,X1),X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_153,c_61]) ).
cnf(c_3266,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssItem(sK57) ),
inference(resolution_lifted,[status(thm)],[c_138,c_249]) ).
cnf(c_3267,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssItem(sK57) ),
inference(unflattening,[status(thm)],[c_3266]) ).
cnf(c_3268,plain,
( sK56 = nil
| ssItem(sK57) ),
inference(global_subsumption_just,[status(thm)],[c_3267,c_261,c_141,c_3267]) ).
cnf(c_3276,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| ssList(sK58) ),
inference(resolution_lifted,[status(thm)],[c_138,c_248]) ).
cnf(c_3277,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| sK56 = nil
| ssList(sK58) ),
inference(unflattening,[status(thm)],[c_3276]) ).
cnf(c_3278,plain,
( sK56 = nil
| ssList(sK58) ),
inference(global_subsumption_just,[status(thm)],[c_3277,c_261,c_141,c_3277]) ).
cnf(c_3286,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| app(cons(sK57,nil),sK58) = sK56
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3287,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| app(cons(sK57,nil),sK58) = sK56
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3286]) ).
cnf(c_3288,plain,
( app(cons(sK57,nil),sK58) = sK56
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3287,c_261,c_141,c_3287]) ).
cnf(c_3296,plain,
( X0 != sK56
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK58,cons(sK57,nil)) = sK55
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_246]) ).
cnf(c_3297,plain,
( ~ ssList(nil)
| ~ ssList(sK56)
| app(sK58,cons(sK57,nil)) = sK55
| sK56 = nil ),
inference(unflattening,[status(thm)],[c_3296]) ).
cnf(c_3298,plain,
( app(sK58,cons(sK57,nil)) = sK55
| sK56 = nil ),
inference(global_subsumption_just,[status(thm)],[c_3297,c_261,c_141,c_3297]) ).
cnf(c_8945,plain,
cons(sK59,nil) = sP0_iProver_def,
definition ).
cnf(c_8946,plain,
app(sK60,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_8947,plain,
app(sP0_iProver_def,sK60) = sP2_iProver_def,
definition ).
cnf(c_8948,negated_conjecture,
sP1_iProver_def != sK55,
inference(demodulation,[status(thm)],[c_395,c_8945,c_8946]) ).
cnf(c_8949,negated_conjecture,
sP2_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_393,c_8947]) ).
cnf(c_8950,negated_conjecture,
ssList(sK60),
inference(demodulation,[status(thm)],[c_381]) ).
cnf(c_8951,negated_conjecture,
ssItem(sK59),
inference(demodulation,[status(thm)],[c_379]) ).
cnf(c_11806,plain,
( nil = sP2_iProver_def
| ssItem(sK57) ),
inference(light_normalisation,[status(thm)],[c_3268,c_8949]) ).
cnf(c_11811,plain,
( nil = sP2_iProver_def
| ssList(sK58) ),
inference(light_normalisation,[status(thm)],[c_3278,c_8949]) ).
cnf(c_11816,plain,
( app(cons(sK57,nil),sK58) = sP2_iProver_def
| nil = sP2_iProver_def ),
inference(light_normalisation,[status(thm)],[c_3288,c_8949]) ).
cnf(c_11821,plain,
( app(sK58,cons(sK57,nil)) = sK55
| nil = sP2_iProver_def ),
inference(light_normalisation,[status(thm)],[c_3298,c_8949]) ).
cnf(c_12254,plain,
app(nil,sK60) = sK60,
inference(superposition,[status(thm)],[c_8950,c_155]) ).
cnf(c_12524,plain,
( ~ ssItem(sK59)
| ~ ssList(nil)
| ssList(sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_8945,c_140]) ).
cnf(c_12527,plain,
ssList(sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_12524,c_141,c_8951]) ).
cnf(c_13659,plain,
( ~ ssList(X0)
| ~ ssItem(sK57)
| ssList(cons(sK57,X0)) ),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_13660,plain,
( ~ ssItem(sK57)
| ~ ssList(nil)
| ssList(cons(sK57,nil)) ),
inference(instantiation,[status(thm)],[c_13659]) ).
cnf(c_13699,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| nil = sP2_iProver_def
| frontsegP(sP2_iProver_def,cons(sK57,nil)) ),
inference(superposition,[status(thm)],[c_11816,c_400]) ).
cnf(c_13891,plain,
( nil != sP0_iProver_def
| ~ ssItem(sK59)
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_8945,c_142]) ).
cnf(c_13892,plain,
nil != sP0_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_13891,c_141,c_8951]) ).
cnf(c_17412,plain,
( nil != sP2_iProver_def
| ~ ssList(sK60)
| ~ ssList(sP0_iProver_def)
| nil = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_8947,c_230]) ).
cnf(c_17449,plain,
nil != sP2_iProver_def,
inference(forward_subsumption_resolution,[status(thm)],[c_17412,c_13892,c_12527,c_8950]) ).
cnf(c_17527,plain,
app(sK58,cons(sK57,nil)) = sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_11821,c_17449]) ).
cnf(c_17528,plain,
app(cons(sK57,nil),sK58) = sP2_iProver_def,
inference(backward_subsumption_resolution,[status(thm)],[c_11816,c_17449]) ).
cnf(c_17529,plain,
ssList(sK58),
inference(backward_subsumption_resolution,[status(thm)],[c_11811,c_17449]) ).
cnf(c_17530,plain,
ssItem(sK57),
inference(backward_subsumption_resolution,[status(thm)],[c_11806,c_17449]) ).
cnf(c_20024,plain,
( ~ ssList(cons(sK57,nil))
| ~ ssList(sK58)
| frontsegP(sP2_iProver_def,cons(sK57,nil)) ),
inference(superposition,[status(thm)],[c_17528,c_400]) ).
cnf(c_20034,plain,
( ~ ssList(cons(sK57,nil))
| frontsegP(sP2_iProver_def,cons(sK57,nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_20024,c_17529]) ).
cnf(c_22842,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| cons(sK59,app(X1,X0)) = app(cons(sK59,X1),X0) ),
inference(superposition,[status(thm)],[c_8951,c_154]) ).
cnf(c_26642,plain,
( app(sP0_iProver_def,X0) != sP2_iProver_def
| ~ ssList(X0)
| ~ ssList(sK60)
| ~ ssList(sP0_iProver_def)
| X0 = sK60 ),
inference(superposition,[status(thm)],[c_8947,c_226]) ).
cnf(c_26759,plain,
( app(sP0_iProver_def,X0) != sP2_iProver_def
| ~ ssList(X0)
| X0 = sK60 ),
inference(forward_subsumption_resolution,[status(thm)],[c_26642,c_12527,c_8950]) ).
cnf(c_34211,plain,
( ~ ssList(X0)
| cons(sK59,app(X0,sK60)) = app(cons(sK59,X0),sK60) ),
inference(superposition,[status(thm)],[c_8950,c_22842]) ).
cnf(c_34484,plain,
cons(sK59,app(nil,sK60)) = app(cons(sK59,nil),sK60),
inference(superposition,[status(thm)],[c_141,c_34211]) ).
cnf(c_34499,plain,
cons(sK59,sK60) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_34484,c_8945,c_8947,c_12254]) ).
cnf(c_35287,plain,
( ~ frontsegP(sP2_iProver_def,cons(X0,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssItem(sK59)
| ~ ssList(sK60)
| X0 = sK59 ),
inference(superposition,[status(thm)],[c_34499,c_179]) ).
cnf(c_35355,plain,
( ~ frontsegP(sP2_iProver_def,cons(X0,X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| X0 = sK59 ),
inference(forward_subsumption_resolution,[status(thm)],[c_35287,c_8950,c_8951]) ).
cnf(c_57332,plain,
frontsegP(sP2_iProver_def,cons(sK57,nil)),
inference(global_subsumption_just,[status(thm)],[c_20034,c_141,c_13660,c_13699,c_17530,c_17529,c_17449]) ).
cnf(c_57337,plain,
( ~ ssItem(sK57)
| ~ ssList(nil)
| sK57 = sK59 ),
inference(superposition,[status(thm)],[c_57332,c_35355]) ).
cnf(c_57339,plain,
sK57 = sK59,
inference(forward_subsumption_resolution,[status(thm)],[c_57337,c_141,c_17530]) ).
cnf(c_57369,plain,
app(cons(sK59,nil),sK58) = sP2_iProver_def,
inference(demodulation,[status(thm)],[c_17528,c_57339]) ).
cnf(c_57370,plain,
app(sK58,cons(sK59,nil)) = sK55,
inference(demodulation,[status(thm)],[c_17527,c_57339]) ).
cnf(c_57373,plain,
app(sK58,sP0_iProver_def) = sK55,
inference(light_normalisation,[status(thm)],[c_57370,c_8945]) ).
cnf(c_57374,plain,
app(sP0_iProver_def,sK58) = sP2_iProver_def,
inference(light_normalisation,[status(thm)],[c_57369,c_8945]) ).
cnf(c_57756,plain,
( ~ ssList(sK58)
| sK58 = sK60 ),
inference(superposition,[status(thm)],[c_57374,c_26759]) ).
cnf(c_57757,plain,
sK58 = sK60,
inference(forward_subsumption_resolution,[status(thm)],[c_57756,c_17529]) ).
cnf(c_57794,plain,
app(sK60,sP0_iProver_def) = sK55,
inference(demodulation,[status(thm)],[c_57373,c_57757]) ).
cnf(c_57843,plain,
sK55 = sP1_iProver_def,
inference(light_normalisation,[status(thm)],[c_57794,c_8946]) ).
cnf(c_58071,plain,
sP1_iProver_def != sP1_iProver_def,
inference(demodulation,[status(thm)],[c_8948,c_57843]) ).
cnf(c_58073,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_58071]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC315+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 23:30:01 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 19.78/3.66 % SZS status Started for theBenchmark.p
% 19.78/3.66 % SZS status Theorem for theBenchmark.p
% 19.78/3.66
% 19.78/3.66 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 19.78/3.66
% 19.78/3.66 ------ iProver source info
% 19.78/3.66
% 19.78/3.66 git: date: 2024-05-02 19:28:25 +0000
% 19.78/3.66 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 19.78/3.66 git: non_committed_changes: false
% 19.78/3.66
% 19.78/3.66 ------ Parsing...
% 19.78/3.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 19.78/3.66
% 19.78/3.66 ------ 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: 5 0s sf_e pe_s pe_e
% 19.78/3.66
% 19.78/3.66 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 19.78/3.66
% 19.78/3.66 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 19.78/3.66 ------ Proving...
% 19.78/3.66 ------ Problem Properties
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66 clauses 194
% 19.78/3.66 conjectures 7
% 19.78/3.66 EPR 58
% 19.78/3.66 Horn 122
% 19.78/3.66 unary 25
% 19.78/3.66 binary 45
% 19.78/3.66 lits 637
% 19.78/3.66 lits eq 91
% 19.78/3.66 fd_pure 0
% 19.78/3.66 fd_pseudo 0
% 19.78/3.66 fd_cond 21
% 19.78/3.66 fd_pseudo_cond 14
% 19.78/3.66 AC symbols 0
% 19.78/3.66
% 19.78/3.66 ------ Schedule dynamic 5 is on
% 19.78/3.66
% 19.78/3.66 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66 ------
% 19.78/3.66 Current options:
% 19.78/3.66 ------
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66 ------ Proving...
% 19.78/3.66
% 19.78/3.66
% 19.78/3.66 % SZS status Theorem for theBenchmark.p
% 19.78/3.66
% 19.78/3.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 20.73/3.66
% 20.73/3.67
%------------------------------------------------------------------------------