↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n005.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 01:52:53 PM UTC 2026

% Result   : Unsatisfiable 5.08s 1.16s
% Output   : Proof 5.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   24 (  12 unt;   0 def)
%            Number of atoms       :   36 (   8 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   34 (  22   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   14 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,axiom,
    ( ~ c(X1)
    | d(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f1_nnf,plain,
    ! [X1] :
      ( ~ c(X1)
      | d(X1) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X1] :
      ( ~ c(X1)
      | d(X1) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ( ~ c(X0)
    | d(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    ifeq(c(X0),true,d(X0),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(f0,negated_conjecture,
    c(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f0_nnf,plain,
    c(exist),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    c(exist),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,negated_conjecture,
    c(exist) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(h0,plain,
    d(exist) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0]) ).

cnf(f3,axiom,
    ( ~ c(X1)
    | ~ d(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f3_nnf,plain,
    ! [X1] :
      ( ~ c(X1)
      | ~ d(X1) ),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X1] :
      ( ~ c(X1)
      | ~ d(X1) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ( ~ c(X0)
    | ~ d(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(hi3,axiom,
    ifeq(d(X0),true,ifeq(c(X0),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi3,h0,hi0]) ).

cnf(t18,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(f2,axiom,
    ( ~ d(X1)
    | ~ c(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f2_nnf,plain,
    ! [X1] :
      ( ~ d(X1)
      | ~ c(X1) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X1] :
      ( ~ d(X1)
      | ~ c(X1) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( ~ d(X0)
    | ~ c(X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c2,c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS004-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 19:14:02 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.03/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.08/1.16  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.08/1.16  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------