TSTP Solution File: KRS110+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS110+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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 13:00:12 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 : 37 ( 5 unt; 0 def)
% Number of atoms : 168 ( 0 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 215 ( 84 ~; 79 |; 47 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 73 ( 2 sgn 46 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
cUnsatisfiable(i2003_11_14_17_21_12565),
file('/tmp/tmpfjI9k2/sel_KRS110+1.p_1',axiom_12) ).
fof(8,axiom,
! [X1] :
( cp(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmpfjI9k2/sel_KRS110+1.p_1',axiom_3) ).
fof(13,axiom,
! [X1] :
( cpxcomp(X1)
<=> ? [X7] : ra_Px1(X1,X7) ),
file('/tmp/tmpfjI9k2/sel_KRS110+1.p_1',axiom_4) ).
fof(14,axiom,
! [X1] :
( ca_Ax2(X1)
<=> ( cp(X1)
& ? [X2] :
( rinvS(X1,X2)
& cp(X2) ) ) ),
file('/tmp/tmpfjI9k2/sel_KRS110+1.p_1',axiom_5) ).
fof(30,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rs(X1,X2)
& ca_Ax2(X2) )
& ! [X2] :
( rs(X1,X2)
=> cpxcomp(X2) ) ) ),
file('/tmp/tmpfjI9k2/sel_KRS110+1.p_1',axiom_2) ).
cnf(50,plain,
cUnsatisfiable(i2003_11_14_17_21_12565),
inference(split_conjunct,[status(thm)],[4]) ).
fof(60,plain,
! [X1] :
( ( ~ cp(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cp(X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(61,plain,
! [X3] :
( ( ~ cp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cp(X3) ) ),
inference(variable_rename,[status(thm)],[60]) ).
fof(62,plain,
! [X3] :
( ( ~ cp(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk1_1(X3))
| cp(X3) ) ),
inference(skolemize,[status(esa)],[61]) ).
fof(63,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cp(X3) )
& ( ra_Px1(X3,esk1_1(X3))
| cp(X3) ) ),
inference(shift_quantors,[status(thm)],[62]) ).
cnf(65,plain,
( ~ cp(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[63]) ).
fof(78,plain,
! [X1] :
( ( ~ cpxcomp(X1)
| ? [X7] : ra_Px1(X1,X7) )
& ( ! [X7] : ~ ra_Px1(X1,X7)
| cpxcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(79,plain,
! [X8] :
( ( ~ cpxcomp(X8)
| ? [X9] : ra_Px1(X8,X9) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cpxcomp(X8) ) ),
inference(variable_rename,[status(thm)],[78]) ).
fof(80,plain,
! [X8] :
( ( ~ cpxcomp(X8)
| ra_Px1(X8,esk2_1(X8)) )
& ( ! [X10] : ~ ra_Px1(X8,X10)
| cpxcomp(X8) ) ),
inference(skolemize,[status(esa)],[79]) ).
fof(81,plain,
! [X8,X10] :
( ( ~ ra_Px1(X8,X10)
| cpxcomp(X8) )
& ( ~ cpxcomp(X8)
| ra_Px1(X8,esk2_1(X8)) ) ),
inference(shift_quantors,[status(thm)],[80]) ).
cnf(82,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cpxcomp(X1) ),
inference(split_conjunct,[status(thm)],[81]) ).
fof(84,plain,
! [X1] :
( ( ~ ca_Ax2(X1)
| ( cp(X1)
& ? [X2] :
( rinvS(X1,X2)
& cp(X2) ) ) )
& ( ~ cp(X1)
| ! [X2] :
( ~ rinvS(X1,X2)
| ~ cp(X2) )
| ca_Ax2(X1) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(85,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( cp(X3)
& ? [X4] :
( rinvS(X3,X4)
& cp(X4) ) ) )
& ( ~ cp(X3)
| ! [X5] :
( ~ rinvS(X3,X5)
| ~ cp(X5) )
| ca_Ax2(X3) ) ),
inference(variable_rename,[status(thm)],[84]) ).
fof(86,plain,
! [X3] :
( ( ~ ca_Ax2(X3)
| ( cp(X3)
& rinvS(X3,esk3_1(X3))
& cp(esk3_1(X3)) ) )
& ( ~ cp(X3)
| ! [X5] :
( ~ rinvS(X3,X5)
| ~ cp(X5) )
| ca_Ax2(X3) ) ),
inference(skolemize,[status(esa)],[85]) ).
fof(87,plain,
! [X3,X5] :
( ( ~ rinvS(X3,X5)
| ~ cp(X5)
| ~ cp(X3)
| ca_Ax2(X3) )
& ( ~ ca_Ax2(X3)
| ( cp(X3)
& rinvS(X3,esk3_1(X3))
& cp(esk3_1(X3)) ) ) ),
inference(shift_quantors,[status(thm)],[86]) ).
fof(88,plain,
! [X3,X5] :
( ( ~ rinvS(X3,X5)
| ~ cp(X5)
| ~ cp(X3)
| ca_Ax2(X3) )
& ( cp(X3)
| ~ ca_Ax2(X3) )
& ( rinvS(X3,esk3_1(X3))
| ~ ca_Ax2(X3) )
& ( cp(esk3_1(X3))
| ~ ca_Ax2(X3) ) ),
inference(distribute,[status(thm)],[87]) ).
cnf(91,plain,
( cp(X1)
| ~ ca_Ax2(X1) ),
inference(split_conjunct,[status(thm)],[88]) ).
fof(140,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rs(X1,X2)
& ca_Ax2(X2) )
& ! [X2] :
( ~ rs(X1,X2)
| cpxcomp(X2) ) ) )
& ( ! [X2] :
( ~ rs(X1,X2)
| ~ ca_Ax2(X2) )
| ? [X2] :
( rs(X1,X2)
& ~ cpxcomp(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[30]) ).
fof(141,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rs(X3,X4)
& ca_Ax2(X4) )
& ! [X5] :
( ~ rs(X3,X5)
| cpxcomp(X5) ) ) )
& ( ! [X6] :
( ~ rs(X3,X6)
| ~ ca_Ax2(X6) )
| ? [X7] :
( rs(X3,X7)
& ~ cpxcomp(X7) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[140]) ).
fof(142,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rs(X3,esk4_1(X3))
& ca_Ax2(esk4_1(X3))
& ! [X5] :
( ~ rs(X3,X5)
| cpxcomp(X5) ) ) )
& ( ! [X6] :
( ~ rs(X3,X6)
| ~ ca_Ax2(X6) )
| ( rs(X3,esk5_1(X3))
& ~ cpxcomp(esk5_1(X3)) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[141]) ).
fof(143,plain,
! [X3,X5,X6] :
( ( ~ rs(X3,X6)
| ~ ca_Ax2(X6)
| ( rs(X3,esk5_1(X3))
& ~ cpxcomp(esk5_1(X3)) )
| cUnsatisfiable(X3) )
& ( ( ( ~ rs(X3,X5)
| cpxcomp(X5) )
& rs(X3,esk4_1(X3))
& ca_Ax2(esk4_1(X3)) )
| ~ cUnsatisfiable(X3) ) ),
inference(shift_quantors,[status(thm)],[142]) ).
fof(144,plain,
! [X3,X5,X6] :
( ( rs(X3,esk5_1(X3))
| ~ rs(X3,X6)
| ~ ca_Ax2(X6)
| cUnsatisfiable(X3) )
& ( ~ cpxcomp(esk5_1(X3))
| ~ rs(X3,X6)
| ~ ca_Ax2(X6)
| cUnsatisfiable(X3) )
& ( ~ rs(X3,X5)
| cpxcomp(X5)
| ~ cUnsatisfiable(X3) )
& ( rs(X3,esk4_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ca_Ax2(esk4_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[143]) ).
cnf(145,plain,
( ca_Ax2(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(146,plain,
( rs(X1,esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(147,plain,
( cpxcomp(X2)
| ~ cUnsatisfiable(X1)
| ~ rs(X1,X2) ),
inference(split_conjunct,[status(thm)],[144]) ).
cnf(180,plain,
( ~ cp(X1)
| ~ cpxcomp(X1) ),
inference(spm,[status(thm)],[65,82,theory(equality)]) ).
cnf(184,plain,
( cpxcomp(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[147,146,theory(equality)]) ).
cnf(190,plain,
( ~ cp(esk4_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[180,184,theory(equality)]) ).
cnf(195,plain,
( ~ cUnsatisfiable(X1)
| ~ ca_Ax2(esk4_1(X1)) ),
inference(spm,[status(thm)],[190,91,theory(equality)]) ).
cnf(197,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[195,145]) ).
cnf(198,plain,
$false,
inference(sr,[status(thm)],[50,197,theory(equality)]) ).
cnf(199,plain,
$false,
198,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS110+1.p
% --creating new selector for []
% -running prover on /tmp/tmpfjI9k2/sel_KRS110+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS110+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS110+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS110+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
%
%------------------------------------------------------------------------------