TSTP Solution File: KRS086+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS086+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:58:17 EST 2010
% Result : Unsatisfiable 0.29s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 141 ( 8 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 177 ( 70 ~; 63 |; 39 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 74 ( 2 sgn 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ? [X5] :
( rf(X4,X5)
& ? [X6] :
( rinvF(X5,X6)
& ? [X7] :
( rf(X6,X7)
& ~ cp1(X7) ) )
& cp1(X5) ) ),
file('/tmp/tmpp0i4WB/sel_KRS086+1.p_1',axiom_2) ).
fof(4,axiom,
! [X4] :
( cowlThing(X4)
=> ! [X8,X9] :
( ( rf(X4,X8)
& rf(X4,X9) )
=> X8 = X9 ) ),
file('/tmp/tmpp0i4WB/sel_KRS086+1.p_1',axiom_3) ).
fof(5,axiom,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
file('/tmp/tmpp0i4WB/sel_KRS086+1.p_1',axiom_0) ).
fof(8,axiom,
cUnsatisfiable(i2003_11_14_17_19_42328),
file('/tmp/tmpp0i4WB/sel_KRS086+1.p_1',axiom_7) ).
fof(9,axiom,
! [X4,X5] :
( rinvF(X4,X5)
<=> rf(X5,X4) ),
file('/tmp/tmpp0i4WB/sel_KRS086+1.p_1',axiom_4) ).
fof(23,plain,
! [X4] :
( cUnsatisfiable(X4)
<=> ? [X5] :
( rf(X4,X5)
& ? [X6] :
( rinvF(X5,X6)
& ? [X7] :
( rf(X6,X7)
& ~ cp1(X7) ) )
& cp1(X5) ) ),
inference(fof_simplification,[status(thm)],[3,theory(equality)]) ).
fof(24,plain,
! [X4] :
( cowlThing(X4)
& ~ cowlNothing(X4) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(32,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ? [X5] :
( rf(X4,X5)
& ? [X6] :
( rinvF(X5,X6)
& ? [X7] :
( rf(X6,X7)
& ~ cp1(X7) ) )
& cp1(X5) ) )
& ( ! [X5] :
( ~ rf(X4,X5)
| ! [X6] :
( ~ rinvF(X5,X6)
| ! [X7] :
( ~ rf(X6,X7)
| cp1(X7) ) )
| ~ cp1(X5) )
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(33,plain,
! [X8] :
( ( ~ cUnsatisfiable(X8)
| ? [X9] :
( rf(X8,X9)
& ? [X10] :
( rinvF(X9,X10)
& ? [X11] :
( rf(X10,X11)
& ~ cp1(X11) ) )
& cp1(X9) ) )
& ( ! [X12] :
( ~ rf(X8,X12)
| ! [X13] :
( ~ rinvF(X12,X13)
| ! [X14] :
( ~ rf(X13,X14)
| cp1(X14) ) )
| ~ cp1(X12) )
| cUnsatisfiable(X8) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,plain,
! [X8] :
( ( ~ cUnsatisfiable(X8)
| ( rf(X8,esk1_1(X8))
& rinvF(esk1_1(X8),esk2_1(X8))
& rf(esk2_1(X8),esk3_1(X8))
& ~ cp1(esk3_1(X8))
& cp1(esk1_1(X8)) ) )
& ( ! [X12] :
( ~ rf(X8,X12)
| ! [X13] :
( ~ rinvF(X12,X13)
| ! [X14] :
( ~ rf(X13,X14)
| cp1(X14) ) )
| ~ cp1(X12) )
| cUnsatisfiable(X8) ) ),
inference(skolemize,[status(esa)],[33]) ).
fof(35,plain,
! [X8,X12,X13,X14] :
( ( ~ rf(X13,X14)
| cp1(X14)
| ~ rinvF(X12,X13)
| ~ rf(X8,X12)
| ~ cp1(X12)
| cUnsatisfiable(X8) )
& ( ~ cUnsatisfiable(X8)
| ( rf(X8,esk1_1(X8))
& rinvF(esk1_1(X8),esk2_1(X8))
& rf(esk2_1(X8),esk3_1(X8))
& ~ cp1(esk3_1(X8))
& cp1(esk1_1(X8)) ) ) ),
inference(shift_quantors,[status(thm)],[34]) ).
fof(36,plain,
! [X8,X12,X13,X14] :
( ( ~ rf(X13,X14)
| cp1(X14)
| ~ rinvF(X12,X13)
| ~ rf(X8,X12)
| ~ cp1(X12)
| cUnsatisfiable(X8) )
& ( rf(X8,esk1_1(X8))
| ~ cUnsatisfiable(X8) )
& ( rinvF(esk1_1(X8),esk2_1(X8))
| ~ cUnsatisfiable(X8) )
& ( rf(esk2_1(X8),esk3_1(X8))
| ~ cUnsatisfiable(X8) )
& ( ~ cp1(esk3_1(X8))
| ~ cUnsatisfiable(X8) )
& ( cp1(esk1_1(X8))
| ~ cUnsatisfiable(X8) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(37,plain,
( cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(38,plain,
( ~ cUnsatisfiable(X1)
| ~ cp1(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(39,plain,
( rf(esk2_1(X1),esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
cnf(40,plain,
( rinvF(esk1_1(X1),esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(43,plain,
! [X4] :
( ~ cowlThing(X4)
| ! [X8,X9] :
( ~ rf(X4,X8)
| ~ rf(X4,X9)
| X8 = X9 ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(44,plain,
! [X10] :
( ~ cowlThing(X10)
| ! [X11,X12] :
( ~ rf(X10,X11)
| ~ rf(X10,X12)
| X11 = X12 ) ),
inference(variable_rename,[status(thm)],[43]) ).
fof(45,plain,
! [X10,X11,X12] :
( ~ rf(X10,X11)
| ~ rf(X10,X12)
| X11 = X12
| ~ cowlThing(X10) ),
inference(shift_quantors,[status(thm)],[44]) ).
cnf(46,plain,
( X2 = X3
| ~ cowlThing(X1)
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X5] :
( cowlThing(X5)
& ~ cowlNothing(X5) ),
inference(variable_rename,[status(thm)],[24]) ).
cnf(49,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(57,plain,
cUnsatisfiable(i2003_11_14_17_19_42328),
inference(split_conjunct,[status(thm)],[8]) ).
fof(58,plain,
! [X4,X5] :
( ( ~ rinvF(X4,X5)
| rf(X5,X4) )
& ( ~ rf(X5,X4)
| rinvF(X4,X5) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(59,plain,
! [X6,X7] :
( ( ~ rinvF(X6,X7)
| rf(X7,X6) )
& ( ~ rf(X7,X6)
| rinvF(X6,X7) ) ),
inference(variable_rename,[status(thm)],[58]) ).
cnf(61,plain,
( rf(X1,X2)
| ~ rinvF(X2,X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(102,plain,
( X2 = X3
| $false
| ~ rf(X1,X3)
| ~ rf(X1,X2) ),
inference(rw,[status(thm)],[46,49,theory(equality)]),
[unfolding] ).
cnf(107,plain,
( X1 = esk3_1(X2)
| ~ rf(esk2_1(X2),X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[102,39,theory(equality)]) ).
cnf(108,plain,
( rf(esk2_1(X1),esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[61,40,theory(equality)]) ).
cnf(119,plain,
( esk1_1(X1) = esk3_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[107,108,theory(equality)]) ).
cnf(120,plain,
( ~ cp1(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[38,119,theory(equality)]) ).
cnf(123,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[120,37]) ).
cnf(124,plain,
$false,
inference(sr,[status(thm)],[57,123,theory(equality)]) ).
cnf(125,plain,
$false,
124,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS086+1.p
% --creating new selector for []
% -running prover on /tmp/tmpp0i4WB/sel_KRS086+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS086+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS086+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS086+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
%
%------------------------------------------------------------------------------