↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN063-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/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 : n003.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 10:02:22 PM UTC 2025

% Result   : Unsatisfiable 2.48s 1.69s
% Output   : CNFRefutation 2.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   26 (  12   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   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-1 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   10 (  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > #nlpp > e > d > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_23,axiom,
    big_p(a),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ~ big_p(c),
    file(unknown,unknown) ).

tff(f_32,axiom,
    ! [X,Y] :
      ( ~ big_p(a)
      | big_p(X)
      | big_p(c)
      | big_p(Y) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ( ~ big_p(a)
    | ~ big_p(b)
    | big_p(c) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    big_p(a),
    inference(cnfTransformation,[status(thm)],[f_23]) ).

tff(c_8,plain,
    ~ big_p(c),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_4,plain,
    ! [Y_2,X_1] :
      ( big_p(Y_2)
      | big_p(c)
      | big_p(X_1)
      | ~ big_p(a) ),
    inference(cnfTransformation,[status(thm)],[f_32]) ).

tff(c_18,plain,
    ! [Y_2,X_1] :
      ( big_p(Y_2)
      | big_p(X_1)
      | ~ big_p(a) ),
    inference(negUnitSimplification,[status(thm)],[c_8,c_4]) ).

tff(c_22,plain,
    ! [Y_2,X_1] :
      ( big_p(Y_2)
      | big_p(X_1) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_18]) ).

tff(c_24,plain,
    ! [X_1] : big_p(X_1),
    inference(splitLeft,[status(thm)],[c_22]) ).

tff(c_6,plain,
    ( big_p(c)
    | ~ big_p(b)
    | ~ big_p(a) ),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_17,plain,
    ( ~ big_p(b)
    | ~ big_p(a) ),
    inference(negUnitSimplification,[status(thm)],[c_8,c_6]) ).

tff(c_20,plain,
    ~ big_p(b),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_17]) ).

tff(c_30,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_24,c_20]) ).

tff(c_31,plain,
    ! [Y_2] : big_p(Y_2),
    inference(splitRight,[status(thm)],[c_22]) ).

tff(c_37,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_31,c_20]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN063-1 : TPTP v9.0.0. Released v1.0.0.
% 0.03/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.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Apr  9 06:55:03 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 2.48/1.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.48/1.69  
% 2.48/1.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------