TSTP Solution File: KRS067+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS067+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 13:01:02 EST 2010
% Result : Unsatisfiable 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 41 ( 4 avg)
% Number of connectives : 167 ( 63 ~; 72 |; 28 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 24 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ( cc(X1)
& cb(X1) )
| ( cb(X1)
& ca(X1) )
| ( cc(X1)
& ca(X1) ) ) ),
file('/tmp/tmpSlXnSo/sel_KRS067+1.p_1',axiom_2) ).
fof(2,axiom,
! [X1] :
( ca(X1)
=> ~ ( cc(X1)
| cb(X1) ) ),
file('/tmp/tmpSlXnSo/sel_KRS067+1.p_1',axiom_3) ).
fof(5,axiom,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
file('/tmp/tmpSlXnSo/sel_KRS067+1.p_1',axiom_4) ).
fof(6,axiom,
cUnsatisfiable(i2003_11_14_17_18_1956),
file('/tmp/tmpSlXnSo/sel_KRS067+1.p_1',axiom_5) ).
fof(9,plain,
! [X1] :
( cb(X1)
=> ~ cc(X1) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(10,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( cc(X1)
& cb(X1) )
| ( cb(X1)
& ca(X1) )
| ( cc(X1)
& ca(X1) ) )
& ( ( ( ~ cc(X1)
| ~ cb(X1) )
& ( ~ cb(X1)
| ~ ca(X1) )
& ( ~ cc(X1)
| ~ ca(X1) ) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(11,plain,
! [X2] :
( ( ~ cUnsatisfiable(X2)
| ( cc(X2)
& cb(X2) )
| ( cb(X2)
& ca(X2) )
| ( cc(X2)
& ca(X2) ) )
& ( ( ( ~ cc(X2)
| ~ cb(X2) )
& ( ~ cb(X2)
| ~ ca(X2) )
& ( ~ cc(X2)
| ~ ca(X2) ) )
| cUnsatisfiable(X2) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
! [X2] :
( ( cc(X2)
| cb(X2)
| cc(X2)
| ~ cUnsatisfiable(X2) )
& ( ca(X2)
| cb(X2)
| cc(X2)
| ~ cUnsatisfiable(X2) )
& ( cc(X2)
| ca(X2)
| cc(X2)
| ~ cUnsatisfiable(X2) )
& ( ca(X2)
| ca(X2)
| cc(X2)
| ~ cUnsatisfiable(X2) )
& ( cc(X2)
| cb(X2)
| cb(X2)
| ~ cUnsatisfiable(X2) )
& ( ca(X2)
| cb(X2)
| cb(X2)
| ~ cUnsatisfiable(X2) )
& ( cc(X2)
| ca(X2)
| cb(X2)
| ~ cUnsatisfiable(X2) )
& ( ca(X2)
| ca(X2)
| cb(X2)
| ~ cUnsatisfiable(X2) )
& ( ~ cc(X2)
| ~ cb(X2)
| cUnsatisfiable(X2) )
& ( ~ cb(X2)
| ~ ca(X2)
| cUnsatisfiable(X2) )
& ( ~ cc(X2)
| ~ ca(X2)
| cUnsatisfiable(X2) ) ),
inference(distribute,[status(thm)],[11]) ).
cnf(16,plain,
( cb(X1)
| ca(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(19,plain,
( cb(X1)
| cb(X1)
| cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(20,plain,
( cc(X1)
| ca(X1)
| ca(X1)
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(24,plain,
! [X1] :
( ~ ca(X1)
| ( ~ cc(X1)
& ~ cb(X1) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(25,plain,
! [X2] :
( ~ ca(X2)
| ( ~ cc(X2)
& ~ cb(X2) ) ),
inference(variable_rename,[status(thm)],[24]) ).
fof(26,plain,
! [X2] :
( ( ~ cc(X2)
| ~ ca(X2) )
& ( ~ cb(X2)
| ~ ca(X2) ) ),
inference(distribute,[status(thm)],[25]) ).
cnf(27,plain,
( ~ ca(X1)
| ~ cb(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(28,plain,
( ~ ca(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
fof(36,plain,
! [X1] :
( ~ cb(X1)
| ~ cc(X1) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(37,plain,
! [X2] :
( ~ cb(X2)
| ~ cc(X2) ),
inference(variable_rename,[status(thm)],[36]) ).
cnf(38,plain,
( ~ cc(X1)
| ~ cb(X1) ),
inference(split_conjunct,[status(thm)],[37]) ).
cnf(39,plain,
cUnsatisfiable(i2003_11_14_17_18_1956),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(42,plain,
( cc(X1)
| ~ cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[27,20,theory(equality)]) ).
cnf(44,plain,
( cb(X1)
| ~ cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[28,16,theory(equality)]) ).
cnf(51,plain,
( cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[42,19]) ).
cnf(52,plain,
( cb(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[44,51]) ).
cnf(53,plain,
( ~ cc(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[38,52,theory(equality)]) ).
cnf(54,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[53,51]) ).
cnf(55,plain,
$false,
inference(sr,[status(thm)],[39,54,theory(equality)]) ).
cnf(56,plain,
$false,
55,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS067+1.p
% --creating new selector for []
% -running prover on /tmp/tmpSlXnSo/sel_KRS067+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS067+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS067+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS067+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
%
%------------------------------------------------------------------------------