TSTP Solution File: KRS123+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS123+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 13:01:07 EST 2010
% Result : Unsatisfiable 0.27s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 97 ( 42 ~; 36 |; 15 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 41 ( 2 sgn 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
cUnsatisfiable(i2003_11_14_17_22_02803),
file('/tmp/tmppRDOur/sel_KRS123+1.p_1',axiom_12) ).
fof(4,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( cc(X1)
& cd(X1) ) ),
file('/tmp/tmppRDOur/sel_KRS123+1.p_1',axiom_2) ).
fof(5,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/tmp/tmppRDOur/sel_KRS123+1.p_1',axiom_3) ).
fof(8,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmppRDOur/sel_KRS123+1.p_1',axiom_6) ).
fof(9,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/tmp/tmppRDOur/sel_KRS123+1.p_1',axiom_7) ).
cnf(22,plain,
cUnsatisfiable(i2003_11_14_17_22_02803),
inference(split_conjunct,[status(thm)],[3]) ).
fof(23,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( cc(X1)
& cd(X1) ) )
& ( ~ cc(X1)
| ~ cd(X1)
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(24,plain,
! [X2] :
( ( ~ cUnsatisfiable(X2)
| ( cc(X2)
& cd(X2) ) )
& ( ~ cc(X2)
| ~ cd(X2)
| cUnsatisfiable(X2) ) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X2] :
( ( cc(X2)
| ~ cUnsatisfiable(X2) )
& ( cd(X2)
| ~ cUnsatisfiable(X2) )
& ( ~ cc(X2)
| ~ cd(X2)
| cUnsatisfiable(X2) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(27,plain,
( cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(28,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
fof(29,plain,
! [X1] :
( ~ cc(X1)
| cdxcomp(X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(30,plain,
! [X2] :
( ~ cc(X2)
| cdxcomp(X2) ),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(39,plain,
! [X1] :
( ( ~ cd(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cd(X1) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(40,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cd(X3) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk1_1(X3))
| cd(X3) ) ),
inference(skolemize,[status(esa)],[40]) ).
fof(42,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cd(X3) )
& ( ra_Px1(X3,esk1_1(X3))
| cd(X3) ) ),
inference(shift_quantors,[status(thm)],[41]) ).
cnf(44,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(45,plain,
! [X1] :
( ( ~ cdxcomp(X1)
| ? [X3] : ra_Px1(X1,X3) )
& ( ! [X3] : ~ ra_Px1(X1,X3)
| cdxcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(46,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ? [X5] : ra_Px1(X4,X5) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(variable_rename,[status(thm)],[45]) ).
fof(47,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ra_Px1(X4,esk2_1(X4)) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(skolemize,[status(esa)],[46]) ).
fof(48,plain,
! [X4,X6] :
( ( ~ ra_Px1(X4,X6)
| cdxcomp(X4) )
& ( ~ cdxcomp(X4)
| ra_Px1(X4,esk2_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[47]) ).
cnf(49,plain,
( ra_Px1(X1,esk2_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(75,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[44,49,theory(equality)]) ).
cnf(80,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(spm,[status(thm)],[75,31,theory(equality)]) ).
cnf(83,plain,
( ~ cd(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[80,28,theory(equality)]) ).
cnf(84,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[83,27]) ).
cnf(85,plain,
$false,
inference(sr,[status(thm)],[22,84,theory(equality)]) ).
cnf(86,plain,
$false,
85,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS123+1.p
% --creating new selector for []
% -running prover on /tmp/tmppRDOur/sel_KRS123+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS123+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS123+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS123+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
%
%------------------------------------------------------------------------------