TSTP Solution File: SET959+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 15:10:49 EDT 2023
% Result : Theorem 2.09s 1.04s
% Output : CNFRefutation 2.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 70 ( 11 unt; 0 def)
% Number of atoms : 214 ( 86 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 234 ( 90 ~; 91 |; 38 &)
% ( 6 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 161 ( 0 sgn; 91 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f3,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(f7,conjecture,
! [X0,X1] :
( ( ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X0) ) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t112_zfmisc_1) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( ( ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X1) )
& ! [X2] :
~ ( ! [X3,X4] : ordered_pair(X3,X4) != X2
& in(X2,X0) ) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f9,axiom,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
<=> in(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_tarski) ).
fof(f10,plain,
~ ! [X0,X1] :
( ( ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) )
& ! [X4] :
~ ( ! [X5,X6] : ordered_pair(X5,X6) != X4
& in(X4,X1) )
& ! [X7] :
~ ( ! [X8,X9] : ordered_pair(X8,X9) != X7
& in(X7,X0) ) )
=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f12,plain,
? [X0,X1] :
( X0 != X1
& ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X1) )
& ! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
| ~ in(X7,X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f13,plain,
? [X0,X1] :
( X0 != X1
& ! [X2,X3] :
( in(ordered_pair(X2,X3),X0)
<=> in(ordered_pair(X2,X3),X1) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X1) )
& ! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
| ~ in(X7,X0) ) ),
inference(flattening,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( in(X2,X0)
<~> in(X2,X1) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f19,plain,
? [X0,X1] :
( X0 != X1
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X2,X3),X1) )
& ( in(ordered_pair(X2,X3),X1)
| ~ in(ordered_pair(X2,X3),X0) ) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X1) )
& ! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
| ~ in(X7,X0) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f20,plain,
( ? [X0,X1] :
( X0 != X1
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X0)
| ~ in(ordered_pair(X2,X3),X1) )
& ( in(ordered_pair(X2,X3),X1)
| ~ in(ordered_pair(X2,X3),X0) ) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X1) )
& ! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
| ~ in(X7,X0) ) )
=> ( sK2 != sK3
& ! [X3,X2] :
( ( in(ordered_pair(X2,X3),sK2)
| ~ in(ordered_pair(X2,X3),sK3) )
& ( in(ordered_pair(X2,X3),sK3)
| ~ in(ordered_pair(X2,X3),sK2) ) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,sK3) )
& ! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
| ~ in(X7,sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
=> ordered_pair(sK4(X4),sK5(X4)) = X4 ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X7] :
( ? [X8,X9] : ordered_pair(X8,X9) = X7
=> ordered_pair(sK6(X7),sK7(X7)) = X7 ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( sK2 != sK3
& ! [X2,X3] :
( ( in(ordered_pair(X2,X3),sK2)
| ~ in(ordered_pair(X2,X3),sK3) )
& ( in(ordered_pair(X2,X3),sK3)
| ~ in(ordered_pair(X2,X3),sK2) ) )
& ! [X4] :
( ordered_pair(sK4(X4),sK5(X4)) = X4
| ~ in(X4,sK3) )
& ! [X7] :
( ordered_pair(sK6(X7),sK7(X7)) = X7
| ~ in(X7,sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f19,f22,f21,f20]) ).
fof(f24,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ in(X2,X1)
| ~ in(X2,X0) )
& ( in(X2,X1)
| in(X2,X0) ) )
=> ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) )
& ( in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f24,f25]) ).
fof(f28,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f29,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X7] :
( ordered_pair(sK6(X7),sK7(X7)) = X7
| ~ in(X7,sK2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f34,plain,
! [X4] :
( ordered_pair(sK4(X4),sK5(X4)) = X4
| ~ in(X4,sK3) ),
inference(cnf_transformation,[],[f23]) ).
fof(f35,plain,
! [X2,X3] :
( in(ordered_pair(X2,X3),sK3)
| ~ in(ordered_pair(X2,X3),sK2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f36,plain,
! [X2,X3] :
( in(ordered_pair(X2,X3),sK2)
| ~ in(ordered_pair(X2,X3),sK3) ),
inference(cnf_transformation,[],[f23]) ).
fof(f37,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
! [X0,X1] :
( X0 = X1
| in(sK8(X0,X1),X1)
| in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f39,plain,
! [X0,X1] :
( X0 = X1
| ~ in(sK8(X0,X1),X1)
| ~ in(sK8(X0,X1),X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f41,plain,
! [X2,X3] :
( in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK2)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK3) ),
inference(definition_unfolding,[],[f36,f29,f29]) ).
fof(f42,plain,
! [X2,X3] :
( in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK3)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),sK2) ),
inference(definition_unfolding,[],[f35,f29,f29]) ).
fof(f43,plain,
! [X4] :
( unordered_pair(unordered_pair(sK4(X4),sK5(X4)),singleton(sK4(X4))) = X4
| ~ in(X4,sK3) ),
inference(definition_unfolding,[],[f34,f29]) ).
fof(f44,plain,
! [X7] :
( unordered_pair(unordered_pair(sK6(X7),sK7(X7)),singleton(sK6(X7))) = X7
| ~ in(X7,sK2) ),
inference(definition_unfolding,[],[f33,f29]) ).
cnf(c_50,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f28]) ).
cnf(c_54,negated_conjecture,
sK2 != sK3,
inference(cnf_transformation,[],[f37]) ).
cnf(c_55,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK2) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_56,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK2)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_57,negated_conjecture,
( ~ in(X0,sK3)
| unordered_pair(unordered_pair(sK4(X0),sK5(X0)),singleton(sK4(X0))) = X0 ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_58,negated_conjecture,
( ~ in(X0,sK2)
| unordered_pair(unordered_pair(sK6(X0),sK7(X0)),singleton(sK6(X0))) = X0 ),
inference(cnf_transformation,[],[f44]) ).
cnf(c_59,plain,
( ~ in(sK8(X0,X1),X0)
| ~ in(sK8(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_60,plain,
( X0 = X1
| in(sK8(X0,X1),X0)
| in(sK8(X0,X1),X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_69,plain,
( in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK2)
| ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3) ),
inference(prop_impl_just,[status(thm)],[c_55]) ).
cnf(c_70,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK2) ),
inference(renaming,[status(thm)],[c_69]) ).
cnf(c_71,plain,
( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK2)
| in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),sK3) ),
inference(prop_impl_just,[status(thm)],[c_56]) ).
cnf(c_77,plain,
( ~ in(X0,sK3)
| unordered_pair(unordered_pair(sK4(X0),sK5(X0)),singleton(sK4(X0))) = X0 ),
inference(prop_impl_just,[status(thm)],[c_57]) ).
cnf(c_79,plain,
( ~ in(X0,sK2)
| unordered_pair(unordered_pair(sK6(X0),sK7(X0)),singleton(sK6(X0))) = X0 ),
inference(prop_impl_just,[status(thm)],[c_58]) ).
cnf(c_164,plain,
( ~ in(X0,sK2)
| unordered_pair(singleton(sK6(X0)),unordered_pair(sK6(X0),sK7(X0))) = X0 ),
inference(demodulation,[status(thm)],[c_79,c_50]) ).
cnf(c_169,plain,
( ~ in(X0,sK3)
| unordered_pair(singleton(sK4(X0)),unordered_pair(sK4(X0),sK5(X0))) = X0 ),
inference(demodulation,[status(thm)],[c_77,c_50]) ).
cnf(c_174,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3) ),
inference(demodulation,[status(thm)],[c_71,c_50]) ).
cnf(c_179,plain,
( ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK3)
| in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),sK2) ),
inference(demodulation,[status(thm)],[c_70,c_50]) ).
cnf(c_206,plain,
X0 = X0,
theory(equality) ).
cnf(c_208,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_214,plain,
sK2 = sK2,
inference(instantiation,[status(thm)],[c_206]) ).
cnf(c_499,plain,
( unordered_pair(singleton(sK6(sK8(X0,sK2))),unordered_pair(sK6(sK8(X0,sK2)),sK7(sK8(X0,sK2)))) = sK8(X0,sK2)
| X0 = sK2
| in(sK8(X0,sK2),X0) ),
inference(superposition,[status(thm)],[c_60,c_164]) ).
cnf(c_520,plain,
( unordered_pair(singleton(sK4(sK8(sK3,X0))),unordered_pair(sK4(sK8(sK3,X0)),sK5(sK8(sK3,X0)))) = sK8(sK3,X0)
| X0 = sK3
| in(sK8(sK3,X0),X0) ),
inference(superposition,[status(thm)],[c_60,c_169]) ).
cnf(c_527,plain,
( unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| sK2 = sK3
| in(sK8(sK3,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_520]) ).
cnf(c_576,plain,
( unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| sK2 = sK3 ),
inference(superposition,[status(thm)],[c_499,c_169]) ).
cnf(c_582,plain,
( unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2)))) = sK8(sK3,sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_576,c_54]) ).
cnf(c_596,plain,
( ~ in(sK8(sK3,sK2),sK2)
| unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| in(unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2)))),sK3) ),
inference(superposition,[status(thm)],[c_582,c_174]) ).
cnf(c_622,plain,
( sK2 != X0
| sK3 != X0
| sK2 = sK3 ),
inference(instantiation,[status(thm)],[c_208]) ).
cnf(c_623,plain,
( sK2 != sK2
| sK3 != sK2
| sK2 = sK3 ),
inference(instantiation,[status(thm)],[c_622]) ).
cnf(c_640,plain,
( unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| in(unordered_pair(singleton(sK6(sK8(sK3,sK2))),unordered_pair(sK6(sK8(sK3,sK2)),sK7(sK8(sK3,sK2)))),sK3) ),
inference(global_subsumption_just,[status(thm)],[c_596,c_54,c_527,c_596]) ).
cnf(c_646,plain,
( unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2)
| in(sK8(sK3,sK2),sK3) ),
inference(superposition,[status(thm)],[c_582,c_640]) ).
cnf(c_665,plain,
unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))) = sK8(sK3,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_646,c_169]) ).
cnf(c_675,plain,
( ~ in(sK8(sK3,sK2),sK3)
| in(unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))),sK2) ),
inference(superposition,[status(thm)],[c_665,c_179]) ).
cnf(c_676,plain,
( ~ in(sK8(sK3,sK2),sK2)
| in(unordered_pair(singleton(sK4(sK8(sK3,sK2))),unordered_pair(sK4(sK8(sK3,sK2)),sK5(sK8(sK3,sK2)))),sK3) ),
inference(superposition,[status(thm)],[c_665,c_174]) ).
cnf(c_678,plain,
( ~ in(sK8(sK3,sK2),sK2)
| in(sK8(sK3,sK2),sK3) ),
inference(light_normalisation,[status(thm)],[c_676,c_665]) ).
cnf(c_681,plain,
( ~ in(sK8(sK3,sK2),sK3)
| in(sK8(sK3,sK2),sK2) ),
inference(light_normalisation,[status(thm)],[c_675,c_665]) ).
cnf(c_694,plain,
( sK3 = X0
| in(sK8(sK3,X0),X0)
| in(sK8(sK3,X0),sK3) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_695,plain,
( ~ in(sK8(sK3,X0),X0)
| ~ in(sK8(sK3,X0),sK3)
| sK3 = X0 ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_696,plain,
( ~ in(sK8(sK3,sK2),sK2)
| ~ in(sK8(sK3,sK2),sK3)
| sK3 = sK2 ),
inference(instantiation,[status(thm)],[c_695]) ).
cnf(c_697,plain,
( sK3 = sK2
| in(sK8(sK3,sK2),sK2)
| in(sK8(sK3,sK2),sK3) ),
inference(instantiation,[status(thm)],[c_694]) ).
cnf(c_745,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_697,c_696,c_678,c_681,c_623,c_214,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET959+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Sat Aug 26 13:12:58 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.09/1.04 % SZS status Started for theBenchmark.p
% 2.09/1.04 % SZS status Theorem for theBenchmark.p
% 2.09/1.04
% 2.09/1.04 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.09/1.04
% 2.09/1.04 ------ iProver source info
% 2.09/1.04
% 2.09/1.04 git: date: 2023-05-31 18:12:56 +0000
% 2.09/1.04 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.09/1.04 git: non_committed_changes: false
% 2.09/1.04 git: last_make_outside_of_git: false
% 2.09/1.04
% 2.09/1.04 ------ Parsing...
% 2.09/1.04 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.09/1.04
% 2.09/1.04 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe_e
% 2.09/1.04
% 2.09/1.04 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.09/1.04
% 2.09/1.04 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.09/1.04 ------ Proving...
% 2.09/1.04 ------ Problem Properties
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04 clauses 12
% 2.09/1.04 conjectures 1
% 2.09/1.04 EPR 4
% 2.09/1.04 Horn 11
% 2.09/1.04 unary 5
% 2.09/1.04 binary 5
% 2.09/1.04 lits 21
% 2.09/1.04 lits eq 6
% 2.09/1.04 fd_pure 0
% 2.09/1.04 fd_pseudo 0
% 2.09/1.04 fd_cond 0
% 2.09/1.04 fd_pseudo_cond 2
% 2.09/1.04 AC symbols 0
% 2.09/1.04
% 2.09/1.04 ------ Schedule dynamic 5 is on
% 2.09/1.04
% 2.09/1.04 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04 ------
% 2.09/1.04 Current options:
% 2.09/1.04 ------
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04 ------ Proving...
% 2.09/1.04
% 2.09/1.04
% 2.09/1.04 % SZS status Theorem for theBenchmark.p
% 2.09/1.04
% 2.09/1.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.09/1.04
% 2.09/1.04
%------------------------------------------------------------------------------