%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT041-2 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:48:18 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 12 unt; 2 nHn; 23 RR)
% Number of literals : 48 ( 0 equ; 31 neg)
% Maximal clause size : 4 ( 2 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 : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mp_not_high_and_low_1,axiom,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low_1) ).
cnf(a15_3,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15_3) ).
cnf(a14_2,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14_2) ).
cnf(a16_6,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_6) ).
cnf(prove_t10_8,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10_8) ).
cnf(a16_7,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_7) ).
cnf(a16_5,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_5) ).
cnf(a16_4,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16_4) ).
cnf(i_0_8,axiom,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
mp_not_high_and_low_1,
[final] ).
cnf(i_0_9,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
a15_3,
[final] ).
cnf(i_0_10,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
a14_2,
[final] ).
cnf(i_0_11,hypothesis,
number_of_routines(sk1,sk2,high),
a16_6,
[final] ).
cnf(i_0_12,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
prove_t10_8,
[final] ).
cnf(i_0_13,hypothesis,
~ has_elaborated_routines(sk1,sk2),
a16_7,
[final] ).
cnf(i_0_14,hypothesis,
founding_time(sk1,sk2),
a16_5,
[final] ).
cnf(i_0_15,hypothesis,
organisation_at_time(sk1,sk2),
a16_4,
[final] ).
cnf(i_0_16,plain,
~ number_of_routines(sk1,sk2,low),
inference(scs_inference,[],[i_0_11,i_0_8]) ).
cnf(i_0_17,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(rename_variables,[],[i_0_8]) ).
cnf(i_0_18,plain,
~ first_mover(sk1),
inference(scs_inference,[],[i_0_11,i_0_15,i_0_14,i_0_8,i_0_9]) ).
cnf(i_0_19,plain,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
inference(rename_variables,[],[i_0_9]) ).
cnf(i_0_20,plain,
~ efficient_producer(sk1),
inference(scs_inference,[],[i_0_11,i_0_15,i_0_14,i_0_13,i_0_8,i_0_9,i_0_10]) ).
cnf(i_0_21,plain,
( ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2)
| has_elaborated_routines(X1,X2) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_11,i_0_15,i_0_14,i_0_13,i_0_8,i_0_9,i_0_10,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT041-2 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n025.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:29:28 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------