%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS167+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 13:04:19 EST 2010
% Result : Theorem 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 85 ( 9 unt; 0 def)
% Number of atoms : 388 ( 34 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 478 ( 175 ~; 224 |; 67 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-1 aty)
% Number of variables : 126 ( 10 sgn 62 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpBG3Lb1/sel_KRS167+1.p_1',axiom_0) ).
fof(2,axiom,
! [X1] :
( cc2(X1)
<=> ( ? [X2] : rp(X1,X2)
& ! [X2,X3] :
( ( rp(X1,X2)
& rp(X1,X3) )
=> X2 = X3 ) ) ),
file('/tmp/tmpBG3Lb1/sel_KRS167+1.p_1',axiom_3) ).
fof(5,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cc1(X1)
<=> cc2(X1) ) ),
file('/tmp/tmpBG3Lb1/sel_KRS167+1.p_1',the_axiom) ).
fof(6,axiom,
! [X1] :
( cc1(X1)
<=> ( ? [X2] : rp(X1,X2)
& ! [X2,X3] :
( ( rp(X1,X2)
& rp(X1,X3) )
=> X2 = X3 ) ) ),
file('/tmp/tmpBG3Lb1/sel_KRS167+1.p_1',axiom_2) ).
fof(9,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpBG3Lb1/sel_KRS167+1.p_1',axiom_1) ).
fof(14,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cc1(X1)
<=> cc2(X1) ) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(15,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(16,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cc1(X1)
<=> cc2(X1) ) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(17,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(18,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(19,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(20,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[18]) ).
fof(21,plain,
! [X1] :
( ( ~ cc2(X1)
| ( ? [X2] : rp(X1,X2)
& ! [X2,X3] :
( ~ rp(X1,X2)
| ~ rp(X1,X3)
| X2 = X3 ) ) )
& ( ! [X2] : ~ rp(X1,X2)
| ? [X2,X3] :
( rp(X1,X2)
& rp(X1,X3)
& X2 != X3 )
| cc2(X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(22,plain,
! [X4] :
( ( ~ cc2(X4)
| ( ? [X5] : rp(X4,X5)
& ! [X6,X7] :
( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 ) ) )
& ( ! [X8] : ~ rp(X4,X8)
| ? [X9,X10] :
( rp(X4,X9)
& rp(X4,X10)
& X9 != X10 )
| cc2(X4) ) ),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,plain,
! [X4] :
( ( ~ cc2(X4)
| ( rp(X4,esk1_1(X4))
& ! [X6,X7] :
( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 ) ) )
& ( ! [X8] : ~ rp(X4,X8)
| ( rp(X4,esk2_1(X4))
& rp(X4,esk3_1(X4))
& esk2_1(X4) != esk3_1(X4) )
| cc2(X4) ) ),
inference(skolemize,[status(esa)],[22]) ).
fof(24,plain,
! [X4,X6,X7,X8] :
( ( ~ rp(X4,X8)
| ( rp(X4,esk2_1(X4))
& rp(X4,esk3_1(X4))
& esk2_1(X4) != esk3_1(X4) )
| cc2(X4) )
& ( ( ( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 )
& rp(X4,esk1_1(X4)) )
| ~ cc2(X4) ) ),
inference(shift_quantors,[status(thm)],[23]) ).
fof(25,plain,
! [X4,X6,X7,X8] :
( ( rp(X4,esk2_1(X4))
| ~ rp(X4,X8)
| cc2(X4) )
& ( rp(X4,esk3_1(X4))
| ~ rp(X4,X8)
| cc2(X4) )
& ( esk2_1(X4) != esk3_1(X4)
| ~ rp(X4,X8)
| cc2(X4) )
& ( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7
| ~ cc2(X4) )
& ( rp(X4,esk1_1(X4))
| ~ cc2(X4) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(26,plain,
( rp(X1,esk1_1(X1))
| ~ cc2(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,plain,
( X2 = X3
| ~ cc2(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(28,plain,
( cc2(X1)
| ~ rp(X1,X2)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(29,plain,
( cc2(X1)
| rp(X1,esk3_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(30,plain,
( cc2(X1)
| rp(X1,esk2_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(37,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ? [X1] :
( ( ~ cc1(X1)
| ~ cc2(X1) )
& ( cc1(X1)
| cc2(X1) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(38,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ? [X4] :
( ( ~ cc1(X4)
| ~ cc2(X4) )
& ( cc1(X4)
| cc2(X4) ) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,negated_conjecture,
( ~ cowlThing(esk4_0)
| cowlNothing(esk4_0)
| ( ( ~ xsd_string(esk5_0)
| xsd_integer(esk5_0) )
& ( xsd_string(esk5_0)
| ~ xsd_integer(esk5_0) ) )
| ( ( ~ cc1(esk6_0)
| ~ cc2(esk6_0) )
& ( cc1(esk6_0)
| cc2(esk6_0) ) ) ),
inference(skolemize,[status(esa)],[38]) ).
fof(40,negated_conjecture,
( ( ~ cc1(esk6_0)
| ~ cc2(esk6_0)
| ~ xsd_string(esk5_0)
| xsd_integer(esk5_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk4_0) )
& ( cc1(esk6_0)
| cc2(esk6_0)
| ~ xsd_string(esk5_0)
| xsd_integer(esk5_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk4_0) )
& ( ~ cc1(esk6_0)
| ~ cc2(esk6_0)
| xsd_string(esk5_0)
| ~ xsd_integer(esk5_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk4_0) )
& ( cc1(esk6_0)
| cc2(esk6_0)
| xsd_string(esk5_0)
| ~ xsd_integer(esk5_0)
| ~ cowlThing(esk4_0)
| cowlNothing(esk4_0) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(41,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| cc2(esk6_0)
| cc1(esk6_0)
| ~ cowlThing(esk4_0)
| ~ xsd_integer(esk5_0) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(42,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| ~ cowlThing(esk4_0)
| ~ xsd_integer(esk5_0)
| ~ cc2(esk6_0)
| ~ cc1(esk6_0) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(43,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| cc2(esk6_0)
| cc1(esk6_0)
| ~ cowlThing(esk4_0)
| ~ xsd_string(esk5_0) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(44,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| ~ cowlThing(esk4_0)
| ~ xsd_string(esk5_0)
| ~ cc2(esk6_0)
| ~ cc1(esk6_0) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(45,plain,
! [X1] :
( ( ~ cc1(X1)
| ( ? [X2] : rp(X1,X2)
& ! [X2,X3] :
( ~ rp(X1,X2)
| ~ rp(X1,X3)
| X2 = X3 ) ) )
& ( ! [X2] : ~ rp(X1,X2)
| ? [X2,X3] :
( rp(X1,X2)
& rp(X1,X3)
& X2 != X3 )
| cc1(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(46,plain,
! [X4] :
( ( ~ cc1(X4)
| ( ? [X5] : rp(X4,X5)
& ! [X6,X7] :
( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 ) ) )
& ( ! [X8] : ~ rp(X4,X8)
| ? [X9,X10] :
( rp(X4,X9)
& rp(X4,X10)
& X9 != X10 )
| cc1(X4) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X4] :
( ( ~ cc1(X4)
| ( rp(X4,esk7_1(X4))
& ! [X6,X7] :
( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 ) ) )
& ( ! [X8] : ~ rp(X4,X8)
| ( rp(X4,esk8_1(X4))
& rp(X4,esk9_1(X4))
& esk8_1(X4) != esk9_1(X4) )
| cc1(X4) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X4,X6,X7,X8] :
( ( ~ rp(X4,X8)
| ( rp(X4,esk8_1(X4))
& rp(X4,esk9_1(X4))
& esk8_1(X4) != esk9_1(X4) )
| cc1(X4) )
& ( ( ( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7 )
& rp(X4,esk7_1(X4)) )
| ~ cc1(X4) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
fof(49,plain,
! [X4,X6,X7,X8] :
( ( rp(X4,esk8_1(X4))
| ~ rp(X4,X8)
| cc1(X4) )
& ( rp(X4,esk9_1(X4))
| ~ rp(X4,X8)
| cc1(X4) )
& ( esk8_1(X4) != esk9_1(X4)
| ~ rp(X4,X8)
| cc1(X4) )
& ( ~ rp(X4,X6)
| ~ rp(X4,X7)
| X6 = X7
| ~ cc1(X4) )
& ( rp(X4,esk7_1(X4))
| ~ cc1(X4) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(50,plain,
( rp(X1,esk7_1(X1))
| ~ cc1(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(51,plain,
( X2 = X3
| ~ cc1(X1)
| ~ rp(X1,X3)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(52,plain,
( cc1(X1)
| ~ rp(X1,X2)
| esk8_1(X1) != esk9_1(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(53,plain,
( cc1(X1)
| rp(X1,esk9_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(54,plain,
( cc1(X1)
| rp(X1,esk8_1(X1))
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[49]) ).
fof(61,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(62,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[61]) ).
cnf(63,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(64,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(77,negated_conjecture,
( cowlNothing(esk4_0)
| cc2(esk6_0)
| xsd_integer(esk5_0)
| cc1(esk6_0)
| $false
| ~ xsd_string(esk5_0) ),
inference(rw,[status(thm)],[43,20,theory(equality)]),
[unfolding] ).
cnf(78,negated_conjecture,
( cowlNothing(esk4_0)
| cc2(esk6_0)
| cc1(esk6_0)
| xsd_string(esk5_0)
| $false
| ~ xsd_integer(esk5_0) ),
inference(rw,[status(thm)],[41,20,theory(equality)]),
[unfolding] ).
cnf(79,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_integer(esk5_0)
| $false
| ~ cc2(esk6_0)
| ~ cc1(esk6_0)
| ~ xsd_string(esk5_0) ),
inference(rw,[status(thm)],[44,20,theory(equality)]),
[unfolding] ).
cnf(80,negated_conjecture,
( cowlNothing(esk4_0)
| xsd_string(esk5_0)
| $false
| ~ cc2(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cc1(esk6_0) ),
inference(rw,[status(thm)],[42,20,theory(equality)]),
[unfolding] ).
cnf(82,negated_conjecture,
( cc2(esk6_0)
| xsd_integer(esk5_0)
| cc1(esk6_0)
| ~ xsd_string(esk5_0) ),
inference(sr,[status(thm)],[77,19,theory(equality)]) ).
cnf(83,negated_conjecture,
( cc1(esk6_0)
| xsd_integer(esk5_0)
| cc2(esk6_0) ),
inference(csr,[status(thm)],[82,63]) ).
cnf(84,negated_conjecture,
( cc1(esk6_0)
| cc2(esk6_0)
| ~ xsd_string(esk5_0) ),
inference(spm,[status(thm)],[64,83,theory(equality)]) ).
cnf(85,negated_conjecture,
( cc2(esk6_0)
| cc1(esk6_0)
| xsd_string(esk5_0)
| ~ xsd_integer(esk5_0) ),
inference(sr,[status(thm)],[78,19,theory(equality)]) ).
cnf(86,negated_conjecture,
( xsd_string(esk5_0)
| cc1(esk6_0)
| cc2(esk6_0) ),
inference(csr,[status(thm)],[85,83]) ).
cnf(87,negated_conjecture,
( xsd_integer(esk5_0)
| ~ cc2(esk6_0)
| ~ cc1(esk6_0)
| ~ xsd_string(esk5_0) ),
inference(sr,[status(thm)],[79,19,theory(equality)]) ).
cnf(88,negated_conjecture,
( xsd_integer(esk5_0)
| ~ cc1(esk6_0)
| ~ cc2(esk6_0) ),
inference(csr,[status(thm)],[87,63]) ).
cnf(89,negated_conjecture,
( xsd_string(esk5_0)
| ~ cc2(esk6_0)
| ~ xsd_integer(esk5_0)
| ~ cc1(esk6_0) ),
inference(sr,[status(thm)],[80,19,theory(equality)]) ).
cnf(90,negated_conjecture,
( xsd_string(esk5_0)
| ~ cc1(esk6_0)
| ~ cc2(esk6_0) ),
inference(csr,[status(thm)],[89,88]) ).
cnf(92,plain,
( rp(X1,esk2_1(X1))
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[30,50,theory(equality)]) ).
cnf(94,plain,
( rp(X1,esk3_1(X1))
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[29,50,theory(equality)]) ).
cnf(95,plain,
( cc1(X1)
| rp(X1,esk8_1(X1))
| ~ cc2(X1) ),
inference(spm,[status(thm)],[54,26,theory(equality)]) ).
cnf(97,plain,
( cc1(X1)
| rp(X1,esk9_1(X1))
| ~ cc2(X1) ),
inference(spm,[status(thm)],[53,26,theory(equality)]) ).
cnf(99,plain,
( X1 = esk1_1(X2)
| ~ rp(X2,X1)
| ~ cc2(X2) ),
inference(spm,[status(thm)],[27,26,theory(equality)]) ).
cnf(102,plain,
( X1 = esk7_1(X2)
| ~ cc1(X2)
| ~ rp(X2,X1) ),
inference(spm,[status(thm)],[51,50,theory(equality)]) ).
cnf(103,negated_conjecture,
( cc1(esk6_0)
| cc2(esk6_0) ),
inference(csr,[status(thm)],[84,86]) ).
cnf(133,plain,
( esk8_1(X1) = esk1_1(X1)
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[99,95,theory(equality)]) ).
cnf(134,plain,
( esk9_1(X1) = esk1_1(X1)
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[99,97,theory(equality)]) ).
cnf(138,plain,
( esk9_1(X1) = esk8_1(X1)
| cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[133,134,theory(equality)]) ).
cnf(139,plain,
( cc1(X1)
| ~ rp(X1,X2)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[52,138,theory(equality)]) ).
cnf(141,plain,
( cc1(X1)
| ~ cc2(X1) ),
inference(spm,[status(thm)],[139,26,theory(equality)]) ).
cnf(147,negated_conjecture,
( xsd_integer(esk5_0)
| ~ cc2(esk6_0) ),
inference(spm,[status(thm)],[88,141,theory(equality)]) ).
cnf(148,negated_conjecture,
( xsd_string(esk5_0)
| ~ cc2(esk6_0) ),
inference(spm,[status(thm)],[90,141,theory(equality)]) ).
cnf(156,plain,
( esk2_1(X1) = esk7_1(X1)
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[102,92,theory(equality)]) ).
cnf(157,plain,
( esk3_1(X1) = esk7_1(X1)
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[102,94,theory(equality)]) ).
cnf(163,plain,
( esk3_1(X1) = esk2_1(X1)
| cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[156,157,theory(equality)]) ).
cnf(164,plain,
( cc2(X1)
| ~ rp(X1,X2)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[28,163,theory(equality)]) ).
cnf(167,plain,
( cc2(X1)
| ~ cc1(X1) ),
inference(spm,[status(thm)],[164,50,theory(equality)]) ).
cnf(174,negated_conjecture,
cc2(esk6_0),
inference(spm,[status(thm)],[167,103,theory(equality)]) ).
cnf(176,negated_conjecture,
( xsd_string(esk5_0)
| $false ),
inference(rw,[status(thm)],[148,174,theory(equality)]) ).
cnf(177,negated_conjecture,
xsd_string(esk5_0),
inference(cn,[status(thm)],[176,theory(equality)]) ).
cnf(178,negated_conjecture,
( xsd_integer(esk5_0)
| $false ),
inference(rw,[status(thm)],[147,174,theory(equality)]) ).
cnf(179,negated_conjecture,
xsd_integer(esk5_0),
inference(cn,[status(thm)],[178,theory(equality)]) ).
cnf(181,negated_conjecture,
~ xsd_string(esk5_0),
inference(spm,[status(thm)],[64,179,theory(equality)]) ).
cnf(182,negated_conjecture,
$false,
inference(rw,[status(thm)],[181,177,theory(equality)]) ).
cnf(183,negated_conjecture,
$false,
inference(cn,[status(thm)],[182,theory(equality)]) ).
cnf(184,negated_conjecture,
$false,
183,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS167+1.p
% --creating new selector for []
% -running prover on /tmp/tmpBG3Lb1/sel_KRS167+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS167+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS167+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS167+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------