TSTP Solution File: KRS141+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS141+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:02:25 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 13 unt; 0 def)
% Number of atoms : 146 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 171 ( 71 ~; 72 |; 21 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 31 ( 2 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cc(io)
& cowlThing(io) ),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',the_axiom) ).
fof(2,axiom,
! [X1] :
( cr(X1)
=> ! [X2] :
( rp(X1,X2)
=> cc(X2) ) ),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',axiom_2) ).
fof(3,axiom,
cr(ii),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',axiom_3) ).
fof(4,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',axiom_0) ).
fof(5,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',axiom_1) ).
fof(8,axiom,
rp(ii,io),
file('/tmp/tmpIySNb5/sel_KRS141+1.p_1',axiom_5) ).
fof(9,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cc(io)
& cowlThing(io) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(10,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cc(io)
& cowlThing(io) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(11,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(12,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(13,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ~ cc(io)
| ~ cowlThing(io) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(14,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cc(io)
| ~ cowlThing(io) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ~ cc(io)
| ~ cowlThing(io) ),
inference(skolemize,[status(esa)],[14]) ).
fof(16,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cc(io)
| ~ cowlThing(io) ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(io)
| ~ cc(io)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(io)
| ~ cc(io)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(19,plain,
! [X1] :
( ~ cr(X1)
| ! [X2] :
( ~ rp(X1,X2)
| cc(X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(20,plain,
! [X3] :
( ~ cr(X3)
| ! [X4] :
( ~ rp(X3,X4)
| cc(X4) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X3,X4] :
( ~ rp(X3,X4)
| cc(X4)
| ~ cr(X3) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(22,plain,
( cc(X2)
| ~ cr(X1)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
cr(ii),
inference(split_conjunct,[status(thm)],[3]) ).
fof(24,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[11]) ).
cnf(25,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[24]) ).
fof(27,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(28,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[27]) ).
cnf(29,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(33,plain,
rp(ii,io),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(36,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| $false
| $false
| ~ xsd_integer(esk2_0)
| ~ cc(io) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[17,26,theory(equality)]),26,theory(equality)]),
[unfolding] ).
cnf(37,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| $false
| $false
| ~ xsd_string(esk2_0)
| ~ cc(io) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[18,26,theory(equality)]),26,theory(equality)]),
[unfolding] ).
cnf(39,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cc(io) ),
inference(sr,[status(thm)],[36,25,theory(equality)]) ).
cnf(40,negated_conjecture,
( xsd_string(esk2_0)
| ~ cc(io) ),
inference(csr,[status(thm)],[39,29]) ).
cnf(41,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cc(io) ),
inference(sr,[status(thm)],[37,25,theory(equality)]) ).
cnf(42,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cc(io) ),
inference(csr,[status(thm)],[41,29]) ).
cnf(43,plain,
( cc(io)
| ~ cr(ii) ),
inference(spm,[status(thm)],[22,33,theory(equality)]) ).
cnf(44,plain,
( cc(io)
| $false ),
inference(rw,[status(thm)],[43,23,theory(equality)]) ).
cnf(45,plain,
cc(io),
inference(cn,[status(thm)],[44,theory(equality)]) ).
cnf(46,negated_conjecture,
( xsd_integer(esk2_0)
| $false ),
inference(rw,[status(thm)],[42,45,theory(equality)]) ).
cnf(47,negated_conjecture,
xsd_integer(esk2_0),
inference(cn,[status(thm)],[46,theory(equality)]) ).
cnf(48,negated_conjecture,
( xsd_string(esk2_0)
| $false ),
inference(rw,[status(thm)],[40,45,theory(equality)]) ).
cnf(49,negated_conjecture,
xsd_string(esk2_0),
inference(cn,[status(thm)],[48,theory(equality)]) ).
cnf(50,negated_conjecture,
~ xsd_string(esk2_0),
inference(spm,[status(thm)],[30,47,theory(equality)]) ).
cnf(51,negated_conjecture,
$false,
inference(rw,[status(thm)],[50,49,theory(equality)]) ).
cnf(52,negated_conjecture,
$false,
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
$false,
52,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS141+1.p
% --creating new selector for []
% -running prover on /tmp/tmpIySNb5/sel_KRS141+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS141+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS141+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS141+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
%
%------------------------------------------------------------------------------