↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO227+3 : TPTP v9.0.0. Released v4.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 : n024.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:23 PM UTC 2025

% Result   : Theorem 4.06s 2.00s
% Output   : CNFRefutation 4.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   25 (  13   ~;   8   |;   1   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   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  :   19 (  18 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_opposite_lines > unequally_directed_lines > right_convergent_lines > right_apart_point > left_convergent_lines > left_apart_point > incident_point_and_line > equally_directed_opposite_lines > equally_directed_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > line_connecting > intersection_point > #nlpp > reverse_line > #skF_2 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

tff(unequally_directed_opposite_lines,type,
    unequally_directed_opposite_lines: ( $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(equally_directed_opposite_lines,type,
    equally_directed_opposite_lines: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

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

tff(f_287,negated_conjecture,
    ~ ! [L,M] :
        ~ ( equally_directed_lines(L,M)
          & equally_directed_opposite_lines(L,M) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f_155,axiom,
    ! [L,M] :
      ( unequally_directed_lines(L,M)
      | unequally_directed_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).

tff(f_53,axiom,
    ! [X,Y] :
      ( unequally_directed_opposite_lines(X,Y)
    <=> unequally_directed_lines(X,reverse_line(Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a1_defns) ).

tff(f_71,axiom,
    ! [X,Y] :
      ( equally_directed_opposite_lines(X,Y)
    <=> ~ unequally_directed_opposite_lines(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a5_defns) ).

tff(f_66,axiom,
    ! [X,Y] :
      ( equally_directed_lines(X,Y)
    <=> ~ unequally_directed_lines(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a4_defns) ).

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

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

tff(c_88,plain,
    ! [L_40,M_41] :
      ( unequally_directed_lines(L_40,reverse_line(M_41))
      | unequally_directed_lines(L_40,M_41) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_221,plain,
    ! [X_133,Y_134] :
      ( unequally_directed_opposite_lines(X_133,Y_134)
      | ~ unequally_directed_lines(X_133,reverse_line(Y_134)) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_240,plain,
    ! [L_135,M_136] :
      ( unequally_directed_opposite_lines(L_135,M_136)
      | unequally_directed_lines(L_135,M_136) ),
    inference(resolution,[status(thm)],[c_88,c_221]) ).

tff(c_18,plain,
    ! [X_9,Y_10] :
      ( ~ unequally_directed_opposite_lines(X_9,Y_10)
      | ~ equally_directed_opposite_lines(X_9,Y_10) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_245,plain,
    ! [L_137,M_138] :
      ( ~ equally_directed_opposite_lines(L_137,M_138)
      | unequally_directed_lines(L_137,M_138) ),
    inference(resolution,[status(thm)],[c_240,c_18]) ).

tff(c_14,plain,
    ! [X_7,Y_8] :
      ( ~ unequally_directed_lines(X_7,Y_8)
      | ~ equally_directed_lines(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_255,plain,
    ! [L_139,M_140] :
      ( ~ equally_directed_lines(L_139,M_140)
      | ~ equally_directed_opposite_lines(L_139,M_140) ),
    inference(resolution,[status(thm)],[c_245,c_14]) ).

tff(c_258,plain,
    ~ equally_directed_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_134,c_255]) ).

tff(c_262,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_136,c_258]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO227+3 : TPTP v9.0.0. Released v4.0.0.
% 0.03/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.13/0.34  % Computer : n024.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:01:06 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 4.06/2.00  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.06/2.00  
% 4.06/2.00  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------