%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : MGT041+2 : TPTP v9.2.1. Released v2.0.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 : n031.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 : Theorem 0.26s 1.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 84 ( 39 ~; 25 |; 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 : 36 ( 1 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a16,hypothesis,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16) ).
fof(prove_t10,conjecture,
? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10) ).
fof(mp_not_high_and_low,axiom,
! [X1,X2] :
~ ( number_of_routines(X1,X2,low)
& number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).
fof(a15,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& first_mover(X1)
& founding_time(X1,X2) )
=> number_of_routines(X1,X2,low) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15) ).
fof(a14,hypothesis,
! [X1,X2] :
( ( organisation_at_time(X1,X2)
& efficient_producer(X1)
& founding_time(X1,X2) )
=> has_elaborated_routines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14) ).
fof(i_0_5,hypothesis,
? [X1,X2] :
( organisation_at_time(X1,X2)
& founding_time(X1,X2)
& number_of_routines(X1,X2,high)
& ~ has_elaborated_routines(X1,X2) ),
inference(fof_simplification,[status(thm)],[a16]) ).
fof(i_0_6,negated_conjecture,
~ ? [X1,X2] :
( organisation_at_time(X1,X2)
& ~ first_mover(X1)
& ~ efficient_producer(X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_t10])]) ).
fof(i_0_7,plain,
! [X13,X14] :
( ~ number_of_routines(X13,X14,low)
| ~ number_of_routines(X13,X14,high) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_not_high_and_low])]) ).
fof(i_0_8,hypothesis,
! [X17,X18] :
( ~ organisation_at_time(X17,X18)
| ~ first_mover(X17)
| ~ founding_time(X17,X18)
| number_of_routines(X17,X18,low) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a15])]) ).
fof(i_0_9,hypothesis,
! [X15,X16] :
( ~ organisation_at_time(X15,X16)
| ~ efficient_producer(X15)
| ~ founding_time(X15,X16)
| has_elaborated_routines(X15,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a14])]) ).
fof(i_0_10,hypothesis,
( organisation_at_time(esk1_0,esk2_0)
& founding_time(esk1_0,esk2_0)
& number_of_routines(esk1_0,esk2_0,high)
& ~ has_elaborated_routines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_5])]) ).
fof(i_0_11,negated_conjecture,
! [X21,X22] :
( ~ organisation_at_time(X21,X22)
| first_mover(X21)
| efficient_producer(X21) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_6])]) ).
cnf(i_0_12,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_14,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_15,hypothesis,
number_of_routines(esk1_0,esk2_0,high),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_16,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_17,hypothesis,
~ has_elaborated_routines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_18,hypothesis,
founding_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_19,hypothesis,
organisation_at_time(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_20,plain,
~ number_of_routines(esk1_0,esk2_0,low),
inference(scs_inference,[],[i_0_15,i_0_12]) ).
cnf(i_0_21,plain,
( ~ number_of_routines(X1,X2,high)
| ~ number_of_routines(X1,X2,low) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_22,plain,
~ first_mover(esk1_0),
inference(scs_inference,[],[i_0_15,i_0_19,i_0_18,i_0_12,i_0_13]) ).
cnf(i_0_23,plain,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_24,plain,
~ efficient_producer(esk1_0),
inference(scs_inference,[],[i_0_15,i_0_19,i_0_18,i_0_17,i_0_12,i_0_13,i_0_14]) ).
cnf(i_0_25,plain,
( ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2)
| has_elaborated_routines(X1,X2) ),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_26,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_19,i_0_18,i_0_17,i_0_12,i_0_13,i_0_14,i_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT041+2 : TPTP v9.2.1. Released v2.0.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 : n031.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:31:23 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.26/1.61 % Version : CSE_E---1.7
% 0.26/1.61 % Problem : theBenchmark.p
% 0.26/1.61 % SZS status Theorem for theBenchmark.p
% 0.26/1.61 % SZS output start CNFRefutation
% See solution above
% 0.26/1.64 % Total time : 1.271s
%------------------------------------------------------------------------------