TSTP Solution File: GEO178+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO178+3 : TPTP v8.1.2. Released v4.0.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 : n006.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:27 EDT 2023

% Result   : Theorem 4.11s 2.01s
% Output   : CNFRefutation 4.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   39 (   9 unt;  19 typ;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   28 (  10   ~;  12   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   30 (  16   >;  14   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (;  35   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ unorthogonal_lines > parallel_lines > orthogonal_lines > incident_point_and_line > equal_points > equal_lines > 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_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_437,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( distinct_points(X,Y)
          & apart_point_and_line(Z,line_connecting(X,Y)) )
       => ( distinct_points(Z,X)
          & distinct_points(Z,Y) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f_126,axiom,
    ! [X,Y,Z] :
      ( apart_point_and_line(X,Y)
     => ( distinct_lines(Y,Z)
        | apart_point_and_line(X,Z) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).

tff(f_160,axiom,
    ! [X,Y] :
      ( distinct_lines(X,Y)
     => convergent_lines(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).

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

tff(f_61,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).

tff(f_188,axiom,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).

tff(f_191,axiom,
    ! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).

tff(c_96,plain,
    apart_point_and_line('#skF_3',line_connecting('#skF_1','#skF_2')),
    inference(cnfTransformation,[status(thm)],[f_437]) ).

tff(c_471,plain,
    ! [X_236,Z_237,Y_238] :
      ( apart_point_and_line(X_236,Z_237)
      | distinct_lines(Y_238,Z_237)
      | ~ apart_point_and_line(X_236,Y_238) ),
    inference(cnfTransformation,[status(thm)],[f_126]) ).

tff(c_476,plain,
    ! [Z_242] :
      ( apart_point_and_line('#skF_3',Z_242)
      | distinct_lines(line_connecting('#skF_1','#skF_2'),Z_242) ),
    inference(resolution,[status(thm)],[c_96,c_471]) ).

tff(c_30,plain,
    ! [X_34,Y_35] :
      ( convergent_lines(X_34,Y_35)
      | ~ distinct_lines(X_34,Y_35) ),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

tff(c_484,plain,
    ! [Z_242] :
      ( convergent_lines(line_connecting('#skF_1','#skF_2'),Z_242)
      | apart_point_and_line('#skF_3',Z_242) ),
    inference(resolution,[status(thm)],[c_476,c_30]) ).

tff(c_511,plain,
    ! [Y_250,Z_251,X_252] :
      ( convergent_lines(Y_250,Z_251)
      | convergent_lines(X_252,Z_251)
      | ~ convergent_lines(X_252,Y_250) ),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_564,plain,
    ! [Z_260,Z_261] :
      ( convergent_lines(Z_260,Z_261)
      | convergent_lines(line_connecting('#skF_1','#skF_2'),Z_261)
      | apart_point_and_line('#skF_3',Z_260) ),
    inference(resolution,[status(thm)],[c_484,c_511]) ).

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

tff(c_614,plain,
    ! [Z_265] :
      ( convergent_lines(Z_265,line_connecting('#skF_1','#skF_2'))
      | apart_point_and_line('#skF_3',Z_265) ),
    inference(resolution,[status(thm)],[c_564,c_6]) ).

tff(c_32,plain,
    ! [Y_37,X_36] : ~ convergent_lines(parallel_through_point(Y_37,X_36),Y_37),
    inference(cnfTransformation,[status(thm)],[f_188]) ).

tff(c_635,plain,
    ! [X_266] : apart_point_and_line('#skF_3',parallel_through_point(line_connecting('#skF_1','#skF_2'),X_266)),
    inference(resolution,[status(thm)],[c_614,c_32]) ).

tff(c_34,plain,
    ! [X_38,Y_39] : ~ apart_point_and_line(X_38,parallel_through_point(Y_39,X_38)),
    inference(cnfTransformation,[status(thm)],[f_191]) ).

tff(c_643,plain,
    $false,
    inference(resolution,[status(thm)],[c_635,c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO178+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % 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.16/0.35  % Computer : n006.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit : 300
% 0.16/0.35  % WCLimit  : 300
% 0.16/0.35  % DateTime : Fri Aug  4 00:16:58 EDT 2023
% 0.16/0.35  % CPUTime  : 
% 4.11/2.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.11/2.01  
% 4.11/2.01  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.11/2.04  
% 4.11/2.04  Inference rules
% 4.11/2.04  ----------------------
% 4.11/2.04  #Ref     : 0
% 4.11/2.04  #Sup     : 103
% 4.11/2.04  #Fact    : 4
% 4.11/2.04  #Define  : 0
% 4.11/2.04  #Split   : 1
% 4.11/2.04  #Chain   : 0
% 4.11/2.04  #Close   : 0
% 4.11/2.04  
% 4.11/2.04  Ordering : KBO
% 4.11/2.04  
% 4.11/2.04  Simplification rules
% 4.11/2.04  ----------------------
% 4.11/2.04  #Subsume      : 7
% 4.11/2.04  #Demod        : 21
% 4.11/2.04  #Tautology    : 29
% 4.11/2.04  #SimpNegUnit  : 1
% 4.11/2.04  #BackRed      : 0
% 4.11/2.04  
% 4.11/2.04  #Partial instantiations: 0
% 4.11/2.04  #Strategies tried      : 1
% 4.11/2.04  
% 4.11/2.04  Timing (in seconds)
% 4.11/2.04  ----------------------
% 4.11/2.04  Preprocessing        : 0.54
% 4.11/2.04  Parsing              : 0.30
% 4.11/2.04  CNF conversion       : 0.04
% 4.11/2.04  Main loop            : 0.46
% 4.11/2.04  Inferencing          : 0.18
% 4.11/2.04  Reduction            : 0.11
% 4.11/2.04  Demodulation         : 0.07
% 4.11/2.04  BG Simplification    : 0.03
% 4.11/2.04  Subsumption          : 0.11
% 4.11/2.04  Abstraction          : 0.01
% 4.11/2.04  MUC search           : 0.00
% 4.11/2.04  Cooper               : 0.00
% 4.11/2.04  Total                : 1.04
% 4.11/2.04  Index Insertion      : 0.00
% 4.11/2.04  Index Deletion       : 0.00
% 4.11/2.04  Index Matching       : 0.00
% 4.11/2.04  BG Taut test         : 0.00
%------------------------------------------------------------------------------