TSTP Solution File: KRS070+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS070+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:57 EST 2010
% Result : Unsatisfiable 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 5 unt; 0 def)
% Number of atoms : 165 ( 8 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 218 ( 88 ~; 84 |; 42 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 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 : 77 ( 1 sgn 42 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X2] :
( rrx4(X1,X2)
=> rrx(X1,X2) ),
file('/tmp/tmpEKjCm4/sel_KRS070+1.p_1',axiom_16) ).
fof(9,axiom,
! [X1,X2,X6] :
( ( rrx(X1,X2)
& rrx(X1,X6) )
=> X2 = X6 ),
file('/tmp/tmpEKjCm4/sel_KRS070+1.p_1',axiom_3) ).
fof(16,axiom,
cUnsatisfiable(i2003_11_14_17_18_32242),
file('/tmp/tmpEKjCm4/sel_KRS070+1.p_1',axiom_8) ).
fof(17,axiom,
! [X1,X2] :
( rrx3(X1,X2)
=> rrx(X1,X2) ),
file('/tmp/tmpEKjCm4/sel_KRS070+1.p_1',axiom_9) ).
fof(34,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rrx4(X1,X2)
& cc2(X2) )
& ~ ? [X2] :
( rrx3(X1,X2)
& cc2(X2)
& cc1(X2) )
& ? [X2] :
( rrx3(X1,X2)
& cc1(X2) ) ) ),
file('/tmp/tmpEKjCm4/sel_KRS070+1.p_1',axiom_2) ).
fof(53,plain,
! [X1,X2] :
( ~ rrx4(X1,X2)
| rrx(X1,X2) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(54,plain,
! [X3,X4] :
( ~ rrx4(X3,X4)
| rrx(X3,X4) ),
inference(variable_rename,[status(thm)],[53]) ).
cnf(55,plain,
( rrx(X1,X2)
| ~ rrx4(X1,X2) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(71,plain,
! [X1,X2,X6] :
( ~ rrx(X1,X2)
| ~ rrx(X1,X6)
| X2 = X6 ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(72,plain,
! [X7,X8,X9] :
( ~ rrx(X7,X8)
| ~ rrx(X7,X9)
| X8 = X9 ),
inference(variable_rename,[status(thm)],[71]) ).
cnf(73,plain,
( X1 = X2
| ~ rrx(X3,X2)
| ~ rrx(X3,X1) ),
inference(split_conjunct,[status(thm)],[72]) ).
cnf(92,plain,
cUnsatisfiable(i2003_11_14_17_18_32242),
inference(split_conjunct,[status(thm)],[16]) ).
fof(93,plain,
! [X1,X2] :
( ~ rrx3(X1,X2)
| rrx(X1,X2) ),
inference(fof_nnf,[status(thm)],[17]) ).
fof(94,plain,
! [X3,X4] :
( ~ rrx3(X3,X4)
| rrx(X3,X4) ),
inference(variable_rename,[status(thm)],[93]) ).
cnf(95,plain,
( rrx(X1,X2)
| ~ rrx3(X1,X2) ),
inference(split_conjunct,[status(thm)],[94]) ).
fof(144,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rrx4(X1,X2)
& cc2(X2) )
& ! [X2] :
( ~ rrx3(X1,X2)
| ~ cc2(X2)
| ~ cc1(X2) )
& ? [X2] :
( rrx3(X1,X2)
& cc1(X2) ) ) )
& ( ! [X2] :
( ~ rrx4(X1,X2)
| ~ cc2(X2) )
| ? [X2] :
( rrx3(X1,X2)
& cc2(X2)
& cc1(X2) )
| ! [X2] :
( ~ rrx3(X1,X2)
| ~ cc1(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[34]) ).
fof(145,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rrx4(X3,X4)
& cc2(X4) )
& ! [X5] :
( ~ rrx3(X3,X5)
| ~ cc2(X5)
| ~ cc1(X5) )
& ? [X6] :
( rrx3(X3,X6)
& cc1(X6) ) ) )
& ( ! [X7] :
( ~ rrx4(X3,X7)
| ~ cc2(X7) )
| ? [X8] :
( rrx3(X3,X8)
& cc2(X8)
& cc1(X8) )
| ! [X9] :
( ~ rrx3(X3,X9)
| ~ cc1(X9) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[144]) ).
fof(146,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rrx4(X3,esk1_1(X3))
& cc2(esk1_1(X3))
& ! [X5] :
( ~ rrx3(X3,X5)
| ~ cc2(X5)
| ~ cc1(X5) )
& rrx3(X3,esk2_1(X3))
& cc1(esk2_1(X3)) ) )
& ( ! [X7] :
( ~ rrx4(X3,X7)
| ~ cc2(X7) )
| ( rrx3(X3,esk3_1(X3))
& cc2(esk3_1(X3))
& cc1(esk3_1(X3)) )
| ! [X9] :
( ~ rrx3(X3,X9)
| ~ cc1(X9) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[145]) ).
fof(147,plain,
! [X3,X5,X7,X9] :
( ( ~ rrx3(X3,X9)
| ~ cc1(X9)
| ~ rrx4(X3,X7)
| ~ cc2(X7)
| ( rrx3(X3,esk3_1(X3))
& cc2(esk3_1(X3))
& cc1(esk3_1(X3)) )
| cUnsatisfiable(X3) )
& ( ( ( ~ rrx3(X3,X5)
| ~ cc2(X5)
| ~ cc1(X5) )
& rrx4(X3,esk1_1(X3))
& cc2(esk1_1(X3))
& rrx3(X3,esk2_1(X3))
& cc1(esk2_1(X3)) )
| ~ cUnsatisfiable(X3) ) ),
inference(shift_quantors,[status(thm)],[146]) ).
fof(148,plain,
! [X3,X5,X7,X9] :
( ( rrx3(X3,esk3_1(X3))
| ~ rrx4(X3,X7)
| ~ cc2(X7)
| ~ rrx3(X3,X9)
| ~ cc1(X9)
| cUnsatisfiable(X3) )
& ( cc2(esk3_1(X3))
| ~ rrx4(X3,X7)
| ~ cc2(X7)
| ~ rrx3(X3,X9)
| ~ cc1(X9)
| cUnsatisfiable(X3) )
& ( cc1(esk3_1(X3))
| ~ rrx4(X3,X7)
| ~ cc2(X7)
| ~ rrx3(X3,X9)
| ~ cc1(X9)
| cUnsatisfiable(X3) )
& ( ~ rrx3(X3,X5)
| ~ cc2(X5)
| ~ cc1(X5)
| ~ cUnsatisfiable(X3) )
& ( rrx4(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cc2(esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( rrx3(X3,esk2_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cc1(esk2_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[147]) ).
cnf(149,plain,
( cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(150,plain,
( rrx3(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(151,plain,
( cc2(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(152,plain,
( rrx4(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(153,plain,
( ~ cUnsatisfiable(X1)
| ~ cc1(X2)
| ~ cc2(X2)
| ~ rrx3(X1,X2) ),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(189,plain,
( ~ cc1(esk2_1(X1))
| ~ cUnsatisfiable(X1)
| ~ cc2(esk2_1(X1)) ),
inference(spm,[status(thm)],[153,150,theory(equality)]) ).
cnf(192,plain,
( X1 = X2
| ~ rrx(X3,X1)
| ~ rrx3(X3,X2) ),
inference(spm,[status(thm)],[73,95,theory(equality)]) ).
cnf(197,plain,
( ~ cUnsatisfiable(X1)
| ~ cc2(esk2_1(X1)) ),
inference(csr,[status(thm)],[189,149]) ).
cnf(199,plain,
( X1 = X2
| ~ rrx3(X3,X2)
| ~ rrx4(X3,X1) ),
inference(spm,[status(thm)],[192,55,theory(equality)]) ).
cnf(202,plain,
( esk1_1(X1) = X2
| ~ rrx3(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[199,152,theory(equality)]) ).
cnf(203,plain,
( esk1_1(X1) = esk2_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[202,150,theory(equality)]) ).
cnf(206,plain,
( ~ cUnsatisfiable(X1)
| ~ cc2(esk1_1(X1)) ),
inference(spm,[status(thm)],[197,203,theory(equality)]) ).
cnf(207,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[206,151]) ).
cnf(208,plain,
$false,
inference(sr,[status(thm)],[92,207,theory(equality)]) ).
cnf(209,plain,
$false,
208,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS070+1.p
% --creating new selector for []
% -running prover on /tmp/tmpEKjCm4/sel_KRS070+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS070+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS070+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS070+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
%
%------------------------------------------------------------------------------