%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS156+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:31 EST 2010
% Result : Theorem 0.44s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 50 ( 10 unt; 0 def)
% Number of atoms : 215 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 286 ( 121 ~; 117 |; 41 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 32 ( 2 sgn 21 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(34,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',axiom_0) ).
fof(35,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',axiom_1) ).
fof(73,axiom,
! [X1] :
( cTEST(X1)
<=> ( cC140(X1)
& cC116(X1) ) ),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',axiom_127) ).
fof(89,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC116(iV5475)
& cC140(iV5475)
& cowlThing(iV5475)
& cC138(iV5475) ),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',the_axiom) ).
fof(95,axiom,
cTEST(iV5475),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',axiom_131) ).
fof(136,axiom,
! [X1] :
( cC140(X1)
<=> ( cTOP(X1)
& cC138(X1) ) ),
file('/tmp/tmpRXgW_0/sel_KRS156+1.p_1',axiom_49) ).
fof(147,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC116(iV5475)
& cC140(iV5475)
& cowlThing(iV5475)
& cC138(iV5475) ),
inference(assume_negation,[status(cth)],[89]) ).
fof(148,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[34,theory(equality)]) ).
fof(149,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[35,theory(equality)]) ).
fof(150,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cC116(iV5475)
& cC140(iV5475)
& cowlThing(iV5475)
& cC138(iV5475) ),
inference(fof_simplification,[status(thm)],[147,theory(equality)]) ).
fof(361,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[148]) ).
cnf(362,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[361]) ).
cnf(363,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[361]) ).
fof(364,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[149]) ).
fof(365,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[364]) ).
cnf(366,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[365]) ).
cnf(367,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[365]) ).
fof(614,plain,
! [X1] :
( ( ~ cTEST(X1)
| ( cC140(X1)
& cC116(X1) ) )
& ( ~ cC140(X1)
| ~ cC116(X1)
| cTEST(X1) ) ),
inference(fof_nnf,[status(thm)],[73]) ).
fof(615,plain,
! [X2] :
( ( ~ cTEST(X2)
| ( cC140(X2)
& cC116(X2) ) )
& ( ~ cC140(X2)
| ~ cC116(X2)
| cTEST(X2) ) ),
inference(variable_rename,[status(thm)],[614]) ).
fof(616,plain,
! [X2] :
( ( cC140(X2)
| ~ cTEST(X2) )
& ( cC116(X2)
| ~ cTEST(X2) )
& ( ~ cC140(X2)
| ~ cC116(X2)
| cTEST(X2) ) ),
inference(distribute,[status(thm)],[615]) ).
cnf(618,plain,
( cC116(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[616]) ).
cnf(619,plain,
( cC140(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[616]) ).
fof(710,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ),
inference(fof_nnf,[status(thm)],[150]) ).
fof(711,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ),
inference(variable_rename,[status(thm)],[710]) ).
fof(712,negated_conjecture,
( ~ cowlThing(esk62_0)
| cowlNothing(esk62_0)
| ( ( ~ xsd_string(esk63_0)
| xsd_integer(esk63_0) )
& ( xsd_string(esk63_0)
| ~ xsd_integer(esk63_0) ) )
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ),
inference(skolemize,[status(esa)],[711]) ).
fof(713,negated_conjecture,
( ( ~ xsd_string(esk63_0)
| xsd_integer(esk63_0)
| ~ cowlThing(esk62_0)
| cowlNothing(esk62_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) )
& ( xsd_string(esk63_0)
| ~ xsd_integer(esk63_0)
| ~ cowlThing(esk62_0)
| cowlNothing(esk62_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ cowlThing(iV5475)
| ~ cC138(iV5475) ) ),
inference(distribute,[status(thm)],[712]) ).
cnf(714,negated_conjecture,
( cowlNothing(esk62_0)
| xsd_string(esk63_0)
| ~ cC138(iV5475)
| ~ cowlThing(iV5475)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cowlThing(esk62_0)
| ~ xsd_integer(esk63_0) ),
inference(split_conjunct,[status(thm)],[713]) ).
cnf(715,negated_conjecture,
( cowlNothing(esk62_0)
| xsd_integer(esk63_0)
| ~ cC138(iV5475)
| ~ cowlThing(iV5475)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cowlThing(esk62_0)
| ~ xsd_string(esk63_0) ),
inference(split_conjunct,[status(thm)],[713]) ).
cnf(721,plain,
cTEST(iV5475),
inference(split_conjunct,[status(thm)],[95]) ).
fof(952,plain,
! [X1] :
( ( ~ cC140(X1)
| ( cTOP(X1)
& cC138(X1) ) )
& ( ~ cTOP(X1)
| ~ cC138(X1)
| cC140(X1) ) ),
inference(fof_nnf,[status(thm)],[136]) ).
fof(953,plain,
! [X2] :
( ( ~ cC140(X2)
| ( cTOP(X2)
& cC138(X2) ) )
& ( ~ cTOP(X2)
| ~ cC138(X2)
| cC140(X2) ) ),
inference(variable_rename,[status(thm)],[952]) ).
fof(954,plain,
! [X2] :
( ( cTOP(X2)
| ~ cC140(X2) )
& ( cC138(X2)
| ~ cC140(X2) )
& ( ~ cTOP(X2)
| ~ cC138(X2)
| cC140(X2) ) ),
inference(distribute,[status(thm)],[953]) ).
cnf(956,plain,
( cC138(X1)
| ~ cC140(X1) ),
inference(split_conjunct,[status(thm)],[954]) ).
cnf(1024,negated_conjecture,
( cowlNothing(esk62_0)
| xsd_string(esk63_0)
| $false
| $false
| ~ xsd_integer(esk63_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cC138(iV5475) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[714,363,theory(equality)]),363,theory(equality)]),
[unfolding] ).
cnf(1025,negated_conjecture,
( cowlNothing(esk62_0)
| xsd_integer(esk63_0)
| $false
| $false
| ~ xsd_string(esk63_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cC138(iV5475) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[715,363,theory(equality)]),363,theory(equality)]),
[unfolding] ).
cnf(1027,negated_conjecture,
( xsd_string(esk63_0)
| ~ xsd_integer(esk63_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cC138(iV5475) ),
inference(sr,[status(thm)],[1024,362,theory(equality)]) ).
cnf(1028,negated_conjecture,
( xsd_string(esk63_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ xsd_integer(esk63_0) ),
inference(csr,[status(thm)],[1027,956]) ).
cnf(1029,negated_conjecture,
( xsd_string(esk63_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475) ),
inference(csr,[status(thm)],[1028,366]) ).
cnf(1030,negated_conjecture,
( xsd_integer(esk63_0)
| ~ xsd_string(esk63_0)
| ~ cC140(iV5475)
| ~ cC116(iV5475)
| ~ cC138(iV5475) ),
inference(sr,[status(thm)],[1025,362,theory(equality)]) ).
cnf(1031,negated_conjecture,
( xsd_integer(esk63_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475)
| ~ xsd_string(esk63_0) ),
inference(csr,[status(thm)],[1030,956]) ).
cnf(1032,negated_conjecture,
( xsd_integer(esk63_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475) ),
inference(csr,[status(thm)],[1031,1029]) ).
cnf(1033,negated_conjecture,
( ~ xsd_string(esk63_0)
| ~ cC116(iV5475)
| ~ cC140(iV5475) ),
inference(spm,[status(thm)],[367,1032,theory(equality)]) ).
cnf(1034,plain,
cC140(iV5475),
inference(spm,[status(thm)],[619,721,theory(equality)]) ).
cnf(1035,plain,
cC116(iV5475),
inference(spm,[status(thm)],[618,721,theory(equality)]) ).
cnf(2683,negated_conjecture,
( ~ cC116(iV5475)
| ~ cC140(iV5475) ),
inference(csr,[status(thm)],[1033,1029]) ).
cnf(2687,negated_conjecture,
( ~ cC116(iV5475)
| $false ),
inference(rw,[status(thm)],[2683,1034,theory(equality)]) ).
cnf(2688,negated_conjecture,
~ cC116(iV5475),
inference(cn,[status(thm)],[2687,theory(equality)]) ).
cnf(2690,negated_conjecture,
$false,
inference(rw,[status(thm)],[2688,1035,theory(equality)]) ).
cnf(2691,negated_conjecture,
$false,
inference(cn,[status(thm)],[2690,theory(equality)]) ).
cnf(2692,negated_conjecture,
$false,
2691,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS156+1.p
% --creating new selector for []
% -running prover on /tmp/tmpRXgW_0/sel_KRS156+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS156+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS156+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS156+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
%
%------------------------------------------------------------------------------