↑ Up

Beagle---0.9.52.THM-CRf.s

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

% Result   : Theorem 3.61s 1.89s
% Output   : CNFRefutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   27 (   8   ~;  13   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   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    :    6 (   6 usr;   2 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_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_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_58,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).

tff(f_198,axiom,
    ! [L,M] :
      ( convergent_lines(L,M)
      | unorthogonal_lines(L,M) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',occu1) ).

tff(f_236,negated_conjecture,
    ~ ! [L,M] :
        ( unorthogonal_lines(L,M)
       => unorthogonal_lines(M,L) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f_76,axiom,
    ! [X,Y,Z] :
      ( convergent_lines(X,Y)
     => ( convergent_lines(X,Z)
        | convergent_lines(Y,Z) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).

tff(f_211,axiom,
    ! [L,M,N] :
      ( ( convergent_lines(L,M)
        & unorthogonal_lines(L,M) )
     => ( ( convergent_lines(L,N)
          & unorthogonal_lines(L,N) )
        | ( convergent_lines(M,N)
          & unorthogonal_lines(M,N) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',oac1) ).

tff(c_6,plain,
    ! [X_3] : ~ convergent_lines(X_3,X_3),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_62,plain,
    ! [L_65,M_66] :
      ( unorthogonal_lines(L_65,M_66)
      | convergent_lines(L_65,M_66) ),
    inference(cnfTransformation,[status(thm)],[f_198]) ).

tff(c_52,plain,
    ~ unorthogonal_lines('#skF_2','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_236]) ).

tff(c_71,plain,
    convergent_lines('#skF_2','#skF_1'),
    inference(resolution,[status(thm)],[c_62,c_52]) ).

tff(c_104,plain,
    ! [Y_95,Z_96,X_97] :
      ( convergent_lines(Y_95,Z_96)
      | convergent_lines(X_97,Z_96)
      | ~ convergent_lines(X_97,Y_95) ),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_114,plain,
    ! [Z_98] :
      ( convergent_lines('#skF_1',Z_98)
      | convergent_lines('#skF_2',Z_98) ),
    inference(resolution,[status(thm)],[c_71,c_104]) ).

tff(c_125,plain,
    convergent_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_114,c_6]) ).

tff(c_54,plain,
    unorthogonal_lines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_236]) ).

tff(c_398,plain,
    ! [L_138,N_139,M_140] :
      ( convergent_lines(L_138,N_139)
      | unorthogonal_lines(M_140,N_139)
      | ~ unorthogonal_lines(L_138,M_140)
      | ~ convergent_lines(L_138,M_140) ),
    inference(cnfTransformation,[status(thm)],[f_211]) ).

tff(c_404,plain,
    ! [N_139] :
      ( convergent_lines('#skF_1',N_139)
      | unorthogonal_lines('#skF_2',N_139)
      | ~ convergent_lines('#skF_1','#skF_2') ),
    inference(resolution,[status(thm)],[c_54,c_398]) ).

tff(c_410,plain,
    ! [N_141] :
      ( convergent_lines('#skF_1',N_141)
      | unorthogonal_lines('#skF_2',N_141) ),
    inference(demodulation,[status(thm),theory(equality)],[c_125,c_404]) ).

tff(c_417,plain,
    convergent_lines('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_410,c_52]) ).

tff(c_423,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_6,c_417]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO214+1 : TPTP v9.0.0. Released v3.3.0.
% 0.06/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 : n018.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 19:59:02 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.61/1.89  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.61/1.89  
% 3.61/1.89  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------