TSTP Solution File: GEO118-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO118-1 : TPTP v8.1.2. Released v2.4.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 : n024.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:13 EDT 2023

% Result   : Unsatisfiable 6.93s 2.66s
% Output   : CNFRefutation 6.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   47
% Syntax   : Number of formulae    :   56 (   8 unt;  42 typ;   0 def)
%            Number of atoms       :   22 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  13   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   86 (  39   >;  47   *;   0   +;   0  <<)
%            Number of predicates  :   15 (  13 usr;   1 prp; 0-4 aty)
%            Number of functors    :   29 (  29 usr;   3 con; 0-5 aty)
%            Number of variables   :   29 (;  29   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_o > between_c > ordered_by > meet > start_point > part_of > inner_point > incident_o > incident_c > finish_point > end_point > open > closed > ax2_sk5 > ax2_sk4 > ax1_sk1 > ax2_sk7 > ax0_sk5 > ax0_sk2 > sum > ax2_sk9 > ax2_sk8 > ax2_sk2 > ax2_sk10 > ax2_sk1 > ax0_sk9 > ax0_sk4 > ax0_sk3 > ax0_sk13 > ax0_sk12 > ax0_sk11 > ax0_sk10 > ax0_sk1 > #nlpp > underlying_curve > ax2_sk6 > ax2_sk3 > ax0_sk8 > ax0_sk7 > ax0_sk6 > sk27 > sk26 > sk25

%Foreground sorts:

%Background operators:

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

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

tff(ax2_sk10,type,
    ax2_sk10: ( $i * $i ) > $i ).

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

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

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

tff(ax0_sk9,type,
    ax0_sk9: ( $i * $i ) > $i ).

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

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

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

tff(ax2_sk1,type,
    ax2_sk1: ( $i * $i ) > $i ).

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

tff(ax0_sk12,type,
    ax0_sk12: ( $i * $i ) > $i ).

tff(sk26,type,
    sk26: $i ).

tff(ax0_sk13,type,
    ax0_sk13: ( $i * $i ) > $i ).

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

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

tff(sk27,type,
    sk27: $i ).

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

tff(ax2_sk7,type,
    ax2_sk7: ( $i * $i * $i ) > $i ).

tff(ax0_sk4,type,
    ax0_sk4: ( $i * $i ) > $i ).

tff(ax2_sk4,type,
    ax2_sk4: ( $i * $i * $i * $i ) > $i ).

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

tff(sk25,type,
    sk25: $i ).

tff(ax2_sk9,type,
    ax2_sk9: ( $i * $i ) > $i ).

tff(sum,type,
    sum: ( $i * $i ) > $i ).

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

tff(ax2_sk2,type,
    ax2_sk2: ( $i * $i ) > $i ).

tff(ax0_sk11,type,
    ax0_sk11: ( $i * $i ) > $i ).

tff(ax2_sk5,type,
    ax2_sk5: ( $i * $i * $i * $i * $i ) > $i ).

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

tff(ax0_sk1,type,
    ax0_sk1: ( $i * $i ) > $i ).

tff(ax0_sk2,type,
    ax0_sk2: ( $i * $i * $i ) > $i ).

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

tff(ax0_sk10,type,
    ax0_sk10: ( $i * $i ) > $i ).

tff(ax1_sk1,type,
    ax1_sk1: ( $i * $i * $i * $i ) > $i ).

tff(ax2_sk8,type,
    ax2_sk8: ( $i * $i ) > $i ).

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

tff(ax0_sk3,type,
    ax0_sk3: ( $i * $i ) > $i ).

tff(ax0_sk5,type,
    ax0_sk5: ( $i * $i * $i ) > $i ).

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

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

tff(f_846,axiom,
    ordered_by(sk25,sk27,sk26),
    file(unknown,unknown) ).

tff(f_845,axiom,
    ordered_by(sk25,sk26,sk27),
    file(unknown,unknown) ).

tff(f_556,axiom,
    ! [A,B,C,D] :
      ( ~ ordered_by(A,B,C)
      | ~ ordered_by(A,C,D)
      | between_o(A,B,C,D) ),
    file(unknown,unknown) ).

tff(f_683,axiom,
    ! [A,B,C,D] :
      ( ~ between_o(A,B,C,D)
      | between_c(ax2_sk4(A,D,C,B),B,C,D) ),
    file(unknown,unknown) ).

tff(f_460,axiom,
    ! [A,B,C,D] :
      ( ~ between_c(A,B,C,D)
      | ( B != D ) ),
    file(unknown,unknown) ).

tff(c_196,plain,
    ordered_by(sk25,sk27,sk26),
    inference(cnfTransformation,[status(thm)],[f_846]) ).

tff(c_194,plain,
    ordered_by(sk25,sk26,sk27),
    inference(cnfTransformation,[status(thm)],[f_845]) ).

tff(c_118,plain,
    ! [A_168,B_169,C_170,D_171] :
      ( between_o(A_168,B_169,C_170,D_171)
      | ~ ordered_by(A_168,C_170,D_171)
      | ~ ordered_by(A_168,B_169,C_170) ),
    inference(cnfTransformation,[status(thm)],[f_556]) ).

tff(c_2897,plain,
    ! [A_684,D_685,C_686,B_687] :
      ( between_c(ax2_sk4(A_684,D_685,C_686,B_687),B_687,C_686,D_685)
      | ~ between_o(A_684,B_687,C_686,D_685) ),
    inference(cnfTransformation,[status(thm)],[f_683]) ).

tff(c_98,plain,
    ! [A_127,D_130,C_129] : ~ between_c(A_127,D_130,C_129,D_130),
    inference(cnfTransformation,[status(thm)],[f_460]) ).

tff(c_2913,plain,
    ! [A_688,D_689,C_690] : ~ between_o(A_688,D_689,C_690,D_689),
    inference(resolution,[status(thm)],[c_2897,c_98]) ).

tff(c_2963,plain,
    ! [A_703,C_704,D_705] :
      ( ~ ordered_by(A_703,C_704,D_705)
      | ~ ordered_by(A_703,D_705,C_704) ),
    inference(resolution,[status(thm)],[c_118,c_2913]) ).

tff(c_2969,plain,
    ~ ordered_by(sk25,sk27,sk26),
    inference(resolution,[status(thm)],[c_194,c_2963]) ).

tff(c_2977,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_196,c_2969]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem  : GEO118-1 : TPTP v8.1.2. Released v2.4.0.
% 0.14/0.15  % 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.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Fri Aug  4 00:21:00 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 6.93/2.66  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.93/2.66  
% 6.93/2.66  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.93/2.69  
% 6.93/2.69  Inference rules
% 6.93/2.69  ----------------------
% 6.93/2.69  #Ref     : 0
% 6.93/2.69  #Sup     : 670
% 6.93/2.69  #Fact    : 2
% 6.93/2.69  #Define  : 0
% 6.93/2.69  #Split   : 2
% 6.93/2.69  #Chain   : 0
% 6.93/2.69  #Close   : 0
% 6.93/2.69  
% 6.93/2.69  Ordering : KBO
% 6.93/2.69  
% 6.93/2.69  Simplification rules
% 6.93/2.69  ----------------------
% 6.93/2.69  #Subsume      : 120
% 6.93/2.69  #Demod        : 35
% 6.93/2.69  #Tautology    : 79
% 6.93/2.69  #SimpNegUnit  : 2
% 6.93/2.69  #BackRed      : 0
% 6.93/2.69  
% 6.93/2.69  #Partial instantiations: 0
% 6.93/2.69  #Strategies tried      : 1
% 6.93/2.69  
% 6.93/2.69  Timing (in seconds)
% 6.93/2.69  ----------------------
% 6.93/2.69  Preprocessing        : 0.74
% 6.93/2.69  Parsing              : 0.40
% 6.93/2.69  CNF conversion       : 0.05
% 6.93/2.69  Main loop            : 0.87
% 6.93/2.69  Inferencing          : 0.35
% 6.93/2.69  Reduction            : 0.21
% 6.93/2.69  Demodulation         : 0.14
% 6.93/2.69  BG Simplification    : 0.05
% 6.93/2.69  Subsumption          : 0.20
% 6.93/2.69  Abstraction          : 0.03
% 6.93/2.69  MUC search           : 0.00
% 6.93/2.69  Cooper               : 0.00
% 6.93/2.69  Total                : 1.65
% 6.93/2.69  Index Insertion      : 0.00
% 6.93/2.69  Index Deletion       : 0.00
% 6.93/2.69  Index Matching       : 0.00
% 6.93/2.69  BG Taut test         : 0.00
%------------------------------------------------------------------------------