TSTP Solution File: MGT041+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:08:36 EDT 2023
% Result : Theorem 0.20s 0.57s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 70 ( 30 ~; 20 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% 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 : 30 ( 1 sgn; 14 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
low: $i ).
tff(decl_23,type,
number_of_routines: ( $i * $i * $i ) > $o ).
tff(decl_24,type,
high: $i ).
tff(decl_25,type,
organisation_at_time: ( $i * $i ) > $o ).
tff(decl_26,type,
efficient_producer: $i > $o ).
tff(decl_27,type,
founding_time: ( $i * $i ) > $o ).
tff(decl_28,type,
has_elaborated_routines: ( $i * $i ) > $o ).
tff(decl_29,type,
first_mover: $i > $o ).
tff(decl_30,type,
esk1_0: $i ).
tff(decl_31,type,
esk2_0: $i ).
fof(prove_t10,conjecture,
? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(a16,hypothesis,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(a14,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& efficient_producer(X1)
& founding_time(X1,X2) )
=> has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(a15,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& first_mover(X1)
& founding_time(X1,X2) )
=> number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
fof(mp_not_high_and_low,axiom,
! [X1,X2] :
~ ( number_of_routines(X1,X2,low)
& number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_t10])]) ).
fof(c_0_6,hypothesis,
? [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)],[a16]) ).
fof(c_0_7,negated_conjecture,
! [X11,X12] :
( ~ organisation_at_time(X11,X12)
| first_mover(X11)
| efficient_producer(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
fof(c_0_8,hypothesis,
( 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)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_9,hypothesis,
! [X5,X6] :
( ~ organisation_at_time(X5,X6)
| ~ efficient_producer(X5)
| ~ founding_time(X5,X6)
| has_elaborated_routines(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a14])]) ).
fof(c_0_10,hypothesis,
! [X7,X8] :
( ~ organisation_at_time(X7,X8)
| ~ first_mover(X7)
| ~ founding_time(X7,X8)
| number_of_routines(X7,X8,low) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a15])]) ).
cnf(c_0_11,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
organisation_at_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
founding_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,hypothesis,
( first_mover(esk1_0)
| efficient_producer(esk1_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,hypothesis,
~ efficient_producer(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12])]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ number_of_routines(X3,X4,low)
| ~ number_of_routines(X3,X4,high) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_not_high_and_low])]) ).
cnf(c_0_20,hypothesis,
( number_of_routines(esk1_0,esk2_0,low)
| ~ first_mover(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_12])]) ).
cnf(c_0_21,hypothesis,
first_mover(esk1_0),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,hypothesis,
number_of_routines(esk1_0,esk2_0,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 28 06:12:25 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.57 % Version : CSE_E---1.5
% 0.20/0.57 % Problem : theBenchmark.p
% 0.20/0.57 % Proof found
% 0.20/0.57 % SZS status Theorem for theBenchmark.p
% 0.20/0.57 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.005000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.007000 s
%------------------------------------------------------------------------------