↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO086-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:44 PM UTC 2025

% Result   : Unsatisfiable 4.10s 1.84s
% Output   : CNFRefutation 4.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   12 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   10 (   5   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    1 (   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   :    4 (   4   !;   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_433,axiom,
    open(sk14),
    file(unknown,unknown) ).

tff(f_436,axiom,
    ~ open(sk15),
    file(unknown,unknown) ).

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

tff(f_315,axiom,
    ! [A,B] :
      ( ~ part_of(A,B)
      | ( A = B )
      | open(A) ),
    file(unknown,unknown) ).

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

tff(c_102,plain,
    ~ open(sk15),
    inference(cnfTransformation,[status(thm)],[f_436]) ).

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

tff(c_142,plain,
    ! [A_143,B_144] :
      ( open(A_143)
      | ( B_144 = A_143 )
      | ~ part_of(A_143,B_144) ),
    inference(cnfTransformation,[status(thm)],[f_315]) ).

tff(c_145,plain,
    ( open(sk15)
    | ( sk15 = sk14 ) ),
    inference(resolution,[status(thm)],[c_100,c_142]) ).

tff(c_148,plain,
    sk15 = sk14,
    inference(negUnitSimplification,[status(thm)],[c_102,c_145]) ).

tff(c_150,plain,
    ~ open(sk14),
    inference(demodulation,[status(thm),theory(equality)],[c_148,c_102]) ).

tff(c_153,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_98,c_150]) ).

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