TSTP Solution File: KRS179+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS179+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : nashville.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:47:20 EDT 2012
% Result : Theorem 0.08s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 79 ( 29 ~; 28 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 30 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ! [X3,X4] :
( status(X3,X4,X1)
=> status(X3,X4,X2) )
<=> isa(X1,X2) ),
file('/tmp/tmpZEV_qb/sel_KRS179+1.p_1',isa) ).
fof(2,conjecture,
! [X1,X2,X5] :
( ( isa(X1,X2)
& isa(X2,X5) )
=> isa(X1,X5) ),
file('/tmp/tmpZEV_qb/sel_KRS179+1.p_1',isa_transitive) ).
fof(3,negated_conjecture,
~ ! [X1,X2,X5] :
( ( isa(X1,X2)
& isa(X2,X5) )
=> isa(X1,X5) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(4,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(5,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)],[4]) ).
fof(6,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)],[5]) ).
fof(7,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)],[6]) ).
fof(8,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)],[7]) ).
cnf(9,plain,
( isa(X1,X2)
| ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(10,plain,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(11,plain,
( status(X3,X4,X2)
| ~ isa(X1,X2)
| ~ status(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
fof(12,negated_conjecture,
? [X1,X2,X5] :
( isa(X1,X2)
& isa(X2,X5)
& ~ isa(X1,X5) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(13,negated_conjecture,
? [X6,X7,X8] :
( isa(X6,X7)
& isa(X7,X8)
& ~ isa(X6,X8) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( isa(esk3_0,esk4_0)
& isa(esk4_0,esk5_0)
& ~ isa(esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[13]) ).
cnf(15,negated_conjecture,
~ isa(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(16,negated_conjecture,
isa(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(17,negated_conjecture,
isa(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[14]) ).
cnf(18,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| isa(X1,X2)
| ~ isa(X1,X3) ),
inference(spm,[status(thm)],[11,10,theory(equality)]) ).
cnf(20,plain,
( status(esk1_2(X1,X2),esk2_2(X1,X2),X3)
| isa(X1,X2)
| ~ isa(X4,X3)
| ~ isa(X1,X4) ),
inference(spm,[status(thm)],[11,18,theory(equality)]) ).
cnf(23,negated_conjecture,
( isa(X1,X2)
| status(esk1_2(X1,X2),esk2_2(X1,X2),esk5_0)
| ~ isa(X1,esk4_0) ),
inference(spm,[status(thm)],[20,16,theory(equality)]) ).
cnf(30,negated_conjecture,
( isa(X1,esk5_0)
| ~ isa(X1,esk4_0) ),
inference(spm,[status(thm)],[9,23,theory(equality)]) ).
cnf(31,negated_conjecture,
~ isa(esk3_0,esk4_0),
inference(spm,[status(thm)],[15,30,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
inference(rw,[status(thm)],[31,17,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,negated_conjecture,
$false,
34,
[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/KRS179+1.p
% --creating new selector for [KRS001+1.ax]
% -running prover on /tmp/tmpZEV_qb/sel_KRS179+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/tmpZEV_qb/sel_KRS179+1.p_1']
% -prover status Theorem
% Problem KRS179+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS179+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS179+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
%
%------------------------------------------------------------------------------