TSTP Solution File: NUN056+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN056+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:53:11 EDT 2024
% Result : Theorem 7.98s 1.64s
% Output : CNFRefutation 7.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 88 ( 45 unt; 0 def)
% Number of atoms : 283 ( 67 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 308 ( 113 ~; 88 |; 98 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 250 ( 5 sgn 99 !; 66 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( X3 = X4
& r2(X2,X4) )
| ( X3 != X4
& ~ r2(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
! [X5,X6] :
? [X7] :
! [X8] :
( ( X7 = X8
& r3(X5,X6,X8) )
| ( X7 != X8
& ~ r3(X5,X6,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X13,X14] :
? [X15] :
( ? [X18] :
( r3(X13,X14,X18)
& r2(X18,X15) )
& ? [X16] :
( X15 = X16
& ? [X17] :
( r3(X13,X17,X16)
& r2(X14,X17) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1a) ).
fof(f8,axiom,
! [X29] :
? [X30] :
( X29 = X30
& ? [X31] :
( r3(X29,X31,X30)
& r1(X31) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4a) ).
fof(f12,conjecture,
? [X38] :
( ? [X15] :
( ? [X18] :
( ? [X41] :
( r2(X41,X18)
& r1(X41) )
& r2(X18,X15) )
& ? [X24] :
( ? [X30] :
( r2(X30,X24)
& r1(X30) )
& r3(X24,X15,X38) ) )
& ? [X21] :
( ? [X22] :
( ? [X16] :
( ? [X33] :
( r2(X33,X16)
& r1(X33) )
& r2(X16,X22) )
& r2(X22,X21) )
& X21 = X38 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneplustwoeqthree) ).
fof(f13,negated_conjecture,
~ ? [X38] :
( ? [X15] :
( ? [X18] :
( ? [X41] :
( r2(X41,X18)
& r1(X41) )
& r2(X18,X15) )
& ? [X24] :
( ? [X30] :
( r2(X30,X24)
& r1(X30) )
& r3(X24,X15,X38) ) )
& ? [X21] :
( ? [X22] :
( ? [X16] :
( ? [X33] :
( r2(X33,X16)
& r1(X33) )
& r2(X16,X22) )
& r2(X22,X21) )
& X21 = X38 ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f14,plain,
! [X0] :
? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
? [X2] :
! [X3] :
( ( X2 = X3
& r3(X0,X1,X3) )
| ( X2 != X3
& ~ r3(X0,X1,X3) ) ),
inference(rectify,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( X2 = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) ),
inference(rectify,[],[f5]) ).
fof(f20,plain,
! [X0] :
? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) ),
inference(rectify,[],[f8]) ).
fof(f24,plain,
~ ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( r2(X3,X2)
& r1(X3) )
& r2(X2,X1) )
& ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& r3(X4,X1,X0) ) )
& ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( r2(X9,X8)
& r1(X9) )
& r2(X8,X7) )
& r2(X7,X6) )
& X0 = X6 ) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) )
| ~ r2(X2,X1) )
| ! [X4] :
( ! [X5] :
( ~ r2(X5,X4)
| ~ r1(X5) )
| ~ r3(X4,X1,X0) ) )
| ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ~ r2(X9,X8)
| ~ r1(X9) )
| ~ r2(X8,X7) )
| ~ r2(X7,X6) )
| X0 != X6 ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f26,plain,
( ? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) )
=> ! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f26]) ).
fof(f28,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f28]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
! [X3] :
( ( X2 = X3
& r3(X0,X1,X3) )
| ( X2 != X3
& ~ r3(X0,X1,X3) ) )
=> ! [X3] :
( ( sK2(X0,X1) = X3
& r3(X0,X1,X3) )
| ( sK2(X0,X1) != X3
& ~ r3(X0,X1,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1,X3] :
( ( sK2(X0,X1) = X3
& r3(X0,X1,X3) )
| ( sK2(X0,X1) != X3
& ~ r3(X0,X1,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f15,f30]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( X2 = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) )
=> ( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,sK4(X0,X1)) )
& ? [X4] :
( sK4(X0,X1) = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,plain,
! [X0,X1] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,sK4(X0,X1)) )
=> ( r3(X0,X1,sK5(X0,X1))
& r2(sK5(X0,X1),sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X4] :
( sK4(X0,X1) = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) )
=> ( sK4(X0,X1) = sK6(X0,X1)
& ? [X5] :
( r3(X0,X5,sK6(X0,X1))
& r2(X1,X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
! [X0,X1] :
( ? [X5] :
( r3(X0,X5,sK6(X0,X1))
& r2(X1,X5) )
=> ( r3(X0,sK7(X0,X1),sK6(X0,X1))
& r2(X1,sK7(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
! [X0,X1] :
( r3(X0,X1,sK5(X0,X1))
& r2(sK5(X0,X1),sK4(X0,X1))
& sK4(X0,X1) = sK6(X0,X1)
& r3(X0,sK7(X0,X1),sK6(X0,X1))
& r2(X1,sK7(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f17,f37,f36,f35,f34]) ).
fof(f44,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) )
=> ( sK12(X0) = X0
& ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
=> ( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( sK12(X0) = X0
& r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f20,f45,f44]) ).
fof(f55,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f56,plain,
! [X1] :
( sK0 = X1
| ~ r1(X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f59,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f60,plain,
! [X2,X0] :
( sK1(X0) = X2
| ~ r2(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f64,plain,
! [X3,X0,X1] :
( sK2(X0,X1) = X3
| ~ r3(X0,X1,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f70,plain,
! [X0,X1] : r2(X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f71,plain,
! [X0,X1] : r3(X0,sK7(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f72,plain,
! [X0,X1] : sK4(X0,X1) = sK6(X0,X1),
inference(cnf_transformation,[],[f38]) ).
fof(f73,plain,
! [X0,X1] : r2(sK5(X0,X1),sK4(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f74,plain,
! [X0,X1] : r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f81,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f82,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f83,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f46]) ).
fof(f93,plain,
! [X2,X3,X0,X1,X8,X6,X9,X7,X4,X5] :
( ~ r2(X3,X2)
| ~ r1(X3)
| ~ r2(X2,X1)
| ~ r2(X5,X4)
| ~ r1(X5)
| ~ r3(X4,X1,X0)
| ~ r2(X9,X8)
| ~ r1(X9)
| ~ r2(X8,X7)
| ~ r2(X7,X6)
| X0 != X6 ),
inference(cnf_transformation,[],[f25]) ).
fof(f94,plain,
! [X0,X1] : r2(sK5(X0,X1),sK6(X0,X1)),
inference(definition_unfolding,[],[f73,f72]) ).
fof(f98,plain,
r1(sK0),
inference(equality_resolution,[],[f55]) ).
fof(f100,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f59]) ).
fof(f107,plain,
! [X2,X3,X1,X8,X6,X9,X7,X4,X5] :
( ~ r2(X3,X2)
| ~ r1(X3)
| ~ r2(X2,X1)
| ~ r2(X5,X4)
| ~ r1(X5)
| ~ r3(X4,X1,X6)
| ~ r2(X9,X8)
| ~ r1(X9)
| ~ r2(X8,X7)
| ~ r2(X7,X6) ),
inference(equality_resolution,[],[f93]) ).
cnf(c_49,plain,
( ~ r1(X0)
| X0 = sK0 ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_50,plain,
r1(sK0),
inference(cnf_transformation,[],[f98]) ).
cnf(c_51,plain,
( ~ r2(X0,X1)
| sK1(X0) = X1 ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_52,plain,
r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f100]) ).
cnf(c_53,plain,
( ~ r3(X0,X1,X2)
| sK2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_57,plain,
r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f74]) ).
cnf(c_58,plain,
r2(sK5(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f94]) ).
cnf(c_59,plain,
r3(X0,sK7(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f71]) ).
cnf(c_60,plain,
r2(X0,sK7(X1,X0)),
inference(cnf_transformation,[],[f70]) ).
cnf(c_66,plain,
sK12(X0) = X0,
inference(cnf_transformation,[],[f83]) ).
cnf(c_67,plain,
r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f82]) ).
cnf(c_68,plain,
r1(sK13(X0)),
inference(cnf_transformation,[],[f81]) ).
cnf(c_77,negated_conjecture,
( ~ r3(X0,X1,X2)
| ~ r2(X3,X1)
| ~ r2(X4,X3)
| ~ r2(X5,X0)
| ~ r2(X6,X7)
| ~ r2(X7,X8)
| ~ r2(X8,X2)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X6) ),
inference(cnf_transformation,[],[f107]) ).
cnf(c_81,plain,
r2(sK0,sK1(sK0)),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_203,plain,
r3(X0,sK13(X0),X0),
inference(light_normalisation,[status(thm)],[c_67,c_66]) ).
cnf(c_1319,plain,
sK7(X0,X1) = sK1(X1),
inference(superposition,[status(thm)],[c_60,c_51]) ).
cnf(c_2254,plain,
sK13(X0) = sK0,
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_2260,plain,
r3(X0,sK0,X0),
inference(superposition,[status(thm)],[c_2254,c_203]) ).
cnf(c_2348,plain,
sK2(X0,X1) = sK5(X0,X1),
inference(superposition,[status(thm)],[c_57,c_53]) ).
cnf(c_2351,plain,
sK2(X0,sK0) = X0,
inference(superposition,[status(thm)],[c_2260,c_53]) ).
cnf(c_2361,plain,
r2(sK2(X0,X1),sK6(X0,X1)),
inference(superposition,[status(thm)],[c_2348,c_58]) ).
cnf(c_2518,plain,
r2(X0,sK6(X0,sK0)),
inference(superposition,[status(thm)],[c_2351,c_2361]) ).
cnf(c_2528,plain,
r2(sK0,sK6(sK0,sK0)),
inference(instantiation,[status(thm)],[c_2518]) ).
cnf(c_3494,plain,
sK13(X0) = sK0,
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_3505,plain,
r3(X0,sK0,X0),
inference(superposition,[status(thm)],[c_3494,c_203]) ).
cnf(c_3526,plain,
r3(X0,sK1(X1),sK6(X0,X1)),
inference(superposition,[status(thm)],[c_1319,c_59]) ).
cnf(c_3554,plain,
sK2(X0,X1) = sK5(X0,X1),
inference(superposition,[status(thm)],[c_57,c_53]) ).
cnf(c_3558,plain,
sK2(X0,sK0) = X0,
inference(superposition,[status(thm)],[c_3505,c_53]) ).
cnf(c_3559,plain,
sK2(X0,sK1(X1)) = sK6(X0,X1),
inference(superposition,[status(thm)],[c_3526,c_53]) ).
cnf(c_3604,plain,
r2(sK2(X0,X1),sK6(X0,X1)),
inference(superposition,[status(thm)],[c_3554,c_58]) ).
cnf(c_3610,plain,
r2(X0,sK6(X0,sK0)),
inference(superposition,[status(thm)],[c_3558,c_3604]) ).
cnf(c_3612,plain,
sK1(sK2(X0,X1)) = sK6(X0,X1),
inference(superposition,[status(thm)],[c_3604,c_51]) ).
cnf(c_3629,plain,
sK6(X0,sK0) = sK1(X0),
inference(superposition,[status(thm)],[c_3610,c_51]) ).
cnf(c_5684,plain,
r2(sK6(X0,X1),sK6(X0,sK1(X1))),
inference(superposition,[status(thm)],[c_3559,c_3604]) ).
cnf(c_5815,plain,
sK1(sK6(X0,X1)) = sK6(X0,sK1(X1)),
inference(superposition,[status(thm)],[c_3559,c_3612]) ).
cnf(c_6040,plain,
r2(sK1(X0),sK6(X0,sK1(sK0))),
inference(superposition,[status(thm)],[c_3629,c_5684]) ).
cnf(c_6120,plain,
r2(sK6(X0,X1),sK1(sK6(X0,X1))),
inference(superposition,[status(thm)],[c_5815,c_5684]) ).
cnf(c_7990,plain,
( ~ r2(X0,sK7(X1,X2))
| ~ r2(X3,sK6(X1,X2))
| ~ r2(X4,X0)
| ~ r2(X5,X1)
| ~ r2(X6,X7)
| ~ r2(X7,X3)
| ~ r1(X4)
| ~ r1(X5)
| ~ r1(X6) ),
inference(superposition,[status(thm)],[c_59,c_77]) ).
cnf(c_8016,plain,
( ~ r2(X0,sK6(X1,X2))
| ~ r2(X3,X2)
| ~ r2(X4,X1)
| ~ r2(X5,X6)
| ~ r2(X6,X0)
| ~ r1(X3)
| ~ r1(X4)
| ~ r1(X5) ),
inference(superposition,[status(thm)],[c_60,c_7990]) ).
cnf(c_8018,plain,
( ~ r2(X0,sK1(X1))
| ~ r2(X2,sK1(sK0))
| ~ r2(X3,X1)
| ~ r2(X4,X0)
| ~ r1(X2)
| ~ r1(X3)
| ~ r1(X4) ),
inference(superposition,[status(thm)],[c_6040,c_8016]) ).
cnf(c_8072,plain,
( ~ r2(X0,sK6(X1,X2))
| ~ r2(X3,sK6(X1,X2))
| ~ r2(X4,sK1(sK0))
| ~ r1(X0)
| ~ r1(X3)
| ~ r1(X4) ),
inference(superposition,[status(thm)],[c_6120,c_8018]) ).
cnf(c_8075,plain,
( ~ r2(sK0,sK6(sK0,sK0))
| ~ r2(sK0,sK1(sK0))
| ~ r1(sK0) ),
inference(instantiation,[status(thm)],[c_8072]) ).
cnf(c_8076,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8075,c_2528,c_81,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUN056+2 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 21:58:28 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 7.98/1.64 % SZS status Started for theBenchmark.p
% 7.98/1.64 % SZS status Theorem for theBenchmark.p
% 7.98/1.64
% 7.98/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.98/1.64
% 7.98/1.64 ------ iProver source info
% 7.98/1.64
% 7.98/1.64 git: date: 2024-05-02 19:28:25 +0000
% 7.98/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.98/1.64 git: non_committed_changes: false
% 7.98/1.64
% 7.98/1.64 ------ Parsing...
% 7.98/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.98/1.64
% 7.98/1.64 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 1 sf_s rm: 2 0s sf_e pe_s pe_e
% 7.98/1.64
% 7.98/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.98/1.64
% 7.98/1.64 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.98/1.64 ------ Proving...
% 7.98/1.64 ------ Problem Properties
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64 clauses 27
% 7.98/1.64 conjectures 1
% 7.98/1.64 EPR 5
% 7.98/1.64 Horn 23
% 7.98/1.64 unary 17
% 7.98/1.64 binary 8
% 7.98/1.64 lits 46
% 7.98/1.64 lits eq 12
% 7.98/1.64 fd_pure 0
% 7.98/1.64 fd_pseudo 0
% 7.98/1.64 fd_cond 1
% 7.98/1.64 fd_pseudo_cond 3
% 7.98/1.64 AC symbols 0
% 7.98/1.64
% 7.98/1.64 ------ Input Options Time Limit: Unbounded
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64 ------
% 7.98/1.64 Current options:
% 7.98/1.64 ------
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64 ------ Proving...
% 7.98/1.64
% 7.98/1.64
% 7.98/1.64 % SZS status Theorem for theBenchmark.p
% 7.98/1.64
% 7.98/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.98/1.64
% 7.98/1.65
%------------------------------------------------------------------------------