%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS265+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : franklin.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:58:18 EDT 2012
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 125 ( 51 ~; 45 |; 25 &)
% ( 3 <=>; 1 =>; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 85 ( 4 sgn 58 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ~ ? [X3] : model(X3,X1)
<=> status(X1,X2,cax) ),
file('/tmp/tmprgCFL7/sel_KRS265+1.p_1',cax) ).
fof(4,axiom,
! [X7,X8] :
( ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) )
<=> mighta(X7,X8) ),
file('/tmp/tmprgCFL7/sel_KRS265+1.p_1',mighta) ).
fof(5,axiom,
? [X5] :
! [X6] : ~ model(X6,X5),
file('/tmp/tmprgCFL7/sel_KRS265+1.p_1',contradiction) ).
fof(6,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/tmp/tmprgCFL7/sel_KRS265+1.p_1',thm) ).
fof(10,conjecture,
mighta(cax,thm),
file('/tmp/tmprgCFL7/sel_KRS265+1.p_1',mighta_cax_thm) ).
fof(11,negated_conjecture,
~ mighta(cax,thm),
inference(assume_negation,[status(cth)],[10]) ).
fof(13,plain,
? [X5] :
! [X6] : ~ model(X6,X5),
inference(fof_simplification,[status(thm)],[5,theory(equality)]) ).
fof(17,negated_conjecture,
~ mighta(cax,thm),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(18,plain,
! [X1,X2] :
( ( ? [X3] : model(X3,X1)
| status(X1,X2,cax) )
& ( ~ status(X1,X2,cax)
| ! [X3] : ~ model(X3,X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(19,plain,
! [X4,X5] :
( ( ? [X6] : model(X6,X4)
| status(X4,X5,cax) )
& ( ~ status(X4,X5,cax)
| ! [X7] : ~ model(X7,X4) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5] :
( ( model(esk1_2(X4,X5),X4)
| status(X4,X5,cax) )
& ( ~ status(X4,X5,cax)
| ! [X7] : ~ model(X7,X4) ) ),
inference(skolemize,[status(esa)],[19]) ).
fof(21,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| ~ status(X4,X5,cax) )
& ( model(esk1_2(X4,X5),X4)
| status(X4,X5,cax) ) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(22,plain,
( status(X1,X2,cax)
| model(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(32,plain,
! [X7,X8] :
( ( ! [X1,X2] :
( ~ status(X1,X2,X7)
| ~ status(X1,X2,X8) )
| mighta(X7,X8) )
& ( ~ mighta(X7,X8)
| ? [X1,X2] :
( status(X1,X2,X7)
& status(X1,X2,X8) ) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(33,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| ~ status(X11,X12,X10) )
| mighta(X9,X10) )
& ( ~ mighta(X9,X10)
| ? [X13,X14] :
( status(X13,X14,X9)
& status(X13,X14,X10) ) ) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,plain,
! [X9,X10] :
( ( ! [X11,X12] :
( ~ status(X11,X12,X9)
| ~ status(X11,X12,X10) )
| mighta(X9,X10) )
& ( ~ mighta(X9,X10)
| ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
& status(esk7_2(X9,X10),esk8_2(X9,X10),X10) ) ) ),
inference(skolemize,[status(esa)],[33]) ).
fof(35,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| ~ status(X11,X12,X10)
| mighta(X9,X10) )
& ( ~ mighta(X9,X10)
| ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
& status(esk7_2(X9,X10),esk8_2(X9,X10),X10) ) ) ),
inference(shift_quantors,[status(thm)],[34]) ).
fof(36,plain,
! [X9,X10,X11,X12] :
( ( ~ status(X11,X12,X9)
| ~ status(X11,X12,X10)
| mighta(X9,X10) )
& ( status(esk7_2(X9,X10),esk8_2(X9,X10),X9)
| ~ mighta(X9,X10) )
& ( status(esk7_2(X9,X10),esk8_2(X9,X10),X10)
| ~ mighta(X9,X10) ) ),
inference(distribute,[status(thm)],[35]) ).
cnf(39,plain,
( mighta(X1,X2)
| ~ status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[36]) ).
fof(40,plain,
? [X7] :
! [X8] : ~ model(X8,X7),
inference(variable_rename,[status(thm)],[13]) ).
fof(41,plain,
! [X8] : ~ model(X8,esk9_0),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,plain,
~ model(X1,esk9_0),
inference(split_conjunct,[status(thm)],[41]) ).
fof(43,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)],[6]) ).
fof(44,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)],[43]) ).
fof(45,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)],[44]) ).
fof(46,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)],[45]) ).
fof(47,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)],[46]) ).
cnf(49,plain,
( status(X1,X2,thm)
| model(esk10_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[47]) ).
cnf(69,negated_conjecture,
~ mighta(cax,thm),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(70,plain,
status(esk9_0,X1,cax),
inference(spm,[status(thm)],[42,22,theory(equality)]) ).
cnf(71,plain,
status(esk9_0,X1,thm),
inference(spm,[status(thm)],[42,49,theory(equality)]) ).
cnf(84,plain,
( mighta(X1,thm)
| ~ status(esk9_0,X2,X1) ),
inference(spm,[status(thm)],[39,71,theory(equality)]) ).
cnf(97,plain,
mighta(cax,thm),
inference(spm,[status(thm)],[84,70,theory(equality)]) ).
cnf(101,plain,
$false,
inference(sr,[status(thm)],[97,69,theory(equality)]) ).
cnf(102,plain,
$false,
101,
[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/KRS265+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmprgCFL7/sel_KRS265+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/tmprgCFL7/sel_KRS265+1.p_1']
% -prover status Theorem
% Problem KRS265+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS265+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS265+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
%
%------------------------------------------------------------------------------