↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PUZ035-5 : TPTP v9.0.0. Released v2.0.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 : n004.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 08:25:07 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ says > truth > or > isa > #nlpp > other > knight > knave > asked

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

tff(f_83,axiom,
    ! [X,Y] :
      ( ~ truth(isa(asked,X))
      | ~ truth(isa(other,Y)) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [P] :
      ( truth(isa(P,knight))
      | truth(isa(P,knave)) ),
    file(unknown,unknown) ).

tff(c_18,plain,
    ! [Y_14,X_13] :
      ( ~ truth(isa(other,Y_14))
      | ~ truth(isa(asked,X_13)) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_36,plain,
    ! [X_13] : ~ truth(isa(asked,X_13)),
    inference(splitLeft,[status(thm)],[c_18]) ).

tff(c_2,plain,
    ! [P_1] :
      ( truth(isa(P_1,knave))
      | truth(isa(P_1,knight)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_37,plain,
    ! [X_23] : ~ truth(isa(asked,X_23)),
    inference(splitLeft,[status(thm)],[c_18]) ).

tff(c_41,plain,
    truth(isa(asked,knave)),
    inference(resolution,[status(thm)],[c_2,c_37]) ).

tff(c_45,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_36,c_41]) ).

tff(c_46,plain,
    ! [Y_14] : ~ truth(isa(other,Y_14)),
    inference(splitRight,[status(thm)],[c_18]) ).

tff(c_47,plain,
    ! [Y_24] : ~ truth(isa(other,Y_24)),
    inference(splitRight,[status(thm)],[c_18]) ).

tff(c_51,plain,
    truth(isa(other,knave)),
    inference(resolution,[status(thm)],[c_2,c_47]) ).

tff(c_55,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_46,c_51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : PUZ035-5 : TPTP v9.0.0. Released v2.0.0.
% 0.08/0.13  % 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.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Apr  8 17:13:23 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 2.53/1.59  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.59  
% 2.53/1.59  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------