↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n009.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:02:58 AM UTC 2026

% Result   : Theorem 3.02s 2.16s
% Output   : CNFRefutation 3.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   53 (  24   ~;  17   |;  10   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            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   :   20 (  16   !;   4   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ number_of_routines > organisation_at_time > has_elaborated_routines > founding_time > first_mover > efficient_producer > #nlpp > low > high > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(high,type,
    high: $i ).

tff(has_elaborated_routines,type,
    has_elaborated_routines: ( $i * $i ) > $o ).

tff(efficient_producer,type,
    efficient_producer: $i > $o ).

tff(low,type,
    low: $i ).

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

tff(founding_time,type,
    founding_time: ( $i * $i ) > $o ).

tff(organisation_at_time,type,
    organisation_at_time: ( $i * $i ) > $o ).

tff(first_mover,type,
    first_mover: $i > $o ).

tff(number_of_routines,type,
    number_of_routines: ( $i * $i * $i ) > $o ).

tff(f_64,hypothesis,
    ? [X,T] :
      ( organisation_at_time(X,T)
      & founding_time(X,T)
      & number_of_routines(X,T,high)
      & ~ has_elaborated_routines(X,T) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a16) ).

tff(f_75,negated_conjecture,
    ~ ? [X,T] :
        ( organisation_at_time(X,T)
        & ~ first_mover(X)
        & ~ efficient_producer(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_t10) ).

tff(f_53,hypothesis,
    ! [X,T] :
      ( ( organisation_at_time(X,T)
        & first_mover(X)
        & founding_time(X,T) )
     => number_of_routines(X,T,low) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a15) ).

tff(f_33,axiom,
    ! [X,T] :
      ~ ( number_of_routines(X,T,low)
        & number_of_routines(X,T,high) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp_not_high_and_low) ).

tff(f_43,hypothesis,
    ! [X,T] :
      ( ( organisation_at_time(X,T)
        & efficient_producer(X)
        & founding_time(X,T) )
     => has_elaborated_routines(X,T) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a14) ).

tff(c_8,plain,
    ~ has_elaborated_routines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_14,plain,
    organisation_at_time('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_17,plain,
    ! [X_9,T_10] :
      ( efficient_producer(X_9)
      | first_mover(X_9)
      | ~ organisation_at_time(X_9,T_10) ),
    inference(cnfTransformation,[status(thm)],[f_75]) ).

tff(c_21,plain,
    ( efficient_producer('#skF_1')
    | first_mover('#skF_1') ),
    inference(resolution,[status(thm)],[c_14,c_17]) ).

tff(c_23,plain,
    first_mover('#skF_1'),
    inference(splitLeft,[status(thm)],[c_21]) ).

tff(c_12,plain,
    founding_time('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_10,plain,
    number_of_routines('#skF_1','#skF_2',high),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_32,plain,
    ! [X_15,T_16] :
      ( number_of_routines(X_15,T_16,low)
      | ~ founding_time(X_15,T_16)
      | ~ first_mover(X_15)
      | ~ organisation_at_time(X_15,T_16) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_2,plain,
    ! [X_1,T_2] :
      ( ~ number_of_routines(X_1,T_2,high)
      | ~ number_of_routines(X_1,T_2,low) ),
    inference(cnfTransformation,[status(thm)],[f_33]) ).

tff(c_37,plain,
    ! [X_17,T_18] :
      ( ~ number_of_routines(X_17,T_18,high)
      | ~ founding_time(X_17,T_18)
      | ~ first_mover(X_17)
      | ~ organisation_at_time(X_17,T_18) ),
    inference(resolution,[status(thm)],[c_32,c_2]) ).

tff(c_40,plain,
    ( ~ founding_time('#skF_1','#skF_2')
    | ~ first_mover('#skF_1')
    | ~ organisation_at_time('#skF_1','#skF_2') ),
    inference(resolution,[status(thm)],[c_10,c_37]) ).

tff(c_44,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_14,c_23,c_12,c_40]) ).

tff(c_45,plain,
    efficient_producer('#skF_1'),
    inference(splitRight,[status(thm)],[c_21]) ).

tff(c_47,plain,
    ! [X_19,T_20] :
      ( has_elaborated_routines(X_19,T_20)
      | ~ founding_time(X_19,T_20)
      | ~ efficient_producer(X_19)
      | ~ organisation_at_time(X_19,T_20) ),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_50,plain,
    ( has_elaborated_routines('#skF_1','#skF_2')
    | ~ founding_time('#skF_1','#skF_2')
    | ~ efficient_producer('#skF_1') ),
    inference(resolution,[status(thm)],[c_14,c_47]) ).

tff(c_53,plain,
    has_elaborated_routines('#skF_1','#skF_2'),
    inference(demodulation,[status(thm),theory(equality)],[c_45,c_12,c_50]) ).

tff(c_55,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_8,c_53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep  7 13:02:22 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 3.02/2.16  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.02/2.16  
% 3.02/2.16  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------