TSTP Solution File: KRS152+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS152+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:03:13 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 54 ( 14 unt; 0 def)
% Number of atoms : 215 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 275 ( 114 ~; 111 |; 42 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 32 ( 2 sgn 22 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
cC2(iV21081),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_14) ).
fof(2,axiom,
cC4(iV21081),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_15) ).
fof(7,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',the_axiom) ).
fof(8,axiom,
! [X1] :
( cC10(X1)
<=> ( cC2(X1)
& cC4(X1) ) ),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_2) ).
fof(10,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_0) ).
fof(11,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_1) ).
fof(12,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC12(X1)
& ~ cC8(X1) ) ),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_6) ).
fof(13,axiom,
cTEST(iV21080),
file('/tmp/tmpyyizPf/sel_KRS152+1.p_1',axiom_7) ).
fof(18,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
inference(assume_negation,[status(cth)],[7]) ).
fof(21,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
inference(fof_simplification,[status(thm)],[18,theory(equality)]) ).
fof(22,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(23,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(24,plain,
! [X1] :
( cTEST(X1)
<=> ( cC12(X1)
& ~ cC8(X1) ) ),
inference(fof_simplification,[status(thm)],[12,theory(equality)]) ).
cnf(27,plain,
cC2(iV21081),
inference(split_conjunct,[status(thm)],[1]) ).
cnf(28,plain,
cC4(iV21081),
inference(split_conjunct,[status(thm)],[2]) ).
fof(33,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(fof_nnf,[status(thm)],[21]) ).
fof(34,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(variable_rename,[status(thm)],[33]) ).
fof(35,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(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(skolemize,[status(esa)],[34]) ).
fof(36,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(37,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(39,plain,
! [X1] :
( ( ~ cC10(X1)
| ( cC2(X1)
& cC4(X1) ) )
& ( ~ cC2(X1)
| ~ cC4(X1)
| cC10(X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(40,plain,
! [X2] :
( ( ~ cC10(X2)
| ( cC2(X2)
& cC4(X2) ) )
& ( ~ cC2(X2)
| ~ cC4(X2)
| cC10(X2) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X2] :
( ( cC2(X2)
| ~ cC10(X2) )
& ( cC4(X2)
| ~ cC10(X2) )
& ( ~ cC2(X2)
| ~ cC4(X2)
| cC10(X2) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(42,plain,
( cC10(X1)
| ~ cC4(X1)
| ~ cC2(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(53,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[22]) ).
cnf(54,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[53]) ).
cnf(55,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[53]) ).
fof(56,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(57,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[56]) ).
cnf(58,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
cnf(59,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(60,plain,
! [X1] :
( ( ~ cTEST(X1)
| ( cC12(X1)
& ~ cC8(X1) ) )
& ( ~ cC12(X1)
| cC8(X1)
| cTEST(X1) ) ),
inference(fof_nnf,[status(thm)],[24]) ).
fof(61,plain,
! [X2] :
( ( ~ cTEST(X2)
| ( cC12(X2)
& ~ cC8(X2) ) )
& ( ~ cC12(X2)
| cC8(X2)
| cTEST(X2) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X2] :
( ( cC12(X2)
| ~ cTEST(X2) )
& ( ~ cC8(X2)
| ~ cTEST(X2) )
& ( ~ cC12(X2)
| cC8(X2)
| cTEST(X2) ) ),
inference(distribute,[status(thm)],[61]) ).
cnf(65,plain,
( cC12(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[62]) ).
cnf(66,plain,
cTEST(iV21080),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(87,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| $false
| $false
| $false
| ~ xsd_integer(esk2_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[37,55,theory(equality)]),55,theory(equality)]),55,theory(equality)]),
[unfolding] ).
cnf(88,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[38,55,theory(equality)]),55,theory(equality)]),55,theory(equality)]),
[unfolding] ).
cnf(90,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(sr,[status(thm)],[87,54,theory(equality)]) ).
cnf(91,negated_conjecture,
( xsd_string(esk2_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[90,58]) ).
cnf(92,plain,
cC12(iV21080),
inference(spm,[status(thm)],[65,66,theory(equality)]) ).
cnf(93,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081) ),
inference(sr,[status(thm)],[88,54,theory(equality)]) ).
cnf(94,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[93,58]) ).
cnf(95,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(spm,[status(thm)],[59,94,theory(equality)]) ).
cnf(105,plain,
( cC10(iV21081)
| ~ cC2(iV21081) ),
inference(spm,[status(thm)],[42,28,theory(equality)]) ).
cnf(108,plain,
( cC10(iV21081)
| $false ),
inference(rw,[status(thm)],[105,27,theory(equality)]) ).
cnf(109,plain,
cC10(iV21081),
inference(cn,[status(thm)],[108,theory(equality)]) ).
cnf(120,negated_conjecture,
( ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[95,91]) ).
cnf(121,negated_conjecture,
( ~ cC10(iV21081)
| $false ),
inference(rw,[status(thm)],[120,92,theory(equality)]) ).
cnf(122,negated_conjecture,
~ cC10(iV21081),
inference(cn,[status(thm)],[121,theory(equality)]) ).
cnf(126,negated_conjecture,
$false,
inference(rw,[status(thm)],[122,109,theory(equality)]) ).
cnf(127,negated_conjecture,
$false,
inference(cn,[status(thm)],[126,theory(equality)]) ).
cnf(128,negated_conjecture,
$false,
127,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS152+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyyizPf/sel_KRS152+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS152+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS152+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS152+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
%
%------------------------------------------------------------------------------