TSTP Solution File: KRS134+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS134+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:56 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 47 ( 9 unt; 0 def)
% Number of atoms : 181 ( 0 equ)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 208 ( 74 ~; 94 |; 28 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 39 ( 3 sgn 25 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( rprop(X1,X2)
=> cA(X2) ),
file('/tmp/tmpO8Micy/sel_KRS134+1.p_1',axiom_2) ).
fof(2,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpO8Micy/sel_KRS134+1.p_1',axiom_0) ).
fof(3,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpO8Micy/sel_KRS134+1.p_1',axiom_1) ).
fof(4,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cowlThing(X1)
=> ! [X2] :
( rprop(X1,X2)
=> cA(X2) ) ) ),
file('/tmp/tmpO8Micy/sel_KRS134+1.p_1',the_axiom) ).
fof(5,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cowlThing(X1)
=> ! [X2] :
( rprop(X1,X2)
=> cA(X2) ) ) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(7,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(8,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1] :
( cowlThing(X1)
=> ! [X2] :
( rprop(X1,X2)
=> cA(X2) ) ) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(9,plain,
! [X1,X2] :
( ~ rprop(X1,X2)
| cA(X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(10,plain,
! [X3,X4] :
( ~ rprop(X3,X4)
| cA(X4) ),
inference(variable_rename,[status(thm)],[9]) ).
cnf(11,plain,
( cA(X1)
| ~ rprop(X2,X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[6]) ).
cnf(13,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(14,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[12]) ).
fof(15,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(16,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(17,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(19,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ? [X1] :
( cowlThing(X1)
& ? [X2] :
( rprop(X1,X2)
& ~ cA(X2) ) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(20,negated_conjecture,
( ? [X3] :
( ~ cowlThing(X3)
| cowlNothing(X3) )
| ? [X4] :
( ( ~ xsd_string(X4)
| xsd_integer(X4) )
& ( xsd_string(X4)
| ~ xsd_integer(X4) ) )
| ? [X5] :
( cowlThing(X5)
& ? [X6] :
( rprop(X5,X6)
& ~ cA(X6) ) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,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(esk3_0)
& rprop(esk3_0,esk4_0)
& ~ cA(esk4_0) ) ),
inference(skolemize,[status(esa)],[20]) ).
fof(22,negated_conjecture,
( ( cowlThing(esk3_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rprop(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( cowlThing(esk3_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rprop(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ cA(esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
inference(distribute,[status(thm)],[21]) ).
cnf(23,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA(esk4_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(24,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| rprop(esk3_0,esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(26,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA(esk4_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(27,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| rprop(esk3_0,esk4_0)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(31,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| rprop(esk3_0,esk4_0)
| $false
| ~ xsd_integer(esk2_0) ),
inference(rw,[status(thm)],[24,14,theory(equality)]),
[unfolding] ).
cnf(32,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| rprop(esk3_0,esk4_0)
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[27,14,theory(equality)]),
[unfolding] ).
cnf(33,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cA(esk4_0)
| $false
| ~ xsd_integer(esk2_0) ),
inference(rw,[status(thm)],[23,14,theory(equality)]),
[unfolding] ).
cnf(34,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cA(esk4_0)
| $false
| ~ xsd_string(esk2_0) ),
inference(rw,[status(thm)],[26,14,theory(equality)]),
[unfolding] ).
cnf(36,negated_conjecture,
( xsd_string(esk2_0)
| ~ cA(esk4_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[33,13,theory(equality)]) ).
cnf(37,negated_conjecture,
( xsd_string(esk2_0)
| ~ cA(esk4_0) ),
inference(csr,[status(thm)],[36,17]) ).
cnf(38,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cA(esk4_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[34,13,theory(equality)]) ).
cnf(39,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cA(esk4_0) ),
inference(csr,[status(thm)],[38,17]) ).
cnf(40,negated_conjecture,
( xsd_string(esk2_0)
| rprop(esk3_0,esk4_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[31,13,theory(equality)]) ).
cnf(41,negated_conjecture,
( xsd_string(esk2_0)
| rprop(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[40,17]) ).
cnf(42,negated_conjecture,
( cA(esk4_0)
| xsd_string(esk2_0) ),
inference(spm,[status(thm)],[11,41,theory(equality)]) ).
cnf(43,negated_conjecture,
( xsd_integer(esk2_0)
| rprop(esk3_0,esk4_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[32,13,theory(equality)]) ).
cnf(44,negated_conjecture,
( xsd_integer(esk2_0)
| rprop(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[43,17]) ).
cnf(46,negated_conjecture,
xsd_string(esk2_0),
inference(csr,[status(thm)],[42,37]) ).
cnf(47,negated_conjecture,
~ xsd_integer(esk2_0),
inference(spm,[status(thm)],[18,46,theory(equality)]) ).
cnf(50,negated_conjecture,
rprop(esk3_0,esk4_0),
inference(sr,[status(thm)],[44,47,theory(equality)]) ).
cnf(51,negated_conjecture,
cA(esk4_0),
inference(spm,[status(thm)],[11,50,theory(equality)]) ).
cnf(52,negated_conjecture,
( xsd_integer(esk2_0)
| $false ),
inference(rw,[status(thm)],[39,51,theory(equality)]) ).
cnf(53,negated_conjecture,
xsd_integer(esk2_0),
inference(cn,[status(thm)],[52,theory(equality)]) ).
cnf(54,negated_conjecture,
$false,
inference(sr,[status(thm)],[53,47,theory(equality)]) ).
cnf(55,negated_conjecture,
$false,
54,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS134+1.p
% --creating new selector for []
% -running prover on /tmp/tmpO8Micy/sel_KRS134+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS134+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS134+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS134+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
%
%------------------------------------------------------------------------------