↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL360-1 : TPTP v9.3.1. Released v2.3.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 : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:11:46 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > z > y > x

%Foreground sorts:

%Background operators:

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

tff(is_a_theorem,type,
    is_a_theorem: $i > $o ).

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

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

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

tff(implies,type,
    implies: ( $i * $i ) > $i ).

tff(f_38,axiom,
    ! [X,Y] : is_a_theorem(implies(X,implies(not(X),Y))),
    file(unknown,unknown) ).

tff(f_34,axiom,
    ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file(unknown,unknown) ).

tff(f_40,axiom,
    ~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
    file(unknown,unknown) ).

tff(c_8,plain,
    ! [X_7,Y_8] : is_a_theorem(implies(X_7,implies(not(X_7),Y_8))),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_35,plain,
    ! [X_18,Y_19,Z_20] : is_a_theorem(implies(implies(X_18,Y_19),implies(implies(Y_19,Z_20),implies(X_18,Z_20)))),
    inference(cnfTransformation,[status(thm)],[f_34]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( is_a_theorem(Y_2)
      | ~ is_a_theorem(X_1)
      | ~ is_a_theorem(implies(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_40,plain,
    ! [Y_21,Z_22,X_23] :
      ( is_a_theorem(implies(implies(Y_21,Z_22),implies(X_23,Z_22)))
      | ~ is_a_theorem(implies(X_23,Y_21)) ),
    inference(resolution,[status(thm)],[c_35,c_2]) ).

tff(c_10,plain,
    ~ is_a_theorem(implies(implies(implies(not(x),y),z),implies(x,z))),
    inference(cnfTransformation,[status(thm)],[f_40]) ).

tff(c_43,plain,
    ~ is_a_theorem(implies(x,implies(not(x),y))),
    inference(resolution,[status(thm)],[c_40,c_10]) ).

tff(c_50,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_8,c_43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL360-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % 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.10/0.36  % Computer : n019.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sat Sep  5 13:56:38 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 2.72/2.08  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.72/2.09  
% 2.72/2.09  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------