↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : SYN084-2 : 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 : n005.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:35 PM UTC 2025

% Result   : Unsatisfiable 2.60s 1.67s
% Output   : CNFRefutation 2.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   67 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   66 (  35   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   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-1 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ big_p > #nlpp > f > sk2 > sk1 > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(f_46,axiom,
    ! [A] :
      ( big_p(f(f(A)))
      | ~ big_p(f(A))
      | ~ big_p(a) ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(f(f(sk2))) ),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [A] :
      ( big_p(f(f(A)))
      | big_p(A)
      | ~ big_p(a) ),
    file(unknown,unknown) ).

tff(f_60,axiom,
    ( big_p(f(sk1))
    | big_p(f(sk2))
    | ~ big_p(sk1)
    | ~ big_p(sk2) ),
    file(unknown,unknown) ).

tff(f_67,axiom,
    ( big_p(f(sk1))
    | ~ big_p(sk1)
    | ~ big_p(f(f(sk2))) ),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ( big_p(f(sk2))
    | ~ big_p(sk2)
    | ~ big_p(f(f(sk1))) ),
    file(unknown,unknown) ).

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

tff(c_6,plain,
    ! [A_2] :
      ( ~ big_p(a)
      | ~ big_p(f(A_2))
      | big_p(f(f(A_2))) ),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_18,plain,
    ! [A_2] :
      ( ~ big_p(f(A_2))
      | big_p(f(f(A_2))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_6]) ).

tff(c_8,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(f(f(sk1))) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_21,plain,
    ~ big_p(f(f(sk1))),
    inference(splitLeft,[status(thm)],[c_8]) ).

tff(c_28,plain,
    ~ big_p(f(sk1)),
    inference(resolution,[status(thm)],[c_18,c_21]) ).

tff(c_4,plain,
    ! [A_1] :
      ( ~ big_p(a)
      | big_p(A_1)
      | big_p(f(f(A_1))) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_16,plain,
    ! [A_1] :
      ( big_p(A_1)
      | big_p(f(f(A_1))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_4]) ).

tff(c_29,plain,
    big_p(sk1),
    inference(resolution,[status(thm)],[c_16,c_21]) ).

tff(c_10,plain,
    ( ~ big_p(sk2)
    | ~ big_p(sk1)
    | big_p(f(sk2))
    | big_p(f(sk1)) ),
    inference(cnfTransformation,[status(thm)],[f_60]) ).

tff(c_42,plain,
    ( ~ big_p(sk2)
    | big_p(f(sk2))
    | big_p(f(sk1)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_29,c_10]) ).

tff(c_43,plain,
    ( ~ big_p(sk2)
    | big_p(f(sk2)) ),
    inference(negUnitSimplification,[status(thm)],[c_28,c_42]) ).

tff(c_44,plain,
    ~ big_p(sk2),
    inference(splitLeft,[status(thm)],[c_43]) ).

tff(c_12,plain,
    ( ~ big_p(f(f(sk2)))
    | ~ big_p(sk1)
    | big_p(f(sk1)) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_31,plain,
    ( ~ big_p(f(f(sk2)))
    | big_p(f(sk1)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_29,c_12]) ).

tff(c_32,plain,
    ~ big_p(f(f(sk2))),
    inference(negUnitSimplification,[status(thm)],[c_28,c_31]) ).

tff(c_40,plain,
    big_p(sk2),
    inference(resolution,[status(thm)],[c_16,c_32]) ).

tff(c_45,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_40]) ).

tff(c_46,plain,
    big_p(f(sk2)),
    inference(splitRight,[status(thm)],[c_43]) ).

tff(c_39,plain,
    ~ big_p(f(sk2)),
    inference(resolution,[status(thm)],[c_18,c_32]) ).

tff(c_50,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_46,c_39]) ).

tff(c_51,plain,
    ~ big_p(f(f(sk2))),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_59,plain,
    ~ big_p(f(sk2)),
    inference(resolution,[status(thm)],[c_18,c_51]) ).

tff(c_60,plain,
    big_p(sk2),
    inference(resolution,[status(thm)],[c_16,c_51]) ).

tff(c_14,plain,
    ( ~ big_p(f(f(sk1)))
    | ~ big_p(sk2)
    | big_p(f(sk2)) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_62,plain,
    ( ~ big_p(f(f(sk1)))
    | big_p(f(sk2)) ),
    inference(demodulation,[status(thm),theory(equality)],[c_60,c_14]) ).

tff(c_63,plain,
    ~ big_p(f(f(sk1))),
    inference(negUnitSimplification,[status(thm)],[c_59,c_62]) ).

tff(c_52,plain,
    big_p(f(f(sk1))),
    inference(splitRight,[status(thm)],[c_8]) ).

tff(c_72,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_63,c_52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN084-2 : TPTP v9.0.0. Released v1.2.0.
% 0.12/0.14  % 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.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Wed Apr  9 06:56:27 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 2.60/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.60/1.68  
% 2.60/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------