TSTP Solution File: PUZ023-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PUZ023-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %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 : Thu Aug 31 13:12:10 EDT 2023

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   36 (   8 unt;  15 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   48 (  27   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   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-3 aty)
%            Number of functors    :   12 (  12 usr;   9 con; 0-2 aty)
%            Number of variables   :    8 (   2 sgn;   0   !;   0   ?;   0   :)

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

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

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

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

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

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

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

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

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

tff(decl_31,type,
    garbage: $i ).

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

tff(decl_33,type,
    an_answer: $i > $o ).

tff(decl_34,type,
    b_liar_and_c_truthteller: $i ).

tff(decl_35,type,
    b_truthteller_and_c_liar: $i ).

tff(decl_36,type,
    b_and_c_truthtellers: $i ).

cnf(b_liar_and_c_truthteller,hypothesis,
    ( an_answer(b_liar_and_c_truthteller)
    | ~ a_truth(liar(b))
    | ~ a_truth(truthteller(c)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_liar_and_c_truthteller) ).

cnf(prove_there_is_an_answer,negated_conjecture,
    ~ an_answer(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_an_answer) ).

cnf(b_and_c_liars,hypothesis,
    ( an_answer(b_and_c_liars)
    | ~ a_truth(liar(b))
    | ~ a_truth(liar(c)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_and_c_liars) ).

cnf(truthtellers_tell_truth,axiom,
    ( a_truth(X2)
    | ~ a_truth(truthteller(X1))
    | ~ a_truth(says(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PUZ002-0.ax',truthtellers_tell_truth) ).

cnf(c_says_b_lies,hypothesis,
    a_truth(says(c,liar(b))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_says_b_lies) ).

cnf(b_truthteller_and_c_liar,hypothesis,
    ( an_answer(b_truthteller_and_c_liar)
    | ~ a_truth(truthteller(b))
    | ~ a_truth(liar(c)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_truthteller_and_c_liar) ).

cnf(truthteller_or_liar,axiom,
    ( a_truth(truthteller(X1))
    | a_truth(liar(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PUZ002-0.ax',truthteller_or_liar) ).

cnf(c_0_7,hypothesis,
    ( an_answer(b_liar_and_c_truthteller)
    | ~ a_truth(liar(b))
    | ~ a_truth(truthteller(c)) ),
    b_liar_and_c_truthteller ).

cnf(c_0_8,negated_conjecture,
    ~ an_answer(X1),
    prove_there_is_an_answer ).

cnf(c_0_9,hypothesis,
    ( an_answer(b_and_c_liars)
    | ~ a_truth(liar(b))
    | ~ a_truth(liar(c)) ),
    b_and_c_liars ).

cnf(c_0_10,axiom,
    ( a_truth(X2)
    | ~ a_truth(truthteller(X1))
    | ~ a_truth(says(X1,X2)) ),
    truthtellers_tell_truth ).

cnf(c_0_11,hypothesis,
    a_truth(says(c,liar(b))),
    c_says_b_lies ).

cnf(c_0_12,hypothesis,
    ( ~ a_truth(truthteller(c))
    | ~ a_truth(liar(b)) ),
    inference(sr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,hypothesis,
    ( an_answer(b_truthteller_and_c_liar)
    | ~ a_truth(truthteller(b))
    | ~ a_truth(liar(c)) ),
    b_truthteller_and_c_liar ).

cnf(c_0_14,hypothesis,
    ( ~ a_truth(liar(b))
    | ~ a_truth(liar(c)) ),
    inference(sr,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_15,axiom,
    ( a_truth(truthteller(X1))
    | a_truth(liar(X1)) ),
    truthteller_or_liar ).

cnf(c_0_16,hypothesis,
    ~ a_truth(truthteller(c)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

cnf(c_0_17,hypothesis,
    ( ~ a_truth(truthteller(b))
    | ~ a_truth(liar(c)) ),
    inference(sr,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_18,hypothesis,
    ~ a_truth(liar(b)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_19,hypothesis,
    ~ a_truth(truthteller(b)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16]) ).

cnf(c_0_20,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PUZ023-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %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   : Sat Aug 26 22:13:02 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.005000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------