↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n013.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 03:03:39 PM UTC 2026

% Result   : Theorem 0.15s 5.94s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   18 (  10 unt;   0 def)
%            Number of atoms       :   26 (   7 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (   9   ~;   3   |;   5   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-4 aty)
%            Number of variables   :   14 (   0 sgn   4   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ? [BNODE_x,BNODE_y] :
      ( iext(uri_ex_q,BNODE_y,BNODE_x)
      & iext(uri_ex_p,BNODE_x,BNODE_y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

fof(f0_neg,negated_conjecture,
    ~ ? [BNODE_x,BNODE_y] :
        ( iext(uri_ex_q,BNODE_y,BNODE_x)
        & iext(uri_ex_p,BNODE_x,BNODE_y) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ! [BNODE_x,BNODE_y] :
      ( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
      | ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [BNODE_x,BNODE_y] :
      ( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
      | ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( ~ iext(uri_ex_q,X1,X0)
    | ~ iext(uri_ex_p,X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi2,negated_conjecture,
    ifeq(iext(uri_ex_p,X0,X1),true,ifeq(iext(uri_ex_q,X1,X0),true,false,true),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

fof(f1,axiom,
    ? [BNODE_o] :
      ( iext(uri_ex_q,BNODE_o,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,BNODE_o) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

fof(f1_nnf,plain,
    ? [BNODE_o] :
      ( iext(uri_ex_q,BNODE_o,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,BNODE_o) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ( iext(uri_ex_q,sk0,uri_ex_s)
    & iext(uri_ex_p,uri_ex_s,sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

cnf(c1,plain,
    iext(uri_ex_p,uri_ex_s,sk0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi0,axiom,
    iext(uri_ex_p,uri_ex_s,sk0) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(c2,plain,
    iext(uri_ex_q,sk0,uri_ex_s),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(hi1,axiom,
    iext(uri_ex_q,sk0,uri_ex_s) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/5.38  % Computer : n013.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Thu Sep 24 15:17:48 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.15/5.94  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.94  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------