%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:00:43 AM UTC 2026
% Result : Theorem 5.01s 3.16s
% Output : Refutation 5.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 12 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 38 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 110 ( 12 ~; 0 |; 22 &; 72 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 22 ( 0 ^; 12 !; 10 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(organisation_at_time_decl,type,
organisation_at_time: $i > $i > $o ).
thf(first_mover_decl,type,
first_mover: $i > $o ).
thf(efficient_producer_decl,type,
efficient_producer: $i > $o ).
thf(number_of_routines_decl,type,
number_of_routines: $i > $i > $i > $o ).
thf(low_decl,type,
low: $i ).
thf(high_decl,type,
high: $i ).
thf(founding_time_decl,type,
founding_time: $i > $i > $o ).
thf(has_elaborated_routines_decl,type,
has_elaborated_routines: $i > $i > $o ).
thf(3,axiom,
! [A: $i,B: $i] :
~ ( ( high @ ( B @ ( A @ number_of_routines ) ) )
& ( low @ ( B @ ( A @ number_of_routines ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).
thf(10,plain,
! [A: $i,B: $i] :
~ ( ( high @ ( B @ ( A @ number_of_routines ) ) )
& ( low @ ( B @ ( A @ number_of_routines ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i,B: $i] :
( ( ( B @ ( A @ founding_time ) )
& ( A @ efficient_producer )
& ( B @ ( A @ organisation_at_time ) ) )
=> ( B @ ( A @ has_elaborated_routines ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14) ).
thf(13,plain,
! [A: $i,B: $i] :
( ( ( B @ ( A @ founding_time ) )
& ( A @ efficient_producer )
& ( B @ ( A @ organisation_at_time ) ) )
=> ( B @ ( A @ has_elaborated_routines ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(6,axiom,
? [A: $i,B: $i] :
( ~ ( B @ ( A @ has_elaborated_routines ) )
& ( high @ ( B @ ( A @ number_of_routines ) ) )
& ( B @ ( A @ founding_time ) )
& ( B @ ( A @ organisation_at_time ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16) ).
thf(17,plain,
? [A: $i,B: $i] :
( ~ ( B @ ( A @ has_elaborated_routines ) )
& ( high @ ( B @ ( A @ number_of_routines ) ) )
& ( B @ ( A @ founding_time ) )
& ( B @ ( A @ organisation_at_time ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,conjecture,
? [A: $i,B: $i] :
( ~ ( A @ efficient_producer )
& ~ ( A @ first_mover )
& ( B @ ( A @ organisation_at_time ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10) ).
thf(2,negated_conjecture,
~ ? [A: $i,B: $i] :
( ~ ( A @ efficient_producer )
& ~ ( A @ first_mover )
& ( B @ ( A @ organisation_at_time ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ ? [A: $i,B: $i] :
( ~ ( A @ efficient_producer )
& ~ ( A @ first_mover )
& ( B @ ( A @ organisation_at_time ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( ( B @ ( A @ founding_time ) )
& ( A @ first_mover )
& ( B @ ( A @ organisation_at_time ) ) )
=> ( low @ ( B @ ( A @ number_of_routines ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15) ).
thf(15,plain,
! [A: $i,B: $i] :
( ( ( B @ ( A @ founding_time ) )
& ( A @ first_mover )
& ( B @ ( A @ organisation_at_time ) ) )
=> ( low @ ( B @ ( A @ number_of_routines ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(23,plain,
$false,
inference(e,[status(thm)],[10,13,17,7,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.56 % Computer : n001.cluster.edu
% 0.13/0.56 % Model : x86_64 x86_64
% 0.13/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.56 % Memory : 8046.5625MB
% 0.13/0.56 % OS : Linux 6.8.0-71-generic
% 0.13/0.56 % CPULimit : 300
% 0.13/0.56 % WCLimit : 300
% 0.13/0.56 % DateTime : Sat Sep 26 00:14:42 UTC 2026
% 0.13/0.56 % CPUTime :
% 0.13/0.56 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 1.04/1.26 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.56/1.53 % [INFO] Parsing done (267ms).
% 1.56/1.55 % [INFO] Running in sequential loop mode.
% 2.66/2.18 % [INFO] eprover registered as external prover.
% 2.66/2.19 % [INFO] Scanning for conjecture ...
% 2.96/2.32 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 2.96/2.37 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 3.14/2.40 % [INFO] Problem is first-order (TPTP FOF).
% 3.14/2.41 % [INFO] Type checking passed.
% 3.14/2.41 % [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 ...
% 5.01/3.16 % External prover 'e' found a proof!
% 5.01/3.16 % [INFO] Killing All external provers ...
% 5.01/3.16 % Time passed: 2448ms (effective reasoning time: 1601ms)
% 5.01/3.16 % Solved by 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)>
% 5.01/3.16 % Axioms used in derivation (4): mp_not_high_and_low, a14, a16, a15
% 5.01/3.16 % No. of inferences in proof: 12
% 5.01/3.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2448 ms resp. 1601 ms w/o parsing
% 5.11/3.23 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.11/3.23 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------