TSTP Solution File: KRS233+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS233+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:54:16 EDT 2012
% Result : Theorem 0.31s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 8 unt; 0 def)
% Number of atoms : 157 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 183 ( 71 ~; 70 |; 33 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 107 ( 0 sgn 71 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X2,X3] :
( ? [X1] :
( model(X1,X2)
& model(X1,not(X3)) )
<=> status(X2,X3,csa) ),
file('/tmp/tmpBj54vl/sel_KRS233+1.p_1',csa) ).
fof(4,axiom,
! [X7,X8] :
( ! [X2,X3] :
( status(X2,X3,X7)
=> ~ status(X2,X3,X8) )
<=> nevera(X7,X8) ),
file('/tmp/tmpBj54vl/sel_KRS233+1.p_1',nevera) ).
fof(6,axiom,
! [X2,X3] :
( ! [X1] :
( model(X1,X2)
=> model(X1,X3) )
<=> status(X2,X3,thm) ),
file('/tmp/tmpBj54vl/sel_KRS233+1.p_1',thm) ).
fof(8,axiom,
! [X6,X5] :
( model(X6,X5)
<=> ~ model(X6,not(X5)) ),
file('/tmp/tmpBj54vl/sel_KRS233+1.p_1',not) ).
fof(12,conjecture,
nevera(csa,thm),
file('/tmp/tmpBj54vl/sel_KRS233+1.p_1',nevera_csa_thm) ).
fof(13,negated_conjecture,
~ nevera(csa,thm),
inference(assume_negation,[status(cth)],[12]) ).
fof(15,plain,
! [X7,X8] :
( ! [X2,X3] :
( status(X2,X3,X7)
=> ~ status(X2,X3,X8) )
<=> nevera(X7,X8) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(18,plain,
! [X6,X5] :
( model(X6,X5)
<=> ~ model(X6,not(X5)) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(22,negated_conjecture,
~ nevera(csa,thm),
inference(fof_simplification,[status(thm)],[13,theory(equality)]) ).
fof(31,plain,
! [X2,X3] :
( ( ! [X1] :
( ~ model(X1,X2)
| ~ model(X1,not(X3)) )
| status(X2,X3,csa) )
& ( ~ status(X2,X3,csa)
| ? [X1] :
( model(X1,X2)
& model(X1,not(X3)) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(32,plain,
! [X4,X5] :
( ( ! [X6] :
( ~ model(X6,X4)
| ~ model(X6,not(X5)) )
| status(X4,X5,csa) )
& ( ~ status(X4,X5,csa)
| ? [X7] :
( model(X7,X4)
& model(X7,not(X5)) ) ) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,plain,
! [X4,X5] :
( ( ! [X6] :
( ~ model(X6,X4)
| ~ model(X6,not(X5)) )
| status(X4,X5,csa) )
& ( ~ status(X4,X5,csa)
| ( model(esk6_2(X4,X5),X4)
& model(esk6_2(X4,X5),not(X5)) ) ) ),
inference(skolemize,[status(esa)],[32]) ).
fof(34,plain,
! [X4,X5,X6] :
( ( ~ model(X6,X4)
| ~ model(X6,not(X5))
| status(X4,X5,csa) )
& ( ~ status(X4,X5,csa)
| ( model(esk6_2(X4,X5),X4)
& model(esk6_2(X4,X5),not(X5)) ) ) ),
inference(shift_quantors,[status(thm)],[33]) ).
fof(35,plain,
! [X4,X5,X6] :
( ( ~ model(X6,X4)
| ~ model(X6,not(X5))
| status(X4,X5,csa) )
& ( model(esk6_2(X4,X5),X4)
| ~ status(X4,X5,csa) )
& ( model(esk6_2(X4,X5),not(X5))
| ~ status(X4,X5,csa) ) ),
inference(distribute,[status(thm)],[34]) ).
cnf(36,plain,
( model(esk6_2(X1,X2),not(X2))
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[35]) ).
cnf(37,plain,
( model(esk6_2(X1,X2),X1)
| ~ status(X1,X2,csa) ),
inference(split_conjunct,[status(thm)],[35]) ).
fof(39,plain,
! [X7,X8] :
( ( ? [X2,X3] :
( status(X2,X3,X7)
& status(X2,X3,X8) )
| nevera(X7,X8) )
& ( ~ nevera(X7,X8)
| ! [X2,X3] :
( ~ status(X2,X3,X7)
| ~ status(X2,X3,X8) ) ) ),
inference(fof_nnf,[status(thm)],[15]) ).
fof(40,plain,
! [X9,X10] :
( ( ? [X11,X12] :
( status(X11,X12,X9)
& status(X11,X12,X10) )
| nevera(X9,X10) )
& ( ~ nevera(X9,X10)
| ! [X13,X14] :
( ~ status(X13,X14,X9)
| ~ status(X13,X14,X10) ) ) ),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,plain,
! [X9,X10] :
( ( ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
& status(esk7_2(X9,X10),esk8_2(X9,X10),X10) )
| nevera(X9,X10) )
& ( ~ nevera(X9,X10)
| ! [X13,X14] :
( ~ status(X13,X14,X9)
| ~ status(X13,X14,X10) ) ) ),
inference(skolemize,[status(esa)],[40]) ).
fof(42,plain,
! [X9,X10,X13,X14] :
( ( ~ status(X13,X14,X9)
| ~ status(X13,X14,X10)
| ~ nevera(X9,X10) )
& ( ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
& status(esk7_2(X9,X10),esk8_2(X9,X10),X10) )
| nevera(X9,X10) ) ),
inference(shift_quantors,[status(thm)],[41]) ).
fof(43,plain,
! [X9,X10,X13,X14] :
( ( ~ status(X13,X14,X9)
| ~ status(X13,X14,X10)
| ~ nevera(X9,X10) )
& ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
| nevera(X9,X10) )
& ( status(esk7_2(X9,X10),esk8_2(X9,X10),X10)
| nevera(X9,X10) ) ),
inference(distribute,[status(thm)],[42]) ).
cnf(44,plain,
( nevera(X1,X2)
| status(esk7_2(X1,X2),esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(45,plain,
( nevera(X1,X2)
| status(esk7_2(X1,X2),esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
cnf(46,plain,
( ~ nevera(X1,X2)
| ~ status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[43]) ).
fof(50,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)],[6]) ).
fof(51,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)],[50]) ).
fof(52,plain,
! [X4,X5] :
( ( ( model(esk10_2(X4,X5),X4)
& ~ model(esk10_2(X4,X5),X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(skolemize,[status(esa)],[51]) ).
fof(53,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( ( model(esk10_2(X4,X5),X4)
& ~ model(esk10_2(X4,X5),X5) )
| status(X4,X5,thm) ) ),
inference(shift_quantors,[status(thm)],[52]) ).
fof(54,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( model(esk10_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk10_2(X4,X5),X5)
| status(X4,X5,thm) ) ),
inference(distribute,[status(thm)],[53]) ).
cnf(57,plain,
( model(X3,X2)
| ~ status(X1,X2,thm)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[54]) ).
fof(63,plain,
! [X6,X5] :
( ( ~ model(X6,X5)
| ~ model(X6,not(X5)) )
& ( model(X6,not(X5))
| model(X6,X5) ) ),
inference(fof_nnf,[status(thm)],[18]) ).
fof(64,plain,
! [X7,X8] :
( ( ~ model(X7,X8)
| ~ model(X7,not(X8)) )
& ( model(X7,not(X8))
| model(X7,X8) ) ),
inference(variable_rename,[status(thm)],[63]) ).
cnf(66,plain,
( ~ model(X1,not(X2))
| ~ model(X1,X2) ),
inference(split_conjunct,[status(thm)],[64]) ).
cnf(84,negated_conjecture,
~ nevera(csa,thm),
inference(split_conjunct,[status(thm)],[22]) ).
cnf(94,plain,
( model(esk6_2(esk7_2(X1,csa),esk8_2(X1,csa)),esk7_2(X1,csa))
| nevera(X1,csa) ),
inference(spm,[status(thm)],[37,44,theory(equality)]) ).
cnf(96,plain,
( model(esk6_2(esk7_2(X1,csa),esk8_2(X1,csa)),not(esk8_2(X1,csa)))
| nevera(X1,csa) ),
inference(spm,[status(thm)],[36,44,theory(equality)]) ).
cnf(97,plain,
( nevera(X2,X3)
| ~ nevera(X1,X2)
| ~ status(esk7_2(X2,X3),esk8_2(X2,X3),X1) ),
inference(spm,[status(thm)],[46,45,theory(equality)]) ).
cnf(99,plain,
( model(X1,esk8_2(thm,X2))
| nevera(thm,X2)
| ~ model(X1,esk7_2(thm,X2)) ),
inference(spm,[status(thm)],[57,45,theory(equality)]) ).
cnf(125,plain,
( nevera(X1,X2)
| ~ nevera(X2,X1) ),
inference(spm,[status(thm)],[97,44,theory(equality)]) ).
cnf(307,plain,
( nevera(thm,csa)
| model(esk6_2(esk7_2(thm,csa),esk8_2(thm,csa)),esk8_2(thm,csa)) ),
inference(spm,[status(thm)],[99,94,theory(equality)]) ).
cnf(639,plain,
( nevera(X1,csa)
| ~ model(esk6_2(esk7_2(X1,csa),esk8_2(X1,csa)),esk8_2(X1,csa)) ),
inference(spm,[status(thm)],[66,96,theory(equality)]) ).
cnf(10116,plain,
nevera(thm,csa),
inference(csr,[status(thm)],[307,639]) ).
cnf(10117,plain,
nevera(csa,thm),
inference(spm,[status(thm)],[125,10116,theory(equality)]) ).
cnf(10315,plain,
$false,
inference(sr,[status(thm)],[10117,84,theory(equality)]) ).
cnf(10316,plain,
$false,
10315,
[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/KRS233+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmpBj54vl/sel_KRS233+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/tmpBj54vl/sel_KRS233+1.p_1']
% -prover status Theorem
% Problem KRS233+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS233+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS233+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
%
%------------------------------------------------------------------------------