TSTP Solution File: MGT014+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT014+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 21:04:01 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of formulae : 78 ( 21 unt; 0 def)
% Number of atoms : 296 ( 25 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 365 ( 147 ~; 136 |; 71 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 165 ( 1 sgn 103 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& X4 = X5 )
=> X2 = X3 ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',mp19) ).
fof(3,axiom,
! [X1,X6] :
~ ( greater(X1,X6)
& X1 = X6 ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',mp6_1) ).
fof(4,axiom,
! [X1,X7] :
( organization(X1,X7)
=> time(X7) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',mp15) ).
fof(5,axiom,
! [X4,X5] :
( ( time(X4)
& time(X5) )
=> ( greater(X4,X5)
| X4 = X5
| greater(X5,X4) ) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',mp16) ).
fof(6,axiom,
! [X1,X4,X5] :
( reorganization_free(X1,X4,X5)
=> reorganization_free(X1,X5,X4) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',mp17) ).
fof(7,conjecture,
! [X1,X8,X9,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2) )
=> ~ greater(X8,X9) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',t14_FOL) ).
fof(8,axiom,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',t12_FOL) ).
fof(9,axiom,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X5,X4) )
=> ~ greater(X2,X3) ),
file('/tmp/tmp__8DgF/sel_MGT014+1.p_1',t11_FOL) ).
fof(10,negated_conjecture,
~ ! [X1,X8,X9,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[7]) ).
fof(11,negated_conjecture,
~ ! [X1,X8,X9,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[10,theory(equality)]) ).
fof(12,plain,
! [X1,X8,X9,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& greater(X5,X4) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[8,theory(equality)]) ).
fof(13,plain,
! [X1,X2,X3,X4,X5] :
( ( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X5,X4) )
=> ~ greater(X2,X3) ),
inference(fof_simplification,[status(thm)],[9,theory(equality)]) ).
fof(14,plain,
! [X1,X2,X3,X4,X5] :
( ~ organization(X1,X4)
| ~ organization(X1,X5)
| ~ size(X1,X2,X4)
| ~ size(X1,X3,X5)
| X4 != X5
| X2 = X3 ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(15,plain,
! [X6,X7,X8,X9,X10] :
( ~ organization(X6,X9)
| ~ organization(X6,X10)
| ~ size(X6,X7,X9)
| ~ size(X6,X8,X10)
| X9 != X10
| X7 = X8 ),
inference(variable_rename,[status(thm)],[14]) ).
cnf(16,plain,
( X1 = X2
| X3 != X4
| ~ size(X5,X2,X4)
| ~ size(X5,X1,X3)
| ~ organization(X5,X4)
| ~ organization(X5,X3) ),
inference(split_conjunct,[status(thm)],[15]) ).
fof(20,plain,
! [X1,X6] :
( ~ greater(X1,X6)
| X1 != X6 ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(21,plain,
! [X7,X8] :
( ~ greater(X7,X8)
| X7 != X8 ),
inference(variable_rename,[status(thm)],[20]) ).
cnf(22,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(23,plain,
! [X1,X7] :
( ~ organization(X1,X7)
| time(X7) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(24,plain,
! [X8,X9] :
( ~ organization(X8,X9)
| time(X9) ),
inference(variable_rename,[status(thm)],[23]) ).
cnf(25,plain,
( time(X1)
| ~ organization(X2,X1) ),
inference(split_conjunct,[status(thm)],[24]) ).
fof(26,plain,
! [X4,X5] :
( ~ time(X4)
| ~ time(X5)
| greater(X4,X5)
| X4 = X5
| greater(X5,X4) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(27,plain,
! [X6,X7] :
( ~ time(X6)
| ~ time(X7)
| greater(X6,X7)
| X6 = X7
| greater(X7,X6) ),
inference(variable_rename,[status(thm)],[26]) ).
cnf(28,plain,
( greater(X1,X2)
| X2 = X1
| greater(X2,X1)
| ~ time(X1)
| ~ time(X2) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
! [X1,X4,X5] :
( ~ reorganization_free(X1,X4,X5)
| reorganization_free(X1,X5,X4) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(30,plain,
! [X6,X7,X8] :
( ~ reorganization_free(X6,X7,X8)
| reorganization_free(X6,X8,X7) ),
inference(variable_rename,[status(thm)],[29]) ).
cnf(31,plain,
( reorganization_free(X1,X2,X3)
| ~ reorganization_free(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[30]) ).
fof(32,negated_conjecture,
? [X1,X8,X9,X2,X3,X4,X5] :
( organization(X1,X4)
& organization(X1,X5)
& reorganization_free(X1,X4,X5)
& complexity(X1,X8,X4)
& complexity(X1,X9,X5)
& size(X1,X2,X4)
& size(X1,X3,X5)
& greater(X3,X2)
& greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(33,negated_conjecture,
? [X10,X11,X12,X13,X14,X15,X16] :
( organization(X10,X15)
& organization(X10,X16)
& reorganization_free(X10,X15,X16)
& complexity(X10,X11,X15)
& complexity(X10,X12,X16)
& size(X10,X13,X15)
& size(X10,X14,X16)
& greater(X14,X13)
& greater(X11,X12) ),
inference(variable_rename,[status(thm)],[32]) ).
fof(34,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& complexity(esk1_0,esk2_0,esk6_0)
& complexity(esk1_0,esk3_0,esk7_0)
& size(esk1_0,esk4_0,esk6_0)
& size(esk1_0,esk5_0,esk7_0)
& greater(esk5_0,esk4_0)
& greater(esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[33]) ).
cnf(35,negated_conjecture,
greater(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(36,negated_conjecture,
greater(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(37,negated_conjecture,
size(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(38,negated_conjecture,
size(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(39,negated_conjecture,
complexity(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(40,negated_conjecture,
complexity(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(41,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(42,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[34]) ).
cnf(43,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[34]) ).
fof(44,plain,
! [X1,X8,X9,X4,X5] :
( ~ organization(X1,X4)
| ~ organization(X1,X5)
| ~ reorganization_free(X1,X4,X5)
| ~ complexity(X1,X8,X4)
| ~ complexity(X1,X9,X5)
| ~ greater(X5,X4)
| ~ greater(X8,X9) ),
inference(fof_nnf,[status(thm)],[12]) ).
fof(45,plain,
! [X10,X11,X12,X13,X14] :
( ~ organization(X10,X13)
| ~ organization(X10,X14)
| ~ reorganization_free(X10,X13,X14)
| ~ complexity(X10,X11,X13)
| ~ complexity(X10,X12,X14)
| ~ greater(X14,X13)
| ~ greater(X11,X12) ),
inference(variable_rename,[status(thm)],[44]) ).
cnf(46,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ complexity(X5,X2,X3)
| ~ complexity(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[45]) ).
fof(47,plain,
! [X1,X2,X3,X4,X5] :
( ~ organization(X1,X4)
| ~ organization(X1,X5)
| ~ reorganization_free(X1,X4,X5)
| ~ size(X1,X2,X4)
| ~ size(X1,X3,X5)
| ~ greater(X5,X4)
| ~ greater(X2,X3) ),
inference(fof_nnf,[status(thm)],[13]) ).
fof(48,plain,
! [X6,X7,X8,X9,X10] :
( ~ organization(X6,X9)
| ~ organization(X6,X10)
| ~ reorganization_free(X6,X9,X10)
| ~ size(X6,X7,X9)
| ~ size(X6,X8,X10)
| ~ greater(X10,X9)
| ~ greater(X7,X8) ),
inference(variable_rename,[status(thm)],[47]) ).
cnf(49,plain,
( ~ greater(X1,X2)
| ~ greater(X3,X4)
| ~ size(X5,X2,X3)
| ~ size(X5,X1,X4)
| ~ reorganization_free(X5,X4,X3)
| ~ organization(X5,X3)
| ~ organization(X5,X4) ),
inference(split_conjunct,[status(thm)],[48]) ).
cnf(50,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[22,theory(equality)]) ).
cnf(53,negated_conjecture,
time(esk6_0),
inference(spm,[status(thm)],[25,43,theory(equality)]) ).
cnf(54,negated_conjecture,
time(esk7_0),
inference(spm,[status(thm)],[25,42,theory(equality)]) ).
cnf(55,negated_conjecture,
reorganization_free(esk1_0,esk7_0,esk6_0),
inference(spm,[status(thm)],[31,41,theory(equality)]) ).
cnf(56,plain,
( X1 = X2
| ~ size(X3,X2,X4)
| ~ size(X3,X1,X4)
| ~ organization(X3,X4) ),
inference(er,[status(thm)],[16,theory(equality)]) ).
cnf(62,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ greater(esk7_0,X2)
| ~ greater(X1,esk3_0)
| ~ organization(esk1_0,X2)
| ~ organization(esk1_0,esk7_0) ),
inference(spm,[status(thm)],[46,39,theory(equality)]) ).
cnf(65,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ greater(esk7_0,X2)
| ~ greater(X1,esk3_0)
| ~ organization(esk1_0,X2)
| $false ),
inference(rw,[status(thm)],[62,42,theory(equality)]) ).
cnf(66,negated_conjecture,
( ~ complexity(esk1_0,X1,X2)
| ~ reorganization_free(esk1_0,X2,esk7_0)
| ~ greater(esk7_0,X2)
| ~ greater(X1,esk3_0)
| ~ organization(esk1_0,X2) ),
inference(cn,[status(thm)],[65,theory(equality)]) ).
cnf(74,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,X2)
| ~ size(esk1_0,X2,esk6_0)
| ~ size(esk1_0,X1,esk7_0)
| ~ organization(esk1_0,esk7_0)
| ~ organization(esk1_0,esk6_0) ),
inference(spm,[status(thm)],[49,55,theory(equality)]) ).
cnf(76,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,X2)
| ~ size(esk1_0,X2,esk6_0)
| ~ size(esk1_0,X1,esk7_0)
| $false
| ~ organization(esk1_0,esk6_0) ),
inference(rw,[status(thm)],[74,42,theory(equality)]) ).
cnf(77,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,X2)
| ~ size(esk1_0,X2,esk6_0)
| ~ size(esk1_0,X1,esk7_0)
| $false
| $false ),
inference(rw,[status(thm)],[76,43,theory(equality)]) ).
cnf(78,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,X2)
| ~ size(esk1_0,X2,esk6_0)
| ~ size(esk1_0,X1,esk7_0) ),
inference(cn,[status(thm)],[77,theory(equality)]) ).
cnf(79,negated_conjecture,
( X1 = esk6_0
| greater(X1,esk6_0)
| greater(esk6_0,X1)
| ~ time(X1) ),
inference(spm,[status(thm)],[28,53,theory(equality)]) ).
cnf(83,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0)
| ~ organization(esk1_0,esk6_0) ),
inference(spm,[status(thm)],[56,38,theory(equality)]) ).
cnf(85,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0)
| $false ),
inference(rw,[status(thm)],[83,43,theory(equality)]) ).
cnf(86,negated_conjecture,
( X1 = esk4_0
| ~ size(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[85,theory(equality)]) ).
cnf(89,negated_conjecture,
( ~ reorganization_free(esk1_0,esk6_0,esk7_0)
| ~ greater(esk7_0,esk6_0)
| ~ greater(esk2_0,esk3_0)
| ~ organization(esk1_0,esk6_0) ),
inference(spm,[status(thm)],[66,40,theory(equality)]) ).
cnf(91,negated_conjecture,
( $false
| ~ greater(esk7_0,esk6_0)
| ~ greater(esk2_0,esk3_0)
| ~ organization(esk1_0,esk6_0) ),
inference(rw,[status(thm)],[89,41,theory(equality)]) ).
cnf(92,negated_conjecture,
( $false
| ~ greater(esk7_0,esk6_0)
| $false
| ~ organization(esk1_0,esk6_0) ),
inference(rw,[status(thm)],[91,35,theory(equality)]) ).
cnf(93,negated_conjecture,
( $false
| ~ greater(esk7_0,esk6_0)
| $false
| $false ),
inference(rw,[status(thm)],[92,43,theory(equality)]) ).
cnf(94,negated_conjecture,
~ greater(esk7_0,esk6_0),
inference(cn,[status(thm)],[93,theory(equality)]) ).
cnf(97,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk6_0,esk7_0)
| greater(esk7_0,esk6_0) ),
inference(spm,[status(thm)],[79,54,theory(equality)]) ).
cnf(98,negated_conjecture,
( esk7_0 = esk6_0
| greater(esk6_0,esk7_0) ),
inference(sr,[status(thm)],[97,94,theory(equality)]) ).
cnf(100,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(X1,esk4_0)
| ~ size(esk1_0,X1,esk7_0) ),
inference(spm,[status(thm)],[78,38,theory(equality)]) ).
cnf(101,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| ~ greater(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[100,37,theory(equality)]) ).
cnf(102,negated_conjecture,
( ~ greater(esk6_0,esk7_0)
| $false ),
inference(rw,[status(thm)],[101,36,theory(equality)]) ).
cnf(103,negated_conjecture,
~ greater(esk6_0,esk7_0),
inference(cn,[status(thm)],[102,theory(equality)]) ).
cnf(104,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[98,103,theory(equality)]) ).
cnf(110,negated_conjecture,
size(esk1_0,esk5_0,esk6_0),
inference(rw,[status(thm)],[37,104,theory(equality)]) ).
cnf(136,negated_conjecture,
esk5_0 = esk4_0,
inference(spm,[status(thm)],[86,110,theory(equality)]) ).
cnf(140,negated_conjecture,
greater(esk5_0,esk5_0),
inference(rw,[status(thm)],[36,136,theory(equality)]) ).
cnf(141,negated_conjecture,
$false,
inference(sr,[status(thm)],[140,50,theory(equality)]) ).
cnf(142,negated_conjecture,
$false,
141,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT014+1.p
% --creating new selector for []
% -running prover on /tmp/tmp__8DgF/sel_MGT014+1.p_1 with time limit 29
% -prover status Theorem
% Problem MGT014+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT014+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT014+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
%
%------------------------------------------------------------------------------