%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PUZ035-4 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n011.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 : Thu Aug 31 13:12:16 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    person: $i > $o ).

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

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

tff(decl_25,type,
    truth: $i > $o ).

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

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

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

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

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

tff(decl_31,type,
    not: $i > $i ).

cnf(everyone_a_knight_or_knave,axiom,
    ( truth(isa(X1,knight))
    | truth(isa(X1,knave))
    | ~ person(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).

cnf(asked_person,axiom,
    person(asked),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',asked_person) ).

cnf(prove_answer,negated_conjecture,
    ( ~ truth(isa(asked,X1))
    | ~ truth(isa(other,X2))
    | ~ says(asked,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).

cnf(other_person,axiom,
    person(other),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',other_person) ).

cnf(one_is_knight_answer,axiom,
    ( says(asked,or(isa(asked,knight),isa(other,knight)))
    | says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_is_knight_answer) ).

cnf(c_0_5,axiom,
    ( truth(isa(X1,knight))
    | truth(isa(X1,knave))
    | ~ person(X1) ),
    everyone_a_knight_or_knave ).

cnf(c_0_6,axiom,
    person(asked),
    asked_person ).

cnf(c_0_7,negated_conjecture,
    ( ~ truth(isa(asked,X1))
    | ~ truth(isa(other,X2))
    | ~ says(asked,X3) ),
    prove_answer ).

cnf(c_0_8,plain,
    ( truth(isa(asked,knave))
    | truth(isa(asked,knight)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,axiom,
    person(other),
    other_person ).

cnf(c_0_10,negated_conjecture,
    ( ~ says(asked,X1)
    | ~ truth(isa(other,X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).

cnf(c_0_11,plain,
    ( truth(isa(other,knave))
    | truth(isa(other,knight)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_12,axiom,
    ( says(asked,or(isa(asked,knight),isa(other,knight)))
    | says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
    one_is_knight_answer ).

cnf(c_0_13,negated_conjecture,
    ~ says(asked,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).

cnf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_12,c_0_13]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : PUZ035-4 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat Aug 26 22:22:09 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 0.20/0.61  start to proof: theBenchmark
% 0.20/0.62  % Version  : CSE_E---1.5
% 0.20/0.62  % Problem  : theBenchmark.p
% 0.20/0.62  % Proof found
% 0.20/0.62  % SZS status Theorem for theBenchmark.p
% 0.20/0.62  % SZS output start Proof
% See solution above
% 0.20/0.63  % Total time : 0.004000 s
% 0.20/0.63  % SZS output end Proof
% 0.20/0.63  % Total time : 0.007000 s
%------------------------------------------------------------------------------