↑ Up

Beagle---0.9.52.UNS-CRf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #nlpp > x > w > 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(x,type,
    x: $i ).

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

tff(w,type,
    w: $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_468,axiom,
    ~ between(u,v,x),
    file(unknown,unknown) ).

tff(f_466,axiom,
    between(u,w,x),
    file(unknown,unknown) ).

tff(f_382,axiom,
    ! [U,V,W] :
      ( ~ between(U,V,W)
      | between(W,V,U) ),
    file(unknown,unknown) ).

tff(f_465,axiom,
    between(u,v,w),
    file(unknown,unknown) ).

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

tff(c_118,plain,
    ~ between(u,v,x),
    inference(cnfTransformation,[status(thm)],[f_468]) ).

tff(c_116,plain,
    between(u,w,x),
    inference(cnfTransformation,[status(thm)],[f_466]) ).

tff(c_250,plain,
    ! [W_228,V_229,U_230] :
      ( between(W_228,V_229,U_230)
      | ~ between(U_230,V_229,W_228) ),
    inference(cnfTransformation,[status(thm)],[f_382]) ).

tff(c_272,plain,
    between(x,w,u),
    inference(resolution,[status(thm)],[c_116,c_250]) ).

tff(c_114,plain,
    between(u,v,w),
    inference(cnfTransformation,[status(thm)],[f_465]) ).

tff(c_267,plain,
    between(w,v,u),
    inference(resolution,[status(thm)],[c_114,c_250]) ).

tff(c_1344,plain,
    ! [U_340,W_341,X_342,V_343] :
      ( between(U_340,W_341,X_342)
      | ~ between(V_343,W_341,X_342)
      | ~ between(U_340,V_343,X_342) ),
    inference(cnfTransformation,[status(thm)],[f_464]) ).

tff(c_2525,plain,
    ! [U_402] :
      ( between(U_402,v,u)
      | ~ between(U_402,w,u) ),
    inference(resolution,[status(thm)],[c_267,c_1344]) ).

tff(c_2546,plain,
    between(x,v,u),
    inference(resolution,[status(thm)],[c_272,c_2525]) ).

tff(c_92,plain,
    ! [W_162,V_161,U_160] :
      ( between(W_162,V_161,U_160)
      | ~ between(U_160,V_161,W_162) ),
    inference(cnfTransformation,[status(thm)],[f_382]) ).

tff(c_2590,plain,
    between(u,v,x),
    inference(resolution,[status(thm)],[c_2546,c_92]) ).

tff(c_2603,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_118,c_2590]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem  : GEO047-3 : TPTP v9.0.0. Released v1.0.0.
% 0.04/0.10  % 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.10/0.29  % Computer : n008.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 300
% 0.10/0.29  % DateTime : Mon Apr  7 19:21:47 EDT 2025
% 0.10/0.30  % CPUTime  : 
% 8.72/3.53  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.86/3.54  
% 8.86/3.54  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------