TSTP Solution File: KRS163+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS163+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:04:03 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 143 ( 18 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 170 ( 67 ~; 73 |; 25 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,conjecture,
( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',the_axiom) ).
fof(5,axiom,
cA(ia),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',axiom_2) ).
fof(7,axiom,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',axiom_0) ).
fof(8,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',axiom_1) ).
fof(10,axiom,
cB(ib),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',axiom_4) ).
fof(13,axiom,
! [X3] :
~ ( cB(X3)
& cA(X3) ),
file('/tmp/tmp73eRGN/sel_KRS163+1.p_1',axiom_6) ).
fof(15,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
inference(assume_negation,[status(cth)],[4]) ).
fof(16,negated_conjecture,
~ ( ! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& cowlThing(ia)
& cowlThing(ib)
& ia != ib ),
inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).
fof(17,plain,
! [X3] :
( cowlThing(X3)
& ~ cowlNothing(X3) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(18,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(26,negated_conjecture,
( ? [X3] :
( ~ cowlThing(X3)
| cowlNothing(X3) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(27,negated_conjecture,
( ? [X4] :
( ~ cowlThing(X4)
| cowlNothing(X4) )
| ? [X5] :
( ( ~ xsd_string(X5)
| xsd_integer(X5) )
& ( xsd_string(X5)
| ~ xsd_integer(X5) ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ),
inference(skolemize,[status(esa)],[27]) ).
fof(29,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib)
| ia = ib ) ),
inference(distribute,[status(thm)],[28]) ).
cnf(30,negated_conjecture,
( ia = ib
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,negated_conjecture,
( ia = ib
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(32,plain,
cA(ia),
inference(split_conjunct,[status(thm)],[5]) ).
fof(36,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(variable_rename,[status(thm)],[17]) ).
cnf(37,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[36]) ).
fof(39,plain,
! [X3] :
( ( ~ xsd_string(X3)
| ~ xsd_integer(X3) )
& ( xsd_integer(X3)
| xsd_string(X3) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(40,plain,
! [X4] :
( ( ~ xsd_string(X4)
| ~ xsd_integer(X4) )
& ( xsd_integer(X4)
| xsd_string(X4) ) ),
inference(variable_rename,[status(thm)],[39]) ).
cnf(41,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(42,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(46,plain,
cB(ib),
inference(split_conjunct,[status(thm)],[10]) ).
fof(51,plain,
! [X3] :
( ~ cB(X3)
| ~ cA(X3) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(52,plain,
! [X4] :
( ~ cB(X4)
| ~ cA(X4) ),
inference(variable_rename,[status(thm)],[51]) ).
cnf(53,plain,
( ~ cA(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(59,negated_conjecture,
( ib = ia
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| $false
| $false
| $false
| ~ xsd_integer(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[30,38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),
[unfolding] ).
cnf(60,negated_conjecture,
( ib = ia
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[31,38,theory(equality)]),38,theory(equality)]),38,theory(equality)]),
[unfolding] ).
cnf(62,negated_conjecture,
( ib = ia
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[59,37,theory(equality)]) ).
cnf(63,negated_conjecture,
( ib = ia
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[62,41]) ).
cnf(64,negated_conjecture,
( ib = ia
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[60,37,theory(equality)]) ).
cnf(65,negated_conjecture,
( ib = ia
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[64,41]) ).
cnf(66,negated_conjecture,
( ib = ia
| ~ xsd_string(esk2_0) ),
inference(spm,[status(thm)],[42,65,theory(equality)]) ).
cnf(67,plain,
~ cB(ia),
inference(spm,[status(thm)],[53,32,theory(equality)]) ).
cnf(68,negated_conjecture,
ib = ia,
inference(csr,[status(thm)],[66,63]) ).
cnf(69,plain,
cB(ia),
inference(rw,[status(thm)],[46,68,theory(equality)]) ).
cnf(72,plain,
$false,
inference(sr,[status(thm)],[69,67,theory(equality)]) ).
cnf(73,plain,
$false,
72,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS163+1.p
% --creating new selector for []
% -running prover on /tmp/tmp73eRGN/sel_KRS163+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS163+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS163+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS163+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
%
%------------------------------------------------------------------------------