↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO225+1 : TPTP v9.0.0. Released v3.3.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 : n005.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:22 PM UTC 2025

% Result   : Theorem 3.08s 1.71s
% Output   : CNFRefutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   10 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   22 (  11   ~;   4   |;   3   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   13 (  12   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > orthogonal_through_point > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_1

%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(orthogonal_through_point,type,
    orthogonal_through_point: ( $i * $i ) > $i ).

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

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

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

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

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

tff(f_204,negated_conjecture,
    ~ ! [A,B] :
        ( ( point(A)
          & point(B)
          & distinct_points(A,B) )
       => ? [X] :
            ( line(X)
           => ( ~ apart_point_and_line(A,X)
              & ~ apart_point_and_line(B,X) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f_88,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).

tff(f_83,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(X,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).

tff(c_42,plain,
    distinct_points('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_204]) ).

tff(c_40,plain,
    ! [X_43] :
      ( apart_point_and_line('#skF_2',X_43)
      | apart_point_and_line('#skF_1',X_43) ),
    inference(cnfTransformation,[status(thm)],[f_204]) ).

tff(c_66,plain,
    ! [Y_53,X_54] :
      ( ~ apart_point_and_line(Y_53,line_connecting(X_54,Y_53))
      | ~ distinct_points(X_54,Y_53) ),
    inference(cnfTransformation,[status(thm)],[f_88]) ).

tff(c_74,plain,
    ! [X_59] :
      ( ~ distinct_points(X_59,'#skF_2')
      | apart_point_and_line('#skF_1',line_connecting(X_59,'#skF_2')) ),
    inference(resolution,[status(thm)],[c_40,c_66]) ).

tff(c_14,plain,
    ! [X_13,Y_14] :
      ( ~ apart_point_and_line(X_13,line_connecting(X_13,Y_14))
      | ~ distinct_points(X_13,Y_14) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_78,plain,
    ~ distinct_points('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_74,c_14]) ).

tff(c_82,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_42,c_78]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GEO225+1 : TPTP v9.0.0. Released v3.3.0.
% 0.11/0.13  % 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.13/0.34  % Computer : n005.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr  7 20:00:12 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.08/1.71  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/1.72  
% 3.08/1.72  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------