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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO126-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/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 : n018.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:14 EDT 2023

% Result   : Unsatisfiable 6.29s 2.41s
% Output   : CNFRefutation 6.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   50
% Syntax   : Number of formulae    :   75 (  15 unt;  40 typ;   0 def)
%            Number of atoms       :   60 (   9 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   52 (  27   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   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    :   27 (  27 usr;   1 con; 0-5 aty)
%            Number of variables   :   45 (;  45   !;   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 > 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(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(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_725,axiom,
    ! [A] : start_point(ax2_sk6(A),A),
    file(unknown,unknown) ).

tff(f_347,axiom,
    ! [A] : inner_point(ax0_sk8(A),A),
    file(unknown,unknown) ).

tff(f_209,axiom,
    ! [A,B] :
      ( ~ inner_point(A,B)
      | incident_c(A,B) ),
    file(unknown,unknown) ).

tff(f_662,axiom,
    ! [A,B] :
      ( ~ incident_c(A,ax2_sk3(B))
      | incident_o(A,B) ),
    file(unknown,unknown) ).

tff(f_579,axiom,
    ! [A,B,C] :
      ( ~ start_point(A,B)
      | ( A = C )
      | ~ incident_o(C,B)
      | ordered_by(B,A,C) ),
    file(unknown,unknown) ).

tff(f_849,axiom,
    ! [A,B] :
      ( ~ ordered_by(sk25,A,B)
      | ( A = B ) ),
    file(unknown,unknown) ).

tff(f_215,axiom,
    ! [A,B] :
      ( ~ inner_point(A,B)
      | ~ end_point(A,B) ),
    file(unknown,unknown) ).

tff(f_652,axiom,
    ! [A] : open(ax2_sk3(A)),
    file(unknown,unknown) ).

tff(f_303,axiom,
    ! [A] :
      ( ~ open(A)
      | end_point(ax0_sk7(A),A) ),
    file(unknown,unknown) ).

tff(f_141,axiom,
    ! [A,B] :
      ( ~ end_point(A,B)
      | incident_c(A,B) ),
    file(unknown,unknown) ).

tff(c_166,plain,
    ! [A_243] : start_point(ax2_sk6(A_243),A_243),
    inference(cnfTransformation,[status(thm)],[f_725]) ).

tff(c_74,plain,
    ! [A_98] : inner_point(ax0_sk8(A_98),A_98),
    inference(cnfTransformation,[status(thm)],[f_347]) ).

tff(c_245,plain,
    ! [A_306,B_307] :
      ( incident_c(A_306,B_307)
      | ~ inner_point(A_306,B_307) ),
    inference(cnfTransformation,[status(thm)],[f_209]) ).

tff(c_249,plain,
    ! [A_98] : incident_c(ax0_sk8(A_98),A_98),
    inference(resolution,[status(thm)],[c_74,c_245]) ).

tff(c_264,plain,
    ! [A_323,B_324] :
      ( incident_o(A_323,B_324)
      | ~ incident_c(A_323,ax2_sk3(B_324)) ),
    inference(cnfTransformation,[status(thm)],[f_662]) ).

tff(c_273,plain,
    ! [B_324] : incident_o(ax0_sk8(ax2_sk3(B_324)),B_324),
    inference(resolution,[status(thm)],[c_249,c_264]) ).

tff(c_1353,plain,
    ! [B_532,A_533,C_534] :
      ( ordered_by(B_532,A_533,C_534)
      | ~ incident_o(C_534,B_532)
      | ( C_534 = A_533 )
      | ~ start_point(A_533,B_532) ),
    inference(cnfTransformation,[status(thm)],[f_579]) ).

tff(c_194,plain,
    ! [B_278,A_277] :
      ( ( B_278 = A_277 )
      | ~ ordered_by(sk25,A_277,B_278) ),
    inference(cnfTransformation,[status(thm)],[f_849]) ).

tff(c_1377,plain,
    ! [C_535,A_536] :
      ( ~ incident_o(C_535,sk25)
      | ( C_535 = A_536 )
      | ~ start_point(A_536,sk25) ),
    inference(resolution,[status(thm)],[c_1353,c_194]) ).

tff(c_1534,plain,
    ! [A_543] :
      ( ( ax0_sk8(ax2_sk3(sk25)) = A_543 )
      | ~ start_point(A_543,sk25) ),
    inference(resolution,[status(thm)],[c_273,c_1377]) ).

tff(c_1542,plain,
    ax0_sk8(ax2_sk3(sk25)) = ax2_sk6(sk25),
    inference(resolution,[status(thm)],[c_166,c_1534]) ).

tff(c_238,plain,
    ! [A_301,B_302] :
      ( ~ end_point(A_301,B_302)
      | ~ inner_point(A_301,B_302) ),
    inference(cnfTransformation,[status(thm)],[f_215]) ).

tff(c_242,plain,
    ! [A_98] : ~ end_point(ax0_sk8(A_98),A_98),
    inference(resolution,[status(thm)],[c_74,c_238]) ).

tff(c_1563,plain,
    ~ end_point(ax2_sk6(sk25),ax2_sk3(sk25)),
    inference(superposition,[status(thm),theory(equality)],[c_1542,c_242]) ).

tff(c_146,plain,
    ! [A_204] : open(ax2_sk3(A_204)),
    inference(cnfTransformation,[status(thm)],[f_652]) ).

tff(c_66,plain,
    ! [A_88] :
      ( end_point(ax0_sk7(A_88),A_88)
      | ~ open(A_88) ),
    inference(cnfTransformation,[status(thm)],[f_303]) ).

tff(c_26,plain,
    ! [A_38,B_39] :
      ( incident_c(A_38,B_39)
      | ~ end_point(A_38,B_39) ),
    inference(cnfTransformation,[status(thm)],[f_141]) ).

tff(c_310,plain,
    ! [A_337,B_338] :
      ( incident_o(A_337,B_338)
      | ~ end_point(A_337,ax2_sk3(B_338)) ),
    inference(resolution,[status(thm)],[c_26,c_264]) ).

tff(c_314,plain,
    ! [B_338] :
      ( incident_o(ax0_sk7(ax2_sk3(B_338)),B_338)
      | ~ open(ax2_sk3(B_338)) ),
    inference(resolution,[status(thm)],[c_66,c_310]) ).

tff(c_321,plain,
    ! [B_338] : incident_o(ax0_sk7(ax2_sk3(B_338)),B_338),
    inference(demodulation,[status(thm),theory(equality)],[c_146,c_314]) ).

tff(c_1667,plain,
    ! [A_549] :
      ( ( ax0_sk7(ax2_sk3(sk25)) = A_549 )
      | ~ start_point(A_549,sk25) ),
    inference(resolution,[status(thm)],[c_321,c_1377]) ).

tff(c_1675,plain,
    ax0_sk7(ax2_sk3(sk25)) = ax2_sk6(sk25),
    inference(resolution,[status(thm)],[c_166,c_1667]) ).

tff(c_1687,plain,
    ( end_point(ax2_sk6(sk25),ax2_sk3(sk25))
    | ~ open(ax2_sk3(sk25)) ),
    inference(superposition,[status(thm),theory(equality)],[c_1675,c_66]) ).

tff(c_1694,plain,
    end_point(ax2_sk6(sk25),ax2_sk3(sk25)),
    inference(demodulation,[status(thm),theory(equality)],[c_146,c_1687]) ).

tff(c_1696,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1563,c_1694]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GEO126-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15  % 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.36  % Computer : n018.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:39:06 EDT 2023
% 0.14/0.37  % CPUTime  : 
% 6.29/2.41  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.29/2.42  
% 6.29/2.42  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.29/2.45  
% 6.29/2.45  Inference rules
% 6.29/2.45  ----------------------
% 6.29/2.45  #Ref     : 0
% 6.29/2.45  #Sup     : 318
% 6.29/2.45  #Fact    : 2
% 6.29/2.45  #Define  : 0
% 6.29/2.45  #Split   : 2
% 6.29/2.45  #Chain   : 0
% 6.29/2.45  #Close   : 0
% 6.29/2.45  
% 6.29/2.45  Ordering : KBO
% 6.29/2.45  
% 6.29/2.45  Simplification rules
% 6.29/2.45  ----------------------
% 6.29/2.45  #Subsume      : 36
% 6.29/2.45  #Demod        : 37
% 6.29/2.45  #Tautology    : 59
% 6.29/2.45  #SimpNegUnit  : 8
% 6.29/2.45  #BackRed      : 11
% 6.29/2.45  
% 6.29/2.45  #Partial instantiations: 0
% 6.29/2.45  #Strategies tried      : 1
% 6.29/2.45  
% 6.29/2.45  Timing (in seconds)
% 6.29/2.45  ----------------------
% 6.29/2.45  Preprocessing        : 0.71
% 6.29/2.45  Parsing              : 0.38
% 6.29/2.45  CNF conversion       : 0.05
% 6.29/2.45  Main loop            : 0.67
% 6.29/2.45  Inferencing          : 0.27
% 6.29/2.45  Reduction            : 0.17
% 6.29/2.45  Demodulation         : 0.11
% 6.29/2.45  BG Simplification    : 0.05
% 6.29/2.45  Subsumption          : 0.15
% 6.29/2.45  Abstraction          : 0.02
% 6.29/2.45  MUC search           : 0.00
% 6.29/2.45  Cooper               : 0.00
% 6.29/2.45  Total                : 1.43
% 6.29/2.45  Index Insertion      : 0.00
% 6.29/2.45  Index Deletion       : 0.00
% 6.29/2.45  Index Matching       : 0.00
% 6.29/2.45  BG Taut test         : 0.00
%------------------------------------------------------------------------------