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

View Problem - Process Solution

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

% Result   : Theorem 3.78s 1.95s
% Output   : CNFRefutation 4.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   31
% Syntax   : Number of formulae    :   49 (   9 unt;  23 typ;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   39 (  18   ~;  16   |;   1   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   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   :   39 (;  39   !;   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_133,axiom,
    ! [L] : equally_directed_lines(L,L),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).

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

tff(f_71,axiom,
    ! [X,Y] :
      ( equally_directed_opposite_lines(X,Y)
    <=> ~ unequally_directed_opposite_lines(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a5_defns) ).

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

tff(f_173,axiom,
    ! [L,M] :
      ~ ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).

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

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

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

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_20,plain,
    ! [X_9,Y_10] :
      ( equally_directed_opposite_lines(X_9,Y_10)
      | unequally_directed_opposite_lines(X_9,Y_10) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_258,plain,
    ! [X_144,Y_145] :
      ( unequally_directed_lines(X_144,reverse_line(Y_145))
      | ~ unequally_directed_opposite_lines(X_144,Y_145) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

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_272,plain,
    ! [X_148,Y_149] :
      ( ~ unequally_directed_lines(X_148,Y_149)
      | ~ unequally_directed_opposite_lines(X_148,Y_149) ),
    inference(resolution,[status(thm)],[c_258,c_142]) ).

tff(c_307,plain,
    ! [X_154,Y_155] :
      ( ~ unequally_directed_lines(X_154,Y_155)
      | equally_directed_opposite_lines(X_154,Y_155) ),
    inference(resolution,[status(thm)],[c_20,c_272]) ).

tff(c_324,plain,
    ! [X_156,Y_157] :
      ( equally_directed_opposite_lines(X_156,Y_157)
      | equally_directed_lines(X_156,Y_157) ),
    inference(resolution,[status(thm)],[c_16,c_307]) ).

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

tff(c_332,plain,
    equally_directed_lines('#skF_1',reverse_line('#skF_1')),
    inference(resolution,[status(thm)],[c_324,c_134]) ).

tff(c_199,plain,
    ! [L_126,M_127] :
      ( unequally_directed_lines(L_126,reverse_line(M_127))
      | unequally_directed_lines(L_126,M_127) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

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_333,plain,
    ! [L_158,M_159] :
      ( ~ equally_directed_lines(L_158,reverse_line(M_159))
      | unequally_directed_lines(L_158,M_159) ),
    inference(resolution,[status(thm)],[c_199,c_14]) ).

tff(c_345,plain,
    unequally_directed_lines('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_332,c_333]) ).

tff(c_354,plain,
    ~ equally_directed_lines('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_345,c_14]) ).

tff(c_359,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_76,c_354]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO269+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.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % 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:33:09 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 3.78/1.95  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.78/1.96  
% 3.78/1.96  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.07/1.99  
% 4.07/1.99  Inference rules
% 4.07/1.99  ----------------------
% 4.07/1.99  #Ref     : 0
% 4.07/1.99  #Sup     : 39
% 4.07/1.99  #Fact    : 0
% 4.07/1.99  #Define  : 0
% 4.07/1.99  #Split   : 1
% 4.07/1.99  #Chain   : 0
% 4.07/1.99  #Close   : 0
% 4.07/1.99  
% 4.07/1.99  Ordering : KBO
% 4.07/1.99  
% 4.07/1.99  Simplification rules
% 4.07/1.99  ----------------------
% 4.07/1.99  #Subsume      : 39
% 4.07/1.99  #Demod        : 1
% 4.07/1.99  #Tautology    : 7
% 4.07/1.99  #SimpNegUnit  : 17
% 4.07/1.99  #BackRed      : 0
% 4.07/1.99  
% 4.07/1.99  #Partial instantiations: 0
% 4.07/1.99  #Strategies tried      : 1
% 4.07/1.99  
% 4.07/1.99  Timing (in seconds)
% 4.07/1.99  ----------------------
% 4.07/1.99  Preprocessing        : 0.58
% 4.07/1.99  Parsing              : 0.31
% 4.07/1.99  CNF conversion       : 0.05
% 4.07/1.99  Main loop            : 0.35
% 4.07/1.99  Inferencing          : 0.13
% 4.07/1.99  Reduction            : 0.09
% 4.07/1.99  Demodulation         : 0.06
% 4.07/1.99  BG Simplification    : 0.03
% 4.07/1.99  Subsumption          : 0.09
% 4.07/1.99  Abstraction          : 0.01
% 4.07/1.99  MUC search           : 0.00
% 4.07/1.99  Cooper               : 0.00
% 4.07/1.99  Total                : 0.97
% 4.07/1.99  Index Insertion      : 0.00
% 4.07/1.99  Index Deletion       : 0.00
% 4.07/1.99  Index Matching       : 0.00
% 4.07/1.99  BG Taut test         : 0.00
%------------------------------------------------------------------------------