TSTP Solution File: KRS216+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS216+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : newtonia.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:51:28 EDT 2012
% Result : Theorem 0.05s
% Output : CNFRefutation 0.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 18 unt; 0 def)
% Number of atoms : 156 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 175 ( 69 ~; 64 |; 35 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 4 sgn 81 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ( ! [X3] : model(X3,X1)
& ! [X4] : model(X4,not(X2)) )
<=> status(X1,X2,uns) ),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',uns) ).
fof(2,axiom,
! [X5,X6] :
( model(X5,X6)
<~> model(X5,not(X6)) ),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',completeness) ).
fof(3,axiom,
? [X6] :
! [X5] : model(X5,X6),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',tautology) ).
fof(4,axiom,
? [X6] :
! [X5] : ~ model(X5,X6),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',contradiction) ).
fof(5,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',thm) ).
fof(6,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',nota) ).
fof(12,conjecture,
nota(uns,thm),
file('/tmp/tmprkdezu/sel_KRS216+1.p_1',nota_uns_thm) ).
fof(13,negated_conjecture,
~ nota(uns,thm),
inference(assume_negation,[status(cth)],[12]) ).
fof(14,plain,
! [X5,X6] :
~ ( model(X5,X6)
<=> model(X5,not(X6)) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(15,plain,
? [X6] :
! [X5] : ~ model(X5,X6),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(16,plain,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(22,negated_conjecture,
~ nota(uns,thm),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(23,plain,
! [X1,X2] :
( ( ? [X3] : ~ model(X3,X1)
| ? [X4] : ~ model(X4,not(X2))
| status(X1,X2,uns) )
& ( ~ status(X1,X2,uns)
| ( ! [X3] : model(X3,X1)
& ! [X4] : model(X4,not(X2)) ) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(24,plain,
! [X5,X6] :
( ( ? [X7] : ~ model(X7,X5)
| ? [X8] : ~ model(X8,not(X6))
| status(X5,X6,uns) )
& ( ~ status(X5,X6,uns)
| ( ! [X9] : model(X9,X5)
& ! [X10] : model(X10,not(X6)) ) ) ),
inference(variable_rename,[status(thm)],[23]) ).
fof(25,plain,
! [X5,X6] :
( ( ~ model(esk1_2(X5,X6),X5)
| ~ model(esk2_2(X5,X6),not(X6))
| status(X5,X6,uns) )
& ( ~ status(X5,X6,uns)
| ( ! [X9] : model(X9,X5)
& ! [X10] : model(X10,not(X6)) ) ) ),
inference(skolemize,[status(esa)],[24]) ).
fof(26,plain,
! [X5,X6,X9,X10] :
( ( ( model(X10,not(X6))
& model(X9,X5) )
| ~ status(X5,X6,uns) )
& ( ~ model(esk1_2(X5,X6),X5)
| ~ model(esk2_2(X5,X6),not(X6))
| status(X5,X6,uns) ) ),
inference(shift_quantors,[status(thm)],[25]) ).
fof(27,plain,
! [X5,X6,X9,X10] :
( ( model(X10,not(X6))
| ~ status(X5,X6,uns) )
& ( model(X9,X5)
| ~ status(X5,X6,uns) )
& ( ~ model(esk1_2(X5,X6),X5)
| ~ model(esk2_2(X5,X6),not(X6))
| status(X5,X6,uns) ) ),
inference(distribute,[status(thm)],[26]) ).
cnf(28,plain,
( status(X1,X2,uns)
| ~ model(esk2_2(X1,X2),not(X2))
| ~ model(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(31,plain,
! [X5,X6] :
( ( ~ model(X5,X6)
| ~ model(X5,not(X6)) )
& ( model(X5,X6)
| model(X5,not(X6)) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(32,plain,
! [X7,X8] :
( ( ~ model(X7,X8)
| ~ model(X7,not(X8)) )
& ( model(X7,X8)
| model(X7,not(X8)) ) ),
inference(variable_rename,[status(thm)],[31]) ).
cnf(33,plain,
( model(X1,not(X2))
| model(X1,X2) ),
inference(split_conjunct,[status(thm)],[32]) ).
fof(35,plain,
? [X7] :
! [X8] : model(X8,X7),
inference(variable_rename,[status(thm)],[3]) ).
fof(36,plain,
! [X8] : model(X8,esk3_0),
inference(skolemize,[status(esa)],[35]) ).
cnf(37,plain,
model(X1,esk3_0),
inference(split_conjunct,[status(thm)],[36]) ).
fof(38,plain,
? [X7] :
! [X8] : ~ model(X8,X7),
inference(variable_rename,[status(thm)],[15]) ).
fof(39,plain,
! [X8] : ~ model(X8,esk4_0),
inference(skolemize,[status(esa)],[38]) ).
cnf(40,plain,
~ model(X1,esk4_0),
inference(split_conjunct,[status(thm)],[39]) ).
fof(41,plain,
! [X1,X2] :
( ( ? [X3] :
( model(X3,X1)
& ~ model(X3,X2) )
| status(X1,X2,thm) )
& ( ~ status(X1,X2,thm)
| ! [X3] :
( ~ model(X3,X1)
| model(X3,X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(42,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)],[41]) ).
fof(43,plain,
! [X4,X5] :
( ( ( model(esk5_2(X4,X5),X4)
& ~ model(esk5_2(X4,X5),X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(skolemize,[status(esa)],[42]) ).
fof(44,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( ( model(esk5_2(X4,X5),X4)
& ~ model(esk5_2(X4,X5),X5) )
| status(X4,X5,thm) ) ),
inference(shift_quantors,[status(thm)],[43]) ).
fof(45,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( model(esk5_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk5_2(X4,X5),X5)
| status(X4,X5,thm) ) ),
inference(distribute,[status(thm)],[44]) ).
cnf(48,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(49,plain,
! [X7,X8] :
( ( ! [X1,X2] :
( ~ status(X1,X2,X7)
| status(X1,X2,X8) )
| nota(X7,X8) )
& ( ~ nota(X7,X8)
| ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(50,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)],[49]) ).
fof(51,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| status(X11,X12,X10) )
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk6_2(X9,X10),esk7_2(X9,X10),X9)
& ~ status(esk6_2(X9,X10),esk7_2(X9,X10),X10) ) ) ),
inference(skolemize,[status(esa)],[50]) ).
fof(52,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk6_2(X9,X10),esk7_2(X9,X10),X9)
& ~ status(esk6_2(X9,X10),esk7_2(X9,X10),X10) ) ) ),
inference(shift_quantors,[status(thm)],[51]) ).
fof(53,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( status(esk6_2(X9,X10),esk7_2(X9,X10),X9)
| ~ nota(X9,X10) )
& ( ~ status(esk6_2(X9,X10),esk7_2(X9,X10),X10)
| ~ nota(X9,X10) ) ),
inference(distribute,[status(thm)],[52]) ).
cnf(56,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[53]) ).
cnf(84,negated_conjecture,
~ nota(uns,thm),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(93,plain,
( status(esk3_0,X1,uns)
| ~ model(esk2_2(esk3_0,X1),not(X1)) ),
inference(spm,[status(thm)],[28,37,theory(equality)]) ).
cnf(107,plain,
( status(esk3_0,X1,uns)
| model(esk2_2(esk3_0,X1),X1) ),
inference(spm,[status(thm)],[93,33,theory(equality)]) ).
cnf(159,plain,
status(esk3_0,esk4_0,uns),
inference(spm,[status(thm)],[40,107,theory(equality)]) ).
cnf(165,plain,
( nota(uns,X1)
| status(esk3_0,esk4_0,X1) ),
inference(spm,[status(thm)],[56,159,theory(equality)]) ).
cnf(174,negated_conjecture,
status(esk3_0,esk4_0,thm),
inference(spm,[status(thm)],[84,165,theory(equality)]) ).
cnf(177,negated_conjecture,
( model(X1,esk4_0)
| ~ model(X1,esk3_0) ),
inference(spm,[status(thm)],[48,174,theory(equality)]) ).
cnf(178,negated_conjecture,
( model(X1,esk4_0)
| $false ),
inference(rw,[status(thm)],[177,37,theory(equality)]) ).
cnf(179,negated_conjecture,
model(X1,esk4_0),
inference(cn,[status(thm)],[178,theory(equality)]) ).
cnf(180,negated_conjecture,
$false,
inference(sr,[status(thm)],[179,40,theory(equality)]) ).
cnf(181,negated_conjecture,
$false,
180,
[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/KRS216+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmprkdezu/sel_KRS216+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/tmprkdezu/sel_KRS216+1.p_1']
% -prover status Theorem
% Problem KRS216+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS216+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS216+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
%
%------------------------------------------------------------------------------