↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Computer : n015.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 : Wed Apr  9 06:14:32 PM UTC 2025

% Result   : Theorem 4.00s 2.22s
% Output   : CNFRefutation 4.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   13 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   29 (  13   ~;   9   |;   4   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-4 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (  25   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_lines > left_convergent_lines > left_apart_point > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > line_connecting > intersection_point > #nlpp > reverse_line > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(line_connecting,type,
    line_connecting: ( $i * $i ) > $i ).

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

tff(intersection_point,type,
    intersection_point: ( $i * $i ) > $i ).

tff(parallel_through_point,type,
    parallel_through_point: ( $i * $i ) > $i ).

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

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

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

tff(reverse_line,type,
    reverse_line: $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_63,axiom,
    ! [L,M] :
      ( convergent_lines(L,M)
    <=> ( unequally_directed_lines(L,M)
        & unequally_directed_lines(L,reverse_line(M)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',con_def) ).

tff(f_166,axiom,
    ! [L,M] :
      ~ ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).

tff(f_156,axiom,
    ! [L,M] :
      ( ( unequally_directed_lines(L,M)
        & unequally_directed_lines(L,reverse_line(M)) )
     => ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).

tff(f_287,negated_conjecture,
    ~ ! [L,M,A,B,C] :
        ( ( between_on_line(L,A,B,C)
          & convergent_lines(L,M)
          & ~ apart_point_and_line(B,M) )
       => divides_points(M,A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(c_12,plain,
    ! [L_3,M_4] :
      ( unequally_directed_lines(L_3,M_4)
      | ~ convergent_lines(L_3,M_4) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_172,plain,
    ! [L_100,M_101] :
      ( unequally_directed_lines(L_100,reverse_line(M_101))
      | ~ convergent_lines(L_100,M_101) ),
    inference(cnfTransformation,[status(thm)],[f_63]) ).

tff(c_80,plain,
    ! [L_36,M_37] : ~ left_convergent_lines(L_36,M_37),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_74,plain,
    ! [L_32,M_33] :
      ( left_convergent_lines(L_32,reverse_line(M_33))
      | left_convergent_lines(L_32,M_33)
      | ~ unequally_directed_lines(L_32,reverse_line(M_33))
      | ~ unequally_directed_lines(L_32,M_33) ),
    inference(cnfTransformation,[status(thm)],[f_156]) ).

tff(c_132,plain,
    ! [L_32,M_33] :
      ( ~ unequally_directed_lines(L_32,reverse_line(M_33))
      | ~ unequally_directed_lines(L_32,M_33) ),
    inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).

tff(c_188,plain,
    ! [L_103,M_104] :
      ( ~ unequally_directed_lines(L_103,M_104)
      | ~ convergent_lines(L_103,M_104) ),
    inference(resolution,[status(thm)],[c_172,c_132]) ).

tff(c_196,plain,
    ! [L_3,M_4] : ~ convergent_lines(L_3,M_4),
    inference(resolution,[status(thm)],[c_12,c_188]) ).

tff(c_122,plain,
    convergent_lines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_287]) ).

tff(c_198,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_196,c_122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08  % Problem  : GEO261+1 : TPTP v9.0.0. Bugfixed v6.4.0.
% 0.04/0.09  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.08/0.28  % Computer : n015.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 300
% 0.08/0.29  % DateTime : Mon Apr  7 20:04:05 EDT 2025
% 0.08/0.29  % CPUTime  : 
% 4.00/2.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.33/2.23  
% 4.33/2.23  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------