↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL126-1 : TPTP v9.3.1. 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 : n001.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:18 AM UTC 2026

% Result   : Unsatisfiable 3.09s 2.27s
% Output   : CNFRefutation 3.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   39 (  21   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   49 (  49   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > equivalent > #nlpp > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_41,axiom,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_6,Y_7,Z_8] : is_a_theorem(equivalent(equivalent(X_6,Y_7),equivalent(equivalent(X_6,Z_8),equivalent(Y_7,Z_8)))),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_4,plain,
    ! [X_3,Y_4,Z_5] : is_a_theorem(equivalent(X_3,equivalent(equivalent(X_3,equivalent(Y_4,Z_5)),equivalent(Z_5,Y_4)))),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_15,plain,
    ! [X_14,Y_15,Z_16] : is_a_theorem(equivalent(X_14,equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),equivalent(Z_16,Y_15)))),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

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

tff(c_20,plain,
    ! [X_17,Y_18,Z_19] :
      ( is_a_theorem(equivalent(equivalent(X_17,equivalent(Y_18,Z_19)),equivalent(Z_19,Y_18)))
      | ~ is_a_theorem(X_17) ),
    inference(resolution,[status(thm)],[c_15,c_2]) ).

tff(c_30,plain,
    ! [Z_23,Y_24,X_25] :
      ( is_a_theorem(equivalent(Z_23,Y_24))
      | ~ is_a_theorem(equivalent(X_25,equivalent(Y_24,Z_23)))
      | ~ is_a_theorem(X_25) ),
    inference(resolution,[status(thm)],[c_20,c_2]) ).

tff(c_45,plain,
    ! [Z_5,Y_4,X_3] :
      ( is_a_theorem(equivalent(equivalent(Z_5,Y_4),equivalent(X_3,equivalent(Y_4,Z_5))))
      | ~ is_a_theorem(X_3) ),
    inference(resolution,[status(thm)],[c_4,c_30]) ).

tff(c_19,plain,
    ! [X_14,Y_15,Z_16] :
      ( is_a_theorem(equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),equivalent(Z_16,Y_15)))
      | ~ is_a_theorem(X_14) ),
    inference(resolution,[status(thm)],[c_15,c_2]) ).

tff(c_84,plain,
    ! [Y_35,Z_36,X_37] :
      ( is_a_theorem(equivalent(Y_35,Z_36))
      | ~ is_a_theorem(equivalent(X_37,equivalent(Y_35,Z_36)))
      | ~ is_a_theorem(X_37) ),
    inference(resolution,[status(thm)],[c_19,c_30]) ).

tff(c_128,plain,
    ! [X_41,Y_42,Z_43] :
      ( is_a_theorem(equivalent(X_41,equivalent(Y_42,Z_43)))
      | ~ is_a_theorem(equivalent(Z_43,Y_42))
      | ~ is_a_theorem(X_41) ),
    inference(resolution,[status(thm)],[c_45,c_84]) ).

tff(c_44,plain,
    ! [Y_15,Z_16,X_14] :
      ( is_a_theorem(equivalent(Y_15,Z_16))
      | ~ is_a_theorem(equivalent(X_14,equivalent(Y_15,Z_16)))
      | ~ is_a_theorem(X_14) ),
    inference(resolution,[status(thm)],[c_19,c_30]) ).

tff(c_146,plain,
    ! [Y_42,Z_43,X_41] :
      ( is_a_theorem(equivalent(Y_42,Z_43))
      | ~ is_a_theorem(equivalent(Z_43,Y_42))
      | ~ is_a_theorem(X_41) ),
    inference(resolution,[status(thm)],[c_128,c_44]) ).

tff(c_151,plain,
    ! [X_41] : ~ is_a_theorem(X_41),
    inference(splitLeft,[status(thm)],[c_146]) ).

tff(c_184,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_151,c_4]) ).

tff(c_186,plain,
    ! [Y_48,Z_49] :
      ( is_a_theorem(equivalent(Y_48,Z_49))
      | ~ is_a_theorem(equivalent(Z_49,Y_48)) ),
    inference(splitRight,[status(thm)],[c_146]) ).

tff(c_207,plain,
    ! [X_6,Z_8,Y_7] : is_a_theorem(equivalent(equivalent(equivalent(X_6,Z_8),equivalent(Y_7,Z_8)),equivalent(X_6,Y_7))),
    inference(resolution,[status(thm)],[c_6,c_186]) ).

tff(c_8,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,b)),equivalent(a,c))),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL126-1 : TPTP v9.3.1. Released v1.0.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.08/0.35  % Computer : n001.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 11:04:16 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 3.09/2.27  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/2.28  
% 3.09/2.28  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------