%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS181+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:47:30 EDT 2012
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 38 ( 7 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 140 ( 51 ~; 53 |; 30 &)
% ( 3 <=>; 3 =>; 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 : 107 ( 0 sgn 54 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/tmp/tmp8HMDvS/sel_KRS181+1.p_1',isa) ).
fof(2,axiom,
! [X1,X2] :
( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
<=> nota(X1,X2) ),
file('/tmp/tmp8HMDvS/sel_KRS181+1.p_1',nota) ).
fof(3,conjecture,
! [X1,X2,X5] :
( ( isa(X1,X2)
& nota(X1,X5) )
=> nota(X2,X5) ),
file('/tmp/tmp8HMDvS/sel_KRS181+1.p_1',nota_isa_nota) ).
fof(4,negated_conjecture,
~ ! [X1,X2,X5] :
( ( isa(X1,X2)
& nota(X1,X5) )
=> nota(X2,X5) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(5,plain,
! [X1,X2] :
( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
<=> nota(X1,X2) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(6,plain,
! [X1,X2] :
( ( ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) )
| isa(X1,X2) )
& ( ~ isa(X1,X2)
| ! [X3,X4] :
( ~ status(X3,X4,X1)
| status(X3,X4,X2) ) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(7,plain,
! [X5,X6] :
( ( ? [X7,X8] :
( status(X7,X8,X5)
& ~ status(X7,X8,X6) )
| isa(X5,X6) )
& ( ~ isa(X5,X6)
| ! [X9,X10] :
( ~ status(X9,X10,X5)
| status(X9,X10,X6) ) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,plain,
! [X5,X6] :
( ( ( status(esk1_2(X5,X6),esk2_2(X5,X6),X5)
& ~ status(esk1_2(X5,X6),esk2_2(X5,X6),X6) )
| isa(X5,X6) )
& ( ~ isa(X5,X6)
| ! [X9,X10] :
( ~ status(X9,X10,X5)
| status(X9,X10,X6) ) ) ),
inference(skolemize,[status(esa)],[7]) ).
fof(9,plain,
! [X5,X6,X9,X10] :
( ( ~ status(X9,X10,X5)
| status(X9,X10,X6)
| ~ isa(X5,X6) )
& ( ( status(esk1_2(X5,X6),esk2_2(X5,X6),X5)
& ~ status(esk1_2(X5,X6),esk2_2(X5,X6),X6) )
| isa(X5,X6) ) ),
inference(shift_quantors,[status(thm)],[8]) ).
fof(10,plain,
! [X5,X6,X9,X10] :
( ( ~ status(X9,X10,X5)
| status(X9,X10,X6)
| ~ isa(X5,X6) )
& ( status(esk1_2(X5,X6),esk2_2(X5,X6),X5)
| isa(X5,X6) )
& ( ~ status(esk1_2(X5,X6),esk2_2(X5,X6),X6)
| isa(X5,X6) ) ),
inference(distribute,[status(thm)],[9]) ).
cnf(11,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(13,plain,
( status(X3,X4,X2)
| ~ isa(X1,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(14,plain,
! [X1,X2] :
( ( ! [X3,X4] :
( ~ status(X3,X4,X1)
| status(X3,X4,X2) )
| nota(X1,X2) )
& ( ~ nota(X1,X2)
| ? [X3,X4] :
( status(X3,X4,X1)
& ~ status(X3,X4,X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(15,plain,
! [X5,X6] :
( ( ! [X7,X8] :
( ~ status(X7,X8,X5)
| status(X7,X8,X6) )
| nota(X5,X6) )
& ( ~ nota(X5,X6)
| ? [X9,X10] :
( status(X9,X10,X5)
& ~ status(X9,X10,X6) ) ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(16,plain,
! [X5,X6] :
( ( ! [X7,X8] :
( ~ status(X7,X8,X5)
| status(X7,X8,X6) )
| nota(X5,X6) )
& ( ~ nota(X5,X6)
| ( status(esk3_2(X5,X6),esk4_2(X5,X6),X5)
& ~ status(esk3_2(X5,X6),esk4_2(X5,X6),X6) ) ) ),
inference(skolemize,[status(esa)],[15]) ).
fof(17,plain,
! [X5,X6,X7,X8] :
( ( ~ status(X7,X8,X5)
| status(X7,X8,X6)
| nota(X5,X6) )
& ( ~ nota(X5,X6)
| ( status(esk3_2(X5,X6),esk4_2(X5,X6),X5)
& ~ status(esk3_2(X5,X6),esk4_2(X5,X6),X6) ) ) ),
inference(shift_quantors,[status(thm)],[16]) ).
fof(18,plain,
! [X5,X6,X7,X8] :
( ( ~ status(X7,X8,X5)
| status(X7,X8,X6)
| nota(X5,X6) )
& ( status(esk3_2(X5,X6),esk4_2(X5,X6),X5)
| ~ nota(X5,X6) )
& ( ~ status(esk3_2(X5,X6),esk4_2(X5,X6),X6)
| ~ nota(X5,X6) ) ),
inference(distribute,[status(thm)],[17]) ).
cnf(19,plain,
( ~ nota(X1,X2)
| ~ status(esk3_2(X1,X2),esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(20,plain,
( status(esk3_2(X1,X2),esk4_2(X1,X2),X1)
| ~ nota(X1,X2) ),
inference(split_conjunct,[status(thm)],[18]) ).
cnf(21,plain,
( nota(X1,X2)
| status(X3,X4,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[18]) ).
fof(22,negated_conjecture,
? [X1,X2,X5] :
( isa(X1,X2)
& nota(X1,X5)
& ~ nota(X2,X5) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(23,negated_conjecture,
? [X6,X7,X8] :
( isa(X6,X7)
& nota(X6,X8)
& ~ nota(X7,X8) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( isa(esk5_0,esk6_0)
& nota(esk5_0,esk7_0)
& ~ nota(esk6_0,esk7_0) ),
inference(skolemize,[status(esa)],[23]) ).
cnf(25,negated_conjecture,
~ nota(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,negated_conjecture,
nota(esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
isa(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(28,plain,
( nota(X1,X2)
| status(esk1_2(X1,X3),esk2_2(X1,X3),X2)
| isa(X1,X3) ),
inference(spm,[status(thm)],[21,12,theory(equality)]) ).
cnf(31,plain,
( status(esk3_2(X1,X2),esk4_2(X1,X2),X3)
| ~ isa(X1,X3)
| ~ nota(X1,X2) ),
inference(spm,[status(thm)],[13,20,theory(equality)]) ).
cnf(34,plain,
( nota(X1,X2)
| status(esk1_2(X3,X4),esk2_2(X3,X4),X2)
| nota(X3,X1)
| isa(X3,X4) ),
inference(spm,[status(thm)],[21,28,theory(equality)]) ).
cnf(40,plain,
( isa(X1,X2)
| nota(X1,X3)
| nota(X3,X2) ),
inference(spm,[status(thm)],[11,34,theory(equality)]) ).
cnf(51,plain,
( ~ nota(X1,X2)
| ~ isa(X1,X2) ),
inference(spm,[status(thm)],[19,31,theory(equality)]) ).
cnf(52,negated_conjecture,
~ nota(esk5_0,esk6_0),
inference(spm,[status(thm)],[51,27,theory(equality)]) ).
cnf(55,plain,
( nota(X3,X2)
| nota(X1,X3)
| ~ nota(X1,X2) ),
inference(spm,[status(thm)],[51,40,theory(equality)]) ).
cnf(56,negated_conjecture,
( nota(esk5_0,X1)
| nota(X1,esk7_0) ),
inference(spm,[status(thm)],[55,26,theory(equality)]) ).
cnf(77,negated_conjecture,
nota(esk6_0,esk7_0),
inference(spm,[status(thm)],[52,56,theory(equality)]) ).
cnf(79,negated_conjecture,
$false,
inference(sr,[status(thm)],[77,25,theory(equality)]) ).
cnf(80,negated_conjecture,
$false,
79,
[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/KRS181+1.p
% --creating new selector for [KRS001+1.ax]
% -running prover on /tmp/tmp8HMDvS/sel_KRS181+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/tmp8HMDvS/sel_KRS181+1.p_1']
% -prover status Theorem
% Problem KRS181+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS181+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS181+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
%
%------------------------------------------------------------------------------