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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO206+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/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 : n010.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:39 EDT 2023

% Result   : Theorem 3.36s 2.04s
% Output   : CNFRefutation 3.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   30 (  12 unt;  10 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   28 (  12   ~;  12   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (   7   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (;  26   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > parallel_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('#skF_2',type,
    '#skF_2': $i ).

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

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

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

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

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

tff(f_78,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_159,axiom,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).

tff(f_162,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_40,plain,
    ~ apart_point_and_line('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_38,plain,
    ~ convergent_lines('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_36,plain,
    distinct_lines('#skF_2',parallel_through_point('#skF_3','#skF_1')),
    inference(cnfTransformation,[status(thm)],[f_183]) ).

tff(c_159,plain,
    ! [Y_80,Z_81,X_82] :
      ( convergent_lines(Y_80,Z_81)
      | apart_point_and_line(X_82,Z_81)
      | apart_point_and_line(X_82,Y_80)
      | ~ distinct_lines(Y_80,Z_81) ),
    inference(cnfTransformation,[status(thm)],[f_171]) ).

tff(c_177,plain,
    ! [X_82] :
      ( convergent_lines('#skF_2',parallel_through_point('#skF_3','#skF_1'))
      | apart_point_and_line(X_82,parallel_through_point('#skF_3','#skF_1'))
      | apart_point_and_line(X_82,'#skF_2') ),
    inference(resolution,[status(thm)],[c_36,c_159]) ).

tff(c_178,plain,
    convergent_lines('#skF_2',parallel_through_point('#skF_3','#skF_1')),
    inference(splitLeft,[status(thm)],[c_177]) ).

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_204,plain,
    ! [Z_87] :
      ( convergent_lines(parallel_through_point('#skF_3','#skF_1'),Z_87)
      | convergent_lines('#skF_2',Z_87) ),
    inference(resolution,[status(thm)],[c_178,c_12]) ).

tff(c_30,plain,
    ! [Y_35,X_34] : ~ convergent_lines(parallel_through_point(Y_35,X_34),Y_35),
    inference(cnfTransformation,[status(thm)],[f_159]) ).

tff(c_212,plain,
    convergent_lines('#skF_2','#skF_3'),
    inference(resolution,[status(thm)],[c_204,c_30]) ).

tff(c_222,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_38,c_212]) ).

tff(c_225,plain,
    ! [X_88] :
      ( apart_point_and_line(X_88,parallel_through_point('#skF_3','#skF_1'))
      | apart_point_and_line(X_88,'#skF_2') ),
    inference(splitRight,[status(thm)],[c_177]) ).

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

tff(c_241,plain,
    apart_point_and_line('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_225,c_32]) ).

tff(c_249,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_241]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO206+1 : TPTP v8.1.2. Released v3.3.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.14/0.36  % Computer : n010.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Fri Aug  4 00:17:13 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.36/2.04  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/2.05  
% 3.36/2.05  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.64/2.08  
% 3.64/2.08  Inference rules
% 3.64/2.08  ----------------------
% 3.64/2.08  #Ref     : 0
% 3.64/2.08  #Sup     : 38
% 3.64/2.08  #Fact    : 4
% 3.64/2.08  #Define  : 0
% 3.64/2.08  #Split   : 1
% 3.64/2.08  #Chain   : 0
% 3.64/2.08  #Close   : 0
% 3.64/2.08  
% 3.64/2.08  Ordering : KBO
% 3.64/2.08  
% 3.64/2.08  Simplification rules
% 3.64/2.08  ----------------------
% 3.64/2.08  #Subsume      : 4
% 3.64/2.08  #Demod        : 6
% 3.64/2.08  #Tautology    : 6
% 3.64/2.08  #SimpNegUnit  : 2
% 3.64/2.08  #BackRed      : 0
% 3.64/2.08  
% 3.64/2.08  #Partial instantiations: 0
% 3.64/2.08  #Strategies tried      : 1
% 3.64/2.08  
% 3.64/2.08  Timing (in seconds)
% 3.64/2.08  ----------------------
% 3.64/2.08  Preprocessing        : 0.51
% 3.64/2.08  Parsing              : 0.26
% 3.64/2.08  CNF conversion       : 0.04
% 3.64/2.08  Main loop            : 0.46
% 3.64/2.08  Inferencing          : 0.18
% 3.64/2.08  Reduction            : 0.10
% 3.64/2.08  Demodulation         : 0.06
% 3.64/2.08  BG Simplification    : 0.03
% 3.64/2.08  Subsumption          : 0.12
% 3.64/2.08  Abstraction          : 0.02
% 3.64/2.08  MUC search           : 0.00
% 3.64/2.08  Cooper               : 0.00
% 3.64/2.08  Total                : 1.03
% 3.64/2.08  Index Insertion      : 0.00
% 3.64/2.08  Index Deletion       : 0.00
% 3.64/2.08  Index Matching       : 0.00
% 3.64/2.08  BG Taut test         : 0.00
%------------------------------------------------------------------------------