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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO217+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/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 : n008.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:43 EDT 2023

% Result   : Theorem 5.50s 2.23s
% Output   : CNFRefutation 5.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   41 (  10 unt;  19 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  11   ~;  14   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   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   :   27 (;  27   !;   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_434,negated_conjecture,
    ~ ! [L,M,N] :
        ( ( parallel_lines(L,M)
          & parallel_lines(L,N) )
       => parallel_lines(M,N) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f_415,axiom,
    ! [X,Y] :
      ( parallel_lines(X,Y)
    <=> ~ convergent_lines(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a3) ).

tff(f_78,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_60,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).

tff(c_96,plain,
    parallel_lines('#skF_1','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_434]) ).

tff(c_119,plain,
    ! [X_101,Y_102] :
      ( ~ convergent_lines(X_101,Y_102)
      | ~ parallel_lines(X_101,Y_102) ),
    inference(cnfTransformation,[status(thm)],[f_415]) ).

tff(c_130,plain,
    ~ convergent_lines('#skF_1','#skF_3'),
    inference(resolution,[status(thm)],[c_96,c_119]) ).

tff(c_113,plain,
    ! [X_97,Y_98] :
      ( parallel_lines(X_97,Y_98)
      | convergent_lines(X_97,Y_98) ),
    inference(cnfTransformation,[status(thm)],[f_415]) ).

tff(c_94,plain,
    ~ parallel_lines('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_434]) ).

tff(c_117,plain,
    convergent_lines('#skF_2','#skF_3'),
    inference(resolution,[status(thm)],[c_113,c_94]) ).

tff(c_185,plain,
    ! [Y_138,Z_139,X_140] :
      ( convergent_lines(Y_138,Z_139)
      | convergent_lines(X_140,Z_139)
      | ~ convergent_lines(X_140,Y_138) ),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_208,plain,
    ! [Z_144] :
      ( convergent_lines('#skF_3',Z_144)
      | convergent_lines('#skF_2',Z_144) ),
    inference(resolution,[status(thm)],[c_117,c_185]) ).

tff(c_12,plain,
    ! [Y_11,Z_12,X_10] :
      ( convergent_lines(Y_11,Z_12)
      | convergent_lines(X_10,Z_12)
      | ~ convergent_lines(X_10,Y_11) ),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

tff(c_418,plain,
    ! [Z_186,Z_187] :
      ( convergent_lines(Z_186,Z_187)
      | convergent_lines('#skF_2',Z_187)
      | convergent_lines('#skF_3',Z_186) ),
    inference(resolution,[status(thm)],[c_208,c_12]) ).

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

tff(c_465,plain,
    ! [Z_188] :
      ( convergent_lines(Z_188,'#skF_2')
      | convergent_lines('#skF_3',Z_188) ),
    inference(resolution,[status(thm)],[c_418,c_6]) ).

tff(c_1651,plain,
    ! [Z_300,Z_301] :
      ( convergent_lines(Z_300,Z_301)
      | convergent_lines('#skF_3',Z_301)
      | convergent_lines(Z_300,'#skF_2') ),
    inference(resolution,[status(thm)],[c_465,c_12]) ).

tff(c_1753,plain,
    ! [Z_304] :
      ( convergent_lines(Z_304,'#skF_3')
      | convergent_lines(Z_304,'#skF_2') ),
    inference(resolution,[status(thm)],[c_1651,c_6]) ).

tff(c_98,plain,
    parallel_lines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_434]) ).

tff(c_131,plain,
    ~ convergent_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_98,c_119]) ).

tff(c_1762,plain,
    convergent_lines('#skF_1','#skF_3'),
    inference(resolution,[status(thm)],[c_1753,c_131]) ).

tff(c_1777,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_130,c_1762]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO217+3 : TPTP v8.1.2. Released v4.0.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.34  % Computer : n008.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 : Fri Aug  4 00:37:18 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 5.50/2.23  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.50/2.24  
% 5.50/2.24  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.50/2.26  
% 5.50/2.26  Inference rules
% 5.50/2.26  ----------------------
% 5.50/2.26  #Ref     : 0
% 5.50/2.26  #Sup     : 313
% 5.50/2.26  #Fact    : 40
% 5.50/2.26  #Define  : 0
% 5.50/2.26  #Split   : 0
% 5.50/2.26  #Chain   : 0
% 5.50/2.26  #Close   : 0
% 5.50/2.26  
% 5.50/2.26  Ordering : KBO
% 5.50/2.26  
% 5.50/2.26  Simplification rules
% 5.50/2.26  ----------------------
% 5.50/2.26  #Subsume      : 66
% 5.50/2.26  #Demod        : 63
% 5.50/2.26  #Tautology    : 69
% 5.50/2.26  #SimpNegUnit  : 11
% 5.50/2.26  #BackRed      : 0
% 5.50/2.26  
% 5.50/2.26  #Partial instantiations: 0
% 5.50/2.26  #Strategies tried      : 1
% 5.50/2.26  
% 5.50/2.26  Timing (in seconds)
% 5.50/2.26  ----------------------
% 5.50/2.27  Preprocessing        : 0.56
% 5.50/2.27  Parsing              : 0.31
% 5.50/2.27  CNF conversion       : 0.04
% 5.50/2.27  Main loop            : 0.70
% 5.50/2.27  Inferencing          : 0.28
% 5.50/2.27  Reduction            : 0.17
% 5.50/2.27  Demodulation         : 0.11
% 5.50/2.27  BG Simplification    : 0.04
% 5.50/2.27  Subsumption          : 0.17
% 5.50/2.27  Abstraction          : 0.02
% 5.50/2.27  MUC search           : 0.00
% 5.50/2.27  Cooper               : 0.00
% 5.50/2.27  Total                : 1.31
% 5.50/2.27  Index Insertion      : 0.00
% 5.50/2.27  Index Deletion       : 0.00
% 5.50/2.27  Index Matching       : 0.00
% 5.50/2.27  BG Taut test         : 0.00
%------------------------------------------------------------------------------