%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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 : Tue Sep 8 06:11:26 AM UTC 2026
% Result : Theorem 0.03s 0.30s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 18 |; 12 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 20 ( 1 sgn 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_t10,plain,
? [X,T] :
( organisation_at_time(X,T)
& ~ first_mover(X)
& ~ efficient_producer(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10) ).
fof(prove_t10_negated,plain,
~ ? [X,T] :
( organisation_at_time(X,T)
& ~ first_mover(X)
& ~ efficient_producer(X) ),
inference(negate_conjecture,[status(cth)],[prove_t10]) ).
cnf(7,plain,
( ~ organisation_at_time(X0,X1)
| efficient_producer(X0)
| first_mover(X0) ),
inference(cnf,[status(esa)],[prove_t10_negated]) ).
cnf(l0,plain,
( ~ organisation_at_time(sK1,sK2)
| efficient_producer(sK1)
| first_mover(sK1) ),
inference(instantiation,[status(thm)],[7]) ).
fof(a14,plain,
! [X,T] :
( ( organisation_at_time(X,T)
& efficient_producer(X)
& founding_time(X,T) )
=> has_elaborated_routines(X,T) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14) ).
cnf(1,plain,
( ~ organisation_at_time(X0,X1)
| ~ efficient_producer(X0)
| ~ founding_time(X0,X1)
| has_elaborated_routines(X0,X1) ),
inference(cnf,[status(esa)],[a14]) ).
cnf(l1,plain,
( ~ organisation_at_time(sK1,sK2)
| ~ efficient_producer(sK1)
| ~ founding_time(sK1,sK2)
| has_elaborated_routines(sK1,sK2) ),
inference(instantiation,[status(thm)],[1]) ).
fof(a16,plain,
? [X,T] :
( organisation_at_time(X,T)
& founding_time(X,T)
& number_of_routines(X,T,high)
& ~ has_elaborated_routines(X,T) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16) ).
cnf(3,plain,
organisation_at_time(sK1,sK2),
inference(cnf,[status(esa)],[a16]) ).
cnf(l2,plain,
organisation_at_time(sK1,sK2),
inference(instantiation,[status(thm)],[3]) ).
cnf(4,plain,
founding_time(sK1,sK2),
inference(cnf,[status(esa)],[a16]) ).
cnf(l3,plain,
founding_time(sK1,sK2),
inference(instantiation,[status(thm)],[4]) ).
cnf(l4,plain,
organisation_at_time(sK1,sK2),
inference(instantiation,[status(thm)],[3]) ).
cnf(6,plain,
~ has_elaborated_routines(sK1,sK2),
inference(cnf,[status(esa)],[a16]) ).
cnf(l5,plain,
~ has_elaborated_routines(sK1,sK2),
inference(instantiation,[status(thm)],[6]) ).
fof(a15,plain,
! [X,T] :
( ( organisation_at_time(X,T)
& first_mover(X)
& founding_time(X,T) )
=> number_of_routines(X,T,low) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15) ).
cnf(2,plain,
( ~ organisation_at_time(X0,X1)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| number_of_routines(X0,X1,low) ),
inference(cnf,[status(esa)],[a15]) ).
cnf(l6,plain,
( ~ organisation_at_time(sK1,sK2)
| ~ founding_time(sK1,sK2)
| ~ first_mover(sK1)
| number_of_routines(sK1,sK2,low) ),
inference(instantiation,[status(thm)],[2]) ).
cnf(l7,plain,
organisation_at_time(sK1,sK2),
inference(instantiation,[status(thm)],[3]) ).
cnf(l8,plain,
founding_time(sK1,sK2),
inference(instantiation,[status(thm)],[4]) ).
fof(mp_not_high_and_low,plain,
! [X,T] :
~ ( number_of_routines(X,T,low)
& number_of_routines(X,T,high) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).
cnf(0,plain,
( ~ number_of_routines(X0,X1,low)
| ~ number_of_routines(X0,X1,high) ),
inference(cnf,[status(esa)],[mp_not_high_and_low]) ).
cnf(l9,plain,
( ~ number_of_routines(sK1,sK2,low)
| ~ number_of_routines(sK1,sK2,high) ),
inference(instantiation,[status(thm)],[0]) ).
cnf(5,plain,
number_of_routines(sK1,sK2,high),
inference(cnf,[status(esa)],[a16]) ).
cnf(l10,plain,
number_of_routines(sK1,sK2,high),
inference(instantiation,[status(thm)],[5]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5,l6,l7,l8,l9,l10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.02 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 7 13:02:27 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 % launching worker at depth: 1
% 0.03/0.30 % launching worker at depth: 6
% 0.03/0.30 % launching worker at depth: 2
% 0.03/0.30 % launching worker at depth: 3
% 0.03/0.30 % launching worker at depth: 5
% 0.03/0.30 % launching worker at depth: 7
% 0.03/0.30 % launching worker at depth: 8
% 0.03/0.30 % launching worker at depth: 4
% 0.03/0.30 % launching worker at depth: 9
% 0.03/0.30 % SZS status Theorem for theBenchmark
% 0.03/0.30 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------