↑ Up

Beagle---0.9.52.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Beagle---0.9.52
% Problem  : PUZ035-7 : 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 : 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 08:25:08 PM UTC 2025

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

% Comments : 
%------------------------------------------------------------------------------
%$ reply > truth > or > isa > #nlpp > not > yes > other > no > knight > knave > asked

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

tff(not,type,
    not: $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_126,axiom,
    ! [R,X,Y] :
      ( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R)
      | ~ truth(isa(asked,X))
      | ~ truth(isa(other,Y)) ),
    file(unknown,unknown) ).

tff(f_80,axiom,
    ! [P,Q] :
      ( reply(P,Q,yes)
      | reply(P,Q,no) ),
    file(unknown,unknown) ).

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

tff(c_28,plain,
    ! [Y_25,X_24,R_23] :
      ( ~ truth(isa(other,Y_25))
      | ~ truth(isa(asked,X_24))
      | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_23) ),
    inference(cnfTransformation,[status(thm)],[f_126]) ).

tff(c_104,plain,
    ! [R_23] : ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_23),
    inference(splitLeft,[status(thm)],[c_28]) ).

tff(c_14,plain,
    ! [P_11,Q_12] :
      ( reply(P_11,Q_12,no)
      | reply(P_11,Q_12,yes) ),
    inference(cnfTransformation,[status(thm)],[f_80]) ).

tff(c_105,plain,
    ! [R_52] : ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_52),
    inference(splitLeft,[status(thm)],[c_28]) ).

tff(c_117,plain,
    reply(asked,or(isa(asked,knight),isa(other,knight)),no),
    inference(resolution,[status(thm)],[c_14,c_105]) ).

tff(c_123,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_104,c_117]) ).

tff(c_124,plain,
    ! [Y_25,X_24] :
      ( ~ truth(isa(other,Y_25))
      | ~ truth(isa(asked,X_24)) ),
    inference(splitRight,[status(thm)],[c_28]) ).

tff(c_125,plain,
    ! [X_24] : ~ truth(isa(asked,X_24)),
    inference(splitLeft,[status(thm)],[c_124]) ).

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

tff(c_126,plain,
    ! [X_53] : ~ truth(isa(asked,X_53)),
    inference(splitLeft,[status(thm)],[c_124]) ).

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

tff(c_144,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_125,c_138]) ).

tff(c_145,plain,
    ! [Y_25] : ~ truth(isa(other,Y_25)),
    inference(splitRight,[status(thm)],[c_124]) ).

tff(c_153,plain,
    ! [Y_56] : ~ truth(isa(other,Y_56)),
    inference(splitRight,[status(thm)],[c_124]) ).

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

tff(c_171,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_145,c_165]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ035-7 : TPTP v9.0.0. Released v2.0.0.
% 0.03/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.14/0.34  % Computer : n003.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 : Tue Apr  8 17:12:48 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 2.85/1.75  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/1.76  
% 2.85/1.76  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------