TSTP Solution File: KRS124+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS124+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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 13:01:11 EST 2010
% Result : Unsatisfiable 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 6 unt; 0 def)
% Number of atoms : 153 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 189 ( 76 ~; 70 |; 37 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 68 ( 3 sgn 42 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1] :
( ca_Ax3(X1)
<=> ( cd(X1)
& cc(X1) ) ),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_12) ).
fof(4,axiom,
cUnsatisfiable(i2003_11_14_17_22_10903),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_13) ).
fof(5,axiom,
! [X1] :
( cUnsatisfiable(X1)
<=> ( ? [X2] :
( rr(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( rr(X1,X2)
=> ca_Ax3(X2) ) ) ),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_2) ).
fof(6,axiom,
! [X1] :
( cc(X1)
=> cdxcomp(X1) ),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_3) ).
fof(9,axiom,
! [X1] :
( cd(X1)
<=> ~ ? [X2] : ra_Px1(X1,X2) ),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_6) ).
fof(10,axiom,
! [X1] :
( cdxcomp(X1)
<=> ? [X3] : ra_Px1(X1,X3) ),
file('/tmp/tmpsCscj8/sel_KRS124+1.p_1',axiom_7) ).
fof(23,plain,
! [X1] :
( ( ~ ca_Ax3(X1)
| ( cd(X1)
& cc(X1) ) )
& ( ~ cd(X1)
| ~ cc(X1)
| ca_Ax3(X1) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(24,plain,
! [X2] :
( ( ~ ca_Ax3(X2)
| ( cd(X2)
& cc(X2) ) )
& ( ~ cd(X2)
| ~ cc(X2)
| ca_Ax3(X2) ) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X2] :
( ( cd(X2)
| ~ ca_Ax3(X2) )
& ( cc(X2)
| ~ ca_Ax3(X2) )
& ( ~ cd(X2)
| ~ cc(X2)
| ca_Ax3(X2) ) ),
inference(distribute,[status(thm)],[24]) ).
cnf(27,plain,
( cc(X1)
| ~ ca_Ax3(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(28,plain,
( cd(X1)
| ~ ca_Ax3(X1) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(29,plain,
cUnsatisfiable(i2003_11_14_17_22_10903),
inference(split_conjunct,[status(thm)],[4]) ).
fof(30,plain,
! [X1] :
( ( ~ cUnsatisfiable(X1)
| ( ? [X2] :
( rr(X1,X2)
& cowlThing(X2) )
& ! [X2] :
( ~ rr(X1,X2)
| ca_Ax3(X2) ) ) )
& ( ! [X2] :
( ~ rr(X1,X2)
| ~ cowlThing(X2) )
| ? [X2] :
( rr(X1,X2)
& ~ ca_Ax3(X2) )
| cUnsatisfiable(X1) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(31,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( ? [X4] :
( rr(X3,X4)
& cowlThing(X4) )
& ! [X5] :
( ~ rr(X3,X5)
| ca_Ax3(X5) ) ) )
& ( ! [X6] :
( ~ rr(X3,X6)
| ~ cowlThing(X6) )
| ? [X7] :
( rr(X3,X7)
& ~ ca_Ax3(X7) )
| cUnsatisfiable(X3) ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X3] :
( ( ~ cUnsatisfiable(X3)
| ( rr(X3,esk1_1(X3))
& cowlThing(esk1_1(X3))
& ! [X5] :
( ~ rr(X3,X5)
| ca_Ax3(X5) ) ) )
& ( ! [X6] :
( ~ rr(X3,X6)
| ~ cowlThing(X6) )
| ( rr(X3,esk2_1(X3))
& ~ ca_Ax3(esk2_1(X3)) )
| cUnsatisfiable(X3) ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
! [X3,X5,X6] :
( ( ~ rr(X3,X6)
| ~ cowlThing(X6)
| ( rr(X3,esk2_1(X3))
& ~ ca_Ax3(esk2_1(X3)) )
| cUnsatisfiable(X3) )
& ( ( ( ~ rr(X3,X5)
| ca_Ax3(X5) )
& rr(X3,esk1_1(X3))
& cowlThing(esk1_1(X3)) )
| ~ cUnsatisfiable(X3) ) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X3,X5,X6] :
( ( rr(X3,esk2_1(X3))
| ~ rr(X3,X6)
| ~ cowlThing(X6)
| cUnsatisfiable(X3) )
& ( ~ ca_Ax3(esk2_1(X3))
| ~ rr(X3,X6)
| ~ cowlThing(X6)
| cUnsatisfiable(X3) )
& ( ~ rr(X3,X5)
| ca_Ax3(X5)
| ~ cUnsatisfiable(X3) )
& ( rr(X3,esk1_1(X3))
| ~ cUnsatisfiable(X3) )
& ( cowlThing(esk1_1(X3))
| ~ cUnsatisfiable(X3) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(36,plain,
( rr(X1,esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(37,plain,
( ca_Ax3(X2)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(40,plain,
! [X1] :
( ~ cc(X1)
| cdxcomp(X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(41,plain,
! [X2] :
( ~ cc(X2)
| cdxcomp(X2) ),
inference(variable_rename,[status(thm)],[40]) ).
cnf(42,plain,
( cdxcomp(X1)
| ~ cc(X1) ),
inference(split_conjunct,[status(thm)],[41]) ).
fof(50,plain,
! [X1] :
( ( ~ cd(X1)
| ! [X2] : ~ ra_Px1(X1,X2) )
& ( ? [X2] : ra_Px1(X1,X2)
| cd(X1) ) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(51,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ? [X5] : ra_Px1(X3,X5)
| cd(X3) ) ),
inference(variable_rename,[status(thm)],[50]) ).
fof(52,plain,
! [X3] :
( ( ~ cd(X3)
| ! [X4] : ~ ra_Px1(X3,X4) )
& ( ra_Px1(X3,esk3_1(X3))
| cd(X3) ) ),
inference(skolemize,[status(esa)],[51]) ).
fof(53,plain,
! [X3,X4] :
( ( ~ ra_Px1(X3,X4)
| ~ cd(X3) )
& ( ra_Px1(X3,esk3_1(X3))
| cd(X3) ) ),
inference(shift_quantors,[status(thm)],[52]) ).
cnf(55,plain,
( ~ cd(X1)
| ~ ra_Px1(X1,X2) ),
inference(split_conjunct,[status(thm)],[53]) ).
fof(56,plain,
! [X1] :
( ( ~ cdxcomp(X1)
| ? [X3] : ra_Px1(X1,X3) )
& ( ! [X3] : ~ ra_Px1(X1,X3)
| cdxcomp(X1) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(57,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ? [X5] : ra_Px1(X4,X5) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(variable_rename,[status(thm)],[56]) ).
fof(58,plain,
! [X4] :
( ( ~ cdxcomp(X4)
| ra_Px1(X4,esk4_1(X4)) )
& ( ! [X6] : ~ ra_Px1(X4,X6)
| cdxcomp(X4) ) ),
inference(skolemize,[status(esa)],[57]) ).
fof(59,plain,
! [X4,X6] :
( ( ~ ra_Px1(X4,X6)
| cdxcomp(X4) )
& ( ~ cdxcomp(X4)
| ra_Px1(X4,esk4_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[58]) ).
cnf(60,plain,
( ra_Px1(X1,esk4_1(X1))
| ~ cdxcomp(X1) ),
inference(split_conjunct,[status(thm)],[59]) ).
cnf(90,plain,
( ~ cd(X1)
| ~ cdxcomp(X1) ),
inference(spm,[status(thm)],[55,60,theory(equality)]) ).
cnf(93,plain,
( ca_Ax3(esk1_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[37,36,theory(equality)]) ).
cnf(95,plain,
( ~ cd(X1)
| ~ cc(X1) ),
inference(spm,[status(thm)],[90,42,theory(equality)]) ).
cnf(98,plain,
( ~ cd(X1)
| ~ ca_Ax3(X1) ),
inference(spm,[status(thm)],[95,27,theory(equality)]) ).
cnf(99,plain,
~ ca_Ax3(X1),
inference(csr,[status(thm)],[98,28]) ).
cnf(100,plain,
~ cUnsatisfiable(X1),
inference(sr,[status(thm)],[93,99,theory(equality)]) ).
cnf(101,plain,
$false,
inference(sr,[status(thm)],[29,100,theory(equality)]) ).
cnf(102,plain,
$false,
101,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS124+1.p
% --creating new selector for []
% -running prover on /tmp/tmpsCscj8/sel_KRS124+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS124+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS124+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS124+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
%
%------------------------------------------------------------------------------