↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWV006-1 : 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 : n012.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 09:29:18 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ less_than > #nlpp > successor > predecessor > a > one > n > m > i

%Foreground sorts:

%Background operators:

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

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

tff(predecessor,type,
    predecessor: $i > $i ).

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

tff(a,type,
    a: $i > $i ).

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

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

tff(successor,type,
    successor: $i > $i ).

tff(f_110,axiom,
    less_than(i,n),
    file(unknown,unknown) ).

tff(f_65,axiom,
    ! [X] : less_than(X,successor(X)),
    file(unknown,unknown) ).

tff(f_73,axiom,
    ! [X,Z,Y] :
      ( less_than(X,Z)
      | ~ less_than(X,Y)
      | ~ less_than(Y,Z) ),
    file(unknown,unknown) ).

tff(f_82,axiom,
    ! [X] : ~ less_than(X,X),
    file(unknown,unknown) ).

tff(f_113,axiom,
    less_than(a(i),a(m)),
    file(unknown,unknown) ).

tff(f_121,axiom,
    ! [X] :
      ( less_than(X,i)
      | ~ less_than(X,successor(n))
      | ~ less_than(a(X),a(m)) ),
    file(unknown,unknown) ).

tff(c_30,plain,
    less_than(i,n),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_12,plain,
    ! [X_8] : less_than(X_8,successor(X_8)),
    inference(cnfTransformation,[status(thm)],[f_65]) ).

tff(c_234,plain,
    ! [Y_45,Z_46,X_47] :
      ( ~ less_than(Y_45,Z_46)
      | ~ less_than(X_47,Y_45)
      | less_than(X_47,Z_46) ),
    inference(cnfTransformation,[status(thm)],[f_73]) ).

tff(c_477,plain,
    ! [X_58,X_59] :
      ( ~ less_than(X_58,X_59)
      | less_than(X_58,successor(X_59)) ),
    inference(resolution,[status(thm)],[c_12,c_234]) ).

tff(c_18,plain,
    ! [X_14] : ~ less_than(X_14,X_14),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_34,plain,
    less_than(a(i),a(m)),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_361,plain,
    ! [X_53] :
      ( ~ less_than(a(X_53),a(m))
      | ~ less_than(X_53,successor(n))
      | less_than(X_53,i) ),
    inference(cnfTransformation,[status(thm)],[f_121]) ).

tff(c_370,plain,
    ( ~ less_than(i,successor(n))
    | less_than(i,i) ),
    inference(resolution,[status(thm)],[c_34,c_361]) ).

tff(c_375,plain,
    ~ less_than(i,successor(n)),
    inference(negUnitSimplification,[status(thm)],[c_18,c_370]) ).

tff(c_483,plain,
    ~ less_than(i,n),
    inference(resolution,[status(thm)],[c_477,c_375]) ).

tff(c_506,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_30,c_483]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV006-1 : TPTP v9.0.0. Released v1.0.0.
% 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 : n012.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 : Wed Apr  9 02:35:14 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 3.60/1.89  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.60/1.89  
% 3.60/1.89  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------