TSTP Solution File: KRS090+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS090+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:58:39 EST 2010
% Result : Unsatisfiable 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 5 unt; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 170 ( 72 ~; 67 |; 23 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 48 ( 1 sgn 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( cC2(X1)
=> ( ( ~ cB(X1)
| cA(X1) )
& ( cB(X1)
| cA(X1) ) ) ),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_3) ).
fof(5,axiom,
! [X1] :
( cC5(X1)
=> ! [X2] :
( rR(X1,X2)
=> cC3(X2) ) ),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_6) ).
fof(6,axiom,
! [X1] :
( cTEST(X1)
=> ( cC4(X1)
& cC1(X1)
& cC5(X1) ) ),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_7) ).
fof(7,axiom,
! [X1] :
( cC3(X1)
=> ( ( ~ cB(X1)
| ~ cA(X1) )
& ( cB(X1)
| ~ cA(X1) ) ) ),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_4) ).
fof(8,axiom,
! [X1] :
( cC4(X1)
=> ? [X2] :
( rR(X1,X2)
& cC2(X2) ) ),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_5) ).
fof(9,axiom,
cTEST(i2003_11_14_17_19_57994),
file('/tmp/tmph9oT_D/sel_KRS090+1.p_1',axiom_8) ).
fof(10,plain,
! [X1] :
( cC2(X1)
=> ( ( ~ cB(X1)
| cA(X1) )
& ( cB(X1)
| cA(X1) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(13,plain,
! [X1] :
( cC3(X1)
=> ( ( ~ cB(X1)
| ~ cA(X1) )
& ( cB(X1)
| ~ cA(X1) ) ) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(19,plain,
! [X1] :
( ~ cC2(X1)
| ( ( ~ cB(X1)
| cA(X1) )
& ( cB(X1)
| cA(X1) ) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(20,plain,
! [X2] :
( ~ cC2(X2)
| ( ( ~ cB(X2)
| cA(X2) )
& ( cB(X2)
| cA(X2) ) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X2] :
( ( ~ cB(X2)
| cA(X2)
| ~ cC2(X2) )
& ( cB(X2)
| cA(X2)
| ~ cC2(X2) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(22,plain,
( cA(X1)
| cB(X1)
| ~ cC2(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( cA(X1)
| ~ cC2(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(31,plain,
! [X1] :
( ~ cC5(X1)
| ! [X2] :
( ~ rR(X1,X2)
| cC3(X2) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(32,plain,
! [X3] :
( ~ cC5(X3)
| ! [X4] :
( ~ rR(X3,X4)
| cC3(X4) ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X3,X4] :
( ~ rR(X3,X4)
| cC3(X4)
| ~ cC5(X3) ),
inference(shift_quantors,[status(thm)],[32]) ).
cnf(34,plain,
( cC3(X2)
| ~ cC5(X1)
| ~ rR(X1,X2) ),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
! [X1] :
( ~ cTEST(X1)
| ( cC4(X1)
& cC1(X1)
& cC5(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(36,plain,
! [X2] :
( ~ cTEST(X2)
| ( cC4(X2)
& cC1(X2)
& cC5(X2) ) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,plain,
! [X2] :
( ( cC4(X2)
| ~ cTEST(X2) )
& ( cC1(X2)
| ~ cTEST(X2) )
& ( cC5(X2)
| ~ cTEST(X2) ) ),
inference(distribute,[status(thm)],[36]) ).
cnf(38,plain,
( cC5(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(40,plain,
( cC4(X1)
| ~ cTEST(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
fof(41,plain,
! [X1] :
( ~ cC3(X1)
| ( ( ~ cB(X1)
| ~ cA(X1) )
& ( cB(X1)
| ~ cA(X1) ) ) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(42,plain,
! [X2] :
( ~ cC3(X2)
| ( ( ~ cB(X2)
| ~ cA(X2) )
& ( cB(X2)
| ~ cA(X2) ) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X2] :
( ( ~ cB(X2)
| ~ cA(X2)
| ~ cC3(X2) )
& ( cB(X2)
| ~ cA(X2)
| ~ cC3(X2) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(44,plain,
( cB(X1)
| ~ cC3(X1)
| ~ cA(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,plain,
( ~ cC3(X1)
| ~ cA(X1)
| ~ cB(X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(46,plain,
! [X1] :
( ~ cC4(X1)
| ? [X2] :
( rR(X1,X2)
& cC2(X2) ) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(47,plain,
! [X3] :
( ~ cC4(X3)
| ? [X4] :
( rR(X3,X4)
& cC2(X4) ) ),
inference(variable_rename,[status(thm)],[46]) ).
fof(48,plain,
! [X3] :
( ~ cC4(X3)
| ( rR(X3,esk1_1(X3))
& cC2(esk1_1(X3)) ) ),
inference(skolemize,[status(esa)],[47]) ).
fof(49,plain,
! [X3] :
( ( rR(X3,esk1_1(X3))
| ~ cC4(X3) )
& ( cC2(esk1_1(X3))
| ~ cC4(X3) ) ),
inference(distribute,[status(thm)],[48]) ).
cnf(50,plain,
( cC2(esk1_1(X1))
| ~ cC4(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(51,plain,
( rR(X1,esk1_1(X1))
| ~ cC4(X1) ),
inference(split_conjunct,[status(thm)],[49]) ).
cnf(52,plain,
cTEST(i2003_11_14_17_19_57994),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(91,plain,
( cA(X1)
| ~ cC2(X1) ),
inference(csr,[status(thm)],[23,22]) ).
cnf(92,plain,
( cA(esk1_1(X1))
| ~ cC4(X1) ),
inference(spm,[status(thm)],[91,50,theory(equality)]) ).
cnf(93,plain,
( ~ cC3(X1)
| ~ cA(X1) ),
inference(csr,[status(thm)],[45,44]) ).
cnf(94,plain,
( cC3(esk1_1(X1))
| ~ cC5(X1)
| ~ cC4(X1) ),
inference(spm,[status(thm)],[34,51,theory(equality)]) ).
cnf(96,plain,
( ~ cA(esk1_1(X1))
| ~ cC4(X1)
| ~ cC5(X1) ),
inference(spm,[status(thm)],[93,94,theory(equality)]) ).
cnf(97,plain,
( ~ cC4(X1)
| ~ cC5(X1) ),
inference(csr,[status(thm)],[96,92]) ).
cnf(98,plain,
( ~ cC4(X1)
| ~ cTEST(X1) ),
inference(spm,[status(thm)],[97,38,theory(equality)]) ).
cnf(99,plain,
~ cTEST(X1),
inference(csr,[status(thm)],[98,40]) ).
cnf(100,plain,
$false,
inference(sr,[status(thm)],[52,99,theory(equality)]) ).
cnf(101,plain,
$false,
100,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS090+1.p
% --creating new selector for []
% -running prover on /tmp/tmph9oT_D/sel_KRS090+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS090+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS090+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS090+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
%
%------------------------------------------------------------------------------