TSTP Solution File: KRS215+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS215+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 07:51:15 EDT 2012
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 18 unt; 0 def)
% Number of atoms : 157 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 176 ( 69 ~; 65 |; 35 &)
% ( 5 <=>; 1 =>; 0 <=; 1 <~>)
% 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 : 115 ( 5 sgn 74 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( model(X1,X2)
<~> model(X1,not(X2)) ),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',completeness) ).
fof(2,axiom,
? [X2] :
! [X1] : model(X1,X2),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',tautology) ).
fof(3,axiom,
! [X3,X4] :
( ? [X5] :
( model(X5,X3)
& model(X5,not(X4)) )
<=> status(X3,X4,csa) ),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',csa) ).
fof(4,axiom,
? [X2] :
! [X1] : ~ model(X1,X2),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',contradiction) ).
fof(5,axiom,
! [X3,X4] :
( ! [X5] :
( model(X5,X3)
=> model(X5,X4) )
<=> status(X3,X4,thm) ),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',thm) ).
fof(6,axiom,
! [X6,X7] :
( ? [X3,X4] :
( status(X3,X4,X6)
& ~ status(X3,X4,X7) )
<=> nota(X6,X7) ),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',nota) ).
fof(12,conjecture,
nota(csa,thm),
file('/tmp/tmpSo8nL0/sel_KRS215+1.p_1',nota_csa_thm) ).
fof(13,negated_conjecture,
~ nota(csa,thm),
inference(assume_negation,[status(cth)],[12]) ).
fof(14,plain,
! [X1,X2] :
~ ( model(X1,X2)
<=> model(X1,not(X2)) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(15,plain,
? [X2] :
! [X1] : ~ model(X1,X2),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(16,plain,
! [X6,X7] :
( ? [X3,X4] :
( status(X3,X4,X6)
& ~ status(X3,X4,X7) )
<=> nota(X6,X7) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(22,negated_conjecture,
~ nota(csa,thm),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(23,plain,
! [X1,X2] :
( ( ~ model(X1,X2)
| ~ model(X1,not(X2)) )
& ( model(X1,X2)
| model(X1,not(X2)) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(24,plain,
! [X3,X4] :
( ( ~ model(X3,X4)
| ~ model(X3,not(X4)) )
& ( model(X3,X4)
| model(X3,not(X4)) ) ),
inference(variable_rename,[status(thm)],[23]) ).
cnf(25,plain,
( model(X1,not(X2))
| model(X1,X2) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(27,plain,
? [X3] :
! [X4] : model(X4,X3),
inference(variable_rename,[status(thm)],[2]) ).
fof(28,plain,
! [X4] : model(X4,esk1_0),
inference(skolemize,[status(esa)],[27]) ).
cnf(29,plain,
model(X1,esk1_0),
inference(split_conjunct,[status(thm)],[28]) ).
fof(30,plain,
! [X3,X4] :
( ( ! [X5] :
( ~ model(X5,X3)
| ~ model(X5,not(X4)) )
| status(X3,X4,csa) )
& ( ~ status(X3,X4,csa)
| ? [X5] :
( model(X5,X3)
& model(X5,not(X4)) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(31,plain,
! [X6,X7] :
( ( ! [X8] :
( ~ model(X8,X6)
| ~ model(X8,not(X7)) )
| status(X6,X7,csa) )
& ( ~ status(X6,X7,csa)
| ? [X9] :
( model(X9,X6)
& model(X9,not(X7)) ) ) ),
inference(variable_rename,[status(thm)],[30]) ).
fof(32,plain,
! [X6,X7] :
( ( ! [X8] :
( ~ model(X8,X6)
| ~ model(X8,not(X7)) )
| status(X6,X7,csa) )
& ( ~ status(X6,X7,csa)
| ( model(esk2_2(X6,X7),X6)
& model(esk2_2(X6,X7),not(X7)) ) ) ),
inference(skolemize,[status(esa)],[31]) ).
fof(33,plain,
! [X6,X7,X8] :
( ( ~ model(X8,X6)
| ~ model(X8,not(X7))
| status(X6,X7,csa) )
& ( ~ status(X6,X7,csa)
| ( model(esk2_2(X6,X7),X6)
& model(esk2_2(X6,X7),not(X7)) ) ) ),
inference(shift_quantors,[status(thm)],[32]) ).
fof(34,plain,
! [X6,X7,X8] :
( ( ~ model(X8,X6)
| ~ model(X8,not(X7))
| status(X6,X7,csa) )
& ( model(esk2_2(X6,X7),X6)
| ~ status(X6,X7,csa) )
& ( model(esk2_2(X6,X7),not(X7))
| ~ status(X6,X7,csa) ) ),
inference(distribute,[status(thm)],[33]) ).
cnf(37,plain,
( status(X1,X2,csa)
| ~ model(X3,not(X2))
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[34]) ).
fof(38,plain,
? [X3] :
! [X4] : ~ model(X4,X3),
inference(variable_rename,[status(thm)],[15]) ).
fof(39,plain,
! [X4] : ~ model(X4,esk3_0),
inference(skolemize,[status(esa)],[38]) ).
cnf(40,plain,
~ model(X1,esk3_0),
inference(split_conjunct,[status(thm)],[39]) ).
fof(41,plain,
! [X3,X4] :
( ( ? [X5] :
( model(X5,X3)
& ~ model(X5,X4) )
| status(X3,X4,thm) )
& ( ~ status(X3,X4,thm)
| ! [X5] :
( ~ model(X5,X3)
| model(X5,X4) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(42,plain,
! [X6,X7] :
( ( ? [X8] :
( model(X8,X6)
& ~ model(X8,X7) )
| status(X6,X7,thm) )
& ( ~ status(X6,X7,thm)
| ! [X9] :
( ~ model(X9,X6)
| model(X9,X7) ) ) ),
inference(variable_rename,[status(thm)],[41]) ).
fof(43,plain,
! [X6,X7] :
( ( ( model(esk4_2(X6,X7),X6)
& ~ model(esk4_2(X6,X7),X7) )
| status(X6,X7,thm) )
& ( ~ status(X6,X7,thm)
| ! [X9] :
( ~ model(X9,X6)
| model(X9,X7) ) ) ),
inference(skolemize,[status(esa)],[42]) ).
fof(44,plain,
! [X6,X7,X9] :
( ( ~ model(X9,X6)
| model(X9,X7)
| ~ status(X6,X7,thm) )
& ( ( model(esk4_2(X6,X7),X6)
& ~ model(esk4_2(X6,X7),X7) )
| status(X6,X7,thm) ) ),
inference(shift_quantors,[status(thm)],[43]) ).
fof(45,plain,
! [X6,X7,X9] :
( ( ~ model(X9,X6)
| model(X9,X7)
| ~ status(X6,X7,thm) )
& ( model(esk4_2(X6,X7),X6)
| status(X6,X7,thm) )
& ( ~ model(esk4_2(X6,X7),X7)
| status(X6,X7,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,
! [X6,X7] :
( ( ! [X3,X4] :
( ~ status(X3,X4,X6)
| status(X3,X4,X7) )
| nota(X6,X7) )
& ( ~ nota(X6,X7)
| ? [X3,X4] :
( status(X3,X4,X6)
& ~ status(X3,X4,X7) ) ) ),
inference(fof_nnf,[status(thm)],[16]) ).
fof(50,plain,
! [X8,X9] :
( ( ! [X10,X11] :
( ~ status(X10,X11,X8)
| status(X10,X11,X9) )
| nota(X8,X9) )
& ( ~ nota(X8,X9)
| ? [X12,X13] :
( status(X12,X13,X8)
& ~ status(X12,X13,X9) ) ) ),
inference(variable_rename,[status(thm)],[49]) ).
fof(51,plain,
! [X8,X9] :
( ( ! [X10,X11] :
( ~ status(X10,X11,X8)
| status(X10,X11,X9) )
| nota(X8,X9) )
& ( ~ nota(X8,X9)
| ( status(esk5_2(X8,X9),esk6_2(X8,X9),X8)
& ~ status(esk5_2(X8,X9),esk6_2(X8,X9),X9) ) ) ),
inference(skolemize,[status(esa)],[50]) ).
fof(52,plain,
! [X8,X9,X10,X11] :
( ( ~ status(X10,X11,X8)
| status(X10,X11,X9)
| nota(X8,X9) )
& ( ~ nota(X8,X9)
| ( status(esk5_2(X8,X9),esk6_2(X8,X9),X8)
& ~ status(esk5_2(X8,X9),esk6_2(X8,X9),X9) ) ) ),
inference(shift_quantors,[status(thm)],[51]) ).
fof(53,plain,
! [X8,X9,X10,X11] :
( ( ~ status(X10,X11,X8)
| status(X10,X11,X9)
| nota(X8,X9) )
& ( status(esk5_2(X8,X9),esk6_2(X8,X9),X8)
| ~ nota(X8,X9) )
& ( ~ status(esk5_2(X8,X9),esk6_2(X8,X9),X9)
| ~ nota(X8,X9) ) ),
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(csa,thm),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(93,plain,
( status(X1,X2,csa)
| model(X3,X2)
| ~ model(X3,X1) ),
inference(spm,[status(thm)],[37,25,theory(equality)]) ).
cnf(105,plain,
( status(esk1_0,X1,csa)
| model(X2,X1) ),
inference(spm,[status(thm)],[93,29,theory(equality)]) ).
cnf(180,plain,
status(esk1_0,esk3_0,csa),
inference(spm,[status(thm)],[40,105,theory(equality)]) ).
cnf(214,plain,
( nota(csa,X1)
| status(esk1_0,esk3_0,X1) ),
inference(spm,[status(thm)],[56,180,theory(equality)]) ).
cnf(216,negated_conjecture,
status(esk1_0,esk3_0,thm),
inference(spm,[status(thm)],[84,214,theory(equality)]) ).
cnf(218,negated_conjecture,
( model(X1,esk3_0)
| ~ model(X1,esk1_0) ),
inference(spm,[status(thm)],[48,216,theory(equality)]) ).
cnf(220,negated_conjecture,
( model(X1,esk3_0)
| $false ),
inference(rw,[status(thm)],[218,29,theory(equality)]) ).
cnf(221,negated_conjecture,
model(X1,esk3_0),
inference(cn,[status(thm)],[220,theory(equality)]) ).
cnf(222,negated_conjecture,
$false,
inference(sr,[status(thm)],[221,40,theory(equality)]) ).
cnf(223,negated_conjecture,
$false,
222,
[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/KRS215+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmpSo8nL0/sel_KRS215+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/tmpSo8nL0/sel_KRS215+1.p_1']
% -prover status Theorem
% Problem KRS215+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS215+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS215+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
%
%------------------------------------------------------------------------------