↑ Up

Beagle---0.9.52.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO080+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/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 : n011.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:42 PM UTC 2025

% Result   : Theorem 3.61s 1.94s
% Output   : CNFRefutation 3.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    7 (   4 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :    7 (   3   ~;   2   |;   0   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 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  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   1 con; 0-3 aty)
%            Number of variables   :    9 (   9   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > sum > #nlpp > #skF_9 > #skF_7 > #skF_11 > #skF_6 > #skF_8 > #skF_13 > #skF_16 > #skF_14 > #skF_12 > #skF_10 > #skF_2 > #skF_3 > #skF_1 > #skF_5 > #skF_15 > #skF_4

%Foreground sorts:

%Background operators:

%Foreground operators:
tff('#skF_9',type,
    '#skF_9': $i > $i ).

tff('#skF_7',type,
    '#skF_7': $i > $i ).

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

tff('#skF_11',type,
    '#skF_11': ( $i * $i ) > $i ).

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

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

tff('#skF_6',type,
    '#skF_6': ( $i * $i * $i ) > $i ).

tff('#skF_8',type,
    '#skF_8': $i > $i ).

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

tff('#skF_13',type,
    '#skF_13': ( $i * $i ) > $i ).

tff('#skF_16',type,
    '#skF_16': $i ).

tff('#skF_14',type,
    '#skF_14': ( $i * $i ) > $i ).

tff('#skF_12',type,
    '#skF_12': ( $i * $i ) > $i ).

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

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

tff('#skF_10',type,
    '#skF_10': ( $i * $i ) > $i ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i * $i ) > $i ).

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

tff('#skF_3',type,
    '#skF_3': ( $i * $i * $i ) > $i ).

tff('#skF_1',type,
    '#skF_1': ( $i * $i ) > $i ).

tff('#skF_5',type,
    '#skF_5': ( $i * $i ) > $i ).

tff('#skF_15',type,
    '#skF_15': ( $i * $i ) > $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i ) > $i ).

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

tff(f_57,axiom,
    ! [C,C1] :
      ( part_of(C1,C)
    <=> ! [P] :
          ( incident_c(P,C1)
         => incident_c(P,C) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).

tff(f_207,negated_conjecture,
    ~ ! [C] : part_of(C,C),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_reflexivity) ).

tff(c_157,plain,
    ! [C_100,C1_101] :
      ( incident_c('#skF_1'(C_100,C1_101),C1_101)
      | part_of(C1_101,C_100) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_4,plain,
    ! [C_1,C1_2] :
      ( ~ incident_c('#skF_1'(C_1,C1_2),C_1)
      | part_of(C1_2,C_1) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_162,plain,
    ! [C1_101] : part_of(C1_101,C1_101),
    inference(resolution,[status(thm)],[c_157,c_4]) ).

tff(c_98,plain,
    ~ part_of('#skF_16','#skF_16'),
    inference(cnfTransformation,[status(thm)],[f_207]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO080+1 : TPTP v9.0.0. Released v2.4.0.
% 0.03/0.13  % 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.13/0.34  % Computer : n011.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:27:33 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.61/1.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.61/1.94  
% 3.61/1.94  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------