↑ Up

Metis---2.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : MGT041-2 : TPTP v9.3.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n019.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 : Tue Sep  8 06:16:09 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.36s
% Output   : CNFRefutation 0.13s
% 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.00/0.03  % Problem  : MGT041-2 : TPTP v9.3.0. Released v2.4.0.
% 0.00/0.04  % Command  : metis --show proof --show saturation %s
% 0.09/0.35  % Computer : n019.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep  7 13:03:22 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.36  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36  
% 0.13/0.36  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.13/0.36  
%------------------------------------------------------------------------------