TSTP Solution File: KRS069+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS069+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:56:53 EST 2010
% Result : Unsatisfiable 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 162 ( 12 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 200 ( 79 ~; 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] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf1(X1,X2)
& cp1(X2) )
& ? [X2] :
( rf2(X1,X2)
& ~ cp1(X2) )
& ? [X2] :
( rf3(X1,X2)
& cp2(X2) ) ) ),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_2) ).
fof(2,axiom,
! [X1,X2,X3] :
( ( rf1(X1,X2)
& rf1(X1,X3) )
=> X2 = X3 ),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_3) ).
fof(5,axiom,
cUnsatisfiable(i2003_11_14_17_18_2750),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_6) ).
fof(6,axiom,
! [X1,X2] :
( rf3(X1,X2)
=> rf1(X1,X2) ),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_7) ).
fof(7,axiom,
! [X1,X2,X3] :
( ( rf2(X1,X2)
& rf2(X1,X3) )
=> X2 = X3 ),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_4) ).
fof(9,axiom,
! [X1,X2] :
( rf3(X1,X2)
=> rf2(X1,X2) ),
file('/tmp/tmp3tLTng/sel_KRS069+1.p_1',axiom_8) ).
fof(23,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rf1(X1,X2)
& cp1(X2) )
& ? [X2] :
( rf2(X1,X2)
& ~ cp1(X2) )
& ? [X2] :
( rf3(X1,X2)
& cp2(X2) ) ) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(26,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rf1(X1,X2)
& cp1(X2) )
& ? [X2] :
( rf2(X1,X2)
& ~ cp1(X2) )
& ? [X2] :
( rf3(X1,X2)
& cp2(X2) ) ) )
& ( ! [X2] :
( ~ rf1(X1,X2)
| ~ cp1(X2) )
| ! [X2] :
( ~ rf2(X1,X2)
| cp1(X2) )
| ! [X2] :
( ~ rf3(X1,X2)
| ~ cp2(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(27,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rf1(X3,X4)
& cp1(X4) )
& ? [X5] :
( rf2(X3,X5)
& ~ cp1(X5) )
& ? [X6] :
( rf3(X3,X6)
& cp2(X6) ) ) )
& ( ! [X7] :
( ~ rf1(X3,X7)
| ~ cp1(X7) )
| ! [X8] :
( ~ rf2(X3,X8)
| cp1(X8) )
| ! [X9] :
( ~ rf3(X3,X9)
| ~ cp2(X9) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[26]) ).
fof(28,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk1_1(X3))
& cp1(esk1_1(X3))
& rf2(X3,esk2_1(X3))
& ~ cp1(esk2_1(X3))
& rf3(X3,esk3_1(X3))
& cp2(esk3_1(X3)) ) )
& ( ! [X7] :
( ~ rf1(X3,X7)
| ~ cp1(X7) )
| ! [X8] :
( ~ rf2(X3,X8)
| cp1(X8) )
| ! [X9] :
( ~ rf3(X3,X9)
| ~ cp2(X9) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[27]) ).
fof(29,plain,
! [X3,X7,X8,X9] :
( ( ~ rf3(X3,X9)
| ~ cp2(X9)
| ~ rf2(X3,X8)
| cp1(X8)
| ~ rf1(X3,X7)
| ~ cp1(X7)
| cUnsatisfiable(X3) )
& ( ~ cUnsatisfiable(X3)
| ( rf1(X3,esk1_1(X3))
& cp1(esk1_1(X3))
& rf2(X3,esk2_1(X3))
& ~ cp1(esk2_1(X3))
& rf3(X3,esk3_1(X3))
& cp2(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[28]) ).
fof(30,plain,
! [X3,X7,X8,X9] :
( ( ~ rf3(X3,X9)
| ~ cp2(X9)
| ~ rf2(X3,X8)
| cp1(X8)
| ~ rf1(X3,X7)
| ~ cp1(X7)
| cUnsatisfiable(X3) )
& ( rf1(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp1(esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rf2(X3,esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ~ cp1(esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rf3(X3,esk3_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cp2(esk3_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[29]) ).
cnf(32,plain,
( rf3(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(33,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(34,plain,
( rf2(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(35,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
cnf(36,plain,
( rf1(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(38,plain,
! [X1,X2,X3] :
( ~ rf1(X1,X2)
| ~ rf1(X1,X3)
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(39,plain,
! [X4,X5,X6] :
( ~ rf1(X4,X5)
| ~ rf1(X4,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[38]) ).
cnf(40,plain,
( X1 = X2
| ~ rf1(X3,X2)
| ~ rf1(X3,X1) ),
inference(split_conjunct,[status(thm)],[39]) ).
cnf(48,plain,
cUnsatisfiable(i2003_11_14_17_18_2750),
inference(split_conjunct,[status(thm)],[5]) ).
fof(49,plain,
! [X1,X2] :
( ~ rf3(X1,X2)
| rf1(X1,X2) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(50,plain,
! [X3,X4] :
( ~ rf3(X3,X4)
| rf1(X3,X4) ),
inference(variable_rename,[status(thm)],[49]) ).
cnf(51,plain,
( rf1(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[50]) ).
fof(52,plain,
! [X1,X2,X3] :
( ~ rf2(X1,X2)
| ~ rf2(X1,X3)
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(53,plain,
! [X4,X5,X6] :
( ~ rf2(X4,X5)
| ~ rf2(X4,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[52]) ).
cnf(54,plain,
( X1 = X2
| ~ rf2(X3,X2)
| ~ rf2(X3,X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(58,plain,
! [X1,X2] :
( ~ rf3(X1,X2)
| rf2(X1,X2) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(59,plain,
! [X3,X4] :
( ~ rf3(X3,X4)
| rf2(X3,X4) ),
inference(variable_rename,[status(thm)],[58]) ).
cnf(60,plain,
( rf2(X1,X2)
| ~ rf3(X1,X2) ),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(101,plain,
( rf1(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[51,32,theory(equality)]) ).
cnf(102,plain,
( rf2(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[60,32,theory(equality)]) ).
cnf(103,plain,
( X1 = esk1_1(X2)
| ~ rf1(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[40,36,theory(equality)]) ).
cnf(104,plain,
( X1 = esk2_1(X2)
| ~ rf2(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[54,34,theory(equality)]) ).
cnf(109,plain,
( esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[103,101,theory(equality)]) ).
cnf(119,plain,
( esk3_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[104,102,theory(equality)]) ).
cnf(121,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[33,119,theory(equality)]) ).
cnf(123,plain,
( ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[121,109,theory(equality)]) ).
cnf(124,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[123,35]) ).
cnf(125,plain,
$false,
inference(sr,[status(thm)],[48,124,theory(equality)]) ).
cnf(126,plain,
$false,
125,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS069+1.p
% --creating new selector for []
% -running prover on /tmp/tmp3tLTng/sel_KRS069+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS069+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS069+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS069+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
%
%------------------------------------------------------------------------------