TSTP Solution File: MGT041-2 by Metis---2.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n026.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  : 600s
% DateTime : Sun Jul 17 22:19:48 EDT 2022

% Result   : Unsatisfiable 0.12s 0.34s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (   7 unt;   4 nHn;  22 RR)
%            Number of literals    :   49 (   0 equ;  26 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   :    8 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(mp_not_high_and_low_1,axiom,
    ( ~ number_of_routines(A,B,low)
    | ~ number_of_routines(A,B,high) ) ).

cnf(a14_2,hypothesis,
    ( ~ organisation_at_time(A,B)
    | ~ efficient_producer(A)
    | ~ founding_time(A,B)
    | has_elaborated_routines(A,B) ) ).

cnf(a15_3,hypothesis,
    ( ~ organisation_at_time(A,B)
    | ~ first_mover(A)
    | ~ founding_time(A,B)
    | number_of_routines(A,B,low) ) ).

cnf(a16_4,hypothesis,
    organisation_at_time(sk1,sk2) ).

cnf(a16_5,hypothesis,
    founding_time(sk1,sk2) ).

cnf(a16_6,hypothesis,
    number_of_routines(sk1,sk2,high) ).

cnf(a16_7,hypothesis,
    ~ has_elaborated_routines(sk1,sk2) ).

cnf(prove_t10_8,negated_conjecture,
    ( ~ organisation_at_time(A,B)
    | first_mover(A)
    | efficient_producer(A) ) ).

cnf(refute_0_0,plain,
    ( ~ efficient_producer(sk1)
    | ~ founding_time(sk1,sk2)
    | ~ organisation_at_time(sk1,sk2)
    | has_elaborated_routines(sk1,sk2) ),
    inference(subst,[],[a14_2:[bind(A,$fot(sk1)),bind(B,$fot(sk2))]]) ).

cnf(refute_0_1,plain,
    ( ~ efficient_producer(sk1)
    | ~ founding_time(sk1,sk2)
    | has_elaborated_routines(sk1,sk2) ),
    inference(resolve,[$cnf( organisation_at_time(sk1,sk2) )],[a16_4,refute_0_0]) ).

cnf(refute_0_2,plain,
    ( ~ number_of_routines(sk1,sk2,high)
    | ~ number_of_routines(sk1,sk2,low) ),
    inference(subst,[],[mp_not_high_and_low_1:[bind(A,$fot(sk1)),bind(B,$fot(sk2))]]) ).

cnf(refute_0_3,plain,
    ( ~ organisation_at_time(sk1,sk2)
    | efficient_producer(sk1)
    | first_mover(sk1) ),
    inference(subst,[],[prove_t10_8:[bind(A,$fot(sk1)),bind(B,$fot(sk2))]]) ).

cnf(refute_0_4,plain,
    ( efficient_producer(sk1)
    | first_mover(sk1) ),
    inference(resolve,[$cnf( organisation_at_time(sk1,sk2) )],[a16_4,refute_0_3]) ).

cnf(refute_0_5,plain,
    ( ~ first_mover(sk1)
    | ~ founding_time(sk1,sk2)
    | ~ organisation_at_time(sk1,sk2)
    | number_of_routines(sk1,sk2,low) ),
    inference(subst,[],[a15_3:[bind(A,$fot(sk1)),bind(B,$fot(sk2))]]) ).

cnf(refute_0_6,plain,
    ( ~ first_mover(sk1)
    | ~ founding_time(sk1,sk2)
    | number_of_routines(sk1,sk2,low) ),
    inference(resolve,[$cnf( organisation_at_time(sk1,sk2) )],[a16_4,refute_0_5]) ).

cnf(refute_0_7,plain,
    ( ~ first_mover(sk1)
    | number_of_routines(sk1,sk2,low) ),
    inference(resolve,[$cnf( founding_time(sk1,sk2) )],[a16_5,refute_0_6]) ).

cnf(refute_0_8,plain,
    ( efficient_producer(sk1)
    | number_of_routines(sk1,sk2,low) ),
    inference(resolve,[$cnf( first_mover(sk1) )],[refute_0_4,refute_0_7]) ).

cnf(refute_0_9,plain,
    ( ~ number_of_routines(sk1,sk2,high)
    | efficient_producer(sk1) ),
    inference(resolve,[$cnf( number_of_routines(sk1,sk2,low) )],[refute_0_8,refute_0_2]) ).

cnf(refute_0_10,plain,
    efficient_producer(sk1),
    inference(resolve,[$cnf( number_of_routines(sk1,sk2,high) )],[a16_6,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( ~ founding_time(sk1,sk2)
    | has_elaborated_routines(sk1,sk2) ),
    inference(resolve,[$cnf( efficient_producer(sk1) )],[refute_0_10,refute_0_1]) ).

cnf(refute_0_12,plain,
    has_elaborated_routines(sk1,sk2),
    inference(resolve,[$cnf( founding_time(sk1,sk2) )],[a16_5,refute_0_11]) ).

cnf(refute_0_13,plain,
    $false,
    inference(resolve,[$cnf( has_elaborated_routines(sk1,sk2) )],[refute_0_12,a16_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12  % Command  : metis --show proof --show saturation %s
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun  9 07:39:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.12/0.34  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  
% 0.12/0.34  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 0.12/0.34  
%------------------------------------------------------------------------------