%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 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 : Sun Sep 27 08:02:56 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 54 ( 27 ~; 27 |; 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 : 16 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a16_4,axiom,
organisation_at_time(sk1,sk2),
file('theBenchmark.p',a16_4) ).
cnf(c_1,plain,
organisation_at_time(sk1,sk2),
inference(clausify,[status(thm)],[a16_4]) ).
fof(a15_3,axiom,
! [VAR_0,VAR_1] :
( number_of_routines(VAR_0,VAR_1,low)
| ~ founding_time(VAR_0,VAR_1)
| ~ first_mover(VAR_0)
| ~ organisation_at_time(VAR_0,VAR_1) ),
file('theBenchmark.p',a15_3) ).
cnf(c_2,plain,
( number_of_routines(A,B,low)
| ~ founding_time(A,B)
| ~ first_mover(A)
| ~ organisation_at_time(A,B) ),
inference(clausify,[status(thm)],[a15_3]) ).
fof(a14_2,axiom,
! [VAR_0,VAR_1] :
( has_elaborated_routines(VAR_0,VAR_1)
| ~ founding_time(VAR_0,VAR_1)
| ~ efficient_producer(VAR_0)
| ~ organisation_at_time(VAR_0,VAR_1) ),
file('theBenchmark.p',a14_2) ).
cnf(c_3,plain,
( has_elaborated_routines(A,B)
| ~ founding_time(A,B)
| ~ efficient_producer(A)
| ~ organisation_at_time(A,B) ),
inference(clausify,[status(thm)],[a14_2]) ).
fof(prove_t10_8,axiom,
! [VAR_0,VAR_1] :
( efficient_producer(VAR_0)
| first_mover(VAR_0)
| ~ organisation_at_time(VAR_0,VAR_1) ),
file('theBenchmark.p',prove_t10_8) ).
cnf(c_4,plain,
( efficient_producer(A)
| first_mover(A)
| ~ organisation_at_time(A,B) ),
inference(clausify,[status(thm)],[prove_t10_8]) ).
cnf(c_5,plain,
( has_elaborated_routines(sk1,sk2)
| ~ founding_time(sk1,sk2)
| ~ efficient_producer(sk1) ),
inference(resolve,[status(thm)],[c_1,c_3]) ).
cnf(c_6,plain,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(resolve,[status(thm)],[c_4,c_1]) ).
fof(a16_5,axiom,
founding_time(sk1,sk2),
file('theBenchmark.p',a16_5) ).
cnf(c_7,plain,
founding_time(sk1,sk2),
inference(clausify,[status(thm)],[a16_5]) ).
cnf(c_8,plain,
( first_mover(sk1)
| has_elaborated_routines(sk1,sk2)
| ~ founding_time(sk1,sk2) ),
inference(resolve,[status(thm)],[c_5,c_6]) ).
cnf(c_9,plain,
( number_of_routines(sk1,sk2,low)
| ~ founding_time(sk1,sk2)
| ~ first_mover(sk1) ),
inference(resolve,[status(thm)],[c_1,c_2]) ).
fof(a16_7,axiom,
~ has_elaborated_routines(sk1,sk2),
file('theBenchmark.p',a16_7) ).
cnf(c_10,plain,
~ has_elaborated_routines(sk1,sk2),
inference(clausify,[status(thm)],[a16_7]) ).
cnf(c_11,plain,
( first_mover(sk1)
| has_elaborated_routines(sk1,sk2) ),
inference(resolve,[status(thm)],[c_7,c_8]) ).
cnf(c_12,plain,
( number_of_routines(sk1,sk2,low)
| ~ first_mover(sk1) ),
inference(resolve,[status(thm)],[c_9,c_7]) ).
cnf(c_13,plain,
first_mover(sk1),
inference(resolve,[status(thm)],[c_10,c_11]) ).
cnf(c_14,plain,
number_of_routines(sk1,sk2,low),
inference(resolve,[status(thm)],[c_12,c_13]) ).
fof(a16_6,axiom,
number_of_routines(sk1,sk2,high),
file('theBenchmark.p',a16_6) ).
cnf(c_15,plain,
number_of_routines(sk1,sk2,high),
inference(clausify,[status(thm)],[a16_6]) ).
fof(mp_not_high_and_low_1,axiom,
! [VAR_0,VAR_1] :
( ~ number_of_routines(VAR_0,VAR_1,high)
| ~ number_of_routines(VAR_0,VAR_1,low) ),
file('theBenchmark.p',mp_not_high_and_low_1) ).
cnf(c_16,plain,
( ~ number_of_routines(A,B,high)
| ~ number_of_routines(A,B,low) ),
inference(clausify,[status(thm)],[mp_not_high_and_low_1]) ).
cnf(c_18,plain,
~ number_of_routines(sk1,sk2,high),
inference(resolve,[status(thm)],[c_16,c_14]) ).
cnf(c_17,plain,
$false,
inference(resolve,[status(thm)],[c_15,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT041-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 00:09:16 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 1994073 was started by sandbox on n010,
% 0.10/0.37 % Sat Sep 26 00:09:16 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.38
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38
% 0.10/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38 % Length of proof is 17.
% 0.10/0.38 % Level of proof is 6.
% 0.10/0.38 % Maximum clause weight is 8.000.
% 0.10/0.38 % Given clauses 3.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------