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.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n009.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:35 EDT 2023
% Result : Unsatisfiable 0.50s 0.58s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 32 ( 12 unt; 10 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 22 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 16 ( 2 sgn; 0 !; 0 ?; 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,
sk1: $i ).
tff(decl_31,type,
sk2: $i ).
cnf(prove_t10_8,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10_8) ).
cnf(a16_4,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_4) ).
cnf(a16_7,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_7) ).
cnf(a14_2,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14_2) ).
cnf(a16_5,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_5) ).
cnf(a15_3,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15_3) ).
cnf(mp_not_high_and_low_1,axiom,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
cnf(a16_6,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16_6) ).
cnf(c_0_8,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
prove_t10_8 ).
cnf(c_0_9,hypothesis,
organisation_at_time(sk1,sk2),
a16_4 ).
cnf(c_0_10,hypothesis,
~ has_elaborated_routines(sk1,sk2),
a16_7 ).
cnf(c_0_11,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
a14_2 ).
cnf(c_0_12,hypothesis,
founding_time(sk1,sk2),
a16_5 ).
cnf(c_0_13,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
a15_3 ).
cnf(c_0_14,hypothesis,
( first_mover(sk1)
| efficient_producer(sk1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
~ efficient_producer(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_9])]) ).
cnf(c_0_16,hypothesis,
( number_of_routines(sk1,sk2,low)
| ~ first_mover(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_9])]) ).
cnf(c_0_17,hypothesis,
first_mover(sk1),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
mp_not_high_and_low_1 ).
cnf(c_0_19,hypothesis,
number_of_routines(sk1,sk2,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,hypothesis,
number_of_routines(sk1,sk2,high),
a16_6 ).
cnf(c_0_21,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT041-2 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 06:02:50 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.50/0.57 start to proof: theBenchmark
% 0.50/0.58 % Version : CSE_E---1.5
% 0.50/0.58 % Problem : theBenchmark.p
% 0.50/0.58 % Proof found
% 0.50/0.58 % SZS status Theorem for theBenchmark.p
% 0.50/0.59 % SZS output start Proof
% See solution above
% 0.50/0.59 % Total time : 0.004000 s
% 0.50/0.59 % SZS output end Proof
% 0.50/0.59 % Total time : 0.006000 s
%------------------------------------------------------------------------------