↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : GEO064-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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 : n006.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:39 PM UTC 2025

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

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

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

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

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(insertion,type,
    insertion: ( $i * $i * $i * $i ) > $i ).

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_771,axiom,
    between(w,v,u),
    file(unknown,unknown) ).

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

tff(f_252,axiom,
    ! [X,Y,Z] :
      ( ~ between(X,Y,Z)
      | colinear(X,Y,Z) ),
    file(unknown,unknown) ).

tff(f_773,axiom,
    ~ colinear(u,v,w),
    file(unknown,unknown) ).

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

tff(c_328,plain,
    ! [W_357,V_358,U_359] :
      ( between(W_357,V_358,U_359)
      | ~ between(U_359,V_358,W_357) ),
    inference(cnfTransformation,[status(thm)],[f_459]) ).

tff(c_347,plain,
    between(u,v,w),
    inference(resolution,[status(thm)],[c_176,c_328]) ).

tff(c_392,plain,
    ! [X_369,Y_370,Z_371] :
      ( colinear(X_369,Y_370,Z_371)
      | ~ between(X_369,Y_370,Z_371) ),
    inference(cnfTransformation,[status(thm)],[f_252]) ).

tff(c_178,plain,
    ~ colinear(u,v,w),
    inference(cnfTransformation,[status(thm)],[f_773]) ).

tff(c_395,plain,
    ~ between(u,v,w),
    inference(resolution,[status(thm)],[c_392,c_178]) ).

tff(c_399,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_347,c_395]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO064-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 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.13/0.35  % Computer : n006.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Apr  7 19:24:23 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 4.52/2.07  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.52/2.08  
% 4.52/2.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------