↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO210+2 : 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/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:16 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ unorthogonal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > parallel_through_point > orthogonal_through_point > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_3 > #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('#skF_2',type,
    '#skF_2': $i ).

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

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

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

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

tff(f_241,negated_conjecture,
    ~ ! [A,L,M] :
        ( ( ~ apart_point_and_line(A,L)
          & ~ unorthogonal_lines(L,M) )
       => ~ distinct_lines(L,orthogonal_through_point(M,A)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f_229,axiom,
    ! [A,L,M,N] :
      ( distinct_lines(L,M)
     => ( apart_point_and_line(A,L)
        | apart_point_and_line(A,M)
        | unorthogonal_lines(L,N)
        | unorthogonal_lines(M,N) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ouo1) ).

tff(f_218,axiom,
    ! [A,L] : ~ apart_point_and_line(A,orthogonal_through_point(L,A)),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc2) ).

tff(f_215,axiom,
    ! [A,L] : ~ unorthogonal_lines(orthogonal_through_point(L,A),L),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).

tff(c_54,plain,
    ~ unorthogonal_lines('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_241]) ).

tff(c_56,plain,
    ~ apart_point_and_line('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_241]) ).

tff(c_52,plain,
    distinct_lines('#skF_2',orthogonal_through_point('#skF_3','#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_241]) ).

tff(c_2387,plain,
    ! [M_280,N_281,L_282,A_283] :
      ( unorthogonal_lines(M_280,N_281)
      | unorthogonal_lines(L_282,N_281)
      | apart_point_and_line(A_283,M_280)
      | apart_point_and_line(A_283,L_282)
      | ~ distinct_lines(L_282,M_280) ),
    inference(cnfTransformation,[status(thm)],[f_229]) ).

tff(c_2606,plain,
    ! [N_281,A_283] :
      ( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_281)
      | unorthogonal_lines('#skF_2',N_281)
      | apart_point_and_line(A_283,orthogonal_through_point('#skF_3','#skF_1'))
      | apart_point_and_line(A_283,'#skF_2') ),
    inference(resolution,[status(thm)],[c_52,c_2387]) ).

tff(c_2703,plain,
    ! [A_289] :
      ( apart_point_and_line(A_289,orthogonal_through_point('#skF_3','#skF_1'))
      | apart_point_and_line(A_289,'#skF_2') ),
    inference(splitLeft,[status(thm)],[c_2606]) ).

tff(c_48,plain,
    ! [A_45,L_46] : ~ apart_point_and_line(A_45,orthogonal_through_point(L_46,A_45)),
    inference(cnfTransformation,[status(thm)],[f_218]) ).

tff(c_2719,plain,
    apart_point_and_line('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_2703,c_48]) ).

tff(c_2727,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_56,c_2719]) ).

tff(c_2736,plain,
    ! [N_291] :
      ( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_291)
      | unorthogonal_lines('#skF_2',N_291) ),
    inference(splitRight,[status(thm)],[c_2606]) ).

tff(c_46,plain,
    ! [L_44,A_43] : ~ unorthogonal_lines(orthogonal_through_point(L_44,A_43),L_44),
    inference(cnfTransformation,[status(thm)],[f_215]) ).

tff(c_2748,plain,
    unorthogonal_lines('#skF_2','#skF_3'),
    inference(resolution,[status(thm)],[c_2736,c_46]) ).

tff(c_2756,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_54,c_2748]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO210+2 : TPTP v9.0.0. Released v3.3.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.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Apr  7 19:58:36 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 6.49/2.54  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.49/2.54  
% 6.49/2.54  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------