TSTP Solution File: GEO219+2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO219+2 : 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 : n028.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:44 EDT 2023

% Result   : Theorem 3.89s 2.07s
% Output   : CNFRefutation 3.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   34 (   9 unt;  10 typ;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   50 (  22   ~;  22   |;   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  :   14 (   7   >;   7   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   33 (;  33   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ unorthogonal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > 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(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(unorthogonal_lines,type,
    unorthogonal_lines: ( $i * $i ) > $o ).

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

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

tff(f_160,axiom,
    ! [L,M] :
      ~ ( ~ convergent_lines(L,M)
        & ~ unorthogonal_lines(L,M) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+4.ax',coipo1) ).

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

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

tff(f_179,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+4.ax',cotno1) ).

tff(c_44,plain,
    ~ convergent_lines('#skF_1','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_201]) ).

tff(c_50,plain,
    ! [L_42,M_43] :
      ( unorthogonal_lines(L_42,M_43)
      | convergent_lines(L_42,M_43) ),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

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

tff(c_54,plain,
    convergent_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_50,c_46]) ).

tff(c_65,plain,
    ! [Y_49,Z_50,X_51] :
      ( convergent_lines(Y_49,Z_50)
      | convergent_lines(X_51,Z_50)
      | ~ convergent_lines(X_51,Y_49) ),
    inference(cnfTransformation,[status(thm)],[f_81]) ).

tff(c_69,plain,
    ! [Z_52] :
      ( convergent_lines('#skF_2',Z_52)
      | convergent_lines('#skF_1',Z_52) ),
    inference(resolution,[status(thm)],[c_54,c_65]) ).

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_81]) ).

tff(c_184,plain,
    ! [Z_74,Z_75] :
      ( convergent_lines(Z_74,Z_75)
      | convergent_lines('#skF_2',Z_75)
      | convergent_lines('#skF_1',Z_74) ),
    inference(resolution,[status(thm)],[c_69,c_12]) ).

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

tff(c_227,plain,
    ! [Z_79] :
      ( convergent_lines(Z_79,'#skF_2')
      | convergent_lines('#skF_1',Z_79) ),
    inference(resolution,[status(thm)],[c_184,c_6]) ).

tff(c_859,plain,
    ! [Z_118,Z_119] :
      ( convergent_lines(Z_118,Z_119)
      | convergent_lines('#skF_1',Z_119)
      | convergent_lines(Z_118,'#skF_2') ),
    inference(resolution,[status(thm)],[c_227,c_12]) ).

tff(c_923,plain,
    ! [Z_121] :
      ( convergent_lines(Z_121,'#skF_3')
      | convergent_lines(Z_121,'#skF_2') ),
    inference(resolution,[status(thm)],[c_859,c_44]) ).

tff(c_937,plain,
    convergent_lines('#skF_2','#skF_3'),
    inference(resolution,[status(thm)],[c_923,c_6]) ).

tff(c_42,plain,
    unorthogonal_lines('#skF_2','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_201]) ).

tff(c_1025,plain,
    ! [L_131,M_132,N_133] :
      ( unorthogonal_lines(L_131,M_132)
      | convergent_lines(L_131,N_133)
      | ~ unorthogonal_lines(M_132,N_133)
      | ~ convergent_lines(M_132,N_133) ),
    inference(cnfTransformation,[status(thm)],[f_179]) ).

tff(c_1059,plain,
    ! [L_131] :
      ( unorthogonal_lines(L_131,'#skF_2')
      | convergent_lines(L_131,'#skF_3')
      | ~ convergent_lines('#skF_2','#skF_3') ),
    inference(resolution,[status(thm)],[c_42,c_1025]) ).

tff(c_1079,plain,
    ! [L_134] :
      ( unorthogonal_lines(L_134,'#skF_2')
      | convergent_lines(L_134,'#skF_3') ),
    inference(demodulation,[status(thm),theory(equality)],[c_937,c_1059]) ).

tff(c_1084,plain,
    convergent_lines('#skF_1','#skF_3'),
    inference(resolution,[status(thm)],[c_1079,c_46]) ).

tff(c_1089,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_1084]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO219+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % 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.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri Aug  4 00:43:24 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 3.89/2.07  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.89/2.07  
% 3.89/2.07  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.89/2.10  
% 3.89/2.10  Inference rules
% 3.89/2.10  ----------------------
% 3.89/2.10  #Ref     : 0
% 3.89/2.10  #Sup     : 171
% 3.89/2.10  #Fact    : 42
% 3.89/2.10  #Define  : 0
% 3.89/2.10  #Split   : 1
% 3.89/2.10  #Chain   : 0
% 3.89/2.10  #Close   : 0
% 3.89/2.10  
% 3.89/2.10  Ordering : KBO
% 3.89/2.10  
% 3.89/2.10  Simplification rules
% 3.89/2.10  ----------------------
% 3.89/2.10  #Subsume      : 41
% 3.89/2.10  #Demod        : 48
% 3.89/2.10  #Tautology    : 48
% 3.89/2.10  #SimpNegUnit  : 3
% 3.89/2.10  #BackRed      : 0
% 3.89/2.10  
% 3.89/2.10  #Partial instantiations: 0
% 3.89/2.10  #Strategies tried      : 1
% 3.89/2.10  
% 3.89/2.10  Timing (in seconds)
% 3.89/2.10  ----------------------
% 3.89/2.10  Preprocessing        : 0.49
% 3.89/2.11  Parsing              : 0.27
% 3.89/2.11  CNF conversion       : 0.03
% 3.89/2.11  Main loop            : 0.54
% 3.89/2.11  Inferencing          : 0.22
% 3.89/2.11  Reduction            : 0.12
% 3.89/2.11  Demodulation         : 0.08
% 3.89/2.11  BG Simplification    : 0.03
% 3.89/2.11  Subsumption          : 0.13
% 3.89/2.11  Abstraction          : 0.02
% 3.89/2.11  MUC search           : 0.00
% 3.89/2.11  Cooper               : 0.00
% 3.89/2.11  Total                : 1.08
% 3.89/2.11  Index Insertion      : 0.00
% 3.89/2.11  Index Deletion       : 0.00
% 3.89/2.11  Index Matching       : 0.00
% 3.89/2.11  BG Taut test         : 0.00
%------------------------------------------------------------------------------