TSTP Solution File: KRS264+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : KRS264+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:34:01 EDT 2024
% Result : Theorem 20.78s 3.64s
% Output : CNFRefutation 20.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 81 ( 14 unt; 0 def)
% Number of atoms : 318 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 382 ( 145 ~; 138 |; 77 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 214 ( 12 sgn 94 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ! [X2] :
( model(X2,X0)
=> model(X2,X1) )
<=> status(X0,X1,thm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
fof(f12,axiom,
! [X0,X1] :
( ( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( ~ model(X4,X0)
& model(X4,X1) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,wth) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wth) ).
fof(f20,axiom,
! [X6,X7] :
( ? [X0,X1] :
( status(X0,X1,X7)
& status(X0,X1,X6) )
<=> mighta(X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta) ).
fof(f31,axiom,
? [X0,X1] :
( ? [X5] : ~ model(X5,X1)
& ? [X4] :
( model(X4,X1)
& ~ model(X4,X0) )
& ! [X3] :
( model(X3,X0)
=> model(X3,X1) )
& ? [X2] : model(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mixed_pair) ).
fof(f33,conjecture,
mighta(wth,thm),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mighta_wth_thm) ).
fof(f34,negated_conjecture,
~ mighta(wth,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f40,plain,
! [X0,X1] :
( ( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
& ! [X4] :
( model(X4,X0)
=> model(X4,X1) )
& ? [X5] : model(X5,X0) )
<=> status(X0,X1,wth) ),
inference(rectify,[],[f12]) ).
fof(f46,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
<=> mighta(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f57,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X0)
=> model(X4,X1) )
& ? [X5] : model(X5,X0) ),
inference(rectify,[],[f31]) ).
fof(f59,plain,
~ mighta(wth,thm),
inference(flattening,[],[f34]) ).
fof(f60,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X2,X3,X1)
& status(X2,X3,X0) )
=> mighta(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f46]) ).
fof(f63,plain,
! [X0,X1] :
( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
<=> status(X0,X1,thm) ),
inference(ennf_transformation,[],[f5]) ).
fof(f65,plain,
! [X0,X1] :
( ( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
<=> status(X0,X1,wth) ),
inference(ennf_transformation,[],[f40]) ).
fof(f70,plain,
! [X0,X1] :
( mighta(X0,X1)
| ! [X2,X3] :
( ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ) ),
inference(ennf_transformation,[],[f60]) ).
fof(f71,plain,
? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f95,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X2] :
( ~ model(X2,X1)
& model(X2,X0) ) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f96,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) ) ) ),
inference(rectify,[],[f95]) ).
fof(f97,plain,
! [X0,X1] :
( ? [X3] :
( ~ model(X3,X1)
& model(X3,X0) )
=> ( ~ model(sK9(X0,X1),X1)
& model(sK9(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
! [X0,X1] :
( ( ! [X2] :
( model(X2,X1)
| ~ model(X2,X0) )
| ~ status(X0,X1,thm) )
& ( status(X0,X1,thm)
| ( ~ model(sK9(X0,X1),X1)
& model(sK9(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f96,f97]) ).
fof(f136,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
| ~ status(X0,X1,wth) )
& ( status(X0,X1,wth)
| ! [X2] : model(X2,X1)
| ! [X3] :
( model(X3,X0)
| ~ model(X3,X1) )
| ? [X4] :
( ~ model(X4,X1)
& model(X4,X0) )
| ! [X5] : ~ model(X5,X0) ) ),
inference(nnf_transformation,[],[f65]) ).
fof(f137,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
| ~ status(X0,X1,wth) )
& ( status(X0,X1,wth)
| ! [X2] : model(X2,X1)
| ! [X3] :
( model(X3,X0)
| ~ model(X3,X1) )
| ? [X4] :
( ~ model(X4,X1)
& model(X4,X0) )
| ! [X5] : ~ model(X5,X0) ) ),
inference(flattening,[],[f136]) ).
fof(f138,plain,
! [X0,X1] :
( ( ( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
| ~ status(X0,X1,wth) )
& ( status(X0,X1,wth)
| ! [X6] : model(X6,X1)
| ! [X7] :
( model(X7,X0)
| ~ model(X7,X1) )
| ? [X8] :
( ~ model(X8,X1)
& model(X8,X0) )
| ! [X9] : ~ model(X9,X0) ) ),
inference(rectify,[],[f137]) ).
fof(f139,plain,
! [X1] :
( ? [X2] : ~ model(X2,X1)
=> ~ model(sK24(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
! [X0,X1] :
( ? [X3] :
( ~ model(X3,X0)
& model(X3,X1) )
=> ( ~ model(sK25(X0,X1),X0)
& model(sK25(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0] :
( ? [X5] : model(X5,X0)
=> model(sK26(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0,X1] :
( ? [X8] :
( ~ model(X8,X1)
& model(X8,X0) )
=> ( ~ model(sK27(X0,X1),X1)
& model(sK27(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1] :
( ( ( ~ model(sK24(X1),X1)
& ~ model(sK25(X0,X1),X0)
& model(sK25(X0,X1),X1)
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& model(sK26(X0),X0) )
| ~ status(X0,X1,wth) )
& ( status(X0,X1,wth)
| ! [X6] : model(X6,X1)
| ! [X7] :
( model(X7,X0)
| ~ model(X7,X1) )
| ( ~ model(sK27(X0,X1),X1)
& model(sK27(X0,X1),X0) )
| ! [X9] : ~ model(X9,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK24,sK25,sK26,sK27])],[f138,f142,f141,f140,f139]) ).
fof(f197,plain,
( ? [X0,X1] :
( ? [X2] : ~ model(X2,X1)
& ? [X3] :
( model(X3,X1)
& ~ model(X3,X0) )
& ! [X4] :
( model(X4,X1)
| ~ model(X4,X0) )
& ? [X5] : model(X5,X0) )
=> ( ? [X2] : ~ model(X2,sK51)
& ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& ? [X5] : model(X5,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
( ? [X2] : ~ model(X2,sK51)
=> ~ model(sK52,sK51) ),
introduced(choice_axiom,[]) ).
fof(f199,plain,
( ? [X3] :
( model(X3,sK51)
& ~ model(X3,sK50) )
=> ( model(sK53,sK51)
& ~ model(sK53,sK50) ) ),
introduced(choice_axiom,[]) ).
fof(f200,plain,
( ? [X5] : model(X5,sK50)
=> model(sK54,sK50) ),
introduced(choice_axiom,[]) ).
fof(f201,plain,
( ~ model(sK52,sK51)
& model(sK53,sK51)
& ~ model(sK53,sK50)
& ! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) )
& model(sK54,sK50) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK50,sK51,sK52,sK53,sK54])],[f71,f200,f199,f198,f197]) ).
fof(f218,plain,
! [X0,X1] :
( status(X0,X1,thm)
| model(sK9(X0,X1),X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f219,plain,
! [X0,X1] :
( status(X0,X1,thm)
| ~ model(sK9(X0,X1),X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f248,plain,
! [X0,X1,X6,X9,X7] :
( status(X0,X1,wth)
| model(X6,X1)
| model(X7,X0)
| ~ model(X7,X1)
| model(sK27(X0,X1),X0)
| ~ model(X9,X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f249,plain,
! [X0,X1,X6,X9,X7] :
( status(X0,X1,wth)
| model(X6,X1)
| model(X7,X0)
| ~ model(X7,X1)
| ~ model(sK27(X0,X1),X1)
| ~ model(X9,X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f251,plain,
! [X0,X1,X4] :
( model(X4,X1)
| ~ model(X4,X0)
| ~ status(X0,X1,wth) ),
inference(cnf_transformation,[],[f143]) ).
fof(f278,plain,
! [X2,X3,X0,X1] :
( mighta(X0,X1)
| ~ status(X2,X3,X1)
| ~ status(X2,X3,X0) ),
inference(cnf_transformation,[],[f70]) ).
fof(f290,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f291,plain,
! [X4] :
( model(X4,sK51)
| ~ model(X4,sK50) ),
inference(cnf_transformation,[],[f201]) ).
fof(f292,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f201]) ).
fof(f293,plain,
model(sK53,sK51),
inference(cnf_transformation,[],[f201]) ).
fof(f294,plain,
~ model(sK52,sK51),
inference(cnf_transformation,[],[f201]) ).
fof(f298,plain,
~ mighta(wth,thm),
inference(cnf_transformation,[],[f59]) ).
cnf(c_63,plain,
( ~ model(sK9(X0,X1),X1)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_64,plain,
( model(sK9(X0,X1),X0)
| status(X0,X1,thm) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_95,plain,
( ~ status(X0,X1,wth)
| ~ model(X2,X0)
| model(X2,X1) ),
inference(cnf_transformation,[],[f251]) ).
cnf(c_97,plain,
( ~ model(sK27(X0,X1),X1)
| ~ model(X2,X1)
| ~ model(X3,X0)
| status(X0,X1,wth)
| model(X2,X0)
| model(X4,X1) ),
inference(cnf_transformation,[],[f249]) ).
cnf(c_98,plain,
( ~ model(X0,X1)
| ~ model(X2,X3)
| model(sK27(X3,X1),X3)
| status(X3,X1,wth)
| model(X0,X3)
| model(X4,X1) ),
inference(cnf_transformation,[],[f248]) ).
cnf(c_122,plain,
( ~ status(X0,X1,X2)
| ~ status(X0,X1,X3)
| mighta(X3,X2) ),
inference(cnf_transformation,[],[f278]) ).
cnf(c_134,plain,
~ model(sK52,sK51),
inference(cnf_transformation,[],[f294]) ).
cnf(c_135,plain,
model(sK53,sK51),
inference(cnf_transformation,[],[f293]) ).
cnf(c_136,plain,
~ model(sK53,sK50),
inference(cnf_transformation,[],[f292]) ).
cnf(c_137,plain,
( ~ model(X0,sK50)
| model(X0,sK51) ),
inference(cnf_transformation,[],[f291]) ).
cnf(c_138,plain,
model(sK54,sK50),
inference(cnf_transformation,[],[f290]) ).
cnf(c_142,negated_conjecture,
~ mighta(wth,thm),
inference(cnf_transformation,[],[f298]) ).
cnf(c_974,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wth) ),
inference(resolution,[status(thm)],[c_122,c_142]) ).
cnf(c_1020,plain,
( ~ status(X0,X1,thm)
| ~ status(X0,X1,wth) ),
inference(prop_impl_just,[status(thm)],[c_974]) ).
cnf(c_1750,plain,
( ~ status(X0_13,X1_13,thm)
| ~ status(X0_13,X1_13,wth) ),
inference(subtyping,[status(esa)],[c_1020]) ).
cnf(c_1757,plain,
( ~ model(X0_15,sK50)
| model(X0_15,sK51) ),
inference(subtyping,[status(esa)],[c_137]) ).
cnf(c_1791,plain,
( ~ model(X0_15,X0_13)
| ~ model(X1_15,X1_13)
| model(sK27(X1_13,X0_13),X1_13)
| status(X1_13,X0_13,wth)
| model(X0_15,X1_13)
| model(X2_15,X0_13) ),
inference(subtyping,[status(esa)],[c_98]) ).
cnf(c_1792,plain,
( ~ model(sK27(X0_13,X1_13),X1_13)
| ~ model(X0_15,X1_13)
| ~ model(X1_15,X0_13)
| status(X0_13,X1_13,wth)
| model(X0_15,X0_13)
| model(X2_15,X1_13) ),
inference(subtyping,[status(esa)],[c_97]) ).
cnf(c_1794,plain,
( ~ status(X0_13,X1_13,wth)
| ~ model(X0_15,X0_13)
| model(X0_15,X1_13) ),
inference(subtyping,[status(esa)],[c_95]) ).
cnf(c_1825,plain,
( model(sK9(X0_13,X1_13),X0_13)
| status(X0_13,X1_13,thm) ),
inference(subtyping,[status(esa)],[c_64]) ).
cnf(c_1826,plain,
( ~ model(sK9(X0_13,X1_13),X1_13)
| status(X0_13,X1_13,thm) ),
inference(subtyping,[status(esa)],[c_63]) ).
cnf(c_2504,plain,
( ~ model(sK27(X0_13,sK51),sK50)
| model(sK27(X0_13,sK51),sK51) ),
inference(instantiation,[status(thm)],[c_1757]) ).
cnf(c_2506,plain,
( ~ model(sK27(sK50,sK51),sK50)
| model(sK27(sK50,sK51),sK51) ),
inference(instantiation,[status(thm)],[c_2504]) ).
cnf(c_2692,plain,
( ~ model(sK27(X0_13,sK51),sK51)
| ~ model(X0_15,X0_13)
| ~ model(X1_15,sK51)
| status(X0_13,sK51,wth)
| model(X1_15,X0_13)
| model(sK52,sK51) ),
inference(instantiation,[status(thm)],[c_1792]) ).
cnf(c_2694,plain,
( ~ model(X0_15,X0_13)
| ~ model(X1_15,sK51)
| model(sK27(X0_13,sK51),X0_13)
| status(X0_13,sK51,wth)
| model(X1_15,X0_13)
| model(sK52,sK51) ),
inference(instantiation,[status(thm)],[c_1791]) ).
cnf(c_3075,plain,
( ~ model(sK9(X0_13,sK51),sK51)
| status(X0_13,sK51,thm) ),
inference(instantiation,[status(thm)],[c_1826]) ).
cnf(c_3076,plain,
( model(sK9(X0_13,sK51),X0_13)
| status(X0_13,sK51,thm) ),
inference(instantiation,[status(thm)],[c_1825]) ).
cnf(c_3077,plain,
( model(sK9(sK50,sK51),sK50)
| status(sK50,sK51,thm) ),
inference(instantiation,[status(thm)],[c_3076]) ).
cnf(c_3078,plain,
( ~ model(sK9(sK50,sK51),sK51)
| status(sK50,sK51,thm) ),
inference(instantiation,[status(thm)],[c_3075]) ).
cnf(c_3083,plain,
( ~ model(sK27(sK50,sK51),sK51)
| ~ model(X0_15,sK50)
| ~ model(sK53,sK51)
| status(sK50,sK51,wth)
| model(sK52,sK51)
| model(sK53,sK50) ),
inference(instantiation,[status(thm)],[c_2692]) ).
cnf(c_3118,plain,
( ~ model(X0_15,X0_13)
| ~ model(sK53,sK51)
| model(sK27(X0_13,sK51),X0_13)
| status(X0_13,sK51,wth)
| model(sK53,X0_13)
| model(sK52,sK51) ),
inference(instantiation,[status(thm)],[c_2694]) ).
cnf(c_8029,plain,
( ~ status(sK50,sK51,thm)
| ~ status(sK50,sK51,wth) ),
inference(instantiation,[status(thm)],[c_1750]) ).
cnf(c_12534,plain,
( ~ model(sK9(X0_13,sK51),X1_13)
| ~ status(X1_13,sK51,wth)
| model(sK9(X0_13,sK51),sK51) ),
inference(instantiation,[status(thm)],[c_1794]) ).
cnf(c_12535,plain,
( ~ model(sK9(sK50,sK51),sK50)
| ~ status(sK50,sK51,wth)
| model(sK9(sK50,sK51),sK51) ),
inference(instantiation,[status(thm)],[c_12534]) ).
cnf(c_14001,plain,
( ~ model(sK27(sK50,sK51),sK51)
| ~ model(sK53,sK51)
| ~ model(sK54,sK50)
| status(sK50,sK51,wth)
| model(sK52,sK51)
| model(sK53,sK50) ),
inference(instantiation,[status(thm)],[c_3083]) ).
cnf(c_14241,plain,
( ~ model(sK53,sK51)
| ~ model(sK54,sK50)
| model(sK27(sK50,sK51),sK50)
| status(sK50,sK51,wth)
| model(sK52,sK51)
| model(sK53,sK50) ),
inference(instantiation,[status(thm)],[c_3118]) ).
cnf(c_14242,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14241,c_14001,c_12535,c_8029,c_3078,c_3077,c_2506,c_134,c_136,c_135,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS264+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n021.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 22:42:13 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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
% 20.78/3.64 % SZS status Started for theBenchmark.p
% 20.78/3.64 % SZS status Theorem for theBenchmark.p
% 20.78/3.64
% 20.78/3.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 20.78/3.64
% 20.78/3.64 ------ iProver source info
% 20.78/3.64
% 20.78/3.64 git: date: 2024-05-02 19:28:25 +0000
% 20.78/3.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 20.78/3.64 git: non_committed_changes: false
% 20.78/3.64
% 20.78/3.64 ------ Parsing...
% 20.78/3.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 20.78/3.64
% 20.78/3.64 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 20.78/3.64
% 20.78/3.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 20.78/3.64 ------ Proving...
% 20.78/3.64 ------ Problem Properties
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64 clauses 91
% 20.78/3.64 conjectures 0
% 20.78/3.64 EPR 39
% 20.78/3.64 Horn 72
% 20.78/3.64 unary 13
% 20.78/3.64 binary 47
% 20.78/3.64 lits 220
% 20.78/3.64 lits eq 0
% 20.78/3.64 fd_pure 0
% 20.78/3.64 fd_pseudo 0
% 20.78/3.64 fd_cond 0
% 20.78/3.64 fd_pseudo_cond 0
% 20.78/3.64 AC symbols 0
% 20.78/3.64
% 20.78/3.64 ------ Input Options Time Limit: Unbounded
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64 ------
% 20.78/3.64 Current options:
% 20.78/3.64 ------
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64 ------ Proving...
% 20.78/3.64
% 20.78/3.64
% 20.78/3.64 % SZS status Theorem for theBenchmark.p
% 20.78/3.64
% 20.78/3.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 20.78/3.64
% 20.78/3.65
%------------------------------------------------------------------------------