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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PUZ024-1 : TPTP v8.1.2. Released v1.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 : n008.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:02 EDT 2023

% Result   : Unsatisfiable 2.70s 1.66s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   25 (   9 unt;  10 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   27 (  13   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    8 (   5   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (;  20   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ people > a_truth > says > #nlpp > truthteller > liar > one_truthteller > c > b > all_are_liars > a

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

tff(f_203,axiom,
    a_truth(says(a,all_are_liars)),
    file(unknown,unknown) ).

tff(f_209,axiom,
    ! [Truthteller] : ~ a_truth(truthteller(Truthteller)),
    file(unknown,unknown) ).

tff(f_84,axiom,
    ! [Statement,Truthteller] :
      ( ~ a_truth(Statement)
      | ~ a_truth(says(Truthteller,Statement))
      | a_truth(truthteller(Truthteller)) ),
    file(unknown,unknown) ).

tff(f_199,axiom,
    ! [X,Y,Z] :
      ( a_truth(all_are_liars)
      | ~ people(X,Y,Z)
      | a_truth(truthteller(X))
      | a_truth(truthteller(Y))
      | a_truth(truthteller(Z)) ),
    file(unknown,unknown) ).

tff(f_200,axiom,
    people(b,c,a),
    file(unknown,unknown) ).

tff(c_36,plain,
    a_truth(says(a,all_are_liars)),
    inference(cnfTransformation,[status(thm)],[f_203]) ).

tff(c_40,plain,
    ! [Truthteller_35] : ~ a_truth(truthteller(Truthteller_35)),
    inference(cnfTransformation,[status(thm)],[f_209]) ).

tff(c_10,plain,
    ! [Truthteller_8,Statement_7] :
      ( a_truth(truthteller(Truthteller_8))
      | ~ a_truth(says(Truthteller_8,Statement_7))
      | ~ a_truth(Statement_7) ),
    inference(cnfTransformation,[status(thm)],[f_84]) ).

tff(c_52,plain,
    ! [Truthteller_38,Statement_39] :
      ( ~ a_truth(says(Truthteller_38,Statement_39))
      | ~ a_truth(Statement_39) ),
    inference(negUnitSimplification,[status(thm)],[c_40,c_10]) ).

tff(c_59,plain,
    ~ a_truth(all_are_liars),
    inference(resolution,[status(thm)],[c_36,c_52]) ).

tff(c_28,plain,
    ! [Z_34,Y_33,X_32] :
      ( a_truth(truthteller(Z_34))
      | a_truth(truthteller(Y_33))
      | a_truth(truthteller(X_32))
      | ~ people(X_32,Y_33,Z_34)
      | a_truth(all_are_liars) ),
    inference(cnfTransformation,[status(thm)],[f_199]) ).

tff(c_41,plain,
    ! [X_32,Y_33,Z_34] :
      ( ~ people(X_32,Y_33,Z_34)
      | a_truth(all_are_liars) ),
    inference(negUnitSimplification,[status(thm)],[c_40,c_40,c_40,c_28]) ).

tff(c_61,plain,
    ! [X_32,Y_33,Z_34] : ~ people(X_32,Y_33,Z_34),
    inference(negUnitSimplification,[status(thm)],[c_59,c_41]) ).

tff(c_30,plain,
    people(b,c,a),
    inference(cnfTransformation,[status(thm)],[f_200]) ).

tff(c_65,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_61,c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : PUZ024-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/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 : n008.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 : Thu Aug  3 17:39:04 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 2.70/1.66  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.70/1.66  
% 2.70/1.66  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.70/1.69  
% 2.70/1.69  Inference rules
% 2.70/1.69  ----------------------
% 2.70/1.69  #Ref     : 0
% 2.70/1.69  #Sup     : 2
% 2.70/1.69  #Fact    : 0
% 2.70/1.69  #Define  : 0
% 2.70/1.69  #Split   : 1
% 2.70/1.69  #Chain   : 0
% 2.70/1.69  #Close   : 0
% 2.70/1.69  
% 2.70/1.69  Ordering : KBO
% 2.70/1.69  
% 2.70/1.69  Simplification rules
% 2.70/1.69  ----------------------
% 2.70/1.69  #Subsume      : 9
% 2.70/1.69  #Demod        : 4
% 2.70/1.69  #Tautology    : 2
% 2.70/1.69  #SimpNegUnit  : 9
% 2.70/1.69  #BackRed      : 3
% 2.70/1.69  
% 2.70/1.69  #Partial instantiations: 0
% 2.70/1.69  #Strategies tried      : 1
% 2.70/1.69  
% 2.70/1.69  Timing (in seconds)
% 2.70/1.69  ----------------------
% 2.70/1.70  Preprocessing        : 0.43
% 2.70/1.70  Parsing              : 0.20
% 2.70/1.70  CNF conversion       : 0.03
% 2.70/1.70  Main loop            : 0.17
% 2.70/1.70  Inferencing          : 0.05
% 2.70/1.70  Reduction            : 0.05
% 2.70/1.70  Demodulation         : 0.04
% 2.70/1.70  BG Simplification    : 0.02
% 2.70/1.70  Subsumption          : 0.04
% 2.70/1.70  Abstraction          : 0.01
% 2.70/1.70  MUC search           : 0.00
% 2.70/1.70  Cooper               : 0.00
% 2.70/1.70  Total                : 0.65
% 2.70/1.70  Index Insertion      : 0.00
% 2.70/1.70  Index Deletion       : 0.00
% 2.70/1.70  Index Matching       : 0.00
% 2.70/1.70  BG Taut test         : 0.00
%------------------------------------------------------------------------------