↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : LCL007-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n002.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:04 AM UTC 2026

% Result   : Unsatisfiable 3.29s 2.33s
% Output   : CNFRefutation 3.29s
% 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 :   12 (   7   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    4 (   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   :   19 (  19   !;   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_38,axiom,
    ! [X,Y,Z] : is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(X,equivalent(Y,Z)))),
    file(unknown,unknown) ).

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

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

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

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

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

tff(c_10,plain,
    ! [Y_10,X_11] :
      ( is_a_theorem(Y_10)
      | ~ is_a_theorem(X_11)
      | ~ is_a_theorem(equivalent(X_11,Y_10)) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

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

tff(c_26,plain,
    ! [X_14,Y_15,Z_16] : is_a_theorem(equivalent(equivalent(X_14,equivalent(Y_15,Z_16)),equivalent(equivalent(X_14,Y_15),Z_16))),
    inference(resolution,[status(thm)],[c_20,c_14]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL007-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.09/0.35  % Computer : n002.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep  4 17:53:20 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 3.29/2.33  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.29/2.33  
% 3.29/2.33  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------