TSTP Solution File: KRS092+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS092+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art05.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:56 EST 2010
% Result : Unsatisfiable 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 134 ( 54 ~; 48 |; 28 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 36 ( 1 sgn 21 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rr(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( rr(X1,X2)
=> ( cd(X2)
& cc(X2) ) ) ) ),
file('/tmp/tmpwCn0ub/sel_KRS092+1.p_1',axiom_2) ).
fof(2,axiom,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
file('/tmp/tmpwCn0ub/sel_KRS092+1.p_1',axiom_3) ).
fof(9,axiom,
cUnsatisfiable(i2003_11_14_17_20_04172),
file('/tmp/tmpwCn0ub/sel_KRS092+1.p_1',axiom_8) ).
fof(10,plain,
! [X1] :
( cc(X1)
=> ~ cd(X1) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(14,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rr(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( ~ rr(X1,X2)
| ( cd(X2)
& cc(X2) ) ) ) )
& ( ! [X2] :
( ~ rr(X1,X2)
| ~ cowlThing(X2) )
| ? [X2] :
( rr(X1,X2)
& ( ~ cd(X2)
| ~ cc(X2) ) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(15,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rr(X3,X4)
& cowlThing(X4) )
& ! [X5] :
( ~ rr(X3,X5)
| ( cd(X5)
& cc(X5) ) ) ) )
& ( ! [X6] :
( ~ rr(X3,X6)
| ~ cowlThing(X6) )
| ? [X7] :
( rr(X3,X7)
& ( ~ cd(X7)
| ~ cc(X7) ) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(16,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rr(X3,esk1_1(X3))
& cowlThing(esk1_1(X3))
& ! [X5] :
( ~ rr(X3,X5)
| ( cd(X5)
& cc(X5) ) ) ) )
& ( ! [X6] :
( ~ rr(X3,X6)
| ~ cowlThing(X6) )
| ( rr(X3,esk2_1(X3))
& ( ~ cd(esk2_1(X3))
| ~ cc(esk2_1(X3)) ) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[15]) ).
fof(17,plain,
! [X3,X5,X6] :
( ( ~ rr(X3,X6)
| ~ cowlThing(X6)
| ( rr(X3,esk2_1(X3))
& ( ~ cd(esk2_1(X3))
| ~ cc(esk2_1(X3)) ) )
| cUnsatisfiable(X3) )
& ( ( ( ~ rr(X3,X5)
| ( cd(X5)
& cc(X5) ) )
& rr(X3,esk1_1(X3))
& cowlThing(esk1_1(X3)) )
| ~ cUnsatisfiable(X3) ) ),
inference(shift_quantors,[status(thm)],[16]) ).
fof(18,plain,
! [X3,X5,X6] :
( ( rr(X3,esk2_1(X3))
| ~ rr(X3,X6)
| ~ cowlThing(X6)
| cUnsatisfiable(X3) )
& ( ~ cd(esk2_1(X3))
| ~ cc(esk2_1(X3))
| ~ rr(X3,X6)
| ~ cowlThing(X6)
| cUnsatisfiable(X3) )
& ( cd(X5)
| ~ rr(X3,X5)
| ~ cUnsatisfiable(X3) )
& ( cc(X5)
| ~ rr(X3,X5)
| ~ cUnsatisfiable(X3) )
& ( rr(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cowlThing(esk1_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[17]) ).
cnf(20,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(21,plain,
( cc(X2)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(22,plain,
( cd(X2)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(25,plain,
! [X1] :
( ~ cc(X1)
| ~ cd(X1) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(26,plain,
! [X2] :
( ~ cc(X2)
| ~ cd(X2) ),
inference(variable_rename,[status(thm)],[25]) ).
cnf(27,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(47,plain,
cUnsatisfiable(i2003_11_14_17_20_04172),
inference(split_conjunct,[status(thm)],[9]) ).
cnf(53,plain,
( cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[22,20,theory(equality)]) ).
cnf(54,plain,
( cc(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[21,20,theory(equality)]) ).
cnf(58,plain,
( ~ cd(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[27,54,theory(equality)]) ).
cnf(59,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[58,53]) ).
cnf(60,plain,
$false,
inference(sr,[status(thm)],[47,59,theory(equality)]) ).
cnf(61,plain,
$false,
60,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS092+1.p
% --creating new selector for []
% -running prover on /tmp/tmpwCn0ub/sel_KRS092+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS092+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS092+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS092+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
%
%------------------------------------------------------------------------------