TSTP Solution File: GEO221+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO221+1 : TPTP v8.1.2. 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 : 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 : Tue Aug 22 10:38:45 EDT 2023

% Result   : Theorem 5.38s 2.30s
% Output   : CNFRefutation 5.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   28 (  10 unt;  12 typ;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   23 (   9   ~;  12   |;   0   &)
%                                         (   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  :   18 (   9   >;   9   *;   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_217,axiom,
    ! [A,L] : ~ unorthogonal_lines(orthogonal_through_point(L,A),L),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).

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

tff(f_231,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_220,axiom,
    ! [A,L] : ~ apart_point_and_line(A,orthogonal_through_point(L,A)),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc2) ).

tff(c_46,plain,
    ! [L_47,A_46] : ~ unorthogonal_lines(orthogonal_through_point(L_47,A_46),L_47),
    inference(cnfTransformation,[status(thm)],[f_217]) ).

tff(c_54,plain,
    ~ apart_point_and_line('#skF_2',orthogonal_through_point('#skF_3','#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_240]) ).

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

tff(c_1240,plain,
    ! [M_248,N_249,L_250,A_251] :
      ( unorthogonal_lines(M_248,N_249)
      | unorthogonal_lines(L_250,N_249)
      | apart_point_and_line(A_251,M_248)
      | apart_point_and_line(A_251,L_250)
      | ~ distinct_lines(L_250,M_248) ),
    inference(cnfTransformation,[status(thm)],[f_231]) ).

tff(c_1357,plain,
    ! [N_249,A_251] :
      ( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_2'),N_249)
      | unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_249)
      | apart_point_and_line(A_251,orthogonal_through_point('#skF_3','#skF_2'))
      | apart_point_and_line(A_251,orthogonal_through_point('#skF_3','#skF_1')) ),
    inference(resolution,[status(thm)],[c_52,c_1240]) ).

tff(c_1443,plain,
    ! [A_263] :
      ( apart_point_and_line(A_263,orthogonal_through_point('#skF_3','#skF_2'))
      | apart_point_and_line(A_263,orthogonal_through_point('#skF_3','#skF_1')) ),
    inference(splitLeft,[status(thm)],[c_1357]) ).

tff(c_48,plain,
    ! [A_48,L_49] : ~ apart_point_and_line(A_48,orthogonal_through_point(L_49,A_48)),
    inference(cnfTransformation,[status(thm)],[f_220]) ).

tff(c_1459,plain,
    apart_point_and_line('#skF_2',orthogonal_through_point('#skF_3','#skF_1')),
    inference(resolution,[status(thm)],[c_1443,c_48]) ).

tff(c_1467,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_54,c_1459]) ).

tff(c_1469,plain,
    ! [N_264] :
      ( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_2'),N_264)
      | unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_264) ),
    inference(splitRight,[status(thm)],[c_1357]) ).

tff(c_1481,plain,
    unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),'#skF_3'),
    inference(resolution,[status(thm)],[c_1469,c_46]) ).

tff(c_1489,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_46,c_1481]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO221+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Aug  4 00:11:26 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 5.38/2.30  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.38/2.30  
% 5.38/2.30  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.76/2.33  
% 5.76/2.33  Inference rules
% 5.76/2.33  ----------------------
% 5.76/2.33  #Ref     : 0
% 5.76/2.33  #Sup     : 304
% 5.76/2.33  #Fact    : 26
% 5.76/2.33  #Define  : 0
% 5.76/2.33  #Split   : 2
% 5.76/2.33  #Chain   : 0
% 5.76/2.33  #Close   : 0
% 5.76/2.33  
% 5.76/2.33  Ordering : KBO
% 5.76/2.33  
% 5.76/2.33  Simplification rules
% 5.76/2.33  ----------------------
% 5.76/2.33  #Subsume      : 55
% 5.76/2.33  #Demod        : 43
% 5.76/2.33  #Tautology    : 47
% 5.76/2.33  #SimpNegUnit  : 12
% 5.76/2.33  #BackRed      : 0
% 5.76/2.33  
% 5.76/2.33  #Partial instantiations: 0
% 5.76/2.33  #Strategies tried      : 1
% 5.76/2.33  
% 5.76/2.33  Timing (in seconds)
% 5.76/2.33  ----------------------
% 5.76/2.33  Preprocessing        : 0.53
% 5.76/2.33  Parsing              : 0.30
% 5.76/2.33  CNF conversion       : 0.03
% 5.76/2.33  Main loop            : 0.72
% 5.76/2.33  Inferencing          : 0.27
% 5.76/2.33  Reduction            : 0.18
% 5.76/2.33  Demodulation         : 0.11
% 5.76/2.33  BG Simplification    : 0.03
% 5.76/2.33  Subsumption          : 0.19
% 5.76/2.33  Abstraction          : 0.03
% 5.76/2.33  MUC search           : 0.00
% 5.76/2.34  Cooper               : 0.00
% 5.76/2.34  Total                : 1.30
% 5.76/2.34  Index Insertion      : 0.00
% 5.76/2.34  Index Deletion       : 0.00
% 5.76/2.34  Index Matching       : 0.00
% 5.76/2.34  BG Taut test         : 0.00
%------------------------------------------------------------------------------