TSTP Solution File: NUN085+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUN085+2 : TPTP v8.1.2. Released v7.3.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 : Thu Aug 31 12:49:23 EDT 2023
% Result : Theorem 3.38s 1.17s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of formulae : 105 ( 56 unt; 0 def)
% Number of atoms : 275 ( 98 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 252 ( 82 ~; 56 |; 100 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 205 ( 5 sgn; 93 !; 58 ?)
% 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(f11,axiom,
! [X40,X41] :
( ~ r2(X40,X41)
| ! [X42] :
( X41 != X42
| ~ r1(X42) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7a) ).
fof(f12,conjecture,
! [X38] :
( ! [X16] :
( ~ r1(X16)
| X16 != X38 )
| ! [X21] :
( ! [X15] :
( ~ r2(X15,X21)
| ~ r1(X15) )
| ! [X22] :
( ~ r3(X22,X21,X38)
| ~ r1(X22) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zeroplusoneidzero) ).
fof(f13,negated_conjecture,
~ ! [X38] :
( ! [X16] :
( ~ r1(X16)
| X16 != X38 )
| ! [X21] :
( ! [X15] :
( ~ r2(X15,X21)
| ~ r1(X15) )
| ! [X22] :
( ~ r3(X22,X21,X38)
| ~ r1(X22) ) ) ),
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(f23,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f24,plain,
~ ! [X0] :
( ! [X1] :
( ~ r1(X1)
| X0 != X1 )
| ! [X2] :
( ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) )
| ! [X4] :
( ~ r3(X4,X2,X0)
| ~ r1(X4) ) ) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( ? [X3] :
( r2(X3,X2)
& r1(X3) )
& ? [X4] :
( r3(X4,X2,X0)
& r1(X4) ) ) ),
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(f54,plain,
( ? [X0] :
( ? [X1] :
( r1(X1)
& X0 = X1 )
& ? [X2] :
( ? [X3] :
( r2(X3,X2)
& r1(X3) )
& ? [X4] :
( r3(X4,X2,X0)
& r1(X4) ) ) )
=> ( ? [X1] :
( r1(X1)
& sK20 = X1 )
& ? [X2] :
( ? [X3] :
( r2(X3,X2)
& r1(X3) )
& ? [X4] :
( r3(X4,X2,sK20)
& r1(X4) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
( ? [X1] :
( r1(X1)
& sK20 = X1 )
=> ( r1(sK21)
& sK20 = sK21 ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
( ? [X2] :
( ? [X3] :
( r2(X3,X2)
& r1(X3) )
& ? [X4] :
( r3(X4,X2,sK20)
& r1(X4) ) )
=> ( ? [X3] :
( r2(X3,sK22)
& r1(X3) )
& ? [X4] :
( r3(X4,sK22,sK20)
& r1(X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
( ? [X3] :
( r2(X3,sK22)
& r1(X3) )
=> ( r2(sK23,sK22)
& r1(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
( ? [X4] :
( r3(X4,sK22,sK20)
& r1(X4) )
=> ( r3(sK24,sK22,sK20)
& r1(sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
( r1(sK21)
& sK20 = sK21
& r2(sK23,sK22)
& r1(sK23)
& r3(sK24,sK22,sK20)
& r1(sK24) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24])],[f25,f58,f57,f56,f55,f54]) ).
fof(f61,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f62,plain,
! [X1] :
( sK0 = X1
| ~ r1(X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f66,plain,
! [X2,X0] :
( sK1(X0) = X2
| ~ r2(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f70,plain,
! [X3,X0,X1] :
( sK2(X0,X1) = X3
| ~ r3(X0,X1,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f76,plain,
! [X0,X1] : r2(X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f77,plain,
! [X0,X1] : r3(X0,sK7(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f78,plain,
! [X0,X1] : sK4(X0,X1) = sK6(X0,X1),
inference(cnf_transformation,[],[f38]) ).
fof(f79,plain,
! [X0,X1] : r2(sK5(X0,X1),sK4(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f80,plain,
! [X0,X1] : r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f87,plain,
! [X0] : r1(sK13(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f88,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f46]) ).
fof(f89,plain,
! [X0] : sK12(X0) = X0,
inference(cnf_transformation,[],[f46]) ).
fof(f98,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f99,plain,
r1(sK24),
inference(cnf_transformation,[],[f59]) ).
fof(f100,plain,
r3(sK24,sK22,sK20),
inference(cnf_transformation,[],[f59]) ).
fof(f101,plain,
r1(sK23),
inference(cnf_transformation,[],[f59]) ).
fof(f102,plain,
r2(sK23,sK22),
inference(cnf_transformation,[],[f59]) ).
fof(f103,plain,
sK20 = sK21,
inference(cnf_transformation,[],[f59]) ).
fof(f104,plain,
r1(sK21),
inference(cnf_transformation,[],[f59]) ).
fof(f105,plain,
! [X0,X1] : r2(sK5(X0,X1),sK6(X0,X1)),
inference(definition_unfolding,[],[f79,f78]) ).
fof(f108,plain,
r3(sK24,sK22,sK21),
inference(definition_unfolding,[],[f100,f103]) ).
fof(f110,plain,
r1(sK0),
inference(equality_resolution,[],[f61]) ).
fof(f118,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f98]) ).
cnf(c_49,plain,
( ~ r1(X0)
| X0 = sK0 ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_50,plain,
r1(sK0),
inference(cnf_transformation,[],[f110]) ).
cnf(c_51,plain,
( ~ r2(X0,X1)
| sK1(X0) = X1 ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_53,plain,
( ~ r3(X0,X1,X2)
| sK2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_57,plain,
r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f80]) ).
cnf(c_58,plain,
r2(sK5(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f105]) ).
cnf(c_59,plain,
r3(X0,sK7(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f77]) ).
cnf(c_60,plain,
r2(X0,sK7(X1,X0)),
inference(cnf_transformation,[],[f76]) ).
cnf(c_66,plain,
sK12(X0) = X0,
inference(cnf_transformation,[],[f89]) ).
cnf(c_67,plain,
r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f88]) ).
cnf(c_68,plain,
r1(sK13(X0)),
inference(cnf_transformation,[],[f87]) ).
cnf(c_76,plain,
( ~ r2(X0,X1)
| ~ r1(X1) ),
inference(cnf_transformation,[],[f118]) ).
cnf(c_77,negated_conjecture,
r1(sK21),
inference(cnf_transformation,[],[f104]) ).
cnf(c_78,negated_conjecture,
r2(sK23,sK22),
inference(cnf_transformation,[],[f102]) ).
cnf(c_79,negated_conjecture,
r1(sK23),
inference(cnf_transformation,[],[f101]) ).
cnf(c_80,negated_conjecture,
r3(sK24,sK22,sK21),
inference(cnf_transformation,[],[f108]) ).
cnf(c_81,negated_conjecture,
r1(sK24),
inference(cnf_transformation,[],[f99]) ).
cnf(c_197,plain,
r3(X0,sK13(X0),X0),
inference(light_normalisation,[status(thm)],[c_67,c_66]) ).
cnf(c_271,plain,
( sK5(X1,X3) != X4
| X0 != X1
| X2 != X3
| sK2(X0,X2) = X4 ),
inference(resolution_lifted,[status(thm)],[c_53,c_57]) ).
cnf(c_272,plain,
sK2(X0,X1) = sK5(X0,X1),
inference(unflattening,[status(thm)],[c_271]) ).
cnf(c_277,plain,
( sK6(X1,X2) != X4
| sK7(X1,X2) != X3
| X0 != X1
| sK2(X0,X3) = X4 ),
inference(resolution_lifted,[status(thm)],[c_53,c_59]) ).
cnf(c_278,plain,
sK2(X0,sK7(X0,X1)) = sK6(X0,X1),
inference(unflattening,[status(thm)],[c_277]) ).
cnf(c_289,plain,
( X0 != sK24
| X1 != sK22
| X2 != sK21
| sK2(X0,X1) = X2 ),
inference(resolution_lifted,[status(thm)],[c_53,c_80]) ).
cnf(c_290,plain,
sK2(sK24,sK22) = sK21,
inference(unflattening,[status(thm)],[c_289]) ).
cnf(c_294,plain,
( sK13(X1) != X2
| X0 != X1
| X1 != X3
| sK2(X0,X2) = X3 ),
inference(resolution_lifted,[status(thm)],[c_53,c_197]) ).
cnf(c_295,plain,
sK2(X0,sK13(X0)) = X0,
inference(unflattening,[status(thm)],[c_294]) ).
cnf(c_519,plain,
r2(sK2(X0,X1),sK6(X0,X1)),
inference(demodulation,[status(thm)],[c_58,c_272]) ).
cnf(c_909,plain,
sK13(X0) = sK0,
inference(superposition,[status(thm)],[c_68,c_49]) ).
cnf(c_912,plain,
sK0 = sK21,
inference(superposition,[status(thm)],[c_77,c_49]) ).
cnf(c_913,plain,
sK0 = sK23,
inference(superposition,[status(thm)],[c_79,c_49]) ).
cnf(c_914,plain,
sK0 = sK24,
inference(superposition,[status(thm)],[c_81,c_49]) ).
cnf(c_919,plain,
sK2(sK24,sK22) = sK0,
inference(demodulation,[status(thm)],[c_290,c_912]) ).
cnf(c_921,plain,
r2(sK0,sK22),
inference(demodulation,[status(thm)],[c_78,c_913]) ).
cnf(c_925,plain,
sK2(sK0,sK22) = sK0,
inference(light_normalisation,[status(thm)],[c_919,c_914]) ).
cnf(c_939,plain,
~ r1(sK22),
inference(superposition,[status(thm)],[c_921,c_76]) ).
cnf(c_968,plain,
sK7(X0,X1) = sK1(X1),
inference(superposition,[status(thm)],[c_60,c_51]) ).
cnf(c_972,plain,
sK1(sK0) = sK22,
inference(superposition,[status(thm)],[c_921,c_51]) ).
cnf(c_991,plain,
sK2(X0,sK0) = X0,
inference(light_normalisation,[status(thm)],[c_295,c_909]) ).
cnf(c_992,plain,
r2(X0,sK6(X0,sK0)),
inference(superposition,[status(thm)],[c_991,c_519]) ).
cnf(c_994,plain,
sK6(X0,sK0) = sK1(X0),
inference(superposition,[status(thm)],[c_992,c_51]) ).
cnf(c_1393,plain,
sK2(X0,sK1(X1)) = sK6(X0,X1),
inference(light_normalisation,[status(thm)],[c_278,c_968]) ).
cnf(c_1394,plain,
sK2(X0,sK22) = sK6(X0,sK0),
inference(superposition,[status(thm)],[c_972,c_1393]) ).
cnf(c_1400,plain,
sK2(X0,sK22) = sK1(X0),
inference(light_normalisation,[status(thm)],[c_1394,c_994]) ).
cnf(c_1405,plain,
sK1(sK0) = sK0,
inference(demodulation,[status(thm)],[c_925,c_1400]) ).
cnf(c_1406,plain,
sK0 = sK22,
inference(light_normalisation,[status(thm)],[c_1405,c_972]) ).
cnf(c_1426,plain,
~ r1(sK0),
inference(demodulation,[status(thm)],[c_939,c_1406]) ).
cnf(c_1428,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1426,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN085+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n026.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 : Sun Aug 27 09:50:49 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.38/1.17 % SZS status Started for theBenchmark.p
% 3.38/1.17 % SZS status Theorem for theBenchmark.p
% 3.38/1.17
% 3.38/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.38/1.17
% 3.38/1.17 ------ iProver source info
% 3.38/1.17
% 3.38/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.38/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.38/1.17 git: non_committed_changes: false
% 3.38/1.17 git: last_make_outside_of_git: false
% 3.38/1.17
% 3.38/1.17 ------ Parsing...
% 3.38/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.38/1.17
% 3.38/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.38/1.17
% 3.38/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.38/1.17
% 3.38/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.38/1.17 ------ Proving...
% 3.38/1.17 ------ Problem Properties
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17 clauses 29
% 3.38/1.17 conjectures 4
% 3.38/1.17 EPR 8
% 3.38/1.17 Horn 25
% 3.38/1.17 unary 21
% 3.38/1.17 binary 7
% 3.38/1.17 lits 38
% 3.38/1.17 lits eq 16
% 3.38/1.17 fd_pure 0
% 3.38/1.17 fd_pseudo 0
% 3.38/1.17 fd_cond 1
% 3.38/1.17 fd_pseudo_cond 2
% 3.38/1.17 AC symbols 0
% 3.38/1.17
% 3.38/1.17 ------ Schedule dynamic 5 is on
% 3.38/1.17
% 3.38/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17 ------
% 3.38/1.17 Current options:
% 3.38/1.17 ------
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17 ------ Proving...
% 3.38/1.17
% 3.38/1.17
% 3.38/1.17 % SZS status Theorem for theBenchmark.p
% 3.38/1.17
% 3.38/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.38/1.17
% 3.38/1.18
%------------------------------------------------------------------------------