↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO056-3 : TPTP v9.0.0. Released v1.0.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 : 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 : Wed Apr  9 06:13:38 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #nlpp > v > u > lower_dimension_point_3 > lower_dimension_point_2 > lower_dimension_point_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_303,axiom,
    ! [V,U] : equidistant(V,reflection(U,V),U,V),
    file(unknown,unknown) ).

tff(f_71,axiom,
    ! [X,Y,Z] :
      ( ~ equidistant(X,Y,Z,Z)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_304,axiom,
    u = v,
    file(unknown,unknown) ).

tff(f_306,axiom,
    v != reflection(u,v),
    file(unknown,unknown) ).

tff(c_64,plain,
    ! [V_120,U_121] : equidistant(V_120,reflection(U_121,V_120),U_121,V_120),
    inference(cnfTransformation,[status(thm)],[f_303]) ).

tff(c_89,plain,
    ! [Y_135,X_136,Z_137] :
      ( ( Y_135 = X_136 )
      | ~ equidistant(X_136,Y_135,Z_137,Z_137) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_102,plain,
    ! [V_120] : ( reflection(V_120,V_120) = V_120 ),
    inference(resolution,[status(thm)],[c_64,c_89]) ).

tff(c_66,plain,
    v = u,
    inference(cnfTransformation,[status(thm)],[f_304]) ).

tff(c_68,plain,
    reflection(u,v) != v,
    inference(cnfTransformation,[status(thm)],[f_306]) ).

tff(c_69,plain,
    reflection(u,u) != u,
    inference(demodulation,[status(thm),theory(equality)],[c_66,c_66,c_68]) ).

tff(c_109,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_102,c_69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12  % Problem  : GEO056-3 : TPTP v9.0.0. Released v1.0.0.
% 0.02/0.12  % 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.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Mon Apr  7 19:23:36 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.56/1.74  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.56/1.74  
% 3.56/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------