%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS100+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:03:49 EST 2010
% Result : Unsatisfiable 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 142 ( 0 equ)
% Maximal formula atoms : 41 ( 7 avg)
% Number of connectives : 191 ( 67 ~; 75 |; 43 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 44 ( 1 sgn 26 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ! [X2] :
( rr(X1,X2)
=> ( ce(X2)
| ~ cd(X2) ) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ? [X2] :
( rr(X1,X2)
& ~ ce(X2) ) ) ),
file('/tmp/tmpJ5oqeE/sel_KRS100+1.p_1',axiom_2) ).
fof(5,axiom,
cUnsatisfiable(i2003_11_14_17_20_32704),
file('/tmp/tmpJ5oqeE/sel_KRS100+1.p_1',axiom_4) ).
fof(6,plain,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ! [X2] :
( rr(X1,X2)
=> ( ce(X2)
| ~ cd(X2) ) )
& ! [X2] :
( rr(X1,X2)
=> cd(X2) )
& ? [X2] :
( rr(X1,X2)
& ~ ce(X2) ) ) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(10,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ! [X2] :
( ~ rr(X1,X2)
| ce(X2)
| ~ cd(X2) )
& ! [X2] :
( ~ rr(X1,X2)
| cd(X2) )
& ? [X2] :
( rr(X1,X2)
& ~ ce(X2) ) ) )
& ( ? [X2] :
( rr(X1,X2)
& ~ ce(X2)
& cd(X2) )
| ? [X2] :
( rr(X1,X2)
& ~ cd(X2) )
| ! [X2] :
( ~ rr(X1,X2)
| ce(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(11,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ! [X4] :
( ~ rr(X3,X4)
| ce(X4)
| ~ cd(X4) )
& ! [X5] :
( ~ rr(X3,X5)
| cd(X5) )
& ? [X6] :
( rr(X3,X6)
& ~ ce(X6) ) ) )
& ( ? [X7] :
( rr(X3,X7)
& ~ ce(X7)
& cd(X7) )
| ? [X8] :
( rr(X3,X8)
& ~ cd(X8) )
| ! [X9] :
( ~ rr(X3,X9)
| ce(X9) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ! [X4] :
( ~ rr(X3,X4)
| ce(X4)
| ~ cd(X4) )
& ! [X5] :
( ~ rr(X3,X5)
| cd(X5) )
& rr(X3,esk1_1(X3))
& ~ ce(esk1_1(X3)) ) )
& ( ( rr(X3,esk2_1(X3))
& ~ ce(esk2_1(X3))
& cd(esk2_1(X3)) )
| ( rr(X3,esk3_1(X3))
& ~ cd(esk3_1(X3)) )
| ! [X9] :
( ~ rr(X3,X9)
| ce(X9) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[11]) ).
fof(13,plain,
! [X3,X4,X5,X9] :
( ( ~ rr(X3,X9)
| ce(X9)
| ( rr(X3,esk2_1(X3))
& ~ ce(esk2_1(X3))
& cd(esk2_1(X3)) )
| ( rr(X3,esk3_1(X3))
& ~ cd(esk3_1(X3)) )
| cUnsatisfiable(X3) )
& ( ( ( ~ rr(X3,X5)
| cd(X5) )
& ( ~ rr(X3,X4)
| ce(X4)
| ~ cd(X4) )
& rr(X3,esk1_1(X3))
& ~ ce(esk1_1(X3)) )
| ~ cUnsatisfiable(X3) ) ),
inference(shift_quantors,[status(thm)],[12]) ).
fof(14,plain,
! [X3,X4,X5,X9] :
( ( rr(X3,esk3_1(X3))
| rr(X3,esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( ~ cd(esk3_1(X3))
| rr(X3,esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( rr(X3,esk3_1(X3))
| ~ ce(esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( ~ cd(esk3_1(X3))
| ~ ce(esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( rr(X3,esk3_1(X3))
| cd(esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( ~ cd(esk3_1(X3))
| cd(esk2_1(X3))
| ~ rr(X3,X9)
| ce(X9)
| cUnsatisfiable(X3) )
& ( ~ rr(X3,X5)
| cd(X5)
| ~ cUnsatisfiable(X3) )
& ( ~ rr(X3,X4)
| ce(X4)
| ~ cd(X4)
| ~ cUnsatisfiable(X3) )
& ( rr(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( ~ ce(esk1_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[13]) ).
cnf(15,plain,
( ~ cUnsatisfiable(X1)
| ~ ce(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,plain,
( ce(X2)
| ~ cUnsatisfiable(X1)
| ~ cd(X2)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(18,plain,
( cd(X2)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(35,plain,
cUnsatisfiable(i2003_11_14_17_20_32704),
inference(split_conjunct,[status(thm)],[5]) ).
cnf(37,plain,
( ce(X2)
| ~ rr(X1,X2)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[17,18]) ).
cnf(38,plain,
( ce(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[37,16,theory(equality)]) ).
cnf(48,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[38,15]) ).
cnf(49,plain,
$false,
inference(sr,[status(thm)],[35,48,theory(equality)]) ).
cnf(50,plain,
$false,
49,
[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/KRS100+1.p
% --creating new selector for []
% -running prover on /tmp/tmpJ5oqeE/sel_KRS100+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS100+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS100+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS100+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
%
%------------------------------------------------------------------------------