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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO220+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/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 : n032.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 2.58s 1.67s
% Output   : CNFRefutation 2.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   19 (   5 unt;  10 typ;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (  10   ~;   3   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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   :   10 (;  10   !;   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_203,negated_conjecture,
    ~ ! [L,M,N] :
        ( ( ~ unorthogonal_lines(L,M)
          & ~ unorthogonal_lines(L,N) )
       => ~ convergent_lines(M,N) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

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

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

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

tff(c_74,plain,
    ! [M_61,N_62,L_63] :
      ( ~ convergent_lines(M_61,N_62)
      | unorthogonal_lines(L_63,N_62)
      | unorthogonal_lines(L_63,M_61) ),
    inference(cnfTransformation,[status(thm)],[f_191]) ).

tff(c_102,plain,
    ! [L_65] :
      ( unorthogonal_lines(L_65,'#skF_3')
      | unorthogonal_lines(L_65,'#skF_2') ),
    inference(resolution,[status(thm)],[c_42,c_74]) ).

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

tff(c_105,plain,
    unorthogonal_lines('#skF_1','#skF_3'),
    inference(resolution,[status(thm)],[c_102,c_46]) ).

tff(c_109,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_105]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO220+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12  % 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.12/0.32  % Computer : n032.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Fri Aug  4 00:36:21 EDT 2023
% 0.12/0.32  % CPUTime  : 
% 2.58/1.67  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.58/1.67  
% 2.58/1.67  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.70  
% 2.58/1.70  Inference rules
% 2.58/1.70  ----------------------
% 2.58/1.70  #Ref     : 0
% 2.58/1.70  #Sup     : 14
% 2.58/1.70  #Fact    : 0
% 2.58/1.70  #Define  : 0
% 2.58/1.70  #Split   : 0
% 2.58/1.70  #Chain   : 0
% 2.58/1.70  #Close   : 0
% 2.58/1.70  
% 2.58/1.70  Ordering : KBO
% 2.58/1.70  
% 2.58/1.70  Simplification rules
% 2.58/1.70  ----------------------
% 2.58/1.70  #Subsume      : 2
% 2.58/1.70  #Demod        : 0
% 2.58/1.70  #Tautology    : 0
% 2.58/1.70  #SimpNegUnit  : 1
% 2.58/1.70  #BackRed      : 0
% 2.58/1.70  
% 2.58/1.70  #Partial instantiations: 0
% 2.58/1.70  #Strategies tried      : 1
% 2.58/1.70  
% 2.58/1.70  Timing (in seconds)
% 2.58/1.70  ----------------------
% 2.58/1.70  Preprocessing        : 0.47
% 2.58/1.70  Parsing              : 0.26
% 2.58/1.70  CNF conversion       : 0.03
% 2.58/1.70  Main loop            : 0.24
% 2.58/1.70  Inferencing          : 0.10
% 2.58/1.70  Reduction            : 0.06
% 2.58/1.70  Demodulation         : 0.04
% 2.58/1.70  BG Simplification    : 0.02
% 2.58/1.70  Subsumption          : 0.06
% 2.58/1.70  Abstraction          : 0.01
% 2.58/1.70  MUC search           : 0.00
% 2.58/1.70  Cooper               : 0.00
% 2.58/1.70  Total                : 0.76
% 2.58/1.70  Index Insertion      : 0.00
% 2.58/1.70  Index Deletion       : 0.00
% 2.58/1.70  Index Matching       : 0.00
% 2.58/1.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------