TSTP Solution File: KRS075+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS075+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 12:57:21 EST 2010
% Result : Unsatisfiable 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 162 ( 13 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 199 ( 78 ~; 73 |; 42 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 90 ( 1 sgn 52 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( rs(X1,X2)
=> rf1(X1,X2) ),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_10) ).
fof(2,axiom,
! [X1,X2] :
( rs(X1,X2)
=> rf(X1,X2) ),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_11) ).
fof(4,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf1(X1,X2)
& ~ cp(X2) )
& ? [X2] :
( rs(X1,X2)
& cowlThing(X2) )
& ? [X2] :
( rf(X1,X2)
& cp(X2) ) ) ),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_2) ).
fof(5,axiom,
! [X1,X2,X5] :
( ( rf(X1,X2)
& rf(X1,X5) )
=> X2 = X5 ),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_3) ).
fof(10,axiom,
! [X1,X2,X5] :
( ( rf1(X1,X2)
& rf1(X1,X5) )
=> X2 = X5 ),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_4) ).
fof(13,axiom,
cUnsatisfiable(i2003_11_14_17_19_02584),
file('/tmp/tmpaxOsp5/sel_KRS075+1.p_1',axiom_9) ).
fof(31,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf1(X1,X2)
& ~ cp(X2) )
& ? [X2] :
( rs(X1,X2)
& cowlThing(X2) )
& ? [X2] :
( rf(X1,X2)
& cp(X2) ) ) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(34,plain,
! [X1,X2] :
( ~ rs(X1,X2)
| rf1(X1,X2) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(35,plain,
! [X3,X4] :
( ~ rs(X3,X4)
| rf1(X3,X4) ),
inference(variable_rename,[status(thm)],[34]) ).
cnf(36,plain,
( rf1(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(37,plain,
! [X1,X2] :
( ~ rs(X1,X2)
| rf(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(38,plain,
! [X3,X4] :
( ~ rs(X3,X4)
| rf(X3,X4) ),
inference(variable_rename,[status(thm)],[37]) ).
cnf(39,plain,
( rf(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[38]) ).
fof(43,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rf1(X1,X2)
& ~ cp(X2) )
& ? [X2] :
( rs(X1,X2)
& cowlThing(X2) )
& ? [X2] :
( rf(X1,X2)
& cp(X2) ) ) )
& ( ! [X2] :
( ~ rf1(X1,X2)
| cp(X2) )
| ! [X2] :
( ~ rs(X1,X2)
| ~ cowlThing(X2) )
| ! [X2] :
( ~ rf(X1,X2)
| ~ cp(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[31]) ).
fof(44,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rf1(X3,X4)
& ~ cp(X4) )
& ? [X5] :
( rs(X3,X5)
& cowlThing(X5) )
& ? [X6] :
( rf(X3,X6)
& cp(X6) ) ) )
& ( ! [X7] :
( ~ rf1(X3,X7)
| cp(X7) )
| ! [X8] :
( ~ rs(X3,X8)
| ~ cowlThing(X8) )
| ! [X9] :
( ~ rf(X3,X9)
| ~ cp(X9) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk1_1(X3))
& ~ cp(esk1_1(X3))
& rs(X3,esk2_1(X3))
& cowlThing(esk2_1(X3))
& rf(X3,esk3_1(X3))
& cp(esk3_1(X3)) ) )
& ( ! [X7] :
( ~ rf1(X3,X7)
| cp(X7) )
| ! [X8] :
( ~ rs(X3,X8)
| ~ cowlThing(X8) )
| ! [X9] :
( ~ rf(X3,X9)
| ~ cp(X9) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[44]) ).
fof(46,plain,
! [X3,X7,X8,X9] :
( ( ~ rf(X3,X9)
| ~ cp(X9)
| ~ rs(X3,X8)
| ~ cowlThing(X8)
| ~ rf1(X3,X7)
| cp(X7)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk1_1(X3))
& ~ cp(esk1_1(X3))
& rs(X3,esk2_1(X3))
& cowlThing(esk2_1(X3))
& rf(X3,esk3_1(X3))
& cp(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[45]) ).
fof(47,plain,
! [X3,X7,X8,X9] :
( ( ~ rf(X3,X9)
| ~ cp(X9)
| ~ rs(X3,X8)
| ~ cowlThing(X8)
| ~ rf1(X3,X7)
| cp(X7)
| cUnsatisfiable(X3) )
& ( rf1(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ~ cp(esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rs(X3,esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cowlThing(esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rf(X3,esk3_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp(esk3_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[46]) ).
cnf(48,plain,
( cp(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(49,plain,
( rf(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(51,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(52,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(53,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
fof(55,plain,
! [X1,X2,X5] :
( ~ rf(X1,X2)
| ~ rf(X1,X5)
| X2 = X5 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(56,plain,
! [X6,X7,X8] :
( ~ rf(X6,X7)
| ~ rf(X6,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[55]) ).
cnf(57,plain,
( X1 = X2
| ~ rf(X3,X2)
| ~ rf(X3,X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
fof(73,plain,
! [X1,X2,X5] :
( ~ rf1(X1,X2)
| ~ rf1(X1,X5)
| X2 = X5 ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(74,plain,
! [X6,X7,X8] :
( ~ rf1(X6,X7)
| ~ rf1(X6,X8)
| X7 = X8 ),
inference(variable_rename,[status(thm)],[73]) ).
cnf(75,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
inference(split_conjunct,[status(thm)],[74]) ).
cnf(83,plain,
cUnsatisfiable(i2003_11_14_17_19_02584),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(138,plain,
( rf1(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[36,51,theory(equality)]) ).
cnf(139,plain,
( rf(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[39,51,theory(equality)]) ).
cnf(144,plain,
( X1 = esk1_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[75,53,theory(equality)]) ).
cnf(145,plain,
( X1 = esk3_1(X2)
| ~ rf(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[57,49,theory(equality)]) ).
cnf(157,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[144,138,theory(equality)]) ).
cnf(158,plain,
( esk2_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[145,139,theory(equality)]) ).
cnf(171,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[157,158,theory(equality)]) ).
cnf(172,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(esk3_1(X1)) ),
inference(spm,[status(thm)],[52,171,theory(equality)]) ).
cnf(175,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[172,48]) ).
cnf(176,plain,
$false,
inference(sr,[status(thm)],[83,175,theory(equality)]) ).
cnf(177,plain,
$false,
176,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS075+1.p
% --creating new selector for []
% -running prover on /tmp/tmpaxOsp5/sel_KRS075+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS075+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS075+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS075+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Unsatisfiable
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------