%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS131+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:41 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 76 ( 9 unt; 0 def)
% Number of atoms : 299 ( 0 equ)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 367 ( 144 ~; 166 |; 44 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 84 ( 5 sgn 50 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) ) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',the_axiom) ).
fof(2,axiom,
! [X1] :
( cA(X1)
<=> ? [X2] :
( rq(X1,X2)
& cowlThing(X2) ) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_2) ).
fof(3,axiom,
! [X1] :
( cNothing(X1)
=> ~ ? [X2] : rp(X1,X2) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_3) ).
fof(4,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_0) ).
fof(5,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_1) ).
fof(6,axiom,
! [X1] :
( cNothing(X1)
=> ? [X3] : rp(X1,X3) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_4) ).
fof(7,axiom,
! [X1] :
( cnotA(X1)
<=> ! [X2] :
( rq(X1,X2)
=> cNothing(X2) ) ),
file('/tmp/tmpg5MV7C/sel_KRS131+1.p_1',axiom_5) ).
fof(8,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(9,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cnotA(X1)
<=> ~ cA(X1) ) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(10,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(11,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(12,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ? [X1] :
( ( ~ cnotA(X1)
| cA(X1) )
& ( cnotA(X1)
| ~ cA(X1) ) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(13,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ? [X4] :
( ( ~ cnotA(X4)
| cA(X4) )
& ( cnotA(X4)
| ~ cA(X4) ) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ( ( ~ cnotA(esk3_0)
| cA(esk3_0) )
& ( cnotA(esk3_0)
| ~ cA(esk3_0) ) ) ),
inference(skolemize,[status(esa)],[13]) ).
fof(15,negated_conjecture,
( ( ~ cnotA(esk3_0)
| cA(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cnotA(esk3_0)
| ~ cA(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cnotA(esk3_0)
| cA(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cnotA(esk3_0)
| ~ cA(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
inference(distribute,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cnotA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cnotA(esk3_0) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(18,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cnotA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(split_conjunct,[status(thm)],[15]) ).
cnf(19,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cA(esk3_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cnotA(esk3_0) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(20,plain,
! [X1] :
( ( ~ cA(X1)
| ? [X2] :
( rq(X1,X2)
& cowlThing(X2) ) )
& ( ! [X2] :
( ~ rq(X1,X2)
| ~ cowlThing(X2) )
| cA(X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(21,plain,
! [X3] :
( ( ~ cA(X3)
| ? [X4] :
( rq(X3,X4)
& cowlThing(X4) ) )
& ( ! [X5] :
( ~ rq(X3,X5)
| ~ cowlThing(X5) )
| cA(X3) ) ),
inference(variable_rename,[status(thm)],[20]) ).
fof(22,plain,
! [X3] :
( ( ~ cA(X3)
| ( rq(X3,esk4_1(X3))
& cowlThing(esk4_1(X3)) ) )
& ( ! [X5] :
( ~ rq(X3,X5)
| ~ cowlThing(X5) )
| cA(X3) ) ),
inference(skolemize,[status(esa)],[21]) ).
fof(23,plain,
! [X3,X5] :
( ( ~ rq(X3,X5)
| ~ cowlThing(X5)
| cA(X3) )
& ( ~ cA(X3)
| ( rq(X3,esk4_1(X3))
& cowlThing(esk4_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[22]) ).
fof(24,plain,
! [X3,X5] :
( ( ~ rq(X3,X5)
| ~ cowlThing(X5)
| cA(X3) )
& ( rq(X3,esk4_1(X3))
| ~ cA(X3) )
& ( cowlThing(esk4_1(X3))
| ~ cA(X3) ) ),
inference(distribute,[status(thm)],[23]) ).
cnf(26,plain,
( rq(X1,esk4_1(X1))
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,plain,
( cA(X1)
| ~ cowlThing(X2)
| ~ rq(X1,X2) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(28,plain,
! [X1] :
( ~ cNothing(X1)
| ! [X2] : ~ rp(X1,X2) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(29,plain,
! [X3] :
( ~ cNothing(X3)
| ! [X4] : ~ rp(X3,X4) ),
inference(variable_rename,[status(thm)],[28]) ).
fof(30,plain,
! [X3,X4] :
( ~ rp(X3,X4)
| ~ cNothing(X3) ),
inference(shift_quantors,[status(thm)],[29]) ).
cnf(31,plain,
( ~ cNothing(X1)
| ~ rp(X1,X2) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[10]) ).
cnf(33,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(34,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[32]) ).
fof(35,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(36,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[35]) ).
cnf(37,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(39,plain,
! [X1] :
( ~ cNothing(X1)
| ? [X3] : rp(X1,X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(40,plain,
! [X4] :
( ~ cNothing(X4)
| ? [X5] : rp(X4,X5) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X4] :
( ~ cNothing(X4)
| rp(X4,esk5_1(X4)) ),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,plain,
( rp(X1,esk5_1(X1))
| ~ cNothing(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,plain,
! [X1] :
( ( ~ cnotA(X1)
| ! [X2] :
( ~ rq(X1,X2)
| cNothing(X2) ) )
& ( ? [X2] :
( rq(X1,X2)
& ~ cNothing(X2) )
| cnotA(X1) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(44,plain,
! [X3] :
( ( ~ cnotA(X3)
| ! [X4] :
( ~ rq(X3,X4)
| cNothing(X4) ) )
& ( ? [X5] :
( rq(X3,X5)
& ~ cNothing(X5) )
| cnotA(X3) ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X3] :
( ( ~ cnotA(X3)
| ! [X4] :
( ~ rq(X3,X4)
| cNothing(X4) ) )
& ( ( rq(X3,esk6_1(X3))
& ~ cNothing(esk6_1(X3)) )
| cnotA(X3) ) ),
inference(skolemize,[status(esa)],[44]) ).
fof(46,plain,
! [X3,X4] :
( ( ~ rq(X3,X4)
| cNothing(X4)
| ~ cnotA(X3) )
& ( ( rq(X3,esk6_1(X3))
& ~ cNothing(esk6_1(X3)) )
| cnotA(X3) ) ),
inference(shift_quantors,[status(thm)],[45]) ).
fof(47,plain,
! [X3,X4] :
( ( ~ rq(X3,X4)
| cNothing(X4)
| ~ cnotA(X3) )
& ( rq(X3,esk6_1(X3))
| cnotA(X3) )
& ( ~ cNothing(esk6_1(X3))
| cnotA(X3) ) ),
inference(distribute,[status(thm)],[46]) ).
cnf(49,plain,
( cnotA(X1)
| rq(X1,esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(50,plain,
( cNothing(X2)
| ~ cnotA(X1)
| ~ rq(X1,X2) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(52,plain,
( cA(X1)
| $false
| ~ rq(X1,X2) ),
inference(rw,[status(thm)],[27,34,theory(equality)]),
[unfolding] ).
cnf(53,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cnotA(esk3_0)
| $false
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(rw,[status(thm)],[16,34,theory(equality)]),
[unfolding] ).
cnf(54,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| cA(esk3_0)
| $false
| ~ xsd_integer(esk2_0)
| ~ cnotA(esk3_0) ),
inference(rw,[status(thm)],[17,34,theory(equality)]),
[unfolding] ).
cnf(55,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cnotA(esk3_0)
| $false
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(rw,[status(thm)],[18,34,theory(equality)]),
[unfolding] ).
cnf(56,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| cA(esk3_0)
| $false
| ~ xsd_string(esk2_0)
| ~ cnotA(esk3_0) ),
inference(rw,[status(thm)],[19,34,theory(equality)]),
[unfolding] ).
cnf(58,negated_conjecture,
( xsd_string(esk2_0)
| cnotA(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(sr,[status(thm)],[53,33,theory(equality)]) ).
cnf(59,negated_conjecture,
( cnotA(esk3_0)
| xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[58,37]) ).
cnf(60,negated_conjecture,
( cnotA(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(spm,[status(thm)],[38,59,theory(equality)]) ).
cnf(61,negated_conjecture,
( xsd_string(esk2_0)
| cA(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cnotA(esk3_0) ),
inference(sr,[status(thm)],[54,33,theory(equality)]) ).
cnf(62,negated_conjecture,
( cA(esk3_0)
| xsd_string(esk2_0)
| ~ cnotA(esk3_0) ),
inference(csr,[status(thm)],[61,37]) ).
cnf(63,negated_conjecture,
( cA(esk3_0)
| ~ xsd_integer(esk2_0)
| ~ cnotA(esk3_0) ),
inference(spm,[status(thm)],[38,62,theory(equality)]) ).
cnf(64,negated_conjecture,
( xsd_integer(esk2_0)
| cnotA(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk3_0) ),
inference(sr,[status(thm)],[55,33,theory(equality)]) ).
cnf(65,negated_conjecture,
( cnotA(esk3_0)
| xsd_integer(esk2_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[64,59]) ).
cnf(66,negated_conjecture,
( xsd_integer(esk2_0)
| cA(esk3_0)
| ~ xsd_string(esk2_0)
| ~ cnotA(esk3_0) ),
inference(sr,[status(thm)],[56,33,theory(equality)]) ).
cnf(67,negated_conjecture,
( cA(esk3_0)
| xsd_integer(esk2_0)
| ~ cnotA(esk3_0) ),
inference(csr,[status(thm)],[66,37]) ).
cnf(69,plain,
( cA(X1)
| cnotA(X1) ),
inference(spm,[status(thm)],[52,49,theory(equality)]) ).
cnf(72,plain,
( cNothing(esk4_1(X1))
| ~ cnotA(X1)
| ~ cA(X1) ),
inference(spm,[status(thm)],[50,26,theory(equality)]) ).
cnf(73,plain,
~ cNothing(X1),
inference(csr,[status(thm)],[42,31]) ).
cnf(74,negated_conjecture,
( cnotA(esk3_0)
| ~ cA(esk3_0) ),
inference(csr,[status(thm)],[60,65]) ).
cnf(76,negated_conjecture,
( cA(esk3_0)
| ~ cnotA(esk3_0) ),
inference(csr,[status(thm)],[63,67]) ).
cnf(78,negated_conjecture,
cnotA(esk3_0),
inference(spm,[status(thm)],[74,69,theory(equality)]) ).
cnf(79,plain,
( ~ cnotA(X1)
| ~ cA(X1) ),
inference(sr,[status(thm)],[72,73,theory(equality)]) ).
cnf(82,negated_conjecture,
( cA(esk3_0)
| $false ),
inference(rw,[status(thm)],[76,78,theory(equality)]) ).
cnf(83,negated_conjecture,
cA(esk3_0),
inference(cn,[status(thm)],[82,theory(equality)]) ).
cnf(85,negated_conjecture,
~ cnotA(esk3_0),
inference(spm,[status(thm)],[79,83,theory(equality)]) ).
cnf(86,negated_conjecture,
$false,
inference(rw,[status(thm)],[85,78,theory(equality)]) ).
cnf(87,negated_conjecture,
$false,
inference(cn,[status(thm)],[86,theory(equality)]) ).
cnf(88,negated_conjecture,
$false,
87,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS131+1.p
% --creating new selector for []
% -running prover on /tmp/tmpg5MV7C/sel_KRS131+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS131+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS131+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS131+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
%
%------------------------------------------------------------------------------