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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO233+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 : 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:48 EDT 2023

% Result   : Theorem 4.12s 2.01s
% Output   : CNFRefutation 4.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   47 (  10 unt;  23 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   35 (  17   ~;  14   |;   1   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  22   >;  23   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   37 (;  37   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_opposite_lines > unequally_directed_lines > right_convergent_lines > right_apart_point > left_convergent_lines > left_apart_point > incident_point_and_line > equally_directed_opposite_lines > equally_directed_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > line_connecting > intersection_point > #nlpp > reverse_line > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(point,type,
    point: $i > $o ).

tff(reverse_line,type,
    reverse_line: $i > $i ).

tff(line,type,
    line: $i > $o ).

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

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

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

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

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

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

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

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

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

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

tff(f_66,axiom,
    ! [X,Y] :
      ( equally_directed_lines(X,Y)
    <=> ~ unequally_directed_lines(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).

tff(f_155,axiom,
    ! [L,M] :
      ( unequally_directed_lines(L,M)
      | unequally_directed_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).

tff(f_53,axiom,
    ! [X,Y] :
      ( unequally_directed_opposite_lines(X,Y)
    <=> unequally_directed_lines(X,reverse_line(Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a1_defns) ).

tff(f_133,axiom,
    ! [L] : equally_directed_lines(L,L),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).

tff(f_173,axiom,
    ! [L,M] :
      ~ ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).

tff(f_163,axiom,
    ! [L,M] :
      ( ( unequally_directed_lines(L,M)
        & unequally_directed_lines(L,reverse_line(M)) )
     => ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).

tff(f_284,negated_conjecture,
    ~ ! [L] : equally_directed_lines(reverse_line(reverse_line(L)),L),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(c_16,plain,
    ! [X_7,Y_8] :
      ( equally_directed_lines(X_7,Y_8)
      | unequally_directed_lines(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_88,plain,
    ! [L_40,M_41] :
      ( unequally_directed_lines(L_40,reverse_line(M_41))
      | unequally_directed_lines(L_40,M_41) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_219,plain,
    ! [X_130,Y_131] :
      ( unequally_directed_opposite_lines(X_130,Y_131)
      | ~ unequally_directed_lines(X_130,reverse_line(Y_131)) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_231,plain,
    ! [L_40,M_41] :
      ( unequally_directed_opposite_lines(L_40,M_41)
      | unequally_directed_lines(L_40,M_41) ),
    inference(resolution,[status(thm)],[c_88,c_219]) ).

tff(c_76,plain,
    ! [L_33] : equally_directed_lines(L_33,L_33),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_257,plain,
    ! [X_141,Y_142] :
      ( unequally_directed_lines(X_141,reverse_line(Y_142))
      | ~ unequally_directed_opposite_lines(X_141,Y_142) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_14,plain,
    ! [X_7,Y_8] :
      ( ~ unequally_directed_lines(X_7,Y_8)
      | ~ equally_directed_lines(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_328,plain,
    ! [X_155,Y_156] :
      ( ~ equally_directed_lines(X_155,reverse_line(Y_156))
      | ~ unequally_directed_opposite_lines(X_155,Y_156) ),
    inference(resolution,[status(thm)],[c_257,c_14]) ).

tff(c_339,plain,
    ! [Y_157] : ~ unequally_directed_opposite_lines(reverse_line(Y_157),Y_157),
    inference(resolution,[status(thm)],[c_76,c_328]) ).

tff(c_350,plain,
    ! [M_158] : unequally_directed_lines(reverse_line(M_158),M_158),
    inference(resolution,[status(thm)],[c_231,c_339]) ).

tff(c_96,plain,
    ! [L_46,M_47] : ~ left_convergent_lines(L_46,M_47),
    inference(cnfTransformation,[status(thm)],[f_173]) ).

tff(c_90,plain,
    ! [L_42,M_43] :
      ( left_convergent_lines(L_42,reverse_line(M_43))
      | left_convergent_lines(L_42,M_43)
      | ~ unequally_directed_lines(L_42,reverse_line(M_43))
      | ~ unequally_directed_lines(L_42,M_43) ),
    inference(cnfTransformation,[status(thm)],[f_163]) ).

tff(c_142,plain,
    ! [L_42,M_43] :
      ( ~ unequally_directed_lines(L_42,reverse_line(M_43))
      | ~ unequally_directed_lines(L_42,M_43) ),
    inference(negUnitSimplification,[status(thm)],[c_96,c_96,c_90]) ).

tff(c_402,plain,
    ! [M_168] : ~ unequally_directed_lines(reverse_line(reverse_line(M_168)),M_168),
    inference(resolution,[status(thm)],[c_350,c_142]) ).

tff(c_422,plain,
    ! [Y_8] : equally_directed_lines(reverse_line(reverse_line(Y_8)),Y_8),
    inference(resolution,[status(thm)],[c_16,c_402]) ).

tff(c_134,plain,
    ~ equally_directed_lines(reverse_line(reverse_line('#skF_1')),'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_284]) ).

tff(c_432,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_422,c_134]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO233+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.14/0.35  % Computer : n005.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:11:12 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 4.12/2.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/2.02  
% 4.12/2.02  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.12/2.04  
% 4.12/2.04  Inference rules
% 4.12/2.04  ----------------------
% 4.12/2.04  #Ref     : 0
% 4.12/2.04  #Sup     : 54
% 4.12/2.04  #Fact    : 0
% 4.12/2.04  #Define  : 0
% 4.12/2.04  #Split   : 1
% 4.12/2.04  #Chain   : 0
% 4.12/2.04  #Close   : 0
% 4.12/2.04  
% 4.12/2.04  Ordering : KBO
% 4.12/2.04  
% 4.12/2.04  Simplification rules
% 4.12/2.04  ----------------------
% 4.12/2.04  #Subsume      : 41
% 4.12/2.04  #Demod        : 2
% 4.12/2.04  #Tautology    : 8
% 4.12/2.04  #SimpNegUnit  : 17
% 4.12/2.04  #BackRed      : 1
% 4.12/2.04  
% 4.12/2.04  #Partial instantiations: 0
% 4.12/2.04  #Strategies tried      : 1
% 4.12/2.04  
% 4.12/2.04  Timing (in seconds)
% 4.12/2.04  ----------------------
% 4.26/2.04  Preprocessing        : 0.55
% 4.26/2.04  Parsing              : 0.31
% 4.26/2.04  CNF conversion       : 0.04
% 4.26/2.04  Main loop            : 0.33
% 4.26/2.04  Inferencing          : 0.12
% 4.26/2.05  Reduction            : 0.08
% 4.26/2.05  Demodulation         : 0.05
% 4.26/2.05  BG Simplification    : 0.03
% 4.26/2.05  Subsumption          : 0.08
% 4.26/2.05  Abstraction          : 0.01
% 4.26/2.05  MUC search           : 0.00
% 4.26/2.05  Cooper               : 0.00
% 4.26/2.05  Total                : 0.93
% 4.26/2.05  Index Insertion      : 0.00
% 4.26/2.05  Index Deletion       : 0.00
% 4.26/2.05  Index Matching       : 0.00
% 4.26/2.05  BG Taut test         : 0.00
%------------------------------------------------------------------------------