↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SWV005-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 : n015.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.45s 1.90s
% Output   : CNFRefutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   13 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   18 (   9   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    3 (   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    :    8 (   8 usr;   5 con; 0-1 aty)
%            Number of variables   :    3 (   3   !;   0   ?;   0   :)

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

%Foreground sorts:

%Background operators:

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

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

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

tff(k,type,
    k: $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(k,l),
    file(unknown,unknown) ).

tff(f_108,axiom,
    ~ less_than(n,k),
    file(unknown,unknown) ).

tff(f_115,axiom,
    less_than(a(k),a(predecessor(l))),
    file(unknown,unknown) ).

tff(f_114,axiom,
    less_than(one,l),
    file(unknown,unknown) ).

tff(f_133,axiom,
    ! [X] :
      ( less_than(X,l)
      | less_than(n,X)
      | ~ less_than(one,l)
      | ~ less_than(a(X),a(predecessor(l))) ),
    file(unknown,unknown) ).

tff(c_28,plain,
    ~ less_than(k,l),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_26,plain,
    ~ less_than(n,k),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_36,plain,
    less_than(a(k),a(predecessor(l))),
    inference(cnfTransformation,[status(thm)],[f_115]) ).

tff(c_34,plain,
    less_than(one,l),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_40,plain,
    ! [X_24] :
      ( ~ less_than(a(X_24),a(predecessor(l)))
      | ~ less_than(one,l)
      | less_than(n,X_24)
      | less_than(X_24,l) ),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_326,plain,
    ! [X_50] :
      ( ~ less_than(a(X_50),a(predecessor(l)))
      | less_than(n,X_50)
      | less_than(X_50,l) ),
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_40]) ).

tff(c_335,plain,
    ( less_than(n,k)
    | less_than(k,l) ),
    inference(resolution,[status(thm)],[c_36,c_326]) ).

tff(c_341,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_28,c_26,c_335]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWV005-1 : TPTP v9.0.0. Released v1.0.0.
% 0.06/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.34  % Computer : n015.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Wed Apr  9 02:35:35 EDT 2025
% 0.13/0.34  % CPUTime  : 
% 3.45/1.90  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.70/1.91  
% 3.70/1.91  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------