TSTP Solution File: PUZ035-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PUZ035-1 : TPTP v8.1.2. 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 : n010.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 : Tue Aug 22 10:54:05 EDT 2023

% Result   : Unsatisfiable 2.71s 1.67s
% Output   : CNFRefutation 2.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   49 (  24 unt;  11 typ;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   46 (  26   ~;  20   |;   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  :    6 (   5   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   22 (;  22   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ isa > tell_the_truth > response > person > lies > #nlpp > yes > other > no > knight > knave > asked

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

tff(f_128,axiom,
    ! [A,X,Y] :
      ( ~ response(A)
      | ~ isa(asked,X)
      | ~ isa(other,Y) ),
    file(unknown,unknown) ).

tff(f_116,axiom,
    ( response(yes)
    | response(no) ),
    file(unknown,unknown) ).

tff(f_118,axiom,
    person(asked),
    file(unknown,unknown) ).

tff(f_38,axiom,
    ! [X] :
      ( ~ person(X)
      | isa(X,knight)
      | isa(X,knave) ),
    file(unknown,unknown) ).

tff(f_119,axiom,
    person(other),
    file(unknown,unknown) ).

tff(c_30,plain,
    ! [Y_11,X_10,A_9] :
      ( ~ isa(other,Y_11)
      | ~ isa(asked,X_10)
      | ~ response(A_9) ),
    inference(cnfTransformation,[status(thm)],[f_128]) ).

tff(c_108,plain,
    ! [A_9] : ~ response(A_9),
    inference(splitLeft,[status(thm)],[c_30]) ).

tff(c_55,plain,
    ! [A_9] : ~ response(A_9),
    inference(splitLeft,[status(thm)],[c_30]) ).

tff(c_24,plain,
    ( response(no)
    | response(yes) ),
    inference(cnfTransformation,[status(thm)],[f_116]) ).

tff(c_31,plain,
    response(yes),
    inference(splitLeft,[status(thm)],[c_24]) ).

tff(c_57,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_55,c_31]) ).

tff(c_58,plain,
    ! [Y_11,X_10] :
      ( ~ isa(other,Y_11)
      | ~ isa(asked,X_10) ),
    inference(splitRight,[status(thm)],[c_30]) ).

tff(c_59,plain,
    ! [X_10] : ~ isa(asked,X_10),
    inference(splitLeft,[status(thm)],[c_58]) ).

tff(c_26,plain,
    person(asked),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

tff(c_2,plain,
    ! [X_1] :
      ( isa(X_1,knave)
      | isa(X_1,knight)
      | ~ person(X_1) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_60,plain,
    ! [X_18] : ~ isa(asked,X_18),
    inference(splitLeft,[status(thm)],[c_58]) ).

tff(c_68,plain,
    ( isa(asked,knave)
    | ~ person(asked) ),
    inference(resolution,[status(thm)],[c_2,c_60]) ).

tff(c_74,plain,
    isa(asked,knave),
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_68]) ).

tff(c_76,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_59,c_74]) ).

tff(c_77,plain,
    ! [Y_11] : ~ isa(other,Y_11),
    inference(splitRight,[status(thm)],[c_58]) ).

tff(c_28,plain,
    person(other),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

tff(c_81,plain,
    ! [Y_19] : ~ isa(other,Y_19),
    inference(splitRight,[status(thm)],[c_58]) ).

tff(c_89,plain,
    ( isa(other,knave)
    | ~ person(other) ),
    inference(resolution,[status(thm)],[c_2,c_81]) ).

tff(c_95,plain,
    isa(other,knave),
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_89]) ).

tff(c_97,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_77,c_95]) ).

tff(c_98,plain,
    response(no),
    inference(splitRight,[status(thm)],[c_24]) ).

tff(c_110,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_108,c_98]) ).

tff(c_111,plain,
    ! [Y_11,X_10] :
      ( ~ isa(other,Y_11)
      | ~ isa(asked,X_10) ),
    inference(splitRight,[status(thm)],[c_30]) ).

tff(c_112,plain,
    ! [X_10] : ~ isa(asked,X_10),
    inference(splitLeft,[status(thm)],[c_111]) ).

tff(c_114,plain,
    ! [X_25] :
      ( isa(X_25,knave)
      | isa(X_25,knight)
      | ~ person(X_25) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_118,plain,
    ( isa(asked,knave)
    | ~ person(asked) ),
    inference(resolution,[status(thm)],[c_114,c_112]) ).

tff(c_127,plain,
    isa(asked,knave),
    inference(demodulation,[status(thm),theory(equality)],[c_26,c_118]) ).

tff(c_129,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_112,c_127]) ).

tff(c_130,plain,
    ! [Y_11] : ~ isa(other,Y_11),
    inference(splitRight,[status(thm)],[c_111]) ).

tff(c_132,plain,
    ! [X_27] :
      ( isa(X_27,knave)
      | isa(X_27,knight)
      | ~ person(X_27) ),
    inference(cnfTransformation,[status(thm)],[f_38]) ).

tff(c_136,plain,
    ( isa(other,knave)
    | ~ person(other) ),
    inference(resolution,[status(thm)],[c_132,c_130]) ).

tff(c_145,plain,
    isa(other,knave),
    inference(demodulation,[status(thm),theory(equality)],[c_28,c_136]) ).

tff(c_147,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_130,c_145]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : PUZ035-1 : TPTP v8.1.2. Released v2.0.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.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 17:26:14 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 2.71/1.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.71/1.68  
% 2.71/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.71/1.71  
% 2.71/1.71  Inference rules
% 2.71/1.71  ----------------------
% 2.71/1.71  #Ref     : 0
% 2.71/1.71  #Sup     : 13
% 2.71/1.71  #Fact    : 0
% 2.71/1.71  #Define  : 0
% 2.71/1.71  #Split   : 9
% 2.71/1.71  #Chain   : 0
% 2.71/1.71  #Close   : 0
% 2.71/1.71  
% 2.71/1.71  Ordering : KBO
% 2.71/1.71  
% 2.71/1.71  Simplification rules
% 2.71/1.71  ----------------------
% 3.02/1.71  #Subsume      : 4
% 3.02/1.71  #Demod        : 10
% 3.02/1.71  #Tautology    : 2
% 3.02/1.71  #SimpNegUnit  : 7
% 3.02/1.71  #BackRed      : 2
% 3.02/1.71  
% 3.02/1.71  #Partial instantiations: 0
% 3.02/1.71  #Strategies tried      : 1
% 3.02/1.71  
% 3.02/1.71  Timing (in seconds)
% 3.02/1.71  ----------------------
% 3.02/1.71  Preprocessing        : 0.42
% 3.02/1.71  Parsing              : 0.23
% 3.02/1.71  CNF conversion       : 0.02
% 3.02/1.71  Main loop            : 0.23
% 3.02/1.71  Inferencing          : 0.09
% 3.02/1.71  Reduction            : 0.06
% 3.02/1.71  Demodulation         : 0.04
% 3.02/1.71  BG Simplification    : 0.02
% 3.02/1.71  Subsumption          : 0.04
% 3.02/1.71  Abstraction          : 0.01
% 3.02/1.71  MUC search           : 0.00
% 3.02/1.71  Cooper               : 0.00
% 3.02/1.71  Total                : 0.70
% 3.02/1.71  Index Insertion      : 0.00
% 3.02/1.72  Index Deletion       : 0.00
% 3.02/1.72  Index Matching       : 0.00
% 3.02/1.72  BG Taut test         : 0.00
%------------------------------------------------------------------------------