TSTP Solution File: MGT041+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : MGT041+2 : TPTP v5.0.0. Released v2.0.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 @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec 25 21:07:09 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 118 ( 53 ~; 40 |; 23 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 42 ( 1 sgn 22 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& first_mover(X1)
& founding_time(X1,X2) )
=> number_of_routines(X1,X2,low) ),
file('/tmp/tmpviq_RI/sel_MGT041+2.p_1',a15) ).
fof(2,axiom,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& efficient_producer(X1)
& founding_time(X1,X2) )
=> has_elaborated_routines(X1,X2) ),
file('/tmp/tmpviq_RI/sel_MGT041+2.p_1',a14) ).
fof(3,axiom,
! [X1,X2] :
~ ( number_of_routines(X1,X2,low)
& number_of_routines(X1,X2,high) ),
file('/tmp/tmpviq_RI/sel_MGT041+2.p_1',mp_not_high_and_low) ).
fof(4,axiom,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
file('/tmp/tmpviq_RI/sel_MGT041+2.p_1',a16) ).
fof(5,conjecture,
? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
file('/tmp/tmpviq_RI/sel_MGT041+2.p_1',prove_t10) ).
fof(6,negated_conjecture,
~ ? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
inference(assume_negation,[status(cth)],[5]) ).
fof(7,plain,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(8,negated_conjecture,
~ ? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).
fof(9,plain,
! [X1,X2] :
( ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2)
| number_of_routines(X1,X2,low) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(10,plain,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| ~ first_mover(X3)
| ~ founding_time(X3,X4)
| number_of_routines(X3,X4,low) ),
inference(variable_rename,[status(thm)],[9]) ).
cnf(11,plain,
( number_of_routines(X1,X2,low)
| ~ founding_time(X1,X2)
| ~ first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(12,plain,
! [X1,X2] :
( ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2)
| has_elaborated_routines(X1,X2) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| ~ efficient_producer(X3)
| ~ founding_time(X3,X4)
| has_elaborated_routines(X3,X4) ),
inference(variable_rename,[status(thm)],[12]) ).
cnf(14,plain,
( has_elaborated_routines(X1,X2)
| ~ founding_time(X1,X2)
| ~ efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X1,X2] :
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(16,plain,
! [X3,X4] :
( ~ number_of_routines(X3,X4,low)
| ~ number_of_routines(X3,X4,high) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(17,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,plain,
? [X3,X4] :
( organisation_at_time(X3,X4)
& founding_time(X3,X4)
& number_of_routines(X3,X4,high)
& ~ has_elaborated_routines(X3,X4) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(19,plain,
( organisation_at_time(esk1_0,esk2_0)
& founding_time(esk1_0,esk2_0)
& number_of_routines(esk1_0,esk2_0,high)
& ~ has_elaborated_routines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[18]) ).
cnf(20,plain,
~ has_elaborated_routines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(21,plain,
number_of_routines(esk1_0,esk2_0,high),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(22,plain,
founding_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[19]) ).
cnf(23,plain,
organisation_at_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[19]) ).
fof(24,negated_conjecture,
! [X1,X2] :
( ~ organisation_at_time(X1,X2)
| first_mover(X1)
| efficient_producer(X1) ),
inference(fof_nnf,[status(thm)],[8]) ).
fof(25,negated_conjecture,
! [X3,X4] :
( ~ organisation_at_time(X3,X4)
| first_mover(X3)
| efficient_producer(X3) ),
inference(variable_rename,[status(thm)],[24]) ).
cnf(26,negated_conjecture,
( efficient_producer(X1)
| first_mover(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[25]) ).
cnf(27,plain,
( efficient_producer(esk1_0)
| first_mover(esk1_0) ),
inference(spm,[status(thm)],[26,23,theory(equality)]) ).
cnf(28,plain,
( ~ efficient_producer(esk1_0)
| ~ founding_time(esk1_0,esk2_0)
| ~ organisation_at_time(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[20,14,theory(equality)]) ).
cnf(29,plain,
( ~ efficient_producer(esk1_0)
| $false
| ~ organisation_at_time(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[28,22,theory(equality)]) ).
cnf(30,plain,
( ~ efficient_producer(esk1_0)
| $false
| $false ),
inference(rw,[status(thm)],[29,23,theory(equality)]) ).
cnf(31,plain,
~ efficient_producer(esk1_0),
inference(cn,[status(thm)],[30,theory(equality)]) ).
cnf(32,plain,
( number_of_routines(esk1_0,esk2_0,low)
| ~ first_mover(esk1_0)
| ~ organisation_at_time(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[11,22,theory(equality)]) ).
cnf(33,plain,
( number_of_routines(esk1_0,esk2_0,low)
| ~ first_mover(esk1_0)
| $false ),
inference(rw,[status(thm)],[32,23,theory(equality)]) ).
cnf(34,plain,
( number_of_routines(esk1_0,esk2_0,low)
| ~ first_mover(esk1_0) ),
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,plain,
first_mover(esk1_0),
inference(sr,[status(thm)],[27,31,theory(equality)]) ).
cnf(36,plain,
( number_of_routines(esk1_0,esk2_0,low)
| $false ),
inference(rw,[status(thm)],[34,35,theory(equality)]) ).
cnf(37,plain,
number_of_routines(esk1_0,esk2_0,low),
inference(cn,[status(thm)],[36,theory(equality)]) ).
cnf(38,plain,
~ number_of_routines(esk1_0,esk2_0,high),
inference(spm,[status(thm)],[17,37,theory(equality)]) ).
cnf(39,plain,
$false,
inference(rw,[status(thm)],[38,21,theory(equality)]) ).
cnf(40,plain,
$false,
inference(cn,[status(thm)],[39,theory(equality)]) ).
cnf(41,plain,
$false,
40,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/MGT/MGT041+2.p
% --creating new selector for []
% -running prover on /tmp/tmpviq_RI/sel_MGT041+2.p_1 with time limit 29
% -prover status Theorem
% Problem MGT041+2.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/MGT/MGT041+2.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/MGT/MGT041+2.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
%
%------------------------------------------------------------------------------