↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : PUZ024-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n010.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 : Tue May  5 05:02:40 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.73s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  10 unt;   4 nHn;  15 RR)
%            Number of literals    :   34 (   0 equ;  15 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   23 (  10 sgn)

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

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

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

cnf(b_c_a_people,hypothesis,
    people(b,c,a),
    file('/export/starexec/sandbox/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.12/0.12  % Problem    : PUZ024-1 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n010.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 01:33:06 EDT 2026
% 0.16/0.34  % CPUTime    : 
% 0.16/0.35  % start to proof: theBenchmark
% 1.24/1.73  % Version  : CSE_E---1.7
% 1.24/1.73  % Problem  : theBenchmark.p
% 1.24/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.24/1.73  % SZS output start CNFRefutation
% See solution above
% 1.24/1.73  % Total time : 1.374s
%------------------------------------------------------------------------------