↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN310-1 : TPTP v9.0.0. Released v1.2.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 : n024.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:03:08 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ p > #nlpp > g > f > c > b > a

%Foreground sorts:

%Background operators:

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

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

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

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

tff(p,type,
    p: ( $i * $i * $i ) > $o ).

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

tff(f_43,axiom,
    ~ p(a,b,c),
    file(unknown,unknown) ).

tff(f_44,axiom,
    p(f(g(a)),f(g(b)),f(g(c))),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [X,X1,X2] :
      ( ~ p(f(X),X1,X2)
      | p(X,X1,X2) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [X2,X1,X] :
      ( ~ p(X2,X1,X)
      | p(X,X1,X2) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [X,X1,X2] :
      ( ~ p(X,X1,g(X2))
      | p(X,X1,X2) ),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [X1,X,X2] :
      ( ~ p(X1,X,X2)
      | p(X,X1,X2) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    ~ p(a,b,c),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_12,plain,
    p(f(g(a)),f(g(b)),f(g(c))),
    inference(cnfTransformation,[status(thm)],[f_44]) ).

tff(c_8,plain,
    ! [X_10,X1_11,X2_12] :
      ( p(X_10,X1_11,X2_12)
      | ~ p(f(X_10),X1_11,X2_12) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_24,plain,
    p(g(a),f(g(b)),f(g(c))),
    inference(resolution,[status(thm)],[c_12,c_8]) ).

tff(c_2,plain,
    ! [X_3,X1_2,X2_1] :
      ( p(X_3,X1_2,X2_1)
      | ~ p(X2_1,X1_2,X_3) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_31,plain,
    p(f(g(c)),f(g(b)),g(a)),
    inference(resolution,[status(thm)],[c_24,c_2]) ).

tff(c_6,plain,
    ! [X_7,X1_8,X2_9] :
      ( p(X_7,X1_8,X2_9)
      | ~ p(X_7,X1_8,g(X2_9)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_43,plain,
    p(f(g(c)),f(g(b)),a),
    inference(resolution,[status(thm)],[c_31,c_6]) ).

tff(c_55,plain,
    p(g(c),f(g(b)),a),
    inference(resolution,[status(thm)],[c_43,c_8]) ).

tff(c_62,plain,
    p(a,f(g(b)),g(c)),
    inference(resolution,[status(thm)],[c_55,c_2]) ).

tff(c_71,plain,
    p(a,f(g(b)),c),
    inference(resolution,[status(thm)],[c_62,c_6]) ).

tff(c_4,plain,
    ! [X_5,X1_4,X2_6] :
      ( p(X_5,X1_4,X2_6)
      | ~ p(X1_4,X_5,X2_6) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_80,plain,
    p(f(g(b)),a,c),
    inference(resolution,[status(thm)],[c_71,c_4]) ).

tff(c_95,plain,
    p(g(b),a,c),
    inference(resolution,[status(thm)],[c_80,c_8]) ).

tff(c_103,plain,
    p(c,a,g(b)),
    inference(resolution,[status(thm)],[c_95,c_2]) ).

tff(c_123,plain,
    p(c,a,b),
    inference(resolution,[status(thm)],[c_103,c_6]) ).

tff(c_131,plain,
    p(b,a,c),
    inference(resolution,[status(thm)],[c_123,c_2]) ).

tff(c_136,plain,
    p(a,b,c),
    inference(resolution,[status(thm)],[c_131,c_4]) ).

tff(c_142,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_10,c_136]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : SYN310-1 : TPTP v9.0.0. Released v1.2.0.
% 0.09/0.12  % 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.32  % Computer : n024.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit : 300
% 0.10/0.32  % WCLimit  : 300
% 0.10/0.32  % DateTime : Wed Apr  9 07:16:06 EDT 2025
% 0.10/0.32  % CPUTime  : 
% 2.93/2.03  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.93/2.04  
% 2.93/2.04  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------