TSTP Solution File: KRS137+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS137+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 13:06:29 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 171 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 224 ( 96 ~; 93 |; 29 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 26 ( 2 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cowlThing(icar)
& cAutomobile(icar) ),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',the_axiom) ).
fof(2,axiom,
! [X1] :
( cCar(X1)
<=> cAutomobile(X1) ),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',axiom_2) ).
fof(4,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',axiom_0) ).
fof(5,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',axiom_1) ).
fof(6,axiom,
cCar(icar),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',axiom_6) ).
fof(7,axiom,
cAutomobile(iauto),
file('/tmp/tmpts5QZg/sel_KRS137+1.p_1',axiom_4) ).
fof(9,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cowlThing(icar)
& cAutomobile(icar) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(10,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& cCar(iauto)
& cowlThing(iauto)
& cowlThing(icar)
& cAutomobile(icar) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(11,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(12,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(13,negated_conjecture,
( ? [X1] :
( ~ cowlThing(X1)
| cowlNothing(X1) )
| ? [X1] :
( ( ~ xsd_string(X1)
| xsd_integer(X1) )
& ( xsd_string(X1)
| ~ xsd_integer(X1) ) )
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(14,negated_conjecture,
( ? [X2] :
( ~ cowlThing(X2)
| cowlNothing(X2) )
| ? [X3] :
( ( ~ xsd_string(X3)
| xsd_integer(X3) )
& ( xsd_string(X3)
| ~ xsd_integer(X3) ) )
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ),
inference(variable_rename,[status(thm)],[13]) ).
fof(15,negated_conjecture,
( ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0) ) )
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ),
inference(skolemize,[status(esa)],[14]) ).
fof(16,negated_conjecture,
( ( ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) )
& ( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0)
| ~ cCar(iauto)
| ~ cowlThing(iauto)
| ~ cowlThing(icar)
| ~ cAutomobile(icar) ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cowlThing(icar)
| ~ cowlThing(iauto)
| ~ cCar(iauto)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(18,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| ~ cAutomobile(icar)
| ~ cowlThing(icar)
| ~ cowlThing(iauto)
| ~ cCar(iauto)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(19,plain,
! [X1] :
( ( ~ cCar(X1)
| cAutomobile(X1) )
& ( ~ cAutomobile(X1)
| cCar(X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(20,plain,
! [X2] :
( ( ~ cCar(X2)
| cAutomobile(X2) )
& ( ~ cAutomobile(X2)
| cCar(X2) ) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( cCar(X1)
| ~ cAutomobile(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
( cAutomobile(X1)
| ~ cCar(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[11]) ).
cnf(25,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[24]) ).
fof(27,plain,
! [X1] :
( ( ~ xsd_string(X1)
| ~ xsd_integer(X1) )
& ( xsd_integer(X1)
| xsd_string(X1) ) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(28,plain,
! [X2] :
( ( ~ xsd_string(X2)
| ~ xsd_integer(X2) )
& ( xsd_integer(X2)
| xsd_string(X2) ) ),
inference(variable_rename,[status(thm)],[27]) ).
cnf(29,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(30,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[28]) ).
cnf(31,plain,
cCar(icar),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(32,plain,
cAutomobile(iauto),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(36,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_string(esk2_0)
| $false
| $false
| $false
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[17,26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),
[unfolding] ).
cnf(37,negated_conjecture,
( cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| $false
| $false
| $false
| ~ xsd_string(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[18,26,theory(equality)]),26,theory(equality)]),26,theory(equality)]),
[unfolding] ).
cnf(38,plain,
cCar(iauto),
inference(spm,[status(thm)],[21,32,theory(equality)]) ).
cnf(40,negated_conjecture,
( xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(sr,[status(thm)],[36,25,theory(equality)]) ).
cnf(41,negated_conjecture,
( xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[40,29]) ).
cnf(43,negated_conjecture,
( xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cCar(iauto)
| ~ cAutomobile(icar) ),
inference(sr,[status(thm)],[37,25,theory(equality)]) ).
cnf(44,negated_conjecture,
( xsd_integer(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[43,29]) ).
cnf(45,negated_conjecture,
( ~ xsd_string(esk2_0)
| ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(spm,[status(thm)],[30,44,theory(equality)]) ).
cnf(46,negated_conjecture,
( ~ cAutomobile(icar)
| ~ cCar(iauto) ),
inference(csr,[status(thm)],[45,41]) ).
cnf(47,negated_conjecture,
( ~ cCar(iauto)
| ~ cCar(icar) ),
inference(spm,[status(thm)],[46,22,theory(equality)]) ).
cnf(48,negated_conjecture,
( ~ cCar(iauto)
| $false ),
inference(rw,[status(thm)],[47,31,theory(equality)]) ).
cnf(49,negated_conjecture,
~ cCar(iauto),
inference(cn,[status(thm)],[48,theory(equality)]) ).
cnf(50,plain,
$false,
inference(sr,[status(thm)],[38,49,theory(equality)]) ).
cnf(51,plain,
$false,
50,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS137+1.p
% --creating new selector for []
% -running prover on /tmp/tmpts5QZg/sel_KRS137+1.p_1 with time limit 29
% -prover status Theorem
% Problem KRS137+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS137+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS137+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
%
%------------------------------------------------------------------------------