↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n006.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 : Fri Sep 25 02:31:56 PM UTC 2026

% Result   : Unsatisfiable 3.89s 11.15s
% Output   : Proof 3.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   50 (   6 unt;   0 def)
%            Number of atoms       :  117 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  116 (  49   ~;  67   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   74 (  26 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,axiom,
    ( reply(P,Q,no)
    | reply(P,Q,yes) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yes_or_no) ).

fof(f6_nnf,plain,
    ! [P,Q] :
      ( reply(P,Q,no)
      | reply(P,Q,yes) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [P,Q] :
      ( reply(P,Q,no)
      | reply(P,Q,yes) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( reply(X0,X1,no)
    | reply(X0,X1,yes) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(f13,negated_conjecture,
    ( ~ truth(isa(other,Y))
    | ~ truth(isa(asked,X))
    | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_answer) ).

fof(f13_nnf,plain,
    ! [R,X,Y] :
      ( ~ truth(isa(other,Y))
      | ~ truth(isa(asked,X))
      | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
    inference(nnf_transformation,[status(thm)],[f13]) ).

fof(f13_sk,plain,
    ! [R,X,Y] :
      ( ~ truth(isa(other,Y))
      | ~ truth(isa(asked,X))
      | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R) ),
    inference(skolemisation,[status(esa)],[f13_nnf]) ).

cnf(c13,plain,
    ( ~ truth(isa(other,X2))
    | ~ truth(isa(asked,X1))
    | ~ reply(asked,or(isa(asked,knight),isa(other,knight)),X0) ),
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(p26,plain,
    ( ~ truth(isa(other,X1))
    | ~ truth(isa(asked,X0))
    | reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
    inference(resolution,[status(thm)],[c6,c13]) ).

cnf(f0,axiom,
    ( truth(isa(P,knave))
    | truth(isa(P,knight)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',everyone_a_knight_or_knave) ).

fof(f0_nnf,plain,
    ! [P] :
      ( truth(isa(P,knave))
      | truth(isa(P,knight)) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [P] :
      ( truth(isa(P,knave))
      | truth(isa(P,knight)) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( truth(isa(X0,knave))
    | truth(isa(X0,knight)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p27,plain,
    ( truth(isa(asked,knight))
    | ~ truth(isa(other,X0))
    | reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
    inference(resolution,[status(thm)],[p26,c0]) ).

cnf(p28,plain,
    ( truth(isa(other,knight))
    | truth(isa(asked,knight))
    | reply(asked,or(isa(asked,knight),isa(other,knight)),yes) ),
    inference(resolution,[status(thm)],[p27,c0]) ).

cnf(p29,plain,
    ( ~ truth(isa(other,X1))
    | ~ truth(isa(asked,X0))
    | truth(isa(other,knight))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p28,c13]) ).

cnf(p30,plain,
    ( truth(isa(asked,knight))
    | ~ truth(isa(other,X0))
    | truth(isa(other,knight))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p29,c0]) ).

cnf(p31,plain,
    ( ~ truth(isa(other,X0))
    | truth(isa(other,knight))
    | truth(isa(asked,knight)) ),
    inference(factoring,[status(thm)],[p30]) ).

cnf(p32,plain,
    ( truth(isa(other,knight))
    | truth(isa(other,knight))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p31,c0]) ).

cnf(p33,plain,
    ( truth(isa(other,knight))
    | truth(isa(asked,knight)) ),
    inference(factoring,[status(thm)],[p32]) ).

cnf(p42,plain,
    ( truth(isa(asked,knight))
    | reply(asked,or(isa(asked,knight),isa(other,knight)),yes)
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p33,p27]) ).

cnf(p247,plain,
    ( reply(asked,or(isa(asked,knight),isa(other,knight)),yes)
    | truth(isa(asked,knight)) ),
    inference(factoring,[status(thm)],[p42]) ).

cnf(f12,axiom,
    ( ~ truth(B)
    | truth(or(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or3) ).

fof(f12_nnf,plain,
    ! [A,B] :
      ( ~ truth(B)
      | truth(or(A,B)) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [A,B] :
      ( ~ truth(B)
      | truth(or(A,B)) ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c12,plain,
    ( ~ truth(X1)
    | truth(or(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(p40,plain,
    ( truth(or(X0,isa(other,knight)))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p33,c12]) ).

cnf(f3,axiom,
    ( ~ reply(P,Q,yes)
    | truth(isa(P,knight))
    | ~ truth(Q) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_make_true_statements2) ).

fof(f3_nnf,plain,
    ! [Q,P] :
      ( ~ reply(P,Q,yes)
      | truth(isa(P,knight))
      | ~ truth(Q) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [Q,P] :
      ( ~ reply(P,Q,yes)
      | truth(isa(P,knight))
      | ~ truth(Q) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ reply(X1,X0,yes)
    | truth(isa(X1,knight))
    | ~ truth(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p59,plain,
    ( ~ reply(X0,or(X1,isa(other,knight)),yes)
    | truth(isa(X0,knight))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p40,c3]) ).

cnf(p242,plain,
    ( ~ reply(asked,or(X0,isa(other,knight)),yes)
    | truth(isa(asked,knight)) ),
    inference(factoring,[status(thm)],[p59]) ).

cnf(p251,plain,
    ( truth(isa(asked,knight))
    | truth(isa(asked,knight)) ),
    inference(resolution,[status(thm)],[p247,p242]) ).

cnf(p252,plain,
    truth(isa(asked,knight)),
    inference(factoring,[status(thm)],[p251]) ).

cnf(f11,axiom,
    ( ~ truth(A)
    | truth(or(A,B)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',or2) ).

fof(f11_nnf,plain,
    ! [A,B] :
      ( ~ truth(A)
      | truth(or(A,B)) ),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [A,B] :
      ( ~ truth(A)
      | truth(or(A,B)) ),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    ( ~ truth(X0)
    | truth(or(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(p254,plain,
    truth(or(isa(asked,knight),X0)),
    inference(resolution,[status(thm)],[p252,c11]) ).

cnf(f4,axiom,
    ( reply(P,Q,yes)
    | ~ truth(isa(P,knight))
    | ~ truth(Q) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',knights_make_true_statements3) ).

fof(f4_nnf,plain,
    ! [Q,P] :
      ( reply(P,Q,yes)
      | ~ truth(isa(P,knight))
      | ~ truth(Q) ),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [Q,P] :
      ( reply(P,Q,yes)
      | ~ truth(isa(P,knight))
      | ~ truth(Q) ),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    ( reply(X1,X0,yes)
    | ~ truth(isa(X1,knight))
    | ~ truth(X0) ),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p266,plain,
    ( reply(X0,or(isa(asked,knight),X1),yes)
    | ~ truth(isa(X0,knight)) ),
    inference(resolution,[status(thm)],[p254,c4]) ).

cnf(p439,plain,
    reply(asked,or(isa(asked,knight),X0),yes),
    inference(resolution,[status(thm)],[p266,p252]) ).

cnf(p445,plain,
    ( ~ truth(isa(other,X1))
    | ~ truth(isa(asked,X0)) ),
    inference(resolution,[status(thm)],[p439,c13]) ).

cnf(p447,plain,
    ~ truth(isa(other,X0)),
    inference(resolution,[status(thm)],[p445,p252]) ).

cnf(p448,plain,
    truth(isa(other,knight)),
    inference(resolution,[status(thm)],[p447,c0]) ).

cnf(p464,plain,
    $false,
    inference(resolution,[status(thm)],[p448,p447]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ035-7 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/10.39  % Computer : n006.cluster.edu
% 0.09/10.39  % Model    : x86_64 x86_64
% 0.09/10.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.39  % Memory   : 8046.5625MB
% 0.09/10.39  % OS       : Linux 6.8.0-71-generic
% 0.09/10.39  % CPULimit : 300
% 0.09/10.39  % WCLimit  : 300
% 0.09/10.39  % DateTime : Thu Sep 24 06:44:38 UTC 2026
% 0.15/10.40  % CPUTime  : 
% 0.15/10.40  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.89/11.15  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.89/11.15  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------