TSTP Solution File: KRS096+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS096+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:12 EST 2010
% Result : Unsatisfiable 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 138 ( 14 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 187 ( 74 ~; 69 |; 40 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 56 ( 1 sgn 32 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ? [X4] :
( rr(X3,X4)
& cc(X4) )
& ? [X4] :
( rr(X3,X4)
& cd(X4) )
& ! [X5,X6] :
( ( rr(X3,X5)
& rr(X3,X6) )
=> X5 = X6 ) ) ),
file('/tmp/tmpN_h7xu/sel_KRS096+1.p_1',axiom_2) ).
fof(5,axiom,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
file('/tmp/tmpN_h7xu/sel_KRS096+1.p_1',axiom_3) ).
fof(9,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/tmp/tmpN_h7xu/sel_KRS096+1.p_1',axiom_4) ).
fof(16,plain,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(27,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rr(X3,X4)
& cc(X4) )
& ? [X4] :
( rr(X3,X4)
& cd(X4) )
& ! [X5,X6] :
( ~ rr(X3,X5)
| ~ rr(X3,X6)
| X5 = X6 ) ) )
& ( ! [X4] :
( ~ rr(X3,X4)
| ~ cc(X4) )
| ! [X4] :
( ~ rr(X3,X4)
| ~ cd(X4) )
| ? [X5,X6] :
( rr(X3,X5)
& rr(X3,X6)
& X5 != X6 )
| cUnsatisfiable(X3) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(28,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( ? [X8] :
( rr(X7,X8)
& cc(X8) )
& ? [X9] :
( rr(X7,X9)
& cd(X9) )
& ! [X10,X11] :
( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 ) ) )
& ( ! [X12] :
( ~ rr(X7,X12)
| ~ cc(X12) )
| ! [X13] :
( ~ rr(X7,X13)
| ~ cd(X13) )
| ? [X14,X15] :
( rr(X7,X14)
& rr(X7,X15)
& X14 != X15 )
| cUnsatisfiable(X7) ) ),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,plain,
! [X7] :
( ( ~ cUnsatisfiable(X7)
| ( rr(X7,esk1_1(X7))
& cc(esk1_1(X7))
& rr(X7,esk2_1(X7))
& cd(esk2_1(X7))
& ! [X10,X11] :
( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 ) ) )
& ( ! [X12] :
( ~ rr(X7,X12)
| ~ cc(X12) )
| ! [X13] :
( ~ rr(X7,X13)
| ~ cd(X13) )
| ( rr(X7,esk3_1(X7))
& rr(X7,esk4_1(X7))
& esk3_1(X7) != esk4_1(X7) )
| cUnsatisfiable(X7) ) ),
inference(skolemize,[status(esa)],[28]) ).
fof(30,plain,
! [X7,X10,X11,X12,X13] :
( ( ~ rr(X7,X13)
| ~ cd(X13)
| ~ rr(X7,X12)
| ~ cc(X12)
| ( rr(X7,esk3_1(X7))
& rr(X7,esk4_1(X7))
& esk3_1(X7) != esk4_1(X7) )
| cUnsatisfiable(X7) )
& ( ( ( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11 )
& rr(X7,esk1_1(X7))
& cc(esk1_1(X7))
& rr(X7,esk2_1(X7))
& cd(esk2_1(X7)) )
| ~ cUnsatisfiable(X7) ) ),
inference(shift_quantors,[status(thm)],[29]) ).
fof(31,plain,
! [X7,X10,X11,X12,X13] :
( ( rr(X7,esk3_1(X7))
| ~ rr(X7,X13)
| ~ cd(X13)
| ~ rr(X7,X12)
| ~ cc(X12)
| cUnsatisfiable(X7) )
& ( rr(X7,esk4_1(X7))
| ~ rr(X7,X13)
| ~ cd(X13)
| ~ rr(X7,X12)
| ~ cc(X12)
| cUnsatisfiable(X7) )
& ( esk3_1(X7) != esk4_1(X7)
| ~ rr(X7,X13)
| ~ cd(X13)
| ~ rr(X7,X12)
| ~ cc(X12)
| cUnsatisfiable(X7) )
& ( ~ rr(X7,X10)
| ~ rr(X7,X11)
| X10 = X11
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cc(esk1_1(X7))
| ~ cUnsatisfiable(X7) )
& ( rr(X7,esk2_1(X7))
| ~ cUnsatisfiable(X7) )
& ( cd(esk2_1(X7))
| ~ cUnsatisfiable(X7) ) ),
inference(distribute,[status(thm)],[30]) ).
cnf(32,plain,
( cd(esk2_1(X1))
| ~ cUnsatisfiable(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,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(35,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[31]) ).
cnf(36,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[31]) ).
fof(40,plain,
! [X3] :
( ~ cc(X3)
| ~ cd(X3) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(41,plain,
! [X4] :
( ~ cc(X4)
| ~ cd(X4) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(53,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(71,plain,
( X1 = esk1_1(X2)
| ~ rr(X2,X1)
| ~ cUnsatisfiable(X2) ),
inference(spm,[status(thm)],[36,35,theory(equality)]) ).
cnf(77,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[71,33,theory(equality)]) ).
cnf(78,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[32,77,theory(equality)]) ).
cnf(80,plain,
( ~ cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[42,78,theory(equality)]) ).
cnf(83,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[80,34]) ).
cnf(84,plain,
$false,
inference(sr,[status(thm)],[53,83,theory(equality)]) ).
cnf(85,plain,
$false,
84,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS096+1.p
% --creating new selector for []
% -running prover on /tmp/tmpN_h7xu/sel_KRS096+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS096+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS096+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS096+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
%
%------------------------------------------------------------------------------