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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO182+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 : n022.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:29 EDT 2023

% Result   : Theorem 4.84s 2.21s
% Output   : CNFRefutation 5.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   39 (   9 unt;  19 typ;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  10   ~;  12   |;   0   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   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   :   35 (;  35   !;   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_435,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( distinct_points(X,Y)
       => ( apart_point_and_line(Z,line_connecting(X,Y))
         => apart_point_and_line(Z,line_connecting(Y,X)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

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

tff(f_73,axiom,
    ! [X,Y,Z] :
      ( distinct_lines(X,Y)
     => ( distinct_lines(X,Z)
        | distinct_lines(Y,Z) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).

tff(f_58,axiom,
    ! [X] : ~ distinct_lines(X,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart2) ).

tff(f_160,axiom,
    ! [X,Y] :
      ( distinct_lines(X,Y)
     => convergent_lines(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).

tff(f_188,axiom,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).

tff(f_191,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_96,plain,
    apart_point_and_line('#skF_3',line_connecting('#skF_1','#skF_2')),
    inference(cnfTransformation,[status(thm)],[f_435]) ).

tff(c_393,plain,
    ! [X_189,Z_190,Y_191] :
      ( apart_point_and_line(X_189,Z_190)
      | distinct_lines(Y_191,Z_190)
      | ~ apart_point_and_line(X_189,Y_191) ),
    inference(cnfTransformation,[status(thm)],[f_126]) ).

tff(c_403,plain,
    ! [Z_192] :
      ( apart_point_and_line('#skF_3',Z_192)
      | distinct_lines(line_connecting('#skF_1','#skF_2'),Z_192) ),
    inference(resolution,[status(thm)],[c_96,c_393]) ).

tff(c_10,plain,
    ! [Y_8,Z_9,X_7] :
      ( distinct_lines(Y_8,Z_9)
      | distinct_lines(X_7,Z_9)
      | ~ distinct_lines(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_991,plain,
    ! [Z_224,Z_225] :
      ( distinct_lines(Z_224,Z_225)
      | distinct_lines(line_connecting('#skF_1','#skF_2'),Z_225)
      | apart_point_and_line('#skF_3',Z_224) ),
    inference(resolution,[status(thm)],[c_403,c_10]) ).

tff(c_4,plain,
    ! [X_2] : ~ distinct_lines(X_2,X_2),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_1031,plain,
    ! [Z_227] :
      ( distinct_lines(Z_227,line_connecting('#skF_1','#skF_2'))
      | apart_point_and_line('#skF_3',Z_227) ),
    inference(resolution,[status(thm)],[c_991,c_4]) ).

tff(c_30,plain,
    ! [X_34,Y_35] :
      ( convergent_lines(X_34,Y_35)
      | ~ distinct_lines(X_34,Y_35) ),
    inference(cnfTransformation,[status(thm)],[f_160]) ).

tff(c_1045,plain,
    ! [Z_228] :
      ( convergent_lines(Z_228,line_connecting('#skF_1','#skF_2'))
      | apart_point_and_line('#skF_3',Z_228) ),
    inference(resolution,[status(thm)],[c_1031,c_30]) ).

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

tff(c_1066,plain,
    ! [X_229] : apart_point_and_line('#skF_3',parallel_through_point(line_connecting('#skF_1','#skF_2'),X_229)),
    inference(resolution,[status(thm)],[c_1045,c_32]) ).

tff(c_34,plain,
    ! [X_38,Y_39] : ~ apart_point_and_line(X_38,parallel_through_point(Y_39,X_38)),
    inference(cnfTransformation,[status(thm)],[f_191]) ).

tff(c_1077,plain,
    $false,
    inference(resolution,[status(thm)],[c_1066,c_34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO182+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.17/0.35  % Computer : n022.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Fri Aug  4 00:26:18 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 4.84/2.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.84/2.21  
% 4.84/2.21  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.10/2.24  
% 5.10/2.24  Inference rules
% 5.10/2.24  ----------------------
% 5.10/2.24  #Ref     : 0
% 5.10/2.24  #Sup     : 161
% 5.10/2.24  #Fact    : 28
% 5.10/2.24  #Define  : 0
% 5.10/2.24  #Split   : 0
% 5.10/2.24  #Chain   : 0
% 5.10/2.24  #Close   : 0
% 5.10/2.24  
% 5.10/2.24  Ordering : KBO
% 5.10/2.24  
% 5.10/2.24  Simplification rules
% 5.10/2.24  ----------------------
% 5.10/2.24  #Subsume      : 26
% 5.10/2.24  #Demod        : 50
% 5.10/2.24  #Tautology    : 51
% 5.10/2.24  #SimpNegUnit  : 0
% 5.10/2.24  #BackRed      : 0
% 5.10/2.24  
% 5.10/2.24  #Partial instantiations: 0
% 5.10/2.24  #Strategies tried      : 1
% 5.10/2.24  
% 5.10/2.24  Timing (in seconds)
% 5.10/2.24  ----------------------
% 5.10/2.25  Preprocessing        : 0.57
% 5.10/2.25  Parsing              : 0.32
% 5.10/2.25  CNF conversion       : 0.04
% 5.10/2.25  Main loop            : 0.62
% 5.10/2.25  Inferencing          : 0.25
% 5.10/2.25  Reduction            : 0.16
% 5.10/2.25  Demodulation         : 0.10
% 5.10/2.25  BG Simplification    : 0.04
% 5.10/2.25  Subsumption          : 0.14
% 5.10/2.25  Abstraction          : 0.02
% 5.10/2.25  MUC search           : 0.00
% 5.10/2.25  Cooper               : 0.00
% 5.10/2.25  Total                : 1.25
% 5.10/2.25  Index Insertion      : 0.00
% 5.10/2.25  Index Deletion       : 0.00
% 5.10/2.25  Index Matching       : 0.00
% 5.10/2.25  BG Taut test         : 0.00
%------------------------------------------------------------------------------