%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : PUZ024-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 : 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  : 300s
% DateTime : Thu Aug 31 13:12:10 EDT 2023

% Result   : Unsatisfiable 0.21s 0.59s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   28 (  10 unt;  10 typ;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   31 (  15   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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   :   23 (  10 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,
    one_truthteller: $i ).

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

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

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

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

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

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(prove_there_is_a_truthteller,negated_conjecture,
    ~ a_truth(truthteller(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_truthteller) ).

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

cnf(all_truthtellers,axiom,
    ( a_truth(all_are_liars)
    | a_truth(truthteller(X1))
    | a_truth(truthteller(X2))
    | a_truth(truthteller(X3))
    | ~ people(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_truthtellers) ).

cnf(a_says_all_are_liars,hypothesis,
    a_truth(says(a,all_are_liars)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_says_all_are_liars) ).

cnf(b_c_a_people,hypothesis,
    people(b,c,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_c_a_people) ).

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

cnf(c_0_7,negated_conjecture,
    ~ a_truth(truthteller(X1)),
    prove_there_is_a_truthteller ).

cnf(c_0_8,axiom,
    ( ~ a_truth(liar(X1))
    | ~ a_truth(says(X1,X2))
    | ~ a_truth(X2) ),
    liars_lie ).

cnf(c_0_9,plain,
    a_truth(liar(X1)),
    inference(sr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,axiom,
    ( a_truth(all_are_liars)
    | a_truth(truthteller(X1))
    | a_truth(truthteller(X2))
    | a_truth(truthteller(X3))
    | ~ people(X1,X2,X3) ),
    all_truthtellers ).

cnf(c_0_11,plain,
    ( ~ a_truth(says(X1,X2))
    | ~ a_truth(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_12,hypothesis,
    a_truth(says(a,all_are_liars)),
    a_says_all_are_liars ).

cnf(c_0_13,plain,
    ( a_truth(all_are_liars)
    | ~ people(X1,X2,X3) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_14,hypothesis,
    ~ a_truth(all_are_liars),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,hypothesis,
    people(b,c,a),
    b_c_a_people ).

cnf(c_0_16,plain,
    ~ people(X1,X2,X3),
    inference(sr,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PUZ024-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 : 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    : 300
% 0.13/0.34  % DateTime   : Sat Aug 26 22:53:25 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.21/0.58  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.004000 s
% 0.21/0.59  % SZS output end Proof
% 0.21/0.59  % Total time : 0.006000 s
%------------------------------------------------------------------------------