%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n011.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:48 PM UTC 2026
% Result : Unsatisfiable 4.78s 1.16s
% Output : Proof 4.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 93 ( 47 ~; 46 |; 0 &)
% ( 0 <=>; 0 =>; 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 : 32 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,hypothesis,
( number_of_routines(A,B,low)
| ~ founding_time(A,B)
| ~ first_mover(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).
fof(f2_nnf,plain,
! [A,B] :
( number_of_routines(A,B,low)
| ~ founding_time(A,B)
| ~ first_mover(A)
| ~ organisation_at_time(A,B) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [A,B] :
( number_of_routines(A,B,low)
| ~ founding_time(A,B)
| ~ first_mover(A)
| ~ organisation_at_time(A,B) ),
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]) ).
cnf(f3,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).
fof(f3_nnf,plain,
organisation_at_time(sk1,sk2),
inference(nnf_transformation,[status(thm)],[f3]) ).
cnf(c3,plain,
organisation_at_time(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f3_nnf]) ).
cnf(p10,plain,
( number_of_routines(sk1,sk2,low)
| ~ founding_time(sk1,sk2)
| ~ first_mover(sk1) ),
inference(resolution,[status(thm)],[c2,c3]) ).
cnf(f7,negated_conjecture,
( efficient_producer(A)
| first_mover(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).
fof(f7_nnf,plain,
! [A,B] :
( efficient_producer(A)
| first_mover(A)
| ~ organisation_at_time(A,B) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [A,B] :
( efficient_producer(A)
| first_mover(A)
| ~ organisation_at_time(A,B) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c7,plain,
( efficient_producer(X0)
| first_mover(X0)
| ~ organisation_at_time(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p8,plain,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(resolution,[status(thm)],[c7,c3]) ).
cnf(p11,plain,
( efficient_producer(sk1)
| number_of_routines(sk1,sk2,low)
| ~ founding_time(sk1,sk2) ),
inference(resolution,[status(thm)],[p10,p8]) ).
cnf(f4,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).
fof(f4_nnf,plain,
founding_time(sk1,sk2),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
founding_time(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(p12,plain,
( efficient_producer(sk1)
| number_of_routines(sk1,sk2,low) ),
inference(resolution,[status(thm)],[p11,c4]) ).
cnf(f0,axiom,
( ~ number_of_routines(A,B,high)
| ~ number_of_routines(A,B,low) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
fof(f0_nnf,plain,
! [A,B] :
( ~ number_of_routines(A,B,high)
| ~ number_of_routines(A,B,low) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [A,B] :
( ~ number_of_routines(A,B,high)
| ~ number_of_routines(A,B,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(sk1,sk2,high)
| efficient_producer(sk1) ),
inference(resolution,[status(thm)],[p12,c0]) ).
cnf(f5,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).
fof(f5_nnf,plain,
number_of_routines(sk1,sk2,high),
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c5,plain,
number_of_routines(sk1,sk2,high),
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
cnf(p14,plain,
efficient_producer(sk1),
inference(resolution,[status(thm)],[p13,c5]) ).
cnf(f1,hypothesis,
( has_elaborated_routines(A,B)
| ~ founding_time(A,B)
| ~ efficient_producer(A)
| ~ organisation_at_time(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).
fof(f1_nnf,plain,
! [A,B] :
( has_elaborated_routines(A,B)
| ~ founding_time(A,B)
| ~ efficient_producer(A)
| ~ organisation_at_time(A,B) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [A,B] :
( has_elaborated_routines(A,B)
| ~ founding_time(A,B)
| ~ efficient_producer(A)
| ~ organisation_at_time(A,B) ),
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(sk1,sk2)
| ~ founding_time(sk1,sk2)
| ~ efficient_producer(sk1) ),
inference(resolution,[status(thm)],[c1,c3]) ).
cnf(p15,plain,
( has_elaborated_routines(sk1,sk2)
| ~ founding_time(sk1,sk2) ),
inference(resolution,[status(thm)],[p14,p9]) ).
cnf(p16,plain,
has_elaborated_routines(sk1,sk2),
inference(resolution,[status(thm)],[p15,c4]) ).
cnf(f6,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).
fof(f6_nnf,plain,
~ has_elaborated_routines(sk1,sk2),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
~ has_elaborated_routines(sk1,sk2),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
~ has_elaborated_routines(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f6_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.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 01:10:27 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.78/1.16 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.78/1.16 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------