%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n010.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 : Fri Sep 25 02:11:47 PM UTC 2026
% Result : Theorem 2.36s 0.78s
% Output : Proof 2.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 7 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 101 ( 44 ~; 37 |; 18 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 38 ( 1 sgn 22 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,hypothesis,
! [X,T] :
( ( founding_time(X,T)
& first_mover(X)
& organisation_at_time(X,T) )
=> number_of_routines(X,T,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a15) ).
fof(f2_nnf,plain,
! [X,T] :
( number_of_routines(X,T,low)
| ~ founding_time(X,T)
| ~ first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,T] :
( number_of_routines(X,T,low)
| ~ founding_time(X,T)
| ~ first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( number_of_routines(X0,X1,low)
| ~ founding_time(X0,X1)
| ~ first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
fof(f3,hypothesis,
? [X,T] :
( ~ has_elaborated_routines(X,T)
& number_of_routines(X,T,high)
& founding_time(X,T)
& organisation_at_time(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a16) ).
fof(f3_nnf,plain,
? [X,T] :
( ~ has_elaborated_routines(X,T)
& number_of_routines(X,T,high)
& founding_time(X,T)
& organisation_at_time(X,T) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
( ~ has_elaborated_routines(sk0,sk1)
& number_of_routines(sk0,sk1,high)
& founding_time(sk0,sk1)
& organisation_at_time(sk0,sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f3_nnf]) ).
cnf(c3,plain,
organisation_at_time(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p10,plain,
( number_of_routines(sk0,sk1,low)
| ~ founding_time(sk0,sk1)
| ~ first_mover(sk0) ),
inference(resolution,[status(thm)],[c2,c3]) ).
fof(f4,conjecture,
? [X,T] :
( ~ efficient_producer(X)
& ~ first_mover(X)
& organisation_at_time(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_t10) ).
fof(f4_neg,negated_conjecture,
~ ? [X,T] :
( ~ efficient_producer(X)
& ~ first_mover(X)
& organisation_at_time(X,T) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f4_nnf,plain,
! [X,T] :
( efficient_producer(X)
| first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(nnf_transformation,[status(thm)],[f4_neg]) ).
fof(f4_sk,plain,
! [X,T] :
( efficient_producer(X)
| first_mover(X)
| ~ organisation_at_time(X,T) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c7,plain,
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(p8,plain,
( efficient_producer(sk0)
| first_mover(sk0) ),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(p11,plain,
( efficient_producer(sk0)
| number_of_routines(sk0,sk1,low)
| ~ founding_time(sk0,sk1) ),
inference(resolution,[status(thm)],[p10,p8]) ).
cnf(c4,plain,
founding_time(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p12,plain,
( efficient_producer(sk0)
| number_of_routines(sk0,sk1,low) ),
inference(resolution,[status(thm)],[p11,c4]) ).
fof(f0,axiom,
! [X,T] :
~ ( number_of_routines(X,T,high)
& number_of_routines(X,T,low) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(f0_nnf,plain,
! [X,T] :
( ~ number_of_routines(X,T,high)
| ~ number_of_routines(X,T,low) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,T] :
( ~ number_of_routines(X,T,high)
| ~ number_of_routines(X,T,low) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( ~ number_of_routines(X0,X1,high)
| ~ number_of_routines(X0,X1,low) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(p13,plain,
( ~ number_of_routines(sk0,sk1,high)
| efficient_producer(sk0) ),
inference(resolution,[status(thm)],[p12,c0]) ).
cnf(c5,plain,
number_of_routines(sk0,sk1,high),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p14,plain,
efficient_producer(sk0),
inference(resolution,[status(thm)],[p13,c5]) ).
fof(f1,hypothesis,
! [X,T] :
( ( founding_time(X,T)
& efficient_producer(X)
& organisation_at_time(X,T) )
=> has_elaborated_routines(X,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a14) ).
fof(f1_nnf,plain,
! [X,T] :
( has_elaborated_routines(X,T)
| ~ founding_time(X,T)
| ~ efficient_producer(X)
| ~ organisation_at_time(X,T) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,T] :
( has_elaborated_routines(X,T)
| ~ founding_time(X,T)
| ~ efficient_producer(X)
| ~ organisation_at_time(X,T) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( has_elaborated_routines(X0,X1)
| ~ founding_time(X0,X1)
| ~ efficient_producer(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(p9,plain,
( has_elaborated_routines(sk0,sk1)
| ~ founding_time(sk0,sk1)
| ~ efficient_producer(sk0) ),
inference(resolution,[status(thm)],[c1,c3]) ).
cnf(p15,plain,
( has_elaborated_routines(sk0,sk1)
| ~ founding_time(sk0,sk1) ),
inference(resolution,[status(thm)],[p14,p9]) ).
cnf(p16,plain,
has_elaborated_routines(sk0,sk1),
inference(resolution,[status(thm)],[p15,c4]) ).
cnf(c6,plain,
~ has_elaborated_routines(sk0,sk1),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(p17,plain,
$false,
inference(resolution,[status(thm)],[p16,c6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 01:10:29 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.36/0.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.36/0.78 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------