%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS175+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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:54 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 79 ( 8 unt; 0 def)
% Number of atoms : 387 ( 91 equ)
% Maximal formula atoms : 50 ( 4 avg)
% Number of connectives : 495 ( 187 ~; 253 |; 44 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 47 ( 2 sgn 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cA_and_B(X1)
<=> ( cA(X1)
| cB(X1) ) ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',axiom_3) ).
fof(5,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cA_and_B(X1)
<=> ( X1 = ib
| X1 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',the_axiom) ).
fof(6,axiom,
! [X1] :
( cA(X1)
<=> X1 = ia ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',axiom_2) ).
fof(8,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',axiom_0) ).
fof(9,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',axiom_1) ).
fof(11,axiom,
! [X1] :
( cB(X1)
<=> X1 = ib ),
file('/tmp/tmpxMxdvB/sel_KRS175+1.p_1',axiom_4) ).
fof(16,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cA_and_B(X1)
<=> ( X1 = ib
| X1 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(17,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cA_and_B(X1)
<=> ( X1 = ib
| X1 = ia ) )
& cowlThing(ia)
& cowlThing(ib) ),
inference(fof_simplification,[status(thm)],[16,theory(equality)]) ).
fof(18,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(19,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(20,plain,
! [X1] :
( ( ~ cA_and_B(X1)
| cA(X1)
| cB(X1) )
& ( ( ~ cA(X1)
& ~ cB(X1) )
| cA_and_B(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(21,plain,
! [X2] :
( ( ~ cA_and_B(X2)
| cA(X2)
| cB(X2) )
& ( ( ~ cA(X2)
& ~ cB(X2) )
| cA_and_B(X2) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X2] :
( ( ~ cA_and_B(X2)
| cA(X2)
| cB(X2) )
& ( ~ cA(X2)
| cA_and_B(X2) )
& ( ~ cB(X2)
| cA_and_B(X2) ) ),
inference(distribute,[status(thm)],[21]) ).
cnf(23,plain,
( cA_and_B(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,plain,
( cA_and_B(X1)
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(25,plain,
( cB(X1)
| cA(X1)
| ~ cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[22]) ).
fof(35,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ? [X1] :
( ( ~ cA_and_B(X1)
| ( X1 != ib
& X1 != ia ) )
& ( cA_and_B(X1)
| X1 = ib
| X1 = ia ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(36,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ? [X4] :
( ( ~ cA_and_B(X4)
| ( X4 != ib
& X4 != ia ) )
& ( cA_and_B(X4)
| X4 = ib
| X4 = ia ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ( ( ~ cA_and_B(esk3_0)
| ( esk3_0 != ib
& esk3_0 != ia ) )
& ( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia ) )
| ~ cowlThing(ia)
| ~ cowlThing(ib) ),
inference(skolemize,[status(esa)],[36]) ).
fof(38,negated_conjecture,
( ( esk3_0 != ib
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ia
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ib
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( esk3_0 != ia
| ~ cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) )
& ( cA_and_B(esk3_0)
| esk3_0 = ib
| esk3_0 = ia
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(ia)
| ~ cowlThing(ib) ) ),
inference(distribute,[status(thm)],[37]) ).
cnf(39,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(40,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia ),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(41,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib ),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(42,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(43,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia ),
inference(split_conjunct,[status(thm)],[38]) ).
cnf(44,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(45,plain,
! [X1] :
( ( ~ cA(X1)
| X1 = ia )
& ( X1 != ia
| cA(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(46,plain,
! [X2] :
( ( ~ cA(X2)
| X2 = ia )
& ( X2 != ia
| cA(X2) ) ),
inference(variable_rename,[status(thm)],[45]) ).
cnf(47,plain,
( cA(X1)
| X1 != ia ),
inference(split_conjunct,[status(thm)],[46]) ).
cnf(48,plain,
( X1 = ia
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[46]) ).
fof(52,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[18]) ).
cnf(53,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[52]) ).
fof(55,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(56,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[55]) ).
cnf(57,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(58,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
fof(62,plain,
! [X1] :
( ( ~ cB(X1)
| X1 = ib )
& ( X1 != ib
| cB(X1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(63,plain,
! [X2] :
( ( ~ cB(X2)
| X2 = ib )
& ( X2 != ib
| cB(X2) ) ),
inference(variable_rename,[status(thm)],[62]) ).
cnf(64,plain,
( cB(X1)
| X1 != ib ),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(65,plain,
( X1 = ib
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[63]) ).
cnf(76,negated_conjecture,
( esk3_0 = ib
| esk3_0 = ia
| cA_and_B(esk3_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[42,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(77,negated_conjecture,
( esk3_0 = ib
| esk3_0 = ia
| cA_and_B(esk3_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[39,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(78,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ib
| ~ cA_and_B(esk3_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[44,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(79,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| esk3_0 != ia
| ~ cA_and_B(esk3_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[43,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(80,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| esk3_0 != ib
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[41,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(81,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| esk3_0 != ia
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0)
| $false
| $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[40,54,theory(equality)]),54,theory(equality)]),54,theory(equality)]),
[unfolding] ).
cnf(83,negated_conjecture,
( xsd_integer(esk2_0)
| ib != esk3_0
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[78,53,theory(equality)]) ).
cnf(84,negated_conjecture,
( xsd_integer(esk2_0)
| ib != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[83,57]) ).
cnf(85,negated_conjecture,
( ~ xsd_string(esk2_0)
| ib != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[58,84,theory(equality)]) ).
cnf(86,negated_conjecture,
( xsd_integer(esk2_0)
| ia != esk3_0
| ~ cA_and_B(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[79,53,theory(equality)]) ).
cnf(87,negated_conjecture,
( xsd_integer(esk2_0)
| ia != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[86,57]) ).
cnf(88,negated_conjecture,
( ~ xsd_string(esk2_0)
| ia != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[58,87,theory(equality)]) ).
cnf(89,negated_conjecture,
( xsd_string(esk2_0)
| ib != esk3_0
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[80,53,theory(equality)]) ).
cnf(90,negated_conjecture,
( xsd_string(esk2_0)
| ib != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[89,57]) ).
cnf(91,plain,
( cA_and_B(X1)
| ia != X1 ),
inference(spm,[status(thm)],[24,47,theory(equality)]) ).
cnf(92,plain,
( cA_and_B(X1)
| ib != X1 ),
inference(spm,[status(thm)],[23,64,theory(equality)]) ).
cnf(95,negated_conjecture,
( xsd_string(esk2_0)
| ia != esk3_0
| ~ cA_and_B(esk3_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[81,53,theory(equality)]) ).
cnf(96,negated_conjecture,
( xsd_string(esk2_0)
| ia != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[95,57]) ).
cnf(97,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| cA_and_B(esk3_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[76,53,theory(equality)]) ).
cnf(98,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[97,57]) ).
cnf(100,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| cA_and_B(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[77,53,theory(equality)]) ).
cnf(101,negated_conjecture,
( ib = esk3_0
| ia = esk3_0
| xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[100,57]) ).
cnf(103,plain,
( ia = X1
| cB(X1)
| ~ cA_and_B(X1) ),
inference(spm,[status(thm)],[48,25,theory(equality)]) ).
cnf(104,negated_conjecture,
( ib != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[85,90]) ).
cnf(106,negated_conjecture,
( ia != esk3_0
| ~ xsd_string(esk2_0) ),
inference(csr,[status(thm)],[88,91]) ).
cnf(107,negated_conjecture,
( ia != esk3_0
| ~ cA_and_B(esk3_0) ),
inference(spm,[status(thm)],[106,96,theory(equality)]) ).
cnf(109,negated_conjecture,
ia != esk3_0,
inference(csr,[status(thm)],[107,91]) ).
cnf(110,negated_conjecture,
( ib = esk3_0
| xsd_integer(esk2_0)
| cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[98,109,theory(equality)]) ).
cnf(111,negated_conjecture,
( ib = esk3_0
| xsd_string(esk2_0)
| cA_and_B(esk3_0) ),
inference(sr,[status(thm)],[101,109,theory(equality)]) ).
cnf(112,negated_conjecture,
( ib = esk3_0
| cA_and_B(esk3_0)
| ~ xsd_string(esk2_0) ),
inference(spm,[status(thm)],[58,110,theory(equality)]) ).
cnf(114,negated_conjecture,
( ib = esk3_0
| cA_and_B(esk3_0) ),
inference(csr,[status(thm)],[112,111]) ).
cnf(116,negated_conjecture,
ib != esk3_0,
inference(spm,[status(thm)],[104,92,theory(equality)]) ).
cnf(117,negated_conjecture,
cA_and_B(esk3_0),
inference(sr,[status(thm)],[114,116,theory(equality)]) ).
cnf(126,plain,
( ib = X1
| ia = X1
| ~ cA_and_B(X1) ),
inference(spm,[status(thm)],[65,103,theory(equality)]) ).
cnf(127,negated_conjecture,
( ia = esk3_0
| ib = esk3_0 ),
inference(spm,[status(thm)],[126,117,theory(equality)]) ).
cnf(130,negated_conjecture,
ib = esk3_0,
inference(sr,[status(thm)],[127,109,theory(equality)]) ).
cnf(131,negated_conjecture,
$false,
inference(sr,[status(thm)],[130,116,theory(equality)]) ).
cnf(132,negated_conjecture,
$false,
131,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS175+1.p
% --creating new selector for []
% -running prover on /tmp/tmpxMxdvB/sel_KRS175+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS175+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS175+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS175+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
%
%------------------------------------------------------------------------------