TSTP Solution File: PUZ129+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 13:20:21 EDT 2023
% Result : Theorem 1.41s 1.16s
% Output : CNFRefutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 68 ( 19 unt; 0 def)
% Number of atoms : 396 ( 116 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 488 ( 160 ~; 129 |; 158 &)
% ( 0 <=>; 41 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 177 ( 0 sgn; 95 !; 64 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
( ( ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( X14 = X15
& person(X15) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( property1(X10,healthy,pos)
& person(X10) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) )
& ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X0] :
( ( property1(X0,industrious,pos)
& property1(X0,honest,pos)
& person(X0) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(f2,negated_conjecture,
~ ( ( ! [X16] :
( cyclist(X16)
=> ? [X17] :
( X16 = X17
& person(X17) ) )
& ! [X14] :
( grocer(X14)
=> ? [X15] :
( X14 = X15
& person(X15) ) )
& ! [X12] :
( ( property1(X12,honest,pos)
& person(X12) )
=> ~ ? [X13] :
( X12 = X13
& property1(X13,dishonest,pos) ) )
& ! [X10] :
( ( property1(X10,healthy,pos)
& person(X10) )
=> ~ ? [X11] :
( X10 = X11
& property1(X11,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X6] :
( cyclist(X6)
=> ? [X7] :
( X6 = X7
& property1(X7,industrious,pos) ) )
& ! [X4] :
( ( property1(X4,industrious,pos)
& grocer(X4) )
=> ? [X5] :
( X4 = X5
& property1(X5,honest,pos) ) )
& ! [X2] :
( grocer(X2)
=> ~ ? [X3] :
( X2 = X3
& property1(X3,healthy,pos) ) )
& ! [X0] :
( ( property1(X0,industrious,pos)
& property1(X0,honest,pos)
& person(X0) )
=> ? [X1] :
( X0 = X1
& property1(X1,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f3,plain,
~ ( ( ! [X0] :
( cyclist(X0)
=> ? [X1] :
( X0 = X1
& person(X1) ) )
& ! [X2] :
( grocer(X2)
=> ? [X3] :
( X2 = X3
& person(X3) ) )
& ! [X4] :
( ( property1(X4,honest,pos)
& person(X4) )
=> ~ ? [X5] :
( X4 = X5
& property1(X5,dishonest,pos) ) )
& ! [X6] :
( ( property1(X6,healthy,pos)
& person(X6) )
=> ~ ? [X7] :
( X6 = X7
& property1(X7,unhealthy,pos) ) )
& ! [X8] :
( ( property1(X8,unhealthy,pos)
& cyclist(X8) )
=> ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) ) )
& ! [X10] :
( cyclist(X10)
=> ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) ) )
& ! [X12] :
( ( property1(X12,industrious,pos)
& grocer(X12) )
=> ? [X13] :
( X12 = X13
& property1(X13,honest,pos) ) )
& ! [X14] :
( grocer(X14)
=> ~ ? [X15] :
( X14 = X15
& property1(X15,healthy,pos) ) )
& ! [X16] :
( ( property1(X16,industrious,pos)
& property1(X16,honest,pos)
& person(X16) )
=> ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) ) ) )
=> ! [X18] :
( grocer(X18)
=> ~ ? [X19] :
( X18 = X19
& cyclist(X19) ) ) ),
inference(rectify,[],[f2]) ).
fof(f4,plain,
( ? [X18] :
( ? [X19] :
( X18 = X19
& cyclist(X19) )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( X0 = X1
& person(X1) )
| ~ cyclist(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ grocer(X2) )
& ! [X4] :
( ! [X5] :
( X4 != X5
| ~ property1(X5,dishonest,pos) )
| ~ property1(X4,honest,pos)
| ~ person(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,unhealthy,pos) )
| ~ property1(X6,healthy,pos)
| ~ person(X6) )
& ! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) )
| ~ property1(X8,unhealthy,pos)
| ~ cyclist(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) )
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,honest,pos) )
| ~ property1(X12,industrious,pos)
| ~ grocer(X12) )
& ! [X14] :
( ! [X15] :
( X14 != X15
| ~ property1(X15,healthy,pos) )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) )
| ~ property1(X16,industrious,pos)
| ~ property1(X16,honest,pos)
| ~ person(X16) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f5,plain,
( ? [X18] :
( ? [X19] :
( X18 = X19
& cyclist(X19) )
& grocer(X18) )
& ! [X0] :
( ? [X1] :
( X0 = X1
& person(X1) )
| ~ cyclist(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ grocer(X2) )
& ! [X4] :
( ! [X5] :
( X4 != X5
| ~ property1(X5,dishonest,pos) )
| ~ property1(X4,honest,pos)
| ~ person(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,unhealthy,pos) )
| ~ property1(X6,healthy,pos)
| ~ person(X6) )
& ! [X8] :
( ? [X9] :
( X8 = X9
& property1(X9,dishonest,pos) )
| ~ property1(X8,unhealthy,pos)
| ~ cyclist(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,industrious,pos) )
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,honest,pos) )
| ~ property1(X12,industrious,pos)
| ~ grocer(X12) )
& ! [X14] :
( ! [X15] :
( X14 != X15
| ~ property1(X15,healthy,pos) )
| ~ grocer(X14) )
& ! [X16] :
( ? [X17] :
( X16 = X17
& property1(X17,healthy,pos) )
| ~ property1(X16,industrious,pos)
| ~ property1(X16,honest,pos)
| ~ person(X16) ) ),
inference(flattening,[],[f4]) ).
fof(f6,plain,
( ? [X0] :
( ? [X1] :
( X0 = X1
& cyclist(X1) )
& grocer(X0) )
& ! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
| ~ cyclist(X2) )
& ! [X4] :
( ? [X5] :
( X4 = X5
& person(X5) )
| ~ grocer(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) )
| ~ property1(X6,honest,pos)
| ~ person(X6) )
& ! [X8] :
( ! [X9] :
( X8 != X9
| ~ property1(X9,unhealthy,pos) )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,dishonest,pos) )
| ~ property1(X10,unhealthy,pos)
| ~ cyclist(X10) )
& ! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,industrious,pos) )
| ~ cyclist(X12) )
& ! [X14] :
( ? [X15] :
( X14 = X15
& property1(X15,honest,pos) )
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) )
& ! [X16] :
( ! [X17] :
( X16 != X17
| ~ property1(X17,healthy,pos) )
| ~ grocer(X16) )
& ! [X18] :
( ? [X19] :
( X18 = X19
& property1(X19,healthy,pos) )
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ) ),
inference(rectify,[],[f5]) ).
fof(f7,plain,
( ? [X0] :
( ? [X1] :
( X0 = X1
& cyclist(X1) )
& grocer(X0) )
=> ( ? [X1] :
( sK0 = X1
& cyclist(X1) )
& grocer(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] :
( sK0 = X1
& cyclist(X1) )
=> ( sK0 = sK1
& cyclist(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X2] :
( ? [X3] :
( X2 = X3
& person(X3) )
=> ( sK2(X2) = X2
& person(sK2(X2)) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
! [X4] :
( ? [X5] :
( X4 = X5
& person(X5) )
=> ( sK3(X4) = X4
& person(sK3(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X10] :
( ? [X11] :
( X10 = X11
& property1(X11,dishonest,pos) )
=> ( sK4(X10) = X10
& property1(sK4(X10),dishonest,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X12] :
( ? [X13] :
( X12 = X13
& property1(X13,industrious,pos) )
=> ( sK5(X12) = X12
& property1(sK5(X12),industrious,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X14] :
( ? [X15] :
( X14 = X15
& property1(X15,honest,pos) )
=> ( sK6(X14) = X14
& property1(sK6(X14),honest,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X18] :
( ? [X19] :
( X18 = X19
& property1(X19,healthy,pos) )
=> ( sK7(X18) = X18
& property1(sK7(X18),healthy,pos) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( sK0 = sK1
& cyclist(sK1)
& grocer(sK0)
& ! [X2] :
( ( sK2(X2) = X2
& person(sK2(X2)) )
| ~ cyclist(X2) )
& ! [X4] :
( ( sK3(X4) = X4
& person(sK3(X4)) )
| ~ grocer(X4) )
& ! [X6] :
( ! [X7] :
( X6 != X7
| ~ property1(X7,dishonest,pos) )
| ~ property1(X6,honest,pos)
| ~ person(X6) )
& ! [X8] :
( ! [X9] :
( X8 != X9
| ~ property1(X9,unhealthy,pos) )
| ~ property1(X8,healthy,pos)
| ~ person(X8) )
& ! [X10] :
( ( sK4(X10) = X10
& property1(sK4(X10),dishonest,pos) )
| ~ property1(X10,unhealthy,pos)
| ~ cyclist(X10) )
& ! [X12] :
( ( sK5(X12) = X12
& property1(sK5(X12),industrious,pos) )
| ~ cyclist(X12) )
& ! [X14] :
( ( sK6(X14) = X14
& property1(sK6(X14),honest,pos) )
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) )
& ! [X16] :
( ! [X17] :
( X16 != X17
| ~ property1(X17,healthy,pos) )
| ~ grocer(X16) )
& ! [X18] :
( ( sK7(X18) = X18
& property1(sK7(X18),healthy,pos) )
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7])],[f6,f14,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f16,plain,
! [X18] :
( property1(sK7(X18),healthy,pos)
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
fof(f17,plain,
! [X18] :
( sK7(X18) = X18
| ~ property1(X18,industrious,pos)
| ~ property1(X18,honest,pos)
| ~ person(X18) ),
inference(cnf_transformation,[],[f15]) ).
fof(f18,plain,
! [X16,X17] :
( X16 != X17
| ~ property1(X17,healthy,pos)
| ~ grocer(X16) ),
inference(cnf_transformation,[],[f15]) ).
fof(f19,plain,
! [X14] :
( property1(sK6(X14),honest,pos)
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f20,plain,
! [X14] :
( sK6(X14) = X14
| ~ property1(X14,industrious,pos)
| ~ grocer(X14) ),
inference(cnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X12] :
( property1(sK5(X12),industrious,pos)
| ~ cyclist(X12) ),
inference(cnf_transformation,[],[f15]) ).
fof(f22,plain,
! [X12] :
( sK5(X12) = X12
| ~ cyclist(X12) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X4] :
( person(sK3(X4))
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f28,plain,
! [X4] :
( sK3(X4) = X4
| ~ grocer(X4) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
grocer(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
cyclist(sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
sK0 = sK1,
inference(cnf_transformation,[],[f15]) ).
fof(f34,plain,
grocer(sK1),
inference(definition_unfolding,[],[f31,f33]) ).
fof(f37,plain,
! [X17] :
( ~ property1(X17,healthy,pos)
| ~ grocer(X17) ),
inference(equality_resolution,[],[f18]) ).
cnf(c_49,negated_conjecture,
cyclist(sK1),
inference(cnf_transformation,[],[f32]) ).
cnf(c_50,negated_conjecture,
grocer(sK1),
inference(cnf_transformation,[],[f34]) ).
cnf(c_53,negated_conjecture,
( ~ grocer(X0)
| sK3(X0) = X0 ),
inference(cnf_transformation,[],[f28]) ).
cnf(c_54,negated_conjecture,
( ~ grocer(X0)
| person(sK3(X0)) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_59,negated_conjecture,
( ~ cyclist(X0)
| sK5(X0) = X0 ),
inference(cnf_transformation,[],[f22]) ).
cnf(c_60,negated_conjecture,
( ~ cyclist(X0)
| property1(sK5(X0),industrious,pos) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_61,negated_conjecture,
( ~ property1(X0,industrious,pos)
| ~ grocer(X0)
| sK6(X0) = X0 ),
inference(cnf_transformation,[],[f20]) ).
cnf(c_62,negated_conjecture,
( ~ property1(X0,industrious,pos)
| ~ grocer(X0)
| property1(sK6(X0),honest,pos) ),
inference(cnf_transformation,[],[f19]) ).
cnf(c_63,negated_conjecture,
( ~ property1(X0,healthy,pos)
| ~ grocer(X0) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_64,negated_conjecture,
( ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| ~ person(X0)
| sK7(X0) = X0 ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_65,negated_conjecture,
( ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| ~ person(X0)
| property1(sK7(X0),healthy,pos) ),
inference(cnf_transformation,[],[f16]) ).
cnf(c_250,plain,
( X0 != sK1
| ~ property1(X0,healthy,pos) ),
inference(resolution_lifted,[status(thm)],[c_50,c_63]) ).
cnf(c_251,plain,
~ property1(sK1,healthy,pos),
inference(unflattening,[status(thm)],[c_250]) ).
cnf(c_255,plain,
( X0 != sK1
| ~ property1(X0,industrious,pos)
| property1(sK6(X0),honest,pos) ),
inference(resolution_lifted,[status(thm)],[c_50,c_62]) ).
cnf(c_256,plain,
( ~ property1(sK1,industrious,pos)
| property1(sK6(sK1),honest,pos) ),
inference(unflattening,[status(thm)],[c_255]) ).
cnf(c_263,plain,
( X0 != sK1
| ~ property1(X0,industrious,pos)
| sK6(X0) = X0 ),
inference(resolution_lifted,[status(thm)],[c_50,c_61]) ).
cnf(c_264,plain,
( ~ property1(sK1,industrious,pos)
| sK6(sK1) = sK1 ),
inference(unflattening,[status(thm)],[c_263]) ).
cnf(c_271,plain,
( X0 != sK1
| person(sK3(X0)) ),
inference(resolution_lifted,[status(thm)],[c_50,c_54]) ).
cnf(c_272,plain,
person(sK3(sK1)),
inference(unflattening,[status(thm)],[c_271]) ).
cnf(c_276,plain,
( X0 != sK1
| sK3(X0) = X0 ),
inference(resolution_lifted,[status(thm)],[c_50,c_53]) ).
cnf(c_277,plain,
sK3(sK1) = sK1,
inference(unflattening,[status(thm)],[c_276]) ).
cnf(c_288,plain,
( X0 != sK1
| property1(sK5(X0),industrious,pos) ),
inference(resolution_lifted,[status(thm)],[c_49,c_60]) ).
cnf(c_289,plain,
property1(sK5(sK1),industrious,pos),
inference(unflattening,[status(thm)],[c_288]) ).
cnf(c_293,plain,
( X0 != sK1
| sK5(X0) = X0 ),
inference(resolution_lifted,[status(thm)],[c_49,c_59]) ).
cnf(c_294,plain,
sK5(sK1) = sK1,
inference(unflattening,[status(thm)],[c_293]) ).
cnf(c_332,plain,
( sK3(sK1) != X0
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| property1(sK7(X0),healthy,pos) ),
inference(resolution_lifted,[status(thm)],[c_65,c_272]) ).
cnf(c_333,plain,
( ~ property1(sK3(sK1),honest,pos)
| ~ property1(sK3(sK1),industrious,pos)
| property1(sK7(sK3(sK1)),healthy,pos) ),
inference(unflattening,[status(thm)],[c_332]) ).
cnf(c_343,plain,
( sK3(sK1) != X0
| ~ property1(X0,honest,pos)
| ~ property1(X0,industrious,pos)
| sK7(X0) = X0 ),
inference(resolution_lifted,[status(thm)],[c_64,c_272]) ).
cnf(c_344,plain,
( ~ property1(sK3(sK1),honest,pos)
| ~ property1(sK3(sK1),industrious,pos)
| sK7(sK3(sK1)) = sK3(sK1) ),
inference(unflattening,[status(thm)],[c_343]) ).
cnf(c_664,plain,
property1(sK1,industrious,pos),
inference(light_normalisation,[status(thm)],[c_289,c_294]) ).
cnf(c_665,plain,
property1(sK6(sK1),honest,pos),
inference(forward_subsumption_resolution,[status(thm)],[c_256,c_664]) ).
cnf(c_666,plain,
sK6(sK1) = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_264,c_664]) ).
cnf(c_667,plain,
property1(sK1,honest,pos),
inference(demodulation,[status(thm)],[c_665,c_666]) ).
cnf(c_679,plain,
( ~ property1(sK1,honest,pos)
| ~ property1(sK1,industrious,pos)
| property1(sK7(sK1),healthy,pos) ),
inference(light_normalisation,[status(thm)],[c_333,c_277]) ).
cnf(c_680,plain,
property1(sK7(sK1),healthy,pos),
inference(forward_subsumption_resolution,[status(thm)],[c_679,c_664,c_667]) ).
cnf(c_682,plain,
( ~ property1(sK1,honest,pos)
| ~ property1(sK1,industrious,pos)
| sK7(sK1) = sK1 ),
inference(light_normalisation,[status(thm)],[c_344,c_277]) ).
cnf(c_683,plain,
sK7(sK1) = sK1,
inference(forward_subsumption_resolution,[status(thm)],[c_682,c_664,c_667]) ).
cnf(c_684,plain,
property1(sK1,healthy,pos),
inference(demodulation,[status(thm)],[c_680,c_683]) ).
cnf(c_685,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_684,c_251]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 22:06:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 1.41/1.16 % SZS status Started for theBenchmark.p
% 1.41/1.16 % SZS status Theorem for theBenchmark.p
% 1.41/1.16
% 1.41/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.41/1.16
% 1.41/1.16 ------ iProver source info
% 1.41/1.16
% 1.41/1.16 git: date: 2023-05-31 18:12:56 +0000
% 1.41/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.41/1.16 git: non_committed_changes: false
% 1.41/1.16 git: last_make_outside_of_git: false
% 1.41/1.16
% 1.41/1.16 ------ Parsing...
% 1.41/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.41/1.16
% 1.41/1.16 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 1.41/1.16
% 1.41/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.41/1.16
% 1.41/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.41/1.16 ------ Proving...
% 1.41/1.16 ------ Problem Properties
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16 clauses 17
% 1.41/1.16 conjectures 0
% 1.41/1.16 EPR 1
% 1.41/1.16 Horn 17
% 1.41/1.16 unary 5
% 1.41/1.16 binary 8
% 1.41/1.16 lits 33
% 1.41/1.16 lits eq 7
% 1.41/1.16 fd_pure 0
% 1.41/1.16 fd_pseudo 0
% 1.41/1.16 fd_cond 0
% 1.41/1.16 fd_pseudo_cond 0
% 1.41/1.16 AC symbols 0
% 1.41/1.16
% 1.41/1.16 ------ Schedule dynamic 5 is on
% 1.41/1.16
% 1.41/1.16 ------ no conjectures: strip conj schedule
% 1.41/1.16
% 1.41/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16 ------
% 1.41/1.16 Current options:
% 1.41/1.16 ------
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16 ------ Proving...
% 1.41/1.16
% 1.41/1.16
% 1.41/1.16 % SZS status Theorem for theBenchmark.p
% 1.41/1.16
% 1.41/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.41/1.16
% 1.41/1.17
%------------------------------------------------------------------------------