TSTP Solution File: SWC011+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC011+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n029.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:10:52 EDT 2024
% Result : Theorem 3.88s 1.18s
% Output : CNFRefutation 3.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 10 unt; 0 def)
% Number of atoms : 347 ( 118 equ)
% Maximal formula atoms : 19 ( 6 avg)
% Number of connectives : 425 ( 134 ~; 122 |; 141 &)
% ( 0 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 213 ( 24 sgn 99 !; 61 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(X5,X6) != X2
| app(app(X5,cons(X4,nil)),X6) != X3 ) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(X8,X9) = X0
& app(app(X8,cons(X7,nil)),X9) = X1
& ssList(X9) )
& ssList(X8) )
& ssItem(X7) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X0
| app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X0
| app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f233,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X0
| app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f234,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f223,f233]) ).
fof(f346,plain,
! [X2,X3,X0,X1] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X2
& app(app(X5,cons(X4,nil)),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X0
| app(app(X8,cons(X7,nil)),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X1,nil) )
| ~ sP6(X2,X3,X0,X1) ),
inference(nnf_transformation,[],[f233]) ).
fof(f347,plain,
! [X0,X1,X2,X3] :
( ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(rectify,[],[f346]) ).
fof(f348,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(X4,nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(sK54(X0,X1),nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssItem(sK54(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
! [X0,X1] :
( ? [X5] :
( ? [X6] :
( app(X5,X6) = X0
& app(app(X5,cons(sK54(X0,X1),nil)),X6) = X1
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( app(sK55(X0,X1),X6) = X0
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),X6) = X1
& ssList(X6) )
& ssList(sK55(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
! [X0,X1] :
( ? [X6] :
( app(sK55(X0,X1),X6) = X0
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),X6) = X1
& ssList(X6) )
=> ( app(sK55(X0,X1),sK56(X0,X1)) = X0
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X1
& ssList(sK56(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f351,plain,
! [X0,X1,X2,X3] :
( ( app(sK55(X0,X1),sK56(X0,X1)) = X0
& app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X1
& ssList(sK56(X0,X1))
& ssList(sK55(X0,X1))
& ssItem(sK54(X0,X1))
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
& neq(X3,nil) )
| ~ sP6(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK54,sK55,sK56])],[f347,f350,f349,f348]) ).
fof(f352,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,X0,X1) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK57,X1) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f353,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP6(X2,X3,sK57,X1) )
& sK57 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X2,X3,sK57,sK58) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f354,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(X2,X3,sK57,sK58) )
& sK57 = X2
& sK58 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(sK59,X3,sK57,sK58) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f355,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK58,nil) )
| sP6(sK59,X3,sK57,sK58) )
& sK57 = sK59
& sK58 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK60,nil)
& neq(sK58,nil) )
| sP6(sK59,sK60,sK57,sK58) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60) ) ),
introduced(choice_axiom,[]) ).
fof(f356,plain,
( ( ( ~ neq(sK60,nil)
& neq(sK58,nil) )
| sP6(sK59,sK60,sK57,sK58) )
& sK57 = sK59
& sK58 = sK60
& ssList(sK60)
& ssList(sK59)
& ssList(sK58)
& ssList(sK57) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60])],[f234,f355,f354,f353,f352]) ).
fof(f557,plain,
! [X2,X3,X0,X1,X8,X9,X7] :
( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f558,plain,
! [X2,X3,X0,X1] :
( ssItem(sK54(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f559,plain,
! [X2,X3,X0,X1] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f560,plain,
! [X2,X3,X0,X1] :
( ssList(sK56(X0,X1))
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f561,plain,
! [X2,X3,X0,X1] :
( app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X1
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f562,plain,
! [X2,X3,X0,X1] :
( app(sK55(X0,X1),sK56(X0,X1)) = X0
| ~ sP6(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f351]) ).
fof(f567,plain,
sK58 = sK60,
inference(cnf_transformation,[],[f356]) ).
fof(f568,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f356]) ).
fof(f569,plain,
( neq(sK58,nil)
| sP6(sK59,sK60,sK57,sK58) ),
inference(cnf_transformation,[],[f356]) ).
fof(f570,plain,
( ~ neq(sK60,nil)
| sP6(sK59,sK60,sK57,sK58) ),
inference(cnf_transformation,[],[f356]) ).
fof(f571,plain,
( ~ neq(sK60,nil)
| sP6(sK59,sK60,sK59,sK60) ),
inference(definition_unfolding,[],[f570,f568,f567]) ).
fof(f572,plain,
( neq(sK60,nil)
| sP6(sK59,sK60,sK59,sK60) ),
inference(definition_unfolding,[],[f569,f567,f568,f567]) ).
fof(f602,plain,
! [X3,X0,X1,X8,X9,X7] :
( app(app(X8,cons(X7,nil)),X9) != X3
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ sP6(X0,X1,app(X8,X9),X3) ),
inference(equality_resolution,[],[f557]) ).
fof(f603,plain,
! [X0,X1,X8,X9,X7] :
( ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ sP6(X0,X1,app(X8,X9),app(app(X8,cons(X7,nil)),X9)) ),
inference(equality_resolution,[],[f602]) ).
cnf(c_246,plain,
( ~ sP6(X0,X1,X2,X3)
| app(sK55(X0,X1),sK56(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f562]) ).
cnf(c_247,plain,
( ~ sP6(X0,X1,X2,X3)
| app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_248,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK56(X0,X1)) ),
inference(cnf_transformation,[],[f560]) ).
cnf(c_249,plain,
( ~ sP6(X0,X1,X2,X3)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_250,plain,
( ~ sP6(X0,X1,X2,X3)
| ssItem(sK54(X0,X1)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_251,plain,
( ~ sP6(X0,X1,app(X2,X3),app(app(X2,cons(X4,nil)),X3))
| ~ ssItem(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cnf_transformation,[],[f603]) ).
cnf(c_253,negated_conjecture,
( ~ neq(sK60,nil)
| sP6(sK59,sK60,sK59,sK60) ),
inference(cnf_transformation,[],[f571]) ).
cnf(c_254,negated_conjecture,
( sP6(sK59,sK60,sK59,sK60)
| neq(sK60,nil) ),
inference(cnf_transformation,[],[f572]) ).
cnf(c_378,negated_conjecture,
sP6(sK59,sK60,sK59,sK60),
inference(global_subsumption_just,[status(thm)],[c_254,c_254,c_253]) ).
cnf(c_380,negated_conjecture,
sP6(sK59,sK60,sK59,sK60),
inference(global_subsumption_just,[status(thm)],[c_253,c_378]) ).
cnf(c_3229,plain,
( X0 != sK59
| X1 != sK60
| X2 != sK59
| X3 != sK60
| ssItem(sK54(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_250,c_380]) ).
cnf(c_3230,plain,
ssItem(sK54(sK59,sK60)),
inference(unflattening,[status(thm)],[c_3229]) ).
cnf(c_3234,plain,
( X0 != sK59
| X1 != sK60
| X2 != sK59
| X3 != sK60
| ssList(sK55(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_249,c_380]) ).
cnf(c_3235,plain,
ssList(sK55(sK59,sK60)),
inference(unflattening,[status(thm)],[c_3234]) ).
cnf(c_3239,plain,
( X0 != sK59
| X1 != sK60
| X2 != sK59
| X3 != sK60
| ssList(sK56(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_248,c_380]) ).
cnf(c_3240,plain,
ssList(sK56(sK59,sK60)),
inference(unflattening,[status(thm)],[c_3239]) ).
cnf(c_3244,plain,
( X0 != sK59
| X1 != sK60
| X2 != sK59
| X3 != sK60
| app(app(sK55(X0,X1),cons(sK54(X0,X1),nil)),sK56(X0,X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_247,c_380]) ).
cnf(c_3245,plain,
app(app(sK55(sK59,sK60),cons(sK54(sK59,sK60),nil)),sK56(sK59,sK60)) = sK60,
inference(unflattening,[status(thm)],[c_3244]) ).
cnf(c_3249,plain,
( X0 != sK59
| X1 != sK60
| X2 != sK59
| X3 != sK60
| app(sK55(X0,X1),sK56(X0,X1)) = X0 ),
inference(resolution_lifted,[status(thm)],[c_246,c_380]) ).
cnf(c_3250,plain,
app(sK55(sK59,sK60),sK56(sK59,sK60)) = sK59,
inference(unflattening,[status(thm)],[c_3249]) ).
cnf(c_3254,plain,
( app(app(X0,cons(X1,nil)),X2) != sK60
| app(X0,X2) != sK59
| X3 != sK59
| X4 != sK60
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(resolution_lifted,[status(thm)],[c_251,c_380]) ).
cnf(c_3255,plain,
( app(app(X0,cons(X1,nil)),X2) != sK60
| app(X0,X2) != sK59
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(unflattening,[status(thm)],[c_3254]) ).
cnf(c_11827,plain,
( app(sK55(sK59,sK60),sK56(sK59,sK60)) != sK59
| ~ ssItem(sK54(sK59,sK60))
| ~ ssList(sK55(sK59,sK60))
| ~ ssList(sK56(sK59,sK60)) ),
inference(superposition,[status(thm)],[c_3245,c_3255]) ).
cnf(c_11828,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11827,c_3240,c_3235,c_3230,c_3250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC011+1 : TPTP v8.1.2. Released v2.4.0.
% 0.04/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 23:41:52 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.88/1.18 % SZS status Started for theBenchmark.p
% 3.88/1.18 % SZS status Theorem for theBenchmark.p
% 3.88/1.18
% 3.88/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.88/1.18
% 3.88/1.18 ------ iProver source info
% 3.88/1.18
% 3.88/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.88/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.88/1.18 git: non_committed_changes: false
% 3.88/1.18
% 3.88/1.18 ------ Parsing...
% 3.88/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.88/1.18
% 3.88/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 3.88/1.18
% 3.88/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.88/1.18
% 3.88/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.88/1.18 ------ Proving...
% 3.88/1.18 ------ Problem Properties
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18 clauses 189
% 3.88/1.18 conjectures 2
% 3.88/1.18 EPR 52
% 3.88/1.18 Horn 121
% 3.88/1.18 unary 24
% 3.88/1.18 binary 40
% 3.88/1.18 lits 631
% 3.88/1.18 lits eq 83
% 3.88/1.18 fd_pure 0
% 3.88/1.18 fd_pseudo 0
% 3.88/1.18 fd_cond 21
% 3.88/1.18 fd_pseudo_cond 14
% 3.88/1.18 AC symbols 0
% 3.88/1.18
% 3.88/1.18 ------ Schedule dynamic 5 is on
% 3.88/1.18
% 3.88/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18 ------
% 3.88/1.18 Current options:
% 3.88/1.18 ------
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18 ------ Proving...
% 3.88/1.18
% 3.88/1.18
% 3.88/1.18 % SZS status Theorem for theBenchmark.p
% 3.88/1.18
% 3.88/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.88/1.18
% 3.88/1.18
%------------------------------------------------------------------------------