↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO082-1 : TPTP v9.0.0. 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 : n007.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 : Wed Apr  9 06:13:43 PM UTC 2025

% Result   : Unsatisfiable 12.14s 3.88s
% Output   : CNFRefutation 12.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (   8 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (  14 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   46 (  19   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   16 (  16 usr;   2 con; 0-3 aty)
%            Number of variables   :   28 (  28   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > ax0_sk5 > ax0_sk2 > sum > ax0_sk9 > ax0_sk4 > ax0_sk3 > ax0_sk13 > ax0_sk12 > ax0_sk11 > ax0_sk10 > ax0_sk1 > #nlpp > ax0_sk8 > ax0_sk7 > ax0_sk6 > sk15 > sk14

%Foreground sorts:

%Background operators:

%Foreground operators:
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(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(meet,type,
    meet: ( $i * $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

tff(ax0_sk10,type,
    ax0_sk10: ( $i * $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_436,axiom,
    sk14 != sk15,
    file(unknown,unknown) ).

tff(f_434,axiom,
    part_of(sk15,sk14),
    file(unknown,unknown) ).

tff(f_433,axiom,
    part_of(sk14,sk15),
    file(unknown,unknown) ).

tff(f_408,axiom,
    ! [A,B] :
      ( incident_c(ax0_sk13(A,B),B)
      | incident_c(ax0_sk13(A,B),A)
      | ( B = A ) ),
    file(unknown,unknown) ).

tff(f_52,axiom,
    ! [A,B,C] :
      ( ~ part_of(A,B)
      | ~ incident_c(C,A)
      | incident_c(C,B) ),
    file(unknown,unknown) ).

tff(f_430,axiom,
    ! [A,B] :
      ( ~ incident_c(ax0_sk13(A,B),A)
      | ~ incident_c(ax0_sk13(A,B),B)
      | ( B = A ) ),
    file(unknown,unknown) ).

tff(c_102,plain,
    sk15 != sk14,
    inference(cnfTransformation,[status(thm)],[f_436]) ).

tff(c_100,plain,
    part_of(sk15,sk14),
    inference(cnfTransformation,[status(thm)],[f_434]) ).

tff(c_98,plain,
    part_of(sk14,sk15),
    inference(cnfTransformation,[status(thm)],[f_433]) ).

tff(c_570,plain,
    ! [B_243,A_244] :
      ( ( B_243 = A_244 )
      | incident_c(ax0_sk13(A_244,B_243),A_244)
      | incident_c(ax0_sk13(A_244,B_243),B_243) ),
    inference(cnfTransformation,[status(thm)],[f_408]) ).

tff(c_2,plain,
    ! [C_3,B_2,A_1] :
      ( incident_c(C_3,B_2)
      | ~ incident_c(C_3,A_1)
      | ~ part_of(A_1,B_2) ),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_600,plain,
    ! [A_244,B_243,B_2] :
      ( incident_c(ax0_sk13(A_244,B_243),B_2)
      | ~ part_of(B_243,B_2)
      | ( B_243 = A_244 )
      | incident_c(ax0_sk13(A_244,B_243),A_244) ),
    inference(resolution,[status(thm)],[c_570,c_2]) ).

tff(c_30435,plain,
    ! [B_243,B_2] :
      ( ~ part_of(B_243,B_2)
      | ( B_243 = B_2 )
      | incident_c(ax0_sk13(B_2,B_243),B_2) ),
    inference(factorization,[status(thm),theory(equality)],[c_600]) ).

tff(c_596,plain,
    ! [A_244,B_243,B_2] :
      ( incident_c(ax0_sk13(A_244,B_243),B_2)
      | ~ part_of(A_244,B_2)
      | ( B_243 = A_244 )
      | incident_c(ax0_sk13(A_244,B_243),B_243) ),
    inference(resolution,[status(thm)],[c_570,c_2]) ).

tff(c_32729,plain,
    ! [A_21723,B_21724] :
      ( ~ part_of(A_21723,B_21724)
      | ( B_21724 = A_21723 )
      | incident_c(ax0_sk13(A_21723,B_21724),B_21724) ),
    inference(factorization,[status(thm),theory(equality)],[c_596]) ).

tff(c_96,plain,
    ! [B_126,A_125] :
      ( ( B_126 = A_125 )
      | ~ incident_c(ax0_sk13(A_125,B_126),B_126)
      | ~ incident_c(ax0_sk13(A_125,B_126),A_125) ),
    inference(cnfTransformation,[status(thm)],[f_430]) ).

tff(c_32936,plain,
    ! [A_21833,B_21834] :
      ( ~ incident_c(ax0_sk13(A_21833,B_21834),A_21833)
      | ~ part_of(A_21833,B_21834)
      | ( B_21834 = A_21833 ) ),
    inference(resolution,[status(thm)],[c_32729,c_96]) ).

tff(c_33076,plain,
    ! [B_22053,B_22054] :
      ( ~ part_of(B_22053,B_22054)
      | ~ part_of(B_22054,B_22053)
      | ( B_22054 = B_22053 ) ),
    inference(resolution,[status(thm)],[c_30435,c_32936]) ).

tff(c_33102,plain,
    ( ~ part_of(sk15,sk14)
    | ( sk15 = sk14 ) ),
    inference(resolution,[status(thm)],[c_98,c_33076]) ).

tff(c_33122,plain,
    sk15 = sk14,
    inference(demodulation,[status(thm),theory(equality)],[c_100,c_33102]) ).

tff(c_33124,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_102,c_33122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO082-1 : TPTP v9.0.0. Released v2.4.0.
% 0.04/0.13  % 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.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr  7 19:28:38 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 12.14/3.88  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.14/3.88  
% 12.14/3.88  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------