↑ Up

Prover9---2026-6A.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : PUZ035-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:23:10 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.43s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (   9 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   88 (  38   ~;  50   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   29 (  21 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(asked_person,axiom,
    person(asked),
    file('theBenchmark.p',asked_person) ).

cnf(c_1,plain,
    person(asked),
    inference(clausify,[status(thm)],[asked_person]) ).

fof(everyone_a_knight_or_knave,axiom,
    ! [VAR_0] :
      ( isa(VAR_0,knave)
      | isa(VAR_0,knight)
      | ~ person(VAR_0) ),
    file('theBenchmark.p',everyone_a_knight_or_knave) ).

cnf(c_2,plain,
    ( isa(A,knave)
    | isa(A,knight)
    | ~ person(A) ),
    inference(clausify,[status(thm)],[everyone_a_knight_or_knave]) ).

fof(other_person,axiom,
    person(other),
    file('theBenchmark.p',other_person) ).

cnf(c_3,plain,
    person(other),
    inference(clausify,[status(thm)],[other_person]) ).

fof(knights_make_true_statements,axiom,
    ! [VAR_0] :
      ( tell_the_truth(VAR_0)
      | ~ isa(VAR_0,knight) ),
    file('theBenchmark.p',knights_make_true_statements) ).

cnf(c_4,plain,
    ( tell_the_truth(A)
    | ~ isa(A,knight) ),
    inference(clausify,[status(thm)],[knights_make_true_statements]) ).

fof(knight_answers2,axiom,
    ! [VAR_0] :
      ( ~ isa(VAR_0,knight)
      | ~ tell_the_truth(asked)
      | ~ response(no) ),
    file('theBenchmark.p',knight_answers2) ).

cnf(c_7,plain,
    ( ~ isa(A,knight)
    | ~ tell_the_truth(asked)
    | ~ response(no) ),
    inference(clausify,[status(thm)],[knight_answers2]) ).

cnf(c_17,plain,
    ( isa(other,knave)
    | isa(other,knight) ),
    inference(resolve,[status(thm)],[c_3,c_2]) ).

cnf(c_18,plain,
    ( isa(asked,knave)
    | isa(asked,knight) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

fof(prove_answer,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ isa(other,VAR_2)
      | ~ isa(asked,VAR_1)
      | ~ response(VAR_0) ),
    file('theBenchmark.p',prove_answer) ).

cnf(c_19,plain,
    ( ~ isa(other,C)
    | ~ isa(asked,B)
    | ~ response(A) ),
    inference(clausify,[status(thm)],[prove_answer]) ).

fof(two_answers,axiom,
    ( response(no)
    | response(yes) ),
    file('theBenchmark.p',two_answers) ).

cnf(c_20,plain,
    ( response(no)
    | response(yes) ),
    inference(clausify,[status(thm)],[two_answers]) ).

cnf(c_21,plain,
    ( ~ isa(A,knight)
    | ~ response(no)
    | ~ isa(asked,knight) ),
    inference(resolve,[status(thm)],[c_4,c_7]) ).

cnf(c_23,plain,
    ( ~ response(no)
    | ~ isa(asked,knight) ),
    inference(factor,[status(thm)],[c_21]) ).

cnf(c_27,plain,
    ( isa(asked,knight)
    | ~ isa(other,B)
    | ~ response(A) ),
    inference(resolve,[status(thm)],[c_19,c_18]) ).

cnf(c_28,plain,
    ( isa(other,knight)
    | ~ isa(asked,B)
    | ~ response(A) ),
    inference(resolve,[status(thm)],[c_19,c_17]) ).

cnf(c_29,plain,
    ( isa(other,knight)
    | isa(asked,knight)
    | ~ response(A) ),
    inference(resolve,[status(thm)],[c_27,c_17]) ).

cnf(c_30,plain,
    ( response(no)
    | isa(other,knight)
    | isa(asked,knight) ),
    inference(resolve,[status(thm)],[c_29,c_20]) ).

cnf(c_48,plain,
    ( isa(asked,knight)
    | ~ response(A)
    | response(no)
    | isa(asked,knight) ),
    inference(resolve,[status(thm)],[c_30,c_27]) ).

cnf(c_31,plain,
    ( ~ response(A)
    | response(no)
    | isa(asked,knight) ),
    inference(copy,[status(thm)],[c_48]) ).

cnf(c_49,plain,
    ( response(no)
    | response(no)
    | isa(asked,knight) ),
    inference(resolve,[status(thm)],[c_31,c_20]) ).

cnf(c_32,plain,
    ( response(no)
    | isa(asked,knight) ),
    inference(copy,[status(thm)],[c_49]) ).

cnf(c_33,plain,
    ( isa(other,knight)
    | ~ response(A)
    | response(no) ),
    inference(resolve,[status(thm)],[c_32,c_28]) ).

cnf(c_34,plain,
    ( ~ isa(other,B)
    | ~ response(A)
    | response(no) ),
    inference(resolve,[status(thm)],[c_32,c_19]) ).

cnf(c_50,plain,
    ( response(no)
    | isa(other,knight)
    | response(no) ),
    inference(resolve,[status(thm)],[c_33,c_20]) ).

cnf(c_36,plain,
    ( isa(other,knight)
    | response(no) ),
    inference(copy,[status(thm)],[c_50]) ).

cnf(c_51,plain,
    ( response(no)
    | ~ response(A)
    | response(no) ),
    inference(resolve,[status(thm)],[c_34,c_36]) ).

cnf(c_38,plain,
    ( ~ response(A)
    | response(no) ),
    inference(copy,[status(thm)],[c_51]) ).

cnf(c_52,plain,
    ( response(no)
    | response(no) ),
    inference(resolve,[status(thm)],[c_38,c_20]) ).

cnf(c_39,plain,
    response(no),
    inference(copy,[status(thm)],[c_52]) ).

cnf(c_40,plain,
    ~ isa(asked,knight),
    inference(resolve,[status(thm)],[c_39,c_23]) ).

cnf(c_41,plain,
    ( isa(other,knight)
    | ~ response(A) ),
    inference(resolve,[status(thm)],[c_40,c_29]) ).

cnf(c_42,plain,
    ( ~ isa(other,B)
    | ~ response(A) ),
    inference(resolve,[status(thm)],[c_40,c_27]) ).

cnf(c_45,plain,
    isa(other,knight),
    inference(resolve,[status(thm)],[c_41,c_39]) ).

cnf(c_46,plain,
    ~ isa(other,A),
    inference(resolve,[status(thm)],[c_42,c_39]) ).

cnf(c_47,plain,
    $false,
    inference(resolve,[status(thm)],[c_46,c_45]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : PUZ035-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.41  % Computer : n011.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Sat Sep 26 05:06:44 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.41  % Process 3831946 was started by sandbox2 on n011,
% 0.16/0.41  % Sat Sep 26 05:06:44 2026
% 0.16/0.41  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.42  
% 0.16/0.42  % From the command line: assign(max_seconds, 300).
% 0.16/0.43  
% 0.16/0.43  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.43  
% 0.16/0.43  % Proof 1 at 0.00 (+ 0.01) seconds.
% 0.16/0.43  % Length of proof is 28.
% 0.16/0.43  % Level of proof is 14.
% 0.16/0.43  % Maximum clause weight is 8.000.
% 0.16/0.43  % Given clauses 26.
% 0.16/0.43  
% 0.16/0.43  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------