TSTP Solution File: KRS201+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS201+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : merrimac.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 07:49:25 EDT 2012
% Result : Theorem 0.09s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 147 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 165 ( 62 ~; 57 |; 40 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 116 ( 8 sgn 67 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
? [X1,X2,X3] :
( model(X1,X2)
& ~ model(X1,X3)
& ? [X4] : model(X4,X3) ),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',non_thm_spt) ).
fof(2,axiom,
? [X5] :
! [X6] : model(X6,X5),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',tautology) ).
fof(4,axiom,
! [X2,X3] :
( ! [X1] :
( model(X1,X2)
=> model(X1,X3) )
<=> status(X2,X3,thm) ),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',thm) ).
fof(5,axiom,
! [X7,X8] :
( ? [X2,X3] :
( status(X2,X3,X7)
& ~ status(X2,X3,X8) )
<=> nota(X7,X8) ),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',nota) ).
fof(7,axiom,
! [X2,X3] :
( ( ? [X1] : model(X1,X2)
=> ? [X4] : model(X4,X3) )
<=> status(X2,X3,sap) ),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',sap) ).
fof(10,conjecture,
nota(sap,thm),
file('/tmp/tmp8zL_CK/sel_KRS201+1.p_1',nota_sap_thm) ).
fof(11,negated_conjecture,
~ nota(sap,thm),
inference(assume_negation,[status(cth)],[10]) ).
fof(12,plain,
? [X1,X2,X3] :
( model(X1,X2)
& ~ model(X1,X3)
& ? [X4] : model(X4,X3) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(14,plain,
! [X7,X8] :
( ? [X2,X3] :
( status(X2,X3,X7)
& ~ status(X2,X3,X8) )
<=> nota(X7,X8) ),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(18,negated_conjecture,
~ nota(sap,thm),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(19,plain,
? [X5,X6,X7] :
( model(X5,X6)
& ~ model(X5,X7)
& ? [X8] : model(X8,X7) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(20,plain,
( model(esk1_0,esk2_0)
& ~ model(esk1_0,esk3_0)
& model(esk4_0,esk3_0) ),
inference(skolemize,[status(esa)],[19]) ).
cnf(21,plain,
model(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[20]) ).
cnf(22,plain,
~ model(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[20]) ).
fof(24,plain,
? [X7] :
! [X8] : model(X8,X7),
inference(variable_rename,[status(thm)],[2]) ).
fof(25,plain,
! [X8] : model(X8,esk5_0),
inference(skolemize,[status(esa)],[24]) ).
cnf(26,plain,
model(X1,esk5_0),
inference(split_conjunct,[status(thm)],[25]) ).
fof(30,plain,
! [X2,X3] :
( ( ? [X1] :
( model(X1,X2)
& ~ model(X1,X3) )
| status(X2,X3,thm) )
& ( ~ status(X2,X3,thm)
| ! [X1] :
( ~ model(X1,X2)
| model(X1,X3) ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(31,plain,
! [X4,X5] :
( ( ? [X6] :
( model(X6,X4)
& ~ model(X6,X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X4,X5] :
( ( ( model(esk7_2(X4,X5),X4)
& ~ model(esk7_2(X4,X5),X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( ( model(esk7_2(X4,X5),X4)
& ~ model(esk7_2(X4,X5),X5) )
| status(X4,X5,thm) ) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( model(esk7_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk7_2(X4,X5),X5)
| status(X4,X5,thm) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(37,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(38,plain,
! [X7,X8] :
( ( ! [X2,X3] :
( ~ status(X2,X3,X7)
| status(X2,X3,X8) )
| nota(X7,X8) )
& ( ~ nota(X7,X8)
| ? [X2,X3] :
( status(X2,X3,X7)
& ~ status(X2,X3,X8) ) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(39,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| status(X11,X12,X10) )
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ? [X13,X14] :
( status(X13,X14,X9)
& ~ status(X13,X14,X10) ) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| status(X11,X12,X10) )
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk8_2(X9,X10),esk9_2(X9,X10),X9)
& ~ status(esk8_2(X9,X10),esk9_2(X9,X10),X10) ) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk8_2(X9,X10),esk9_2(X9,X10),X9)
& ~ status(esk8_2(X9,X10),esk9_2(X9,X10),X10) ) ) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( status(esk8_2(X9,X10),esk9_2(X9,X10),X9)
| ~ nota(X9,X10) )
& ( ~ status(esk8_2(X9,X10),esk9_2(X9,X10),X10)
| ~ nota(X9,X10) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(45,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(51,plain,
! [X2,X3] :
( ( ( ? [X1] : model(X1,X2)
& ! [X4] : ~ model(X4,X3) )
| status(X2,X3,sap) )
& ( ~ status(X2,X3,sap)
| ! [X1] : ~ model(X1,X2)
| ? [X4] : model(X4,X3) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(52,plain,
! [X5,X6] :
( ( ( ? [X7] : model(X7,X5)
& ! [X8] : ~ model(X8,X6) )
| status(X5,X6,sap) )
& ( ~ status(X5,X6,sap)
| ! [X9] : ~ model(X9,X5)
| ? [X10] : model(X10,X6) ) ),
inference(variable_rename,[status(thm)],[51]) ).
fof(53,plain,
! [X5,X6] :
( ( ( model(esk14_2(X5,X6),X5)
& ! [X8] : ~ model(X8,X6) )
| status(X5,X6,sap) )
& ( ~ status(X5,X6,sap)
| ! [X9] : ~ model(X9,X5)
| model(esk15_2(X5,X6),X6) ) ),
inference(skolemize,[status(esa)],[52]) ).
fof(54,plain,
! [X5,X6,X8,X9] :
( ( ~ model(X9,X5)
| model(esk15_2(X5,X6),X6)
| ~ status(X5,X6,sap) )
& ( ( ~ model(X8,X6)
& model(esk14_2(X5,X6),X5) )
| status(X5,X6,sap) ) ),
inference(shift_quantors,[status(thm)],[53]) ).
fof(55,plain,
! [X5,X6,X8,X9] :
( ( ~ model(X9,X5)
| model(esk15_2(X5,X6),X6)
| ~ status(X5,X6,sap) )
& ( ~ model(X8,X6)
| status(X5,X6,sap) )
& ( model(esk14_2(X5,X6),X5)
| status(X5,X6,sap) ) ),
inference(distribute,[status(thm)],[54]) ).
cnf(57,plain,
( status(X1,X2,sap)
| ~ model(X3,X2) ),
inference(split_conjunct,[status(thm)],[55]) ).
cnf(72,negated_conjecture,
~ nota(sap,thm),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(75,plain,
status(X1,esk3_0,sap),
inference(spm,[status(thm)],[57,21,theory(equality)]) ).
cnf(114,plain,
( nota(sap,X1)
| status(X2,esk3_0,X1) ),
inference(spm,[status(thm)],[45,75,theory(equality)]) ).
cnf(172,plain,
( model(X1,esk3_0)
| nota(sap,thm)
| ~ model(X1,X2) ),
inference(spm,[status(thm)],[37,114,theory(equality)]) ).
cnf(174,plain,
( model(X1,esk3_0)
| ~ model(X1,X2) ),
inference(sr,[status(thm)],[172,72,theory(equality)]) ).
cnf(537,plain,
model(X1,esk3_0),
inference(spm,[status(thm)],[174,26,theory(equality)]) ).
cnf(561,plain,
$false,
inference(rw,[status(thm)],[22,537,theory(equality)]) ).
cnf(562,plain,
$false,
inference(cn,[status(thm)],[561,theory(equality)]) ).
cnf(563,plain,
$false,
562,
[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/KRS201+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmp8zL_CK/sel_KRS201+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmp8zL_CK/sel_KRS201+1.p_1']
% -prover status Theorem
% Problem KRS201+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS201+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS201+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------