TSTP Solution File: KRS071+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS071+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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:02 EST 2010
% Result : Unsatisfiable 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 5 unt; 0 def)
% Number of atoms : 290 ( 51 equ)
% Maximal formula atoms : 67 ( 7 avg)
% Number of connectives : 422 ( 172 ~; 163 |; 83 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 90 ( 1 sgn 47 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ? [X5] :
( rr(X4,X5)
& cp2(X5) )
& ? [X5] :
( rr(X4,X5)
& cp3(X5) )
& ! [X6,X7,X8] :
( ( rr(X4,X6)
& rr(X4,X7)
& rr(X4,X8) )
=> ( X6 = X7
| X6 = X8
| X7 = X8 ) ) ) ),
file('/tmp/tmpAABK4H/sel_KRS071+1.p_1',axiom_2) ).
fof(5,axiom,
! [X4] :
( cp1(X4)
=> ~ ( cp4(X4)
| cp2(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/tmp/tmpAABK4H/sel_KRS071+1.p_1',axiom_3) ).
fof(10,axiom,
! [X4] :
( cp2(X4)
=> ~ ( cp4(X4)
| cp3(X4)
| cp5(X4) ) ),
file('/tmp/tmpAABK4H/sel_KRS071+1.p_1',axiom_4) ).
fof(12,axiom,
cUnsatisfiable(i2003_11_14_17_18_39380),
file('/tmp/tmpAABK4H/sel_KRS071+1.p_1',axiom_8) ).
fof(36,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ? [X5] :
( rr(X4,X5)
& cp1(X5) )
& ? [X5] :
( rr(X4,X5)
& cp2(X5) )
& ? [X5] :
( rr(X4,X5)
& cp3(X5) )
& ! [X6,X7,X8] :
( ~ rr(X4,X6)
| ~ rr(X4,X7)
| ~ rr(X4,X8)
| X6 = X7
| X6 = X8
| X7 = X8 ) ) )
& ( ! [X5] :
( ~ rr(X4,X5)
| ~ cp1(X5) )
| ! [X5] :
( ~ rr(X4,X5)
| ~ cp2(X5) )
| ! [X5] :
( ~ rr(X4,X5)
| ~ cp3(X5) )
| ? [X6,X7,X8] :
( rr(X4,X6)
& rr(X4,X7)
& rr(X4,X8)
& X6 != X7
& X6 != X8
& X7 != X8 )
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(37,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ? [X10] :
( rr(X9,X10)
& cp1(X10) )
& ? [X11] :
( rr(X9,X11)
& cp2(X11) )
& ? [X12] :
( rr(X9,X12)
& cp3(X12) )
& ! [X13,X14,X15] :
( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| X13 = X14
| X13 = X15
| X14 = X15 ) ) )
& ( ! [X16] :
( ~ rr(X9,X16)
| ~ cp1(X16) )
| ! [X17] :
( ~ rr(X9,X17)
| ~ cp2(X17) )
| ! [X18] :
( ~ rr(X9,X18)
| ~ cp3(X18) )
| ? [X19,X20,X21] :
( rr(X9,X19)
& rr(X9,X20)
& rr(X9,X21)
& X19 != X20
& X19 != X21
& X20 != X21 )
| cUnsatisfiable(X9) ) ),
inference(variable_rename,[status(thm)],[36]) ).
fof(38,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( rr(X9,esk1_1(X9))
& cp1(esk1_1(X9))
& rr(X9,esk2_1(X9))
& cp2(esk2_1(X9))
& rr(X9,esk3_1(X9))
& cp3(esk3_1(X9))
& ! [X13,X14,X15] :
( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| X13 = X14
| X13 = X15
| X14 = X15 ) ) )
& ( ! [X16] :
( ~ rr(X9,X16)
| ~ cp1(X16) )
| ! [X17] :
( ~ rr(X9,X17)
| ~ cp2(X17) )
| ! [X18] :
( ~ rr(X9,X18)
| ~ cp3(X18) )
| ( rr(X9,esk4_1(X9))
& rr(X9,esk5_1(X9))
& rr(X9,esk6_1(X9))
& esk4_1(X9) != esk5_1(X9)
& esk4_1(X9) != esk6_1(X9)
& esk5_1(X9) != esk6_1(X9) )
| cUnsatisfiable(X9) ) ),
inference(skolemize,[status(esa)],[37]) ).
fof(39,plain,
! [X9,X13,X14,X15,X16,X17,X18] :
( ( ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| ( rr(X9,esk4_1(X9))
& rr(X9,esk5_1(X9))
& rr(X9,esk6_1(X9))
& esk4_1(X9) != esk5_1(X9)
& esk4_1(X9) != esk6_1(X9)
& esk5_1(X9) != esk6_1(X9) )
| cUnsatisfiable(X9) )
& ( ( ( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| X13 = X14
| X13 = X15
| X14 = X15 )
& rr(X9,esk1_1(X9))
& cp1(esk1_1(X9))
& rr(X9,esk2_1(X9))
& cp2(esk2_1(X9))
& rr(X9,esk3_1(X9))
& cp3(esk3_1(X9)) )
| ~ cUnsatisfiable(X9) ) ),
inference(shift_quantors,[status(thm)],[38]) ).
fof(40,plain,
! [X9,X13,X14,X15,X16,X17,X18] :
( ( rr(X9,esk4_1(X9))
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( rr(X9,esk5_1(X9))
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( rr(X9,esk6_1(X9))
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( esk4_1(X9) != esk5_1(X9)
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( esk4_1(X9) != esk6_1(X9)
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( esk5_1(X9) != esk6_1(X9)
| ~ rr(X9,X18)
| ~ cp3(X18)
| ~ rr(X9,X17)
| ~ cp2(X17)
| ~ rr(X9,X16)
| ~ cp1(X16)
| cUnsatisfiable(X9) )
& ( ~ rr(X9,X13)
| ~ rr(X9,X14)
| ~ rr(X9,X15)
| X13 = X14
| X13 = X15
| X14 = X15
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp1(esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp2(esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk3_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp3(esk3_1(X9))
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(41,plain,
( cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(42,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(43,plain,
( cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(44,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(45,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(46,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(47,plain,
( X2 = X3
| X4 = X3
| X4 = X2
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2)
| ~ rr(X1,X4) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(54,plain,
! [X4] :
( ~ cp1(X4)
| ( ~ cp4(X4)
& ~ cp2(X4)
& ~ cp3(X4)
& ~ cp5(X4) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(55,plain,
! [X5] :
( ~ cp1(X5)
| ( ~ cp4(X5)
& ~ cp2(X5)
& ~ cp3(X5)
& ~ cp5(X5) ) ),
inference(variable_rename,[status(thm)],[54]) ).
fof(56,plain,
! [X5] :
( ( ~ cp4(X5)
| ~ cp1(X5) )
& ( ~ cp2(X5)
| ~ cp1(X5) )
& ( ~ cp3(X5)
| ~ cp1(X5) )
& ( ~ cp5(X5)
| ~ cp1(X5) ) ),
inference(distribute,[status(thm)],[55]) ).
cnf(58,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
cnf(59,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
inference(split_conjunct,[status(thm)],[56]) ).
fof(75,plain,
! [X4] :
( ~ cp2(X4)
| ( ~ cp4(X4)
& ~ cp3(X4)
& ~ cp5(X4) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(76,plain,
! [X5] :
( ~ cp2(X5)
| ( ~ cp4(X5)
& ~ cp3(X5)
& ~ cp5(X5) ) ),
inference(variable_rename,[status(thm)],[75]) ).
fof(77,plain,
! [X5] :
( ( ~ cp4(X5)
| ~ cp2(X5) )
& ( ~ cp3(X5)
| ~ cp2(X5) )
& ( ~ cp5(X5)
| ~ cp2(X5) ) ),
inference(distribute,[status(thm)],[76]) ).
cnf(79,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
inference(split_conjunct,[status(thm)],[77]) ).
cnf(86,plain,
cUnsatisfiable(i2003_11_14_17_18_39380),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(120,plain,
( ~ cp1(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[59,43,theory(equality)]) ).
cnf(121,plain,
( ~ cp1(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[58,41,theory(equality)]) ).
cnf(123,plain,
( ~ cp2(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[79,41,theory(equality)]) ).
cnf(125,plain,
( X1 = X2
| X1 = esk1_1(X3)
| X2 = esk1_1(X3)
| ~ rr(X3,X2)
| ~ rr(X3,X1)
| ~ cUnsatisfiable(X3) ),
inference(spm,[status(thm)],[47,46,theory(equality)]) ).
cnf(146,plain,
( esk2_1(X1) = esk1_1(X1)
| X2 = esk1_1(X1)
| X2 = esk2_1(X1)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[125,44,theory(equality)]) ).
cnf(148,plain,
( esk2_1(X1) = esk1_1(X1)
| esk3_1(X1) = esk2_1(X1)
| esk3_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[146,42,theory(equality)]) ).
cnf(153,plain,
( esk3_1(X1) = esk1_1(X1)
| esk2_1(X1) = esk1_1(X1)
| ~ cp2(esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[123,148,theory(equality)]) ).
cnf(158,plain,
( esk3_1(X1) = esk1_1(X1)
| esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[153,43]) ).
cnf(161,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[121,158,theory(equality)]) ).
cnf(165,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[161,45]) ).
cnf(168,plain,
( ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[120,165,theory(equality)]) ).
cnf(171,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[168,45]) ).
cnf(172,plain,
$false,
inference(sr,[status(thm)],[86,171,theory(equality)]) ).
cnf(173,plain,
$false,
172,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS071+1.p
% --creating new selector for []
% -running prover on /tmp/tmpAABK4H/sel_KRS071+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS071+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS071+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS071+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
%
%------------------------------------------------------------------------------