%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS160+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:49 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 14 unt; 0 def)
% Number of atoms : 212 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 271 ( 112 ~; 111 |; 41 &)
% ( 7 <=>; 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 : 31 ( 2 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC8xcomp(X1)
& cC12(X1) ) ),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_12) ).
fof(8,axiom,
cTEST(iV21080),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_13) ).
fof(9,axiom,
cC4(iV21081),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_18) ).
fof(11,axiom,
! [X1] :
( cC10(X1)
<=> ( cC4(X1)
& cC2(X1) ) ),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_2) ).
fof(13,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_0) ).
fof(14,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_1) ).
fof(22,axiom,
cC2(iV21081),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',axiom_20) ).
fof(23,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cowlThing(iV21080)
& cC12(iV21080)
& cC10(iV21081)
& cowlThing(iV21081) ),
file('/tmp/tmpk8HQOk/sel_KRS160+1.p_1',the_axiom) ).
fof(24,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)],[23]) ).
fof(25,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(26,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(27,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)],[24,theory(equality)]) ).
fof(48,plain,
! [X1] :
( ( ~ cTEST(X1)
| ( cC8xcomp(X1)
& cC12(X1) ) )
& ( ~ cC8xcomp(X1)
| ~ cC12(X1)
| cTEST(X1) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(49,plain,
! [X2] :
( ( ~ cTEST(X2)
| ( cC8xcomp(X2)
& cC12(X2) ) )
& ( ~ cC8xcomp(X2)
| ~ cC12(X2)
| cTEST(X2) ) ),
inference(variable_rename,[status(thm)],[48]) ).
fof(50,plain,
! [X2] :
( ( cC8xcomp(X2)
| ~ cTEST(X2) )
& ( cC12(X2)
| ~ cTEST(X2) )
& ( ~ cC8xcomp(X2)
| ~ cC12(X2)
| cTEST(X2) ) ),
inference(distribute,[status(thm)],[49]) ).
cnf(52,plain,
( cC12(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(54,plain,
cTEST(iV21080),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(55,plain,
cC4(iV21081),
inference(split_conjunct,[status(thm)],[9]) ).
fof(57,plain,
! [X1] :
( ( ~ cC10(X1)
| ( cC4(X1)
& cC2(X1) ) )
& ( ~ cC4(X1)
| ~ cC2(X1)
| cC10(X1) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(58,plain,
! [X2] :
( ( ~ cC10(X2)
| ( cC4(X2)
& cC2(X2) ) )
& ( ~ cC4(X2)
| ~ cC2(X2)
| cC10(X2) ) ),
inference(variable_rename,[status(thm)],[57]) ).
fof(59,plain,
! [X2] :
( ( cC4(X2)
| ~ cC10(X2) )
& ( cC2(X2)
| ~ cC10(X2) )
& ( ~ cC4(X2)
| ~ cC2(X2)
| cC10(X2) ) ),
inference(distribute,[status(thm)],[58]) ).
cnf(60,plain,
( cC10(X1)
| ~ cC2(X1)
| ~ cC4(X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
fof(71,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[25]) ).
cnf(72,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[71]) ).
cnf(73,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[71]) ).
fof(74,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(75,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[74]) ).
cnf(76,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(77,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[75]) ).
cnf(115,plain,
cC2(iV21081),
inference(split_conjunct,[status(thm)],[22]) ).
fof(116,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)],[27]) ).
fof(117,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)],[116]) ).
fof(118,negated_conjecture,
( ~ cowlThing(esk9_0)
| cowlNothing(esk9_0)
| ( ( ~ xsd_string(esk10_0)
| xsd_integer(esk10_0) )
& ( xsd_string(esk10_0)
| ~ xsd_integer(esk10_0) ) )
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ),
inference(skolemize,[status(esa)],[117]) ).
fof(119,negated_conjecture,
( ( ~ xsd_string(esk10_0)
| xsd_integer(esk10_0)
| ~ cowlThing(esk9_0)
| cowlNothing(esk9_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) )
& ( xsd_string(esk10_0)
| ~ xsd_integer(esk10_0)
| ~ cowlThing(esk9_0)
| cowlNothing(esk9_0)
| ~ cowlThing(iV21080)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ cowlThing(iV21081) ) ),
inference(distribute,[status(thm)],[118]) ).
cnf(120,negated_conjecture,
( cowlNothing(esk9_0)
| xsd_string(esk10_0)
| ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk9_0)
| ~ xsd_integer(esk10_0) ),
inference(split_conjunct,[status(thm)],[119]) ).
cnf(121,negated_conjecture,
( cowlNothing(esk9_0)
| xsd_integer(esk10_0)
| ~ cowlThing(iV21081)
| ~ cC10(iV21081)
| ~ cC12(iV21080)
| ~ cowlThing(iV21080)
| ~ cowlThing(esk9_0)
| ~ xsd_string(esk10_0) ),
inference(split_conjunct,[status(thm)],[119]) ).
cnf(124,negated_conjecture,
( cowlNothing(esk9_0)
| xsd_string(esk10_0)
| $false
| $false
| $false
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_integer(esk10_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[120,73,theory(equality)]),73,theory(equality)]),73,theory(equality)]),
[unfolding] ).
cnf(125,negated_conjecture,
( cowlNothing(esk9_0)
| xsd_integer(esk10_0)
| $false
| $false
| $false
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_string(esk10_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[121,73,theory(equality)]),73,theory(equality)]),73,theory(equality)]),
[unfolding] ).
cnf(127,plain,
cC12(iV21080),
inference(spm,[status(thm)],[52,54,theory(equality)]) ).
cnf(128,negated_conjecture,
( xsd_string(esk10_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_integer(esk10_0) ),
inference(sr,[status(thm)],[124,72,theory(equality)]) ).
cnf(129,negated_conjecture,
( xsd_string(esk10_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[128,76]) ).
cnf(130,negated_conjecture,
( xsd_integer(esk10_0)
| ~ cC12(iV21080)
| ~ cC10(iV21081)
| ~ xsd_string(esk10_0) ),
inference(sr,[status(thm)],[125,72,theory(equality)]) ).
cnf(131,negated_conjecture,
( xsd_integer(esk10_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[130,76]) ).
cnf(132,negated_conjecture,
( ~ xsd_string(esk10_0)
| ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(spm,[status(thm)],[77,131,theory(equality)]) ).
cnf(140,plain,
( cC10(iV21081)
| ~ cC4(iV21081) ),
inference(spm,[status(thm)],[60,115,theory(equality)]) ).
cnf(142,plain,
( cC10(iV21081)
| $false ),
inference(rw,[status(thm)],[140,55,theory(equality)]) ).
cnf(143,plain,
cC10(iV21081),
inference(cn,[status(thm)],[142,theory(equality)]) ).
cnf(160,negated_conjecture,
( ~ cC10(iV21081)
| ~ cC12(iV21080) ),
inference(csr,[status(thm)],[132,129]) ).
cnf(161,negated_conjecture,
( ~ cC10(iV21081)
| $false ),
inference(rw,[status(thm)],[160,127,theory(equality)]) ).
cnf(162,negated_conjecture,
~ cC10(iV21081),
inference(cn,[status(thm)],[161,theory(equality)]) ).
cnf(166,negated_conjecture,
$false,
inference(rw,[status(thm)],[162,143,theory(equality)]) ).
cnf(167,negated_conjecture,
$false,
inference(cn,[status(thm)],[166,theory(equality)]) ).
cnf(168,negated_conjecture,
$false,
167,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS160+1.p
% --creating new selector for []
% -running prover on /tmp/tmpk8HQOk/sel_KRS160+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS160+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS160+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS160+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
%
%------------------------------------------------------------------------------