TSTP Solution File: PUZ035-2 by CSE_E---1.5

View Problem - Process Solution

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

% Computer : n031.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.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   26 (   6 unt;  11 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    :    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   :   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 ) > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(two_answers,axiom,
    ( response(yes)
    | response(no) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',two_answers) ).

cnf(c_0_5,axiom,
    ( isa(X1,knight)
    | 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,
    ( ~ response(X1)
    | ~ isa(asked,X2)
    | ~ isa(other,X3) ),
    prove_answer ).

cnf(c_0_8,plain,
    ( isa(asked,knave)
    | 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,
    ( ~ response(X1)
    | ~ 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,
    ( isa(other,knave)
    | isa(other,knight) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_12,axiom,
    ( response(yes)
    | response(no) ),
    two_answers ).

cnf(c_0_13,negated_conjecture,
    ~ response(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.00/0.13  % Problem    : PUZ035-2 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35  % Computer : n031.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 23:11:23 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.59  % Version  : CSE_E---1.5
% 0.21/0.59  % Problem  : theBenchmark.p
% 0.21/0.59  % Proof found
% 0.21/0.59  % SZS status Theorem for theBenchmark.p
% 0.21/0.59  % SZS output start Proof
% See solution above
% 0.21/0.59  % Total time : 0.005000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.008000 s
%------------------------------------------------------------------------------