TSTP Solution File: SET934+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET934+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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:02:03 EDT 2024
% Result : Theorem 7.57s 1.74s
% Output : CNFRefutation 7.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 61 ( 7 unt; 0 def)
% Number of atoms : 237 ( 21 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 290 ( 114 ~; 122 |; 43 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 134 ( 2 sgn 96 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f4,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f14,conjecture,
! [X0,X1] : subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t81_zfmisc_1) ).
fof(f15,negated_conjecture,
~ ! [X0,X1] : subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
inference(negated_conjecture,[],[f14]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f24,plain,
? [X0,X1] : ~ subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1))),
inference(ennf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f26,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( subset(sK0(X0,X1),X0)
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f26,f27]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) )
& ( in(X3,X1)
| in(X3,X0)
| ~ in(X3,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) )
| ~ in(sK1(X0,X1,X2),X2) )
& ( in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0)
| in(sK1(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f31,f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f35,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK2(X0,X1),X1)
& in(sK2(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f35,f36]) ).
fof(f42,plain,
( ? [X0,X1] : ~ subset(set_union2(powerset(X0),powerset(X1)),powerset(set_union2(X0,X1)))
=> ~ subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
~ subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f24,f42]) ).
fof(f46,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f28]) ).
fof(f47,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ subset(X3,X0)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f51,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f52,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f33]) ).
fof(f56,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ in(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f37]) ).
fof(f58,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f67,plain,
~ subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),
inference(cnf_transformation,[],[f43]) ).
fof(f68,plain,
! [X3,X0] :
( in(X3,powerset(X0))
| ~ subset(X3,X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f69,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f46]) ).
fof(f70,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X1) ),
inference(equality_resolution,[],[f52]) ).
fof(f71,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f51]) ).
fof(f72,plain,
! [X0,X1,X4] :
( in(X4,X1)
| in(X4,X0)
| ~ in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f50]) ).
cnf(c_53,plain,
( ~ subset(X0,X1)
| in(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_54,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f69]) ).
cnf(c_58,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X2,X1)) ),
inference(cnf_transformation,[],[f70]) ).
cnf(c_59,plain,
( ~ in(X0,X1)
| in(X0,set_union2(X1,X2)) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_60,plain,
( ~ in(X0,set_union2(X1,X2))
| in(X0,X1)
| in(X0,X2) ),
inference(cnf_transformation,[],[f72]) ).
cnf(c_61,plain,
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
cnf(c_62,plain,
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_63,plain,
( ~ in(X0,X1)
| ~ subset(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_72,negated_conjecture,
~ subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),
inference(cnf_transformation,[],[f67]) ).
cnf(c_733,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(set_union2(sK5,sK6)))
| subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_735,plain,
( in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(powerset(sK5),powerset(sK6)))
| subset(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_740,plain,
( ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(set_union2(sK5,sK6))) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_773,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),set_union2(sK5,sK6))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_61]) ).
cnf(c_775,plain,
( in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_784,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(X0,X1))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),X0)
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),X1) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_914,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK6)
| in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),set_union2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_915,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK5)
| in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),set_union2(sK5,sK6)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_937,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(X0))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_940,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK5))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK5) ),
inference(instantiation,[status(thm)],[c_937]) ).
cnf(c_1177,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(powerset(sK5),powerset(sK6)))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK5))
| in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK6)) ),
inference(instantiation,[status(thm)],[c_784]) ).
cnf(c_1512,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))))
| ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),X0)
| in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),X0) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_1513,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))))
| ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK5)
| in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK5) ),
inference(instantiation,[status(thm)],[c_1512]) ).
cnf(c_3917,plain,
( ~ in(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),powerset(sK6))
| subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK6) ),
inference(instantiation,[status(thm)],[c_937]) ).
cnf(c_6308,plain,
( ~ in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))))
| ~ subset(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),sK6)
| in(sK2(sK2(set_union2(powerset(sK5),powerset(sK6)),powerset(set_union2(sK5,sK6))),set_union2(sK5,sK6)),sK6) ),
inference(instantiation,[status(thm)],[c_1512]) ).
cnf(c_6309,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_6308,c_3917,c_1513,c_1177,c_940,c_915,c_914,c_773,c_775,c_740,c_733,c_735,c_72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET934+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n017.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 : Thu May 2 20:12:36 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.57/1.74 % SZS status Started for theBenchmark.p
% 7.57/1.74 % SZS status Theorem for theBenchmark.p
% 7.57/1.74
% 7.57/1.74 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.57/1.74
% 7.57/1.74 ------ iProver source info
% 7.57/1.74
% 7.57/1.74 git: date: 2024-05-02 19:28:25 +0000
% 7.57/1.74 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.57/1.74 git: non_committed_changes: false
% 7.57/1.74
% 7.57/1.74 ------ Parsing...
% 7.57/1.74 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.57/1.74
% 7.57/1.74 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.57/1.74
% 7.57/1.74 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.57/1.74
% 7.57/1.74 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.57/1.74 ------ Proving...
% 7.57/1.74 ------ Problem Properties
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74 clauses 24
% 7.57/1.74 conjectures 1
% 7.57/1.74 EPR 6
% 7.57/1.74 Horn 20
% 7.57/1.74 unary 7
% 7.57/1.74 binary 9
% 7.57/1.74 lits 50
% 7.57/1.74 lits eq 7
% 7.57/1.74 fd_pure 0
% 7.57/1.74 fd_pseudo 0
% 7.57/1.74 fd_cond 0
% 7.57/1.74 fd_pseudo_cond 5
% 7.57/1.74 AC symbols 0
% 7.57/1.74
% 7.57/1.74 ------ Input Options Time Limit: Unbounded
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74 ------
% 7.57/1.74 Current options:
% 7.57/1.74 ------
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74 ------ Proving...
% 7.57/1.74
% 7.57/1.74
% 7.57/1.74 % SZS status Theorem for theBenchmark.p
% 7.57/1.74
% 7.57/1.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.57/1.74
% 7.57/1.75
%------------------------------------------------------------------------------