↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO058-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 : n017.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 4.32s 1.97s
% Output   : CNFRefutation 4.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (  10 unt;   0 typ;   0 def)
%            Number of atoms       :   18 (   7 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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   :   18 (  18   !;   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_313,axiom,
    u != v,
    file(unknown,unknown) ).

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

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

tff(f_284,axiom,
    ! [U,V,W,X] :
      ( ~ equidistant(U,V,W,X)
      | equidistant(X,W,V,U) ),
    file(unknown,unknown) ).

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

tff(c_72,plain,
    v != u,
    inference(cnfTransformation,[status(thm)],[f_313]) ).

tff(c_70,plain,
    reflection(u,v) = v,
    inference(cnfTransformation,[status(thm)],[f_311]) ).

tff(c_113,plain,
    ! [V_138,U_139] : equidistant(V_138,reflection(U_139,V_138),U_139,V_138),
    inference(cnfTransformation,[status(thm)],[f_303]) ).

tff(c_119,plain,
    equidistant(v,v,u,v),
    inference(superposition,[status(thm),theory(equality)],[c_70,c_113]) ).

tff(c_196,plain,
    ! [X_157,W_158,V_159,U_160] :
      ( equidistant(X_157,W_158,V_159,U_160)
      | ~ equidistant(U_160,V_159,W_158,X_157) ),
    inference(cnfTransformation,[status(thm)],[f_284]) ).

tff(c_212,plain,
    equidistant(v,u,v,v),
    inference(resolution,[status(thm)],[c_119,c_196]) ).

tff(c_6,plain,
    ! [Y_10,X_9,Z_11] :
      ( ( Y_10 = X_9 )
      | ~ equidistant(X_9,Y_10,Z_11,Z_11) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_222,plain,
    v = u,
    inference(resolution,[status(thm)],[c_212,c_6]) ).

tff(c_228,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_72,c_222]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : GEO058-3 : TPTP v9.0.0. Released v1.0.0.
% 0.08/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 : n017.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:23:55 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 4.32/1.97  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/1.98  
% 4.32/1.98  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------