TSTP Solution File: SET807+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET807+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:01:35 EDT 2024
% Result : Theorem 49.89s 7.76s
% Output : CNFRefutation 49.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 76 ( 15 unt; 0 def)
% Number of atoms : 239 ( 8 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 259 ( 96 ~; 79 |; 63 &)
% ( 6 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn 83 !; 25 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f16,axiom,
! [X6,X3] :
( pre_order(X6,X3)
<=> ( ! [X2,X4,X5] :
( ( member(X5,X3)
& member(X4,X3)
& member(X2,X3) )
=> ( ( apply(X6,X4,X5)
& apply(X6,X2,X4) )
=> apply(X6,X2,X5) ) )
& ! [X2] :
( member(X2,X3)
=> apply(X6,X2,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pre_order) ).
fof(f17,axiom,
! [X2,X4] :
( apply(subset_predicate,X2,X4)
<=> subset(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rel_subset) ).
fof(f18,conjecture,
! [X3] : pre_order(subset_predicate,power_set(X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV18a) ).
fof(f19,negated_conjecture,
~ ! [X3] : pre_order(subset_predicate,power_set(X3)),
inference(negated_conjecture,[],[f18]) ).
fof(f32,plain,
! [X0,X1] :
( pre_order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5] :
( member(X5,X1)
=> apply(X0,X5,X5) ) ) ),
inference(rectify,[],[f16]) ).
fof(f33,plain,
! [X0,X1] :
( apply(subset_predicate,X0,X1)
<=> subset(X0,X1) ),
inference(rectify,[],[f17]) ).
fof(f34,plain,
~ ! [X0] : pre_order(subset_predicate,power_set(X0)),
inference(rectify,[],[f19]) ).
fof(f35,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5] :
( member(X5,X1)
=> apply(X0,X5,X5) ) )
=> pre_order(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f38,plain,
! [X0,X1] :
( pre_order(X0,X1)
| ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
| ? [X5] :
( ~ apply(X0,X5,X5)
& member(X5,X1) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f39,plain,
! [X0,X1] :
( pre_order(X0,X1)
| ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
| ? [X5] :
( ~ apply(X0,X5,X5)
& member(X5,X1) ) ),
inference(flattening,[],[f38]) ).
fof(f40,plain,
? [X0] : ~ pre_order(subset_predicate,power_set(X0)),
inference(ennf_transformation,[],[f34]) ).
fof(f41,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
| ~ sP0(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f42,plain,
! [X0,X1] :
( pre_order(X0,X1)
| sP0(X0,X1)
| ? [X5] :
( ~ apply(X0,X5,X5)
& member(X5,X1) ) ),
inference(definition_folding,[],[f39,f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f44,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f43]) ).
fof(f45,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f44,f45]) ).
fof(f67,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
| ~ sP0(X0,X1) ),
inference(nnf_transformation,[],[f41]) ).
fof(f68,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ~ apply(X0,X2,X4)
& apply(X0,X3,X4)
& apply(X0,X2,X3)
& member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& apply(X0,sK4(X0,X1),sK5(X0,X1))
& member(sK6(X0,X1),X1)
& member(sK5(X0,X1),X1)
& member(sK4(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X0,X1] :
( ( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
& apply(X0,sK5(X0,X1),sK6(X0,X1))
& apply(X0,sK4(X0,X1),sK5(X0,X1))
& member(sK6(X0,X1),X1)
& member(sK5(X0,X1),X1)
& member(sK4(X0,X1),X1) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f67,f68]) ).
fof(f70,plain,
! [X0,X1] :
( pre_order(X0,X1)
| sP0(X0,X1)
| ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) ) ),
inference(rectify,[],[f42]) ).
fof(f71,plain,
! [X0,X1] :
( ? [X2] :
( ~ apply(X0,X2,X2)
& member(X2,X1) )
=> ( ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
& member(sK7(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
! [X0,X1] :
( pre_order(X0,X1)
| sP0(X0,X1)
| ( ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
& member(sK7(X0,X1),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f70,f71]) ).
fof(f73,plain,
! [X0,X1] :
( ( apply(subset_predicate,X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ apply(subset_predicate,X0,X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f74,plain,
( ? [X0] : ~ pre_order(subset_predicate,power_set(X0))
=> ~ pre_order(subset_predicate,power_set(sK8)) ),
introduced(choice_axiom,[]) ).
fof(f75,plain,
~ pre_order(subset_predicate,power_set(sK8)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f40,f74]) ).
fof(f76,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f77,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f78,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f108,plain,
! [X0,X1] :
( apply(X0,sK4(X0,X1),sK5(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f109,plain,
! [X0,X1] :
( apply(X0,sK5(X0,X1),sK6(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f110,plain,
! [X0,X1] :
( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f112,plain,
! [X0,X1] :
( pre_order(X0,X1)
| sP0(X0,X1)
| ~ apply(X0,sK7(X0,X1),sK7(X0,X1)) ),
inference(cnf_transformation,[],[f72]) ).
fof(f113,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ apply(subset_predicate,X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f114,plain,
! [X0,X1] :
( apply(subset_predicate,X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f115,plain,
~ pre_order(subset_predicate,power_set(sK8)),
inference(cnf_transformation,[],[f75]) ).
cnf(c_49,plain,
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f78]) ).
cnf(c_50,plain,
( member(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f76]) ).
cnf(c_78,plain,
( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
cnf(c_79,plain,
( ~ sP0(X0,X1)
| apply(X0,sK5(X0,X1),sK6(X0,X1)) ),
inference(cnf_transformation,[],[f109]) ).
cnf(c_80,plain,
( ~ sP0(X0,X1)
| apply(X0,sK4(X0,X1),sK5(X0,X1)) ),
inference(cnf_transformation,[],[f108]) ).
cnf(c_84,plain,
( ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
| sP0(X0,X1)
| pre_order(X0,X1) ),
inference(cnf_transformation,[],[f112]) ).
cnf(c_86,plain,
( ~ subset(X0,X1)
| apply(subset_predicate,X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
cnf(c_87,plain,
( ~ apply(subset_predicate,X0,X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
cnf(c_88,negated_conjecture,
~ pre_order(subset_predicate,power_set(sK8)),
inference(cnf_transformation,[],[f115]) ).
cnf(c_176,plain,
( ~ apply(X0,sK4(X0,X1),sK6(X0,X1))
| ~ sP0(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
cnf(c_180,plain,
( ~ sP0(X0,X1)
| apply(X0,sK5(X0,X1),sK6(X0,X1)) ),
inference(prop_impl_just,[status(thm)],[c_79]) ).
cnf(c_182,plain,
( ~ sP0(X0,X1)
| apply(X0,sK4(X0,X1),sK5(X0,X1)) ),
inference(prop_impl_just,[status(thm)],[c_80]) ).
cnf(c_617,plain,
( power_set(sK8) != X1
| X0 != subset_predicate
| ~ apply(X0,sK7(X0,X1),sK7(X0,X1))
| sP0(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_84,c_88]) ).
cnf(c_618,plain,
( ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| sP0(subset_predicate,power_set(sK8)) ),
inference(unflattening,[status(thm)],[c_617]) ).
cnf(c_677,plain,
( power_set(sK8) != X1
| X0 != subset_predicate
| ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(X0,sK4(X0,X1),sK5(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_182,c_618]) ).
cnf(c_678,plain,
( ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK5(subset_predicate,power_set(sK8))) ),
inference(unflattening,[status(thm)],[c_677]) ).
cnf(c_693,plain,
( power_set(sK8) != X1
| X0 != subset_predicate
| ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(X0,sK5(X0,X1),sK6(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_180,c_618]) ).
cnf(c_694,plain,
( ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(subset_predicate,sK5(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))) ),
inference(unflattening,[status(thm)],[c_693]) ).
cnf(c_709,plain,
( power_set(sK8) != X1
| X0 != subset_predicate
| ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| ~ apply(X0,sK4(X0,X1),sK6(X0,X1)) ),
inference(resolution_lifted,[status(thm)],[c_176,c_618]) ).
cnf(c_710,plain,
( ~ apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8)))
| ~ apply(subset_predicate,sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8))) ),
inference(unflattening,[status(thm)],[c_709]) ).
cnf(c_1825,plain,
( ~ subset(sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK5(subset_predicate,power_set(sK8))) ),
inference(superposition,[status(thm)],[c_86,c_678]) ).
cnf(c_1832,plain,
( ~ subset(sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8)))
| apply(subset_predicate,sK5(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))) ),
inference(superposition,[status(thm)],[c_86,c_694]) ).
cnf(c_1839,plain,
( ~ apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8)))
| ~ subset(sK7(subset_predicate,power_set(sK8)),sK7(subset_predicate,power_set(sK8))) ),
inference(superposition,[status(thm)],[c_86,c_710]) ).
cnf(c_1886,plain,
subset(X0,X0),
inference(superposition,[status(thm)],[c_50,c_49]) ).
cnf(c_1933,plain,
apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK5(subset_predicate,power_set(sK8))),
inference(forward_subsumption_resolution,[status(thm)],[c_1825,c_1886]) ).
cnf(c_1934,plain,
subset(sK4(subset_predicate,power_set(sK8)),sK5(subset_predicate,power_set(sK8))),
inference(superposition,[status(thm)],[c_1933,c_87]) ).
cnf(c_1935,plain,
apply(subset_predicate,sK5(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),
inference(forward_subsumption_resolution,[status(thm)],[c_1832,c_1886]) ).
cnf(c_1936,plain,
subset(sK5(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),
inference(superposition,[status(thm)],[c_1935,c_87]) ).
cnf(c_1937,plain,
~ apply(subset_predicate,sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),
inference(forward_subsumption_resolution,[status(thm)],[c_1839,c_1886]) ).
cnf(c_1938,plain,
~ subset(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),
inference(superposition,[status(thm)],[c_86,c_1937]) ).
cnf(c_3216,plain,
( member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK4(subset_predicate,power_set(sK8)))
| subset(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_3217,plain,
( ~ member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK6(subset_predicate,power_set(sK8)))
| subset(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_23689,plain,
( ~ member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),X0)
| ~ subset(X0,sK6(subset_predicate,power_set(sK8)))
| member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK6(subset_predicate,power_set(sK8))) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_183025,plain,
( ~ member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK5(subset_predicate,power_set(sK8)))
| ~ subset(sK5(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8)))
| member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK6(subset_predicate,power_set(sK8))) ),
inference(instantiation,[status(thm)],[c_23689]) ).
cnf(c_229379,plain,
( ~ member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK4(subset_predicate,power_set(sK8)))
| ~ subset(sK4(subset_predicate,power_set(sK8)),X0)
| member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_246476,plain,
( ~ member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK4(subset_predicate,power_set(sK8)))
| ~ subset(sK4(subset_predicate,power_set(sK8)),sK5(subset_predicate,power_set(sK8)))
| member(sK1(sK4(subset_predicate,power_set(sK8)),sK6(subset_predicate,power_set(sK8))),sK5(subset_predicate,power_set(sK8))) ),
inference(instantiation,[status(thm)],[c_229379]) ).
cnf(c_246477,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_246476,c_183025,c_3216,c_3217,c_1938,c_1936,c_1934]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET807+4 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu May 2 21:17:30 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/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
% 49.89/7.76 % SZS status Started for theBenchmark.p
% 49.89/7.76 % SZS status Theorem for theBenchmark.p
% 49.89/7.76
% 49.89/7.76 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 49.89/7.76
% 49.89/7.76 ------ iProver source info
% 49.89/7.76
% 49.89/7.76 git: date: 2024-05-02 19:28:25 +0000
% 49.89/7.76 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 49.89/7.76 git: non_committed_changes: false
% 49.89/7.76
% 49.89/7.76 ------ Parsing...
% 49.89/7.76 ------ Clausification by vclausify_rel & Parsing by iProver...
% 49.89/7.76
% 49.89/7.76 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e
% 49.89/7.76
% 49.89/7.76 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 49.89/7.76
% 49.89/7.76 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 49.89/7.76 ------ Proving...
% 49.89/7.76 ------ Problem Properties
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76 clauses 43
% 49.89/7.76 conjectures 0
% 49.89/7.76 EPR 4
% 49.89/7.76 Horn 33
% 49.89/7.76 unary 4
% 49.89/7.76 binary 31
% 49.89/7.76 lits 90
% 49.89/7.76 lits eq 3
% 49.89/7.76 fd_pure 0
% 49.89/7.76 fd_pseudo 0
% 49.89/7.76 fd_cond 0
% 49.89/7.76 fd_pseudo_cond 2
% 49.89/7.76 AC symbols 0
% 49.89/7.76
% 49.89/7.76 ------ Schedule dynamic 5 is on
% 49.89/7.76
% 49.89/7.76 ------ no conjectures: strip conj schedule
% 49.89/7.76
% 49.89/7.76 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76 ------
% 49.89/7.76 Current options:
% 49.89/7.76 ------
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76 ------ Proving...
% 49.89/7.76
% 49.89/7.76
% 49.89/7.76 % SZS status Theorem for theBenchmark.p
% 49.89/7.76
% 49.89/7.76 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 49.89/7.76
% 49.89/7.77
%------------------------------------------------------------------------------