TSTP Solution File: KRS095+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS095+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:59:08 EST 2010
% Result : Unsatisfiable 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 108 ( 28 equ)
% Maximal formula atoms : 25 ( 6 avg)
% Number of connectives : 145 ( 54 ~; 55 |; 34 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 1 sgn 28 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4,X5] :
( rr(X3,X4)
& rr(X3,X5)
& X4 != X5 )
& ! [X4,X5] :
( ( rr(X3,X4)
& rr(X3,X5) )
=> X4 = X5 ) ) ),
file('/tmp/tmpqOGcvh/sel_KRS095+1.p_1',axiom_2) ).
fof(9,axiom,
cUnsatisfiable(i2003_11_14_17_20_14253),
file('/tmp/tmpqOGcvh/sel_KRS095+1.p_1',axiom_4) ).
fof(27,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4,X5] :
( rr(X3,X4)
& rr(X3,X5)
& X4 != X5 )
& ! [X4,X5] :
( ~ rr(X3,X4)
| ~ rr(X3,X5)
| X4 = X5 ) ) )
& ( ! [X4,X5] :
( ~ rr(X3,X4)
| ~ rr(X3,X5)
| X4 = X5 )
| ? [X4,X5] :
( rr(X3,X4)
& rr(X3,X5)
& X4 != X5 )
| cUnsatisfiable(X3) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(28,plain,
! [X6] :
( ( ~ cUnsatisfiable(X6)
| ( ? [X7,X8] :
( rr(X6,X7)
& rr(X6,X8)
& X7 != X8 )
& ! [X9,X10] :
( ~ rr(X6,X9)
| ~ rr(X6,X10)
| X9 = X10 ) ) )
& ( ! [X11,X12] :
( ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12 )
| ? [X13,X14] :
( rr(X6,X13)
& rr(X6,X14)
& X13 != X14 )
| cUnsatisfiable(X6) ) ),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,plain,
! [X6] :
( ( ~ cUnsatisfiable(X6)
| ( rr(X6,esk1_1(X6))
& rr(X6,esk2_1(X6))
& esk1_1(X6) != esk2_1(X6)
& ! [X9,X10] :
( ~ rr(X6,X9)
| ~ rr(X6,X10)
| X9 = X10 ) ) )
& ( ! [X11,X12] :
( ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12 )
| ( rr(X6,esk3_1(X6))
& rr(X6,esk4_1(X6))
& esk3_1(X6) != esk4_1(X6) )
| cUnsatisfiable(X6) ) ),
inference(skolemize,[status(esa)],[28]) ).
fof(30,plain,
! [X6,X9,X10,X11,X12] :
( ( ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12
| ( rr(X6,esk3_1(X6))
& rr(X6,esk4_1(X6))
& esk3_1(X6) != esk4_1(X6) )
| cUnsatisfiable(X6) )
& ( ( ( ~ rr(X6,X9)
| ~ rr(X6,X10)
| X9 = X10 )
& rr(X6,esk1_1(X6))
& rr(X6,esk2_1(X6))
& esk1_1(X6) != esk2_1(X6) )
| ~ cUnsatisfiable(X6) ) ),
inference(shift_quantors,[status(thm)],[29]) ).
fof(31,plain,
! [X6,X9,X10,X11,X12] :
( ( rr(X6,esk3_1(X6))
| ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12
| cUnsatisfiable(X6) )
& ( rr(X6,esk4_1(X6))
| ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12
| cUnsatisfiable(X6) )
& ( esk3_1(X6) != esk4_1(X6)
| ~ rr(X6,X11)
| ~ rr(X6,X12)
| X11 = X12
| cUnsatisfiable(X6) )
& ( ~ rr(X6,X9)
| ~ rr(X6,X10)
| X9 = X10
| ~ cUnsatisfiable(X6) )
& ( rr(X6,esk1_1(X6))
| ~ cUnsatisfiable(X6) )
& ( rr(X6,esk2_1(X6))
| ~ cUnsatisfiable(X6) )
& ( esk1_1(X6) != esk2_1(X6)
| ~ cUnsatisfiable(X6) ) ),
inference(distribute,[status(thm)],[30]) ).
cnf(32,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(33,plain,
( rr(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(34,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(35,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(52,plain,
cUnsatisfiable(i2003_11_14_17_20_14253),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(69,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[35,34,theory(equality)]) ).
cnf(78,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[69,33,theory(equality)]) ).
cnf(79,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[78,32]) ).
cnf(80,plain,
$false,
inference(sr,[status(thm)],[52,79,theory(equality)]) ).
cnf(81,plain,
$false,
80,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS095+1.p
% --creating new selector for []
% -running prover on /tmp/tmpqOGcvh/sel_KRS095+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS095+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS095+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS095+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
%
%------------------------------------------------------------------------------