↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : TIM031_1 : TPTP v9.3.0. Released v9.3.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 : n017.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 07:15:48 PM UTC 2026

% Result   : Theorem 3.90s 1.93s
% Output   : CNFRefutation 3.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   31 (  23 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  16   ~;   8   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   12 (  12   !;   0   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
%$ starts > started_by > overlaps > overlapped_by > met_by > meets > finishes > finished_by > during > contains > before > after > #nlpp > h > g > f > e > d > c > b > a

%Foreground sorts:
tff(interval,type,
    interval: $tType ).

%Background operators:

%Foreground operators:
tff(starts,type,
    starts: ( interval * interval ) > $o ).

tff(overlapped_by,type,
    overlapped_by: ( interval * interval ) > $o ).

tff(h,type,
    h: interval ).

tff(f,type,
    f: interval ).

tff(finished_by,type,
    finished_by: ( interval * interval ) > $o ).

tff(e,type,
    e: interval ).

tff(during,type,
    during: ( interval * interval ) > $o ).

tff(before,type,
    before: ( interval * interval ) > $o ).

tff(a,type,
    a: interval ).

tff(meets,type,
    meets: ( interval * interval ) > $o ).

tff(overlaps,type,
    overlaps: ( interval * interval ) > $o ).

tff(contains,type,
    contains: ( interval * interval ) > $o ).

tff(after,type,
    after: ( interval * interval ) > $o ).

tff(started_by,type,
    started_by: ( interval * interval ) > $o ).

tff(finishes,type,
    finishes: ( interval * interval ) > $o ).

tff(c,type,
    c: interval ).

tff(d,type,
    d: interval ).

tff(g,type,
    g: interval ).

tff(b,type,
    b: interval ).

tff(met_by,type,
    met_by: ( interval * interval ) > $o ).

tff(f_87,axiom,
    before(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).

tff(f_88,axiom,
    before(b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).

tff(f_84,axiom,
    ! [I: interval,J: interval,K: interval] :
      ( ( before(I,J)
        & before(J,K) )
     => before(I,K) ),
    file('/export/starexec/sandbox/benchmark/Axioms/TIM002_0.ax',before_transitive) ).

tff(f_89,axiom,
    before(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3) ).

tff(f_90,axiom,
    before(d,e),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p4) ).

tff(f_91,axiom,
    before(e,f),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p5) ).

tff(f_92,axiom,
    before(f,g),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p6) ).

tff(f_93,axiom,
    before(g,h),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p7) ).

tff(f_95,negated_conjecture,
    ~ before(a,h),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

tff(c_30,plain,
    before(a,b),
    inference(cnfTransformation,[status(thm)],[f_87]) ).

tff(c_32,plain,
    before(b,c),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_120,plain,
    ! [I_43: interval,K_44: interval,J_45: interval] :
      ( before(I_43,K_44)
      | ~ before(J_45,K_44)
      | ~ before(I_43,J_45) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_139,plain,
    ! [I_43: interval] :
      ( before(I_43,c)
      | ~ before(I_43,b) ),
    inference(resolution,[status(thm)],[c_32,c_120]) ).

tff(c_34,plain,
    before(c,d),
    inference(cnfTransformation,[status(thm)],[f_89]) ).

tff(c_138,plain,
    ! [I_43: interval] :
      ( before(I_43,d)
      | ~ before(I_43,c) ),
    inference(resolution,[status(thm)],[c_34,c_120]) ).

tff(c_36,plain,
    before(d,e),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_141,plain,
    ! [I_43: interval] :
      ( before(I_43,e)
      | ~ before(I_43,d) ),
    inference(resolution,[status(thm)],[c_36,c_120]) ).

tff(c_38,plain,
    before(e,f),
    inference(cnfTransformation,[status(thm)],[f_91]) ).

tff(c_143,plain,
    ! [I_43: interval] :
      ( before(I_43,f)
      | ~ before(I_43,e) ),
    inference(resolution,[status(thm)],[c_38,c_120]) ).

tff(c_40,plain,
    before(f,g),
    inference(cnfTransformation,[status(thm)],[f_92]) ).

tff(c_225,plain,
    ! [I_50: interval] :
      ( before(I_50,g)
      | ~ before(I_50,f) ),
    inference(resolution,[status(thm)],[c_40,c_120]) ).

tff(c_42,plain,
    before(g,h),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_162,plain,
    ! [I_47: interval] :
      ( before(I_47,h)
      | ~ before(I_47,g) ),
    inference(resolution,[status(thm)],[c_42,c_120]) ).

tff(c_44,plain,
    ~ before(a,h),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_178,plain,
    ~ before(a,g),
    inference(resolution,[status(thm)],[c_162,c_44]) ).

tff(c_241,plain,
    ~ before(a,f),
    inference(resolution,[status(thm)],[c_225,c_178]) ).

tff(c_276,plain,
    ~ before(a,e),
    inference(resolution,[status(thm)],[c_143,c_241]) ).

tff(c_329,plain,
    ~ before(a,d),
    inference(resolution,[status(thm)],[c_141,c_276]) ).

tff(c_390,plain,
    ~ before(a,c),
    inference(resolution,[status(thm)],[c_138,c_329]) ).

tff(c_502,plain,
    ~ before(a,b),
    inference(resolution,[status(thm)],[c_139,c_390]) ).

tff(c_509,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_30,c_502]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : TIM031_1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % 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.16/0.34  % Computer : n017.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Mon May  4 18:28:57 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 3.90/1.93  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.90/1.94  
% 3.90/1.94  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------