TSTP Solution File: KRS200+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS200+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : chickamauga.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:20 EDT 2012
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 17 unt; 0 def)
% Number of atoms : 137 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 159 ( 64 ~; 57 |; 32 &)
% ( 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 112 ( 9 sgn 71 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ( ~ ? [X3] : model(X3,X1)
=> ~ ? [X4] : model(X4,X2) )
<=> status(X1,X2,unp) ),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',unp) ).
fof(3,axiom,
? [X5] :
! [X6] : model(X6,X5),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',tautology) ).
fof(4,axiom,
? [X5] :
! [X6] : ~ model(X6,X5),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',contradiction) ).
fof(5,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',thm) ).
fof(6,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
<=> nota(X7,X8) ),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',nota) ).
fof(10,conjecture,
nota(unp,thm),
file('/tmp/tmpajJudw/sel_KRS200+1.p_1',nota_unp_thm) ).
fof(11,negated_conjecture,
~ nota(unp,thm),
inference(assume_negation,[status(cth)],[10]) ).
fof(13,plain,
? [X5] :
! [X6] : ~ model(X6,X5),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(14,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(18,negated_conjecture,
~ nota(unp,thm),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(19,plain,
! [X1,X2] :
( ( ( ! [X3] : ~ model(X3,X1)
& ? [X4] : model(X4,X2) )
| status(X1,X2,unp) )
& ( ~ status(X1,X2,unp)
| ? [X3] : model(X3,X1)
| ! [X4] : ~ model(X4,X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(20,plain,
! [X5,X6] :
( ( ( ! [X7] : ~ model(X7,X5)
& ? [X8] : model(X8,X6) )
| status(X5,X6,unp) )
& ( ~ status(X5,X6,unp)
| ? [X9] : model(X9,X5)
| ! [X10] : ~ model(X10,X6) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X5,X6] :
( ( ( ! [X7] : ~ model(X7,X5)
& model(esk1_2(X5,X6),X6) )
| status(X5,X6,unp) )
& ( ~ status(X5,X6,unp)
| model(esk2_2(X5,X6),X5)
| ! [X10] : ~ model(X10,X6) ) ),
inference(skolemize,[status(esa)],[20]) ).
fof(22,plain,
! [X5,X6,X7,X10] :
( ( ~ model(X10,X6)
| model(esk2_2(X5,X6),X5)
| ~ status(X5,X6,unp) )
& ( ( ~ model(X7,X5)
& model(esk1_2(X5,X6),X6) )
| status(X5,X6,unp) ) ),
inference(shift_quantors,[status(thm)],[21]) ).
fof(23,plain,
! [X5,X6,X7,X10] :
( ( ~ model(X10,X6)
| model(esk2_2(X5,X6),X5)
| ~ status(X5,X6,unp) )
& ( ~ model(X7,X5)
| status(X5,X6,unp) )
& ( model(esk1_2(X5,X6),X6)
| status(X5,X6,unp) ) ),
inference(distribute,[status(thm)],[22]) ).
cnf(24,plain,
( status(X1,X2,unp)
| model(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[23]) ).
fof(32,plain,
? [X7] :
! [X8] : model(X8,X7),
inference(variable_rename,[status(thm)],[3]) ).
fof(33,plain,
! [X8] : model(X8,esk7_0),
inference(skolemize,[status(esa)],[32]) ).
cnf(34,plain,
model(X1,esk7_0),
inference(split_conjunct,[status(thm)],[33]) ).
fof(35,plain,
? [X7] :
! [X8] : ~ model(X8,X7),
inference(variable_rename,[status(thm)],[13]) ).
fof(36,plain,
! [X8] : ~ model(X8,esk8_0),
inference(skolemize,[status(esa)],[35]) ).
cnf(37,plain,
~ model(X1,esk8_0),
inference(split_conjunct,[status(thm)],[36]) ).
fof(38,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(39,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)],[38]) ).
fof(40,plain,
! [X4,X5] :
( ( ( model(esk9_2(X4,X5),X4)
& ~ model(esk9_2(X4,X5),X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( ( model(esk9_2(X4,X5),X4)
& ~ model(esk9_2(X4,X5),X5) )
| status(X4,X5,thm) ) ),
inference(shift_quantors,[status(thm)],[40]) ).
fof(42,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( model(esk9_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk9_2(X4,X5),X5)
| status(X4,X5,thm) ) ),
inference(distribute,[status(thm)],[41]) ).
cnf(45,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[42]) ).
fof(46,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)],[14]) ).
fof(47,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)],[46]) ).
fof(48,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| status(X11,X12,X10) )
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk10_2(X9,X10),esk11_2(X9,X10),X9)
& ~ status(esk10_2(X9,X10),esk11_2(X9,X10),X10) ) ) ),
inference(skolemize,[status(esa)],[47]) ).
fof(49,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( ~ nota(X9,X10)
| ( status(esk10_2(X9,X10),esk11_2(X9,X10),X9)
& ~ status(esk10_2(X9,X10),esk11_2(X9,X10),X10) ) ) ),
inference(shift_quantors,[status(thm)],[48]) ).
fof(50,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| status(X11,X12,X10)
| nota(X9,X10) )
& ( status(esk10_2(X9,X10),esk11_2(X9,X10),X9)
| ~ nota(X9,X10) )
& ( ~ status(esk10_2(X9,X10),esk11_2(X9,X10),X10)
| ~ nota(X9,X10) ) ),
inference(distribute,[status(thm)],[49]) ).
cnf(53,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[50]) ).
cnf(72,negated_conjecture,
~ nota(unp,thm),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(82,plain,
status(X1,esk8_0,unp),
inference(spm,[status(thm)],[37,24,theory(equality)]) ).
cnf(105,plain,
( nota(unp,X1)
| status(X2,esk8_0,X1) ),
inference(spm,[status(thm)],[53,82,theory(equality)]) ).
cnf(111,plain,
( model(X1,esk8_0)
| nota(unp,thm)
| ~ model(X1,X2) ),
inference(spm,[status(thm)],[45,105,theory(equality)]) ).
cnf(113,plain,
( nota(unp,thm)
| ~ model(X1,X2) ),
inference(sr,[status(thm)],[111,37,theory(equality)]) ).
cnf(114,plain,
~ model(X1,X2),
inference(sr,[status(thm)],[113,72,theory(equality)]) ).
cnf(121,plain,
$false,
inference(sr,[status(thm)],[34,114,theory(equality)]) ).
cnf(122,plain,
$false,
121,
[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/KRS200+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmpajJudw/sel_KRS200+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/tmpajJudw/sel_KRS200+1.p_1']
% -prover status Theorem
% Problem KRS200+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS200+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS200+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
%
%------------------------------------------------------------------------------