TSTP Solution File: KRS077+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS077+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:29 EST 2010
% Result : Unsatisfiable 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 210 ( 16 equ)
% Maximal formula atoms : 57 ( 6 avg)
% Number of connectives : 281 ( 102 ~; 110 |; 61 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 86 ( 1 sgn 50 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X4,X5] :
( rs(X4,X5)
=> rr(X4,X5) ),
file('/tmp/tmpqfu1nt/sel_KRS077+1.p_1',axiom_5) ).
fof(6,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X6,X7] :
( ( rr(X4,X6)
& rr(X4,X7) )
=> X6 = X7 )
& ? [X5] :
( rr(X4,X5)
& ! [X8] :
( rinvS(X5,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X5] :
( rs(X4,X5)
& cp(X5) ) ) ),
file('/tmp/tmpqfu1nt/sel_KRS077+1.p_1',axiom_2) ).
fof(7,axiom,
! [X4,X5] :
( rinvS(X4,X5)
<=> rs(X5,X4) ),
file('/tmp/tmpqfu1nt/sel_KRS077+1.p_1',axiom_3) ).
fof(11,axiom,
cUnsatisfiable(i2003_11_14_17_19_09372),
file('/tmp/tmpqfu1nt/sel_KRS077+1.p_1',axiom_4) ).
fof(19,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ! [X6,X7] :
( ( rr(X4,X6)
& rr(X4,X7) )
=> X6 = X7 )
& ? [X5] :
( rr(X4,X5)
& ! [X8] :
( rinvS(X5,X8)
=> cp(X8) ) )
& ~ cp(X4)
& ? [X5] :
( rs(X4,X5)
& cp(X5) ) ) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(31,plain,
! [X4,X5] :
( ~ rs(X4,X5)
| rr(X4,X5) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(32,plain,
! [X6,X7] :
( ~ rs(X6,X7)
| rr(X6,X7) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( rr(X1,X2)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(37,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ! [X6,X7] :
( ~ rr(X4,X6)
| ~ rr(X4,X7)
| X6 = X7 )
& ? [X5] :
( rr(X4,X5)
& ! [X8] :
( ~ rinvS(X5,X8)
| cp(X8) ) )
& ~ cp(X4)
& ? [X5] :
( rs(X4,X5)
& cp(X5) ) ) )
& ( ? [X6,X7] :
( rr(X4,X6)
& rr(X4,X7)
& X6 != X7 )
| ! [X5] :
( ~ rr(X4,X5)
| ? [X8] :
( rinvS(X5,X8)
& ~ cp(X8) ) )
| cp(X4)
| ! [X5] :
( ~ rs(X4,X5)
| ~ cp(X5) )
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[19]) ).
fof(38,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ! [X10,X11] :
( ~ rr(X9,X10)
| ~ rr(X9,X11)
| X10 = X11 )
& ? [X12] :
( rr(X9,X12)
& ! [X13] :
( ~ rinvS(X12,X13)
| cp(X13) ) )
& ~ cp(X9)
& ? [X14] :
( rs(X9,X14)
& cp(X14) ) ) )
& ( ? [X15,X16] :
( rr(X9,X15)
& rr(X9,X16)
& X15 != X16 )
| ! [X17] :
( ~ rr(X9,X17)
| ? [X18] :
( rinvS(X17,X18)
& ~ cp(X18) ) )
| cp(X9)
| ! [X19] :
( ~ rs(X9,X19)
| ~ cp(X19) )
| cUnsatisfiable(X9) ) ),
inference(variable_rename,[status(thm)],[37]) ).
fof(39,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ! [X10,X11] :
( ~ rr(X9,X10)
| ~ rr(X9,X11)
| X10 = X11 )
& rr(X9,esk1_1(X9))
& ! [X13] :
( ~ rinvS(esk1_1(X9),X13)
| cp(X13) )
& ~ cp(X9)
& rs(X9,esk2_1(X9))
& cp(esk2_1(X9)) ) )
& ( ( rr(X9,esk3_1(X9))
& rr(X9,esk4_1(X9))
& esk3_1(X9) != esk4_1(X9) )
| ! [X17] :
( ~ rr(X9,X17)
| ( rinvS(X17,esk5_2(X9,X17))
& ~ cp(esk5_2(X9,X17)) ) )
| cp(X9)
| ! [X19] :
( ~ rs(X9,X19)
| ~ cp(X19) )
| cUnsatisfiable(X9) ) ),
inference(skolemize,[status(esa)],[38]) ).
fof(40,plain,
! [X9,X10,X11,X13,X17,X19] :
( ( ~ rs(X9,X19)
| ~ cp(X19)
| ~ rr(X9,X17)
| ( rinvS(X17,esk5_2(X9,X17))
& ~ cp(esk5_2(X9,X17)) )
| ( rr(X9,esk3_1(X9))
& rr(X9,esk4_1(X9))
& esk3_1(X9) != esk4_1(X9) )
| cp(X9)
| cUnsatisfiable(X9) )
& ( ( ( ~ rinvS(esk1_1(X9),X13)
| cp(X13) )
& rr(X9,esk1_1(X9))
& ( ~ rr(X9,X10)
| ~ rr(X9,X11)
| X10 = X11 )
& ~ cp(X9)
& rs(X9,esk2_1(X9))
& cp(esk2_1(X9)) )
| ~ cUnsatisfiable(X9) ) ),
inference(shift_quantors,[status(thm)],[39]) ).
fof(41,plain,
! [X9,X10,X11,X13,X17,X19] :
( ( rr(X9,esk3_1(X9))
| rinvS(X17,esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( rr(X9,esk4_1(X9))
| rinvS(X17,esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( esk3_1(X9) != esk4_1(X9)
| rinvS(X17,esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( rr(X9,esk3_1(X9))
| ~ cp(esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( rr(X9,esk4_1(X9))
| ~ cp(esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( esk3_1(X9) != esk4_1(X9)
| ~ cp(esk5_2(X9,X17))
| ~ rr(X9,X17)
| cp(X9)
| ~ rs(X9,X19)
| ~ cp(X19)
| cUnsatisfiable(X9) )
& ( ~ rinvS(esk1_1(X9),X13)
| cp(X13)
| ~ cUnsatisfiable(X9) )
& ( rr(X9,esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( ~ rr(X9,X10)
| ~ rr(X9,X11)
| X10 = X11
| ~ cUnsatisfiable(X9) )
& ( ~ cp(X9)
| ~ cUnsatisfiable(X9) )
& ( rs(X9,esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( cp(esk2_1(X9))
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[40]) ).
cnf(43,plain,
( rs(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,plain,
( ~ cUnsatisfiable(X1)
| ~ cp(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(45,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(46,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(47,plain,
( cp(X2)
| ~ cUnsatisfiable(X1)
| ~ rinvS(esk1_1(X1),X2) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(54,plain,
! [X4,X5] :
( ( ~ rinvS(X4,X5)
| rs(X5,X4) )
& ( ~ rs(X5,X4)
| rinvS(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(55,plain,
! [X6,X7] :
( ( ~ rinvS(X6,X7)
| rs(X7,X6) )
& ( ~ rs(X7,X6)
| rinvS(X6,X7) ) ),
inference(variable_rename,[status(thm)],[54]) ).
cnf(56,plain,
( rinvS(X1,X2)
| ~ rs(X2,X1) ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(68,plain,
cUnsatisfiable(i2003_11_14_17_19_09372),
inference(split_conjunct,[status(thm)],[11]) ).
cnf(93,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[33,43,theory(equality)]) ).
cnf(94,plain,
( cp(X1)
| ~ cUnsatisfiable(X2)
| ~ rs(X1,esk1_1(X2)) ),
inference(spm,[status(thm)],[47,56,theory(equality)]) ).
cnf(95,plain,
( X1 = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X1) ),
inference(spm,[status(thm)],[45,46,theory(equality)]) ).
cnf(100,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[95,93,theory(equality)]) ).
cnf(104,plain,
( cp(X1)
| ~ cUnsatisfiable(X2)
| ~ rs(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[94,100,theory(equality)]) ).
cnf(106,plain,
( cp(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[104,43,theory(equality)]) ).
cnf(107,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[106,44]) ).
cnf(108,plain,
$false,
inference(sr,[status(thm)],[68,107,theory(equality)]) ).
cnf(109,plain,
$false,
108,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS077+1.p
% --creating new selector for []
% -running prover on /tmp/tmpqfu1nt/sel_KRS077+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS077+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS077+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS077+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
%
%------------------------------------------------------------------------------