↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : CAT019-3 : 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/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 : n020.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 05:46:32 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ equivalent > there_exists > f1 > compose > #nlpp > domain > codomain > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(equivalent,type,
    equivalent: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

tff(f_178,axiom,
    a != b,
    file(unknown,unknown) ).

tff(f_143,axiom,
    ! [X,Y] :
      ( ( X = f1(X,Y) )
      | ( Y = f1(X,Y) )
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_137,axiom,
    ! [X,Y] :
      ( there_exists(f1(X,Y))
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_168,axiom,
    ! [Z] :
      ( ~ there_exists(Z)
      | ( a != Z )
      | ( b = Z ) ),
    file(unknown,unknown) ).

tff(f_176,axiom,
    ! [Z] :
      ( ~ there_exists(Z)
      | ( a = Z )
      | ( b != Z ) ),
    file(unknown,unknown) ).

tff(c_40,plain,
    b != a,
    inference(cnfTransformation,[status(thm)],[f_178]) ).

tff(c_397,plain,
    ! [Y_70,X_71] :
      ( ( Y_70 = X_71 )
      | ( f1(X_71,Y_70) = Y_70 )
      | ( f1(X_71,Y_70) = X_71 ) ),
    inference(cnfTransformation,[status(thm)],[f_143]) ).

tff(c_30,plain,
    ! [Y_27,X_26] :
      ( ( Y_27 = X_26 )
      | there_exists(f1(X_26,Y_27)) ),
    inference(cnfTransformation,[status(thm)],[f_137]) ).

tff(c_941,plain,
    ! [Y_89,X_90] :
      ( ( Y_89 = X_90 )
      | there_exists(X_90)
      | ( Y_89 = X_90 )
      | ( f1(X_90,Y_89) = Y_89 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_397,c_30]) ).

tff(c_36,plain,
    ( ( b = a )
    | ~ there_exists(a) ),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_42,plain,
    ~ there_exists(a),
    inference(negUnitSimplification,[status(thm)],[c_40,c_36]) ).

tff(c_1007,plain,
    ! [Y_91] :
      ( ( a = Y_91 )
      | ( f1(a,Y_91) = Y_91 ) ),
    inference(resolution,[status(thm)],[c_941,c_42]) ).

tff(c_1110,plain,
    ! [Y_94] :
      ( ( a = Y_94 )
      | there_exists(Y_94)
      | ( a = Y_94 ) ),
    inference(superposition,[status(thm),theory(equality)],[c_1007,c_30]) ).

tff(c_38,plain,
    ( ( b = a )
    | ~ there_exists(b) ),
    inference(cnfTransformation,[status(thm)],[f_176]) ).

tff(c_41,plain,
    ~ there_exists(b),
    inference(negUnitSimplification,[status(thm)],[c_40,c_38]) ).

tff(c_1137,plain,
    b = a,
    inference(resolution,[status(thm)],[c_1110,c_41]) ).

tff(c_1150,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_40,c_1137]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CAT019-3 : TPTP v9.0.0. Released v1.0.0.
% 0.06/0.13  % 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.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Mon Apr  7 15:40:34 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 4.01/1.94  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.01/1.95  
% 4.01/1.95  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------