↑ Up

Beagle---0.9.52.UNS-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.4.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 : n008.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:59 AM UTC 2026

% Result   : Unsatisfiable 2.80s 2.11s
% Output   : CNFRefutation 2.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   25 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   55 (  29   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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   :   18 (  18   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(low,type,
    low: $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_57,axiom,
    ~ has_elaborated_routines(sk1,sk2),
    file(unknown,unknown) ).

tff(f_53,axiom,
    organisation_at_time(sk1,sk2),
    file(unknown,unknown) ).

tff(f_64,axiom,
    ! [A,B] :
      ( ~ organisation_at_time(A,B)
      | first_mover(A)
      | efficient_producer(A) ),
    file(unknown,unknown) ).

tff(f_54,axiom,
    founding_time(sk1,sk2),
    file(unknown,unknown) ).

tff(f_55,axiom,
    number_of_routines(sk1,sk2,high),
    file(unknown,unknown) ).

tff(f_52,axiom,
    ! [A,B] :
      ( ~ organisation_at_time(A,B)
      | ~ first_mover(A)
      | ~ founding_time(A,B)
      | number_of_routines(A,B,low) ),
    file(unknown,unknown) ).

tff(f_30,axiom,
    ! [A,B] :
      ( ~ number_of_routines(A,B,low)
      | ~ number_of_routines(A,B,high) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [A,B] :
      ( ~ organisation_at_time(A,B)
      | ~ efficient_producer(A)
      | ~ founding_time(A,B)
      | has_elaborated_routines(A,B) ),
    file(unknown,unknown) ).

tff(c_14,plain,
    ~ has_elaborated_routines(sk1,sk2),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_8,plain,
    organisation_at_time(sk1,sk2),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_17,plain,
    ! [A_9,B_10] :
      ( efficient_producer(A_9)
      | first_mover(A_9)
      | ~ organisation_at_time(A_9,B_10) ),
    inference(cnfTransformation,[status(thm)],[f_64]) ).

tff(c_21,plain,
    ( efficient_producer(sk1)
    | first_mover(sk1) ),
    inference(resolution,[status(thm)],[c_8,c_17]) ).

tff(c_23,plain,
    first_mover(sk1),
    inference(splitLeft,[status(thm)],[c_21]) ).

tff(c_10,plain,
    founding_time(sk1,sk2),
    inference(cnfTransformation,[status(thm)],[f_54]) ).

tff(c_12,plain,
    number_of_routines(sk1,sk2,high),
    inference(cnfTransformation,[status(thm)],[f_55]) ).

tff(c_32,plain,
    ! [A_15,B_16] :
      ( number_of_routines(A_15,B_16,low)
      | ~ founding_time(A_15,B_16)
      | ~ first_mover(A_15)
      | ~ organisation_at_time(A_15,B_16) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_2,plain,
    ! [A_1,B_2] :
      ( ~ number_of_routines(A_1,B_2,high)
      | ~ number_of_routines(A_1,B_2,low) ),
    inference(cnfTransformation,[status(thm)],[f_30]) ).

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

tff(c_40,plain,
    ( ~ founding_time(sk1,sk2)
    | ~ first_mover(sk1)
    | ~ organisation_at_time(sk1,sk2) ),
    inference(resolution,[status(thm)],[c_12,c_37]) ).

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

tff(c_45,plain,
    efficient_producer(sk1),
    inference(splitRight,[status(thm)],[c_21]) ).

tff(c_47,plain,
    ! [A_19,B_20] :
      ( has_elaborated_routines(A_19,B_20)
      | ~ founding_time(A_19,B_20)
      | ~ efficient_producer(A_19)
      | ~ organisation_at_time(A_19,B_20) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_50,plain,
    ( has_elaborated_routines(sk1,sk2)
    | ~ founding_time(sk1,sk2)
    | ~ efficient_producer(sk1) ),
    inference(resolution,[status(thm)],[c_8,c_47]) ).

tff(c_53,plain,
    has_elaborated_routines(sk1,sk2),
    inference(demodulation,[status(thm),theory(equality)],[c_45,c_10,c_50]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT041-2 : TPTP v9.3.0. Released v2.4.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.08/0.36  % Computer : n008.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep  7 13:04:08 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 2.80/2.11  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.80/2.12  
% 2.80/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------