↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n017.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:32:07 PM UTC 2026

% Result   : Theorem 3.42s 1.20s
% Output   : Proof 3.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  31 unt;   0 def)
%            Number of atoms       :   51 (  11 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  18   ~;   9   |;   6   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-4 aty)
%            Number of variables   :   12 (   0 sgn   4   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f6,conjecture,
    ? [P,NP] :
      ( ~ patricide(NP)
      & parent_of(P,NP)
      & patricide(P)
      & parent_of(iokaste,P) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).

fof(f6_neg,negated_conjecture,
    ~ ? [P,NP] :
        ( ~ patricide(NP)
        & parent_of(P,NP)
        & patricide(P)
        & parent_of(iokaste,P) ),
    inference(negated_conjecture,[status(cth)],[f6]) ).

fof(f6_nnf,plain,
    ! [P,NP] :
      ( patricide(NP)
      | ~ parent_of(P,NP)
      | ~ patricide(P)
      | ~ parent_of(iokaste,P) ),
    inference(nnf_transformation,[status(thm)],[f6_neg]) ).

fof(f6_sk,plain,
    ! [P,NP] :
      ( patricide(NP)
      | ~ parent_of(P,NP)
      | ~ patricide(P)
      | ~ parent_of(iokaste,P) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( patricide(X1)
    | ~ parent_of(X0,X1)
    | ~ patricide(X0)
    | ~ parent_of(iokaste,X0) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(hi5,negated_conjecture,
    ifeq(parent_of(iokaste,X0),true,ifeq(patricide(X0),true,ifeq(parent_of(X0,X1),true,patricide(X1),true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c6]) ).

fof(f0,axiom,
    parent_of(iokaste,oedipus),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).

fof(f0_nnf,plain,
    parent_of(iokaste,oedipus),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    parent_of(iokaste,oedipus),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    parent_of(iokaste,oedipus) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

fof(f4,axiom,
    patricide(oedipus),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).

fof(f4_nnf,plain,
    patricide(oedipus),
    inference(nnf_transformation,[status(thm)],[f4]) ).

cnf(c4,plain,
    patricide(oedipus),
    inference(cnf_transformation,[status(esa)],[f4_nnf]) ).

cnf(hi4,axiom,
    patricide(oedipus) = true,
    inference(equality_encoding,[status(esa)],[c4]) ).

fof(f2,axiom,
    parent_of(oedipus,polyneikes),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).

fof(f2_nnf,plain,
    parent_of(oedipus,polyneikes),
    inference(nnf_transformation,[status(thm)],[f2]) ).

cnf(c2,plain,
    parent_of(oedipus,polyneikes),
    inference(cnf_transformation,[status(esa)],[f2_nnf]) ).

cnf(hi2,axiom,
    parent_of(oedipus,polyneikes) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h0,plain,
    patricide(polyneikes) = true,
    inference(hyper_resolution,[status(thm)],[hi5,hi0,hi4,hi2]) ).

fof(f1,axiom,
    parent_of(iokaste,polyneikes),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).

fof(f1_nnf,plain,
    parent_of(iokaste,polyneikes),
    inference(nnf_transformation,[status(thm)],[f1]) ).

cnf(c1,plain,
    parent_of(iokaste,polyneikes),
    inference(cnf_transformation,[status(esa)],[f1_nnf]) ).

cnf(hi1,axiom,
    parent_of(iokaste,polyneikes) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

fof(f3,axiom,
    parent_of(polyneikes,thersandros),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).

fof(f3_nnf,plain,
    parent_of(polyneikes,thersandros),
    inference(nnf_transformation,[status(thm)],[f3]) ).

cnf(c3,plain,
    parent_of(polyneikes,thersandros),
    inference(cnf_transformation,[status(esa)],[f3_nnf]) ).

cnf(hi3,axiom,
    parent_of(polyneikes,thersandros) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t2,plain,
    patricide(thersandros) = true,
    inference(hyper_resolution,[status(thm)],[hi5,hi1,h0,hi3]) ).

cnf(t16,plain,
    patricide(thersandros) = true,
    inference(orient,[status(thm)],[t2]) ).

fof(f5,axiom,
    ~ patricide(thersandros),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).

fof(f5_nnf,plain,
    ~ patricide(thersandros),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ~ patricide(thersandros),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    ~ patricide(thersandros),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(goal_0,negated_conjecture,
    patricide(thersandros) != true,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t16]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.72  % Computer : n017.cluster.edu
% 0.10/0.72  % Model    : x86_64 x86_64
% 0.10/0.72  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.72  % Memory   : 8046.5625MB
% 0.10/0.72  % OS       : Linux 6.8.0-71-generic
% 0.10/0.72  % CPULimit : 300
% 0.10/0.72  % WCLimit  : 300
% 0.10/0.72  % DateTime : Thu Sep 24 06:55:03 UTC 2026
% 0.10/0.72  % CPUTime  : 
% 0.10/0.72  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.42/1.20  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/1.20  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------