%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PUZ035-5 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n029.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  : 600s
% DateTime : Mon Jul 18 18:27:21 EDT 2022

% Result   : Unsatisfiable 0.20s 0.42s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    6 (   3 unt;   1 nHn;   6 RR)
%            Number of literals    :    9 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( truth(isa(u,knave))
    | truth(isa(u,knight)) ),
    file('PUZ035-5.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ truth(isa(other,u))
    | ~ truth(isa(asked,v)) ),
    file('PUZ035-5.p',unknown),
    [] ).

cnf(21,plain,
    ( ~ truth(isa(asked,u))
    | truth(isa(other,knave)) ),
    inference(res,[status(thm),theory(equality)],[1,9]),
    [iquote('0:Res:1.1,9.0')] ).

cnf(22,plain,
    ~ truth(isa(asked,u)),
    inference(mrr,[status(thm)],[21,9]),
    [iquote('0:MRR:21.1,9.0')] ).

cnf(23,plain,
    truth(isa(asked,knave)),
    inference(res,[status(thm),theory(equality)],[1,22]),
    [iquote('0:Res:1.1,22.0')] ).

cnf(24,plain,
    $false,
    inference(mrr,[status(thm)],[23,22]),
    [iquote('0:MRR:23.0,22.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ035-5 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n029.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  : 600
% 0.13/0.34  % DateTime : Sat May 28 20:25:42 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.20/0.42  SPASS allocated 75596 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.00 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 2, length 6 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : everyone_a_knight_or_knave query
% 0.20/0.42  
%------------------------------------------------------------------------------