TSTP Solution File: KRS099+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS099+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:25 EST 2010
% Result : Unsatisfiable 0.24s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 358 ( 120 equ)
% Maximal formula atoms : 203 ( 21 avg)
% Number of connectives : 507 ( 166 ~; 245 |; 92 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 38 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-1 aty)
% Number of variables : 80 ( 1 sgn 51 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X4] :
( cUnsatisfiable(X4)
<=> ( ? [X5,X6,X7] :
( rtt(X4,X5)
& rtt(X4,X6)
& rtt(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 )
& ! [X8] :
( rtt(X4,X8)
=> ca(X8) )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 )
& ! [X5,X6] :
( ( rtt(X4,X5)
& rtt(X4,X6) )
=> X5 = X6 ) ) ),
file('/tmp/tmpziXTx0/sel_KRS099+1.p_1',axiom_2) ).
fof(13,axiom,
cUnsatisfiable(i2003_11_14_17_20_29215),
file('/tmp/tmpziXTx0/sel_KRS099+1.p_1',axiom_5) ).
fof(38,plain,
! [X4] :
( ( ~ cUnsatisfiable(X4)
| ( ? [X5,X6,X7] :
( rtt(X4,X5)
& rtt(X4,X6)
& rtt(X4,X7)
& X5 != X6
& X5 != X7
& X6 != X7 )
& ! [X8] :
( ~ rtt(X4,X8)
| ca(X8) )
& ! [X5,X6] :
( ~ rtt(X4,X5)
| ~ rtt(X4,X6)
| X5 = X6 )
& ! [X5,X6] :
( ~ rtt(X4,X5)
| ~ rtt(X4,X6)
| X5 = X6 ) ) )
& ( ! [X5,X6,X7] :
( ~ rtt(X4,X5)
| ~ rtt(X4,X6)
| ~ rtt(X4,X7)
| X5 = X6
| X5 = X7
| X6 = X7 )
| ? [X8] :
( rtt(X4,X8)
& ~ ca(X8) )
| ? [X5,X6] :
( rtt(X4,X5)
& rtt(X4,X6)
& X5 != X6 )
| ? [X5,X6] :
( rtt(X4,X5)
& rtt(X4,X6)
& X5 != X6 )
| cUnsatisfiable(X4) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(39,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( ? [X10,X11,X12] :
( rtt(X9,X10)
& rtt(X9,X11)
& rtt(X9,X12)
& X10 != X11
& X10 != X12
& X11 != X12 )
& ! [X13] :
( ~ rtt(X9,X13)
| ca(X13) )
& ! [X14,X15] :
( ~ rtt(X9,X14)
| ~ rtt(X9,X15)
| X14 = X15 )
& ! [X16,X17] :
( ~ rtt(X9,X16)
| ~ rtt(X9,X17)
| X16 = X17 ) ) )
& ( ! [X18,X19,X20] :
( ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20 )
| ? [X21] :
( rtt(X9,X21)
& ~ ca(X21) )
| ? [X22,X23] :
( rtt(X9,X22)
& rtt(X9,X23)
& X22 != X23 )
| ? [X24,X25] :
( rtt(X9,X24)
& rtt(X9,X25)
& X24 != X25 )
| cUnsatisfiable(X9) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X9] :
( ( ~ cUnsatisfiable(X9)
| ( rtt(X9,esk1_1(X9))
& rtt(X9,esk2_1(X9))
& rtt(X9,esk3_1(X9))
& esk1_1(X9) != esk2_1(X9)
& esk1_1(X9) != esk3_1(X9)
& esk2_1(X9) != esk3_1(X9)
& ! [X13] :
( ~ rtt(X9,X13)
| ca(X13) )
& ! [X14,X15] :
( ~ rtt(X9,X14)
| ~ rtt(X9,X15)
| X14 = X15 )
& ! [X16,X17] :
( ~ rtt(X9,X16)
| ~ rtt(X9,X17)
| X16 = X17 ) ) )
& ( ! [X18,X19,X20] :
( ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20 )
| ( rtt(X9,esk4_1(X9))
& ~ ca(esk4_1(X9)) )
| ( rtt(X9,esk5_1(X9))
& rtt(X9,esk6_1(X9))
& esk5_1(X9) != esk6_1(X9) )
| ( rtt(X9,esk7_1(X9))
& rtt(X9,esk8_1(X9))
& esk7_1(X9) != esk8_1(X9) )
| cUnsatisfiable(X9) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X9,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| ( rtt(X9,esk4_1(X9))
& ~ ca(esk4_1(X9)) )
| ( rtt(X9,esk5_1(X9))
& rtt(X9,esk6_1(X9))
& esk5_1(X9) != esk6_1(X9) )
| ( rtt(X9,esk7_1(X9))
& rtt(X9,esk8_1(X9))
& esk7_1(X9) != esk8_1(X9) )
| cUnsatisfiable(X9) )
& ( ( ( ~ rtt(X9,X16)
| ~ rtt(X9,X17)
| X16 = X17 )
& ( ~ rtt(X9,X14)
| ~ rtt(X9,X15)
| X14 = X15 )
& ( ~ rtt(X9,X13)
| ca(X13) )
& rtt(X9,esk1_1(X9))
& rtt(X9,esk2_1(X9))
& rtt(X9,esk3_1(X9))
& esk1_1(X9) != esk2_1(X9)
& esk1_1(X9) != esk3_1(X9)
& esk2_1(X9) != esk3_1(X9) )
| ~ cUnsatisfiable(X9) ) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X9,X13,X14,X15,X16,X17,X18,X19,X20] :
( ( rtt(X9,esk7_1(X9))
| rtt(X9,esk5_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| rtt(X9,esk5_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| rtt(X9,esk5_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk7_1(X9))
| rtt(X9,esk6_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| rtt(X9,esk6_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| rtt(X9,esk6_1(X9))
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk7_1(X9))
| esk5_1(X9) != esk6_1(X9)
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| esk5_1(X9) != esk6_1(X9)
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| esk5_1(X9) != esk6_1(X9)
| rtt(X9,esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk7_1(X9))
| rtt(X9,esk5_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| rtt(X9,esk5_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| rtt(X9,esk5_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk7_1(X9))
| rtt(X9,esk6_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| rtt(X9,esk6_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| rtt(X9,esk6_1(X9))
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk7_1(X9))
| esk5_1(X9) != esk6_1(X9)
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( rtt(X9,esk8_1(X9))
| esk5_1(X9) != esk6_1(X9)
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( esk7_1(X9) != esk8_1(X9)
| esk5_1(X9) != esk6_1(X9)
| ~ ca(esk4_1(X9))
| ~ rtt(X9,X18)
| ~ rtt(X9,X19)
| ~ rtt(X9,X20)
| X18 = X19
| X18 = X20
| X19 = X20
| cUnsatisfiable(X9) )
& ( ~ rtt(X9,X16)
| ~ rtt(X9,X17)
| X16 = X17
| ~ cUnsatisfiable(X9) )
& ( ~ rtt(X9,X14)
| ~ rtt(X9,X15)
| X14 = X15
| ~ cUnsatisfiable(X9) )
& ( ~ rtt(X9,X13)
| ca(X13)
| ~ cUnsatisfiable(X9) )
& ( rtt(X9,esk1_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rtt(X9,esk2_1(X9))
| ~ cUnsatisfiable(X9) )
& ( rtt(X9,esk3_1(X9))
| ~ cUnsatisfiable(X9) )
& ( esk1_1(X9) != esk2_1(X9)
| ~ cUnsatisfiable(X9) )
& ( esk1_1(X9) != esk3_1(X9)
| ~ cUnsatisfiable(X9) )
& ( esk2_1(X9) != esk3_1(X9)
| ~ cUnsatisfiable(X9) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(45,plain,
( ~ cUnsatisfiable(X1)
| esk1_1(X1) != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(47,plain,
( rtt(X1,esk2_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(48,plain,
( rtt(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(50,plain,
( X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rtt(X1,X3)
| ~ rtt(X1,X2) ),
inference(split_conjunct,[status(thm)],[42]) ).
cnf(86,plain,
cUnsatisfiable(i2003_11_14_17_20_29215),
inference(split_conjunct,[status(thm)],[13]) ).
cnf(101,plain,
( X1 = esk1_1(X2)
| ~ cUnsatisfiable(X2)
| ~ rtt(X2,X1) ),
inference(spm,[status(thm)],[50,48,theory(equality)]) ).
cnf(149,plain,
( esk2_1(X1) = esk1_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[101,47,theory(equality)]) ).
cnf(151,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[149,45]) ).
cnf(152,plain,
$false,
inference(sr,[status(thm)],[86,151,theory(equality)]) ).
cnf(153,plain,
$false,
152,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS099+1.p
% --creating new selector for []
% -running prover on /tmp/tmpziXTx0/sel_KRS099+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS099+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS099+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS099+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
%
%------------------------------------------------------------------------------