TSTP Solution File: MGT041-2 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n006.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 : Mon Jun 24 11:50:28 EDT 2024
% Result : Unsatisfiable 3.73s 1.82s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 89 ( 4 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 250 ( 55 ~; 46 |; 0 &; 149 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 32 ( 0 ^ 32 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(organisation_at_time_type,type,
organisation_at_time: $i > $i > $o ).
thf(first_mover_type,type,
first_mover: $i > $o ).
thf(efficient_producer_type,type,
efficient_producer: $i > $o ).
thf(number_of_routines_type,type,
number_of_routines: $i > $i > $i > $o ).
thf(low_type,type,
low: $i ).
thf(high_type,type,
high: $i ).
thf(founding_time_type,type,
founding_time: $i > $i > $o ).
thf(has_elaborated_routines_type,type,
has_elaborated_routines: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(4,axiom,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).
thf(15,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( number_of_routines @ A @ B @ low ) ),
inference(cnf,[status(esa)],[15]) ).
thf(7,axiom,
number_of_routines @ sk1 @ sk2 @ high,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).
thf(19,plain,
number_of_routines @ sk1 @ sk2 @ high,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
thf(11,plain,
! [B: $i,A: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ~ ( number_of_routines @ A @ B @ high ) ),
inference(cnf,[status(esa)],[11]) ).
thf(23,plain,
! [B: $i,A: $i] :
( ~ ( number_of_routines @ A @ B @ low )
| ( ( number_of_routines @ sk1 @ sk2 @ high )
!= ( number_of_routines @ A @ B @ high ) ) ),
inference(paramod_ordered,[status(thm)],[19,12]) ).
thf(24,plain,
~ ( number_of_routines @ sk1 @ sk2 @ low ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(69,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( first_mover @ A )
| ~ ( founding_time @ A @ B )
| ( ( number_of_routines @ A @ B @ low )
!= ( number_of_routines @ sk1 @ sk2 @ low ) ) ),
inference(paramod_ordered,[status(thm)],[16,24]) ).
thf(70,plain,
( ~ ( organisation_at_time @ sk1 @ sk2 )
| ~ ( first_mover @ sk1 )
| ~ ( founding_time @ sk1 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[69:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(5,axiom,
organisation_at_time @ sk1 @ sk2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).
thf(17,plain,
organisation_at_time @ sk1 @ sk2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,negated_conjecture,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ( first_mover @ A )
| ( efficient_producer @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).
thf(9,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ( first_mover @ A )
| ( efficient_producer @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(10,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ( first_mover @ A )
| ( efficient_producer @ A ) ),
inference(cnf,[status(esa)],[9]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ( first_mover @ A )
| ( efficient_producer @ A )
| ( ( organisation_at_time @ sk1 @ sk2 )
!= ( organisation_at_time @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[17,10]) ).
thf(35,plain,
( ( first_mover @ sk1 )
| ( efficient_producer @ sk1 ) ),
inference(pattern_uni,[status(thm)],[34:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).
thf(13,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( has_elaborated_routines @ A @ B ) ),
inference(cnf,[status(esa)],[13]) ).
thf(8,axiom,
~ ( has_elaborated_routines @ sk1 @ sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).
thf(20,plain,
~ ( has_elaborated_routines @ sk1 @ sk2 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(21,plain,
~ ( has_elaborated_routines @ sk1 @ sk2 ),
inference(polarity_switch,[status(thm)],[20]) ).
thf(42,plain,
! [B: $i,A: $i] :
( ~ ( organisation_at_time @ A @ B )
| ~ ( efficient_producer @ A )
| ~ ( founding_time @ A @ B )
| ( ( has_elaborated_routines @ A @ B )
!= ( has_elaborated_routines @ sk1 @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[14,21]) ).
thf(43,plain,
( ~ ( organisation_at_time @ sk1 @ sk2 )
| ~ ( efficient_producer @ sk1 )
| ~ ( founding_time @ sk1 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[42:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(6,axiom,
founding_time @ sk1 @ sk2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).
thf(18,plain,
founding_time @ sk1 @ sk2,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(62,plain,
( ~ $true
| ~ ( efficient_producer @ sk1 )
| ~ $true ),
inference(rewrite,[status(thm)],[43,17,18]) ).
thf(63,plain,
~ ( efficient_producer @ sk1 ),
inference(simp,[status(thm)],[62]) ).
thf(64,plain,
( ( first_mover @ sk1 )
| $false ),
inference(rewrite,[status(thm)],[35,63]) ).
thf(65,plain,
first_mover @ sk1,
inference(simp,[status(thm)],[64]) ).
thf(91,plain,
( ~ $true
| ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[70,17,65,18]) ).
thf(92,plain,
$false,
inference(simp,[status(thm)],[91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.11/0.32 % Computer : n006.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jun 19 17:50:25 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.97/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.12/0.97 % [INFO] Parsing done (105ms).
% 1.25/0.98 % [INFO] Running in sequential loop mode.
% 1.58/1.19 % [INFO] nitpick registered as external prover.
% 1.58/1.19 % [INFO] Scanning for conjecture ...
% 1.76/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 7 axioms. Running axiom selection ...
% 1.83/1.27 % [INFO] Axiom selection finished. Selected 7 axioms (removed 0 axioms).
% 1.83/1.28 % [INFO] Problem is propositional (TPTP CNF).
% 1.83/1.28 % [INFO] Type checking passed.
% 1.83/1.28 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 3.52/1.81 % [INFO] Killing All external provers ...
% 3.73/1.82 % Time passed: 1288ms (effective reasoning time: 834ms)
% 3.73/1.82 % Axioms used in derivation (7): a16_6, mp_not_high_and_low_1, a16_5, a14_2, a16_4, a16_7, a15_3
% 3.73/1.82 % No. of inferences in proof: 35
% 3.73/1.82 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1288 ms resp. 834 ms w/o parsing
% 3.73/1.86 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.73/1.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------