%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS129+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:01:32 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 11 unt; 0 def)
% Number of atoms : 167 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 197 ( 80 ~; 79 |; 31 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 49 ( 4 sgn 30 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
rhasEuroMP(iUK,iKinnock),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',axiom_13) ).
fof(5,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cEuroMP(iKinnock) ),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',the_axiom) ).
fof(7,axiom,
! [X3] :
( cEuroMP(X3)
<=> ? [X4] :
( risEuroMPFrom(X3,X4)
& cowlThing(X4) ) ),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',axiom_3) ).
fof(8,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',axiom_0) ).
fof(9,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',axiom_1) ).
fof(13,axiom,
! [X3,X4] :
( risEuroMPFrom(X3,X4)
<=> rhasEuroMP(X4,X3) ),
file('/tmp/tmpY1z_Rh/sel_KRS129+1.p_1',axiom_5) ).
fof(28,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cEuroMP(iKinnock) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(29,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cEuroMP(iKinnock) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(30,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(31,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
cnf(37,plain,
rhasEuroMP(iUK,iKinnock),
inference(split_conjunct,[status(thm)],[4]) ).
fof(38,negated_conjecture,
( ? [X3] :
( ~ cowlThing(X3)
| cowlNothing(X3) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cEuroMP(iKinnock) ),
inference(fof_nnf,[status(thm)],[29]) ).
fof(39,negated_conjecture,
( ? [X4] :
( ~ cowlThing(X4)
| cowlNothing(X4) )
| ? [X5] :
( ( ~ xsd_string(X5)
| xsd_integer(X5) )
& ( xsd_string(X5)
| ~ xsd_integer(X5) ) )
| ~ cEuroMP(iKinnock) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ~ cEuroMP(iKinnock) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cEuroMP(iKinnock) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cEuroMP(iKinnock) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(42,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cEuroMP(iKinnock)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(54,plain,
! [X3] :
( ( ~ cEuroMP(X3)
| ? [X4] :
( risEuroMPFrom(X3,X4)
& cowlThing(X4) ) )
& ( ! [X4] :
( ~ risEuroMPFrom(X3,X4)
| ~ cowlThing(X4) )
| cEuroMP(X3) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(55,plain,
! [X5] :
( ( ~ cEuroMP(X5)
| ? [X6] :
( risEuroMPFrom(X5,X6)
& cowlThing(X6) ) )
& ( ! [X7] :
( ~ risEuroMPFrom(X5,X7)
| ~ cowlThing(X7) )
| cEuroMP(X5) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X5] :
( ( ~ cEuroMP(X5)
| ( risEuroMPFrom(X5,esk3_1(X5))
& cowlThing(esk3_1(X5)) ) )
& ( ! [X7] :
( ~ risEuroMPFrom(X5,X7)
| ~ cowlThing(X7) )
| cEuroMP(X5) ) ),
inference(skolemize,[status(esa)],[55]) ).
fof(57,plain,
! [X5,X7] :
( ( ~ risEuroMPFrom(X5,X7)
| ~ cowlThing(X7)
| cEuroMP(X5) )
& ( ~ cEuroMP(X5)
| ( risEuroMPFrom(X5,esk3_1(X5))
& cowlThing(esk3_1(X5)) ) ) ),
inference(shift_quantors,[status(thm)],[56]) ).
fof(58,plain,
! [X5,X7] :
( ( ~ risEuroMPFrom(X5,X7)
| ~ cowlThing(X7)
| cEuroMP(X5) )
& ( risEuroMPFrom(X5,esk3_1(X5))
| ~ cEuroMP(X5) )
& ( cowlThing(esk3_1(X5))
| ~ cEuroMP(X5) ) ),
inference(distribute,[status(thm)],[57]) ).
cnf(61,plain,
( cEuroMP(X1)
| ~ cowlThing(X2)
| ~ risEuroMPFrom(X1,X2) ),
inference(split_conjunct,[status(thm)],[58]) ).
fof(62,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(variable_rename,[status(thm)],[30]) ).
cnf(63,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(64,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[62]) ).
fof(65,plain,
! [X3] :
( ( ~ xsd_string(X3)
| ~ xsd_integer(X3) )
& ( xsd_integer(X3)
| xsd_string(X3) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(66,plain,
! [X4] :
( ( ~ xsd_string(X4)
| ~ xsd_integer(X4) )
& ( xsd_integer(X4)
| xsd_string(X4) ) ),
inference(variable_rename,[status(thm)],[65]) ).
cnf(67,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
cnf(68,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[66]) ).
fof(74,plain,
! [X3,X4] :
( ( ~ risEuroMPFrom(X3,X4)
| rhasEuroMP(X4,X3) )
& ( ~ rhasEuroMP(X4,X3)
| risEuroMPFrom(X3,X4) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(75,plain,
! [X5,X6] :
( ( ~ risEuroMPFrom(X5,X6)
| rhasEuroMP(X6,X5) )
& ( ~ rhasEuroMP(X6,X5)
| risEuroMPFrom(X5,X6) ) ),
inference(variable_rename,[status(thm)],[74]) ).
cnf(76,plain,
( risEuroMPFrom(X1,X2)
| ~ rhasEuroMP(X2,X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(115,plain,
( cEuroMP(X1)
| $false
| ~ risEuroMPFrom(X1,X2) ),
inference(rw,[status(thm)],[61,64,theory(equality)]),
[unfolding] ).
cnf(116,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| $false
| ~ xsd_integer(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(rw,[status(thm)],[42,64,theory(equality)]),
[unfolding] ).
cnf(117,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| $false
| ~ xsd_string(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(rw,[status(thm)],[43,64,theory(equality)]),
[unfolding] ).
cnf(119,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(sr,[status(thm)],[116,63,theory(equality)]) ).
cnf(120,negated_conjecture,
( xsd_string(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[119,67]) ).
cnf(121,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(sr,[status(thm)],[117,63,theory(equality)]) ).
cnf(122,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cEuroMP(iKinnock) ),
inference(csr,[status(thm)],[121,67]) ).
cnf(126,plain,
( cEuroMP(X1)
| ~ rhasEuroMP(X2,X1) ),
inference(spm,[status(thm)],[115,76,theory(equality)]) ).
cnf(135,plain,
cEuroMP(iKinnock),
inference(spm,[status(thm)],[126,37,theory(equality)]) ).
cnf(137,negated_conjecture,
( xsd_integer(esk2_0)
| $false ),
inference(rw,[status(thm)],[122,135,theory(equality)]) ).
cnf(138,negated_conjecture,
xsd_integer(esk2_0),
inference(cn,[status(thm)],[137,theory(equality)]) ).
cnf(139,negated_conjecture,
( xsd_string(esk2_0)
| $false ),
inference(rw,[status(thm)],[120,135,theory(equality)]) ).
cnf(140,negated_conjecture,
xsd_string(esk2_0),
inference(cn,[status(thm)],[139,theory(equality)]) ).
cnf(141,negated_conjecture,
~ xsd_string(esk2_0),
inference(spm,[status(thm)],[68,138,theory(equality)]) ).
cnf(158,negated_conjecture,
$false,
inference(rw,[status(thm)],[141,140,theory(equality)]) ).
cnf(159,negated_conjecture,
$false,
inference(cn,[status(thm)],[158,theory(equality)]) ).
cnf(160,negated_conjecture,
$false,
159,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS129+1.p
% --creating new selector for []
% -running prover on /tmp/tmpY1z_Rh/sel_KRS129+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS129+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS129+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS129+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
%
%------------------------------------------------------------------------------