↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n012.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 : Thu Sep 24 09:00:52 AM UTC 2026

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

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

fof(testcase_premise_fullish_002_Existential_Blank_Nodes,axiom,
    ? [BNODE_o] :
      ( iext(uri_ex_q,BNODE_o,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,BNODE_o) ),
    file('theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

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

fof(f_1_2,negated_conjecture,
    ! [BNODE_x,BNODE_y] :
      ( ~ iext(uri_ex_q,BNODE_y,BNODE_x)
      | ~ iext(uri_ex_p,BNODE_x,BNODE_y) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ! [U_1,U_0] :
      ( ~ iext(uri_ex_q,U_0,U_1)
      | ~ iext(uri_ex_p,U_1,U_0) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ! [U_1,U_0] :
      ( ~ iext(uri_ex_q,U_0,U_1)
      | ~ iext(uri_ex_p,U_1,U_0) ),
    inference(definitional_conversion,[status(esa)],[f_1_3]) ).

cnf(f_1_5,negated_conjecture,
    ( ~ iext(uri_ex_q,U_0,U_1)
    | ~ iext(uri_ex_p,U_1,U_0) ),
    inference(clausify,[status(thm)],[f_1_4]) ).

fof(f_2_1,plain,
    ? [BNODE_o] :
      ( iext(uri_ex_q,BNODE_o,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,BNODE_o) ),
    inference(fof_nnf,[status(thm)],[testcase_premise_fullish_002_Existential_Blank_Nodes]) ).

fof(f_2_2,plain,
    ? [U_2] :
      ( iext(uri_ex_q,U_2,uri_ex_s)
      & iext(uri_ex_p,uri_ex_s,U_2) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ( iext(uri_ex_q,sK1,uri_ex_s)
    & iext(uri_ex_p,uri_ex_s,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_2_2]) ).

cnf(f_2_4,plain,
    iext(uri_ex_p,uri_ex_s,sK1),
    inference(clausify,[status(thm)],[f_2_3]) ).

cnf(f_2_5,plain,
    iext(uri_ex_q,sK1,uri_ex_s),
    inference(clausify,[status(thm)],[f_2_3]) ).

cnf(t1,plain,
    ( ~ iext(uri_ex_q,sK1,uri_ex_s)
    | ~ iext(uri_ex_p,uri_ex_s,sK1) ),
    inference(start,[status(thm),parent(0:0)],[f_1_5]) ).

cnf(t2,plain,
    iext(uri_ex_p,uri_ex_s,sK1),
    inference(extension,[status(thm),parent(t1:1)],[f_2_4]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    iext(uri_ex_q,sK1,uri_ex_s),
    inference(extension,[status(thm),parent(t1:2)],[f_2_5]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.02  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.02  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Sun Sep 20 01:02:53 UTC 2026
% 0.03/0.31  % CPUTime  : 
% 0.03/0.32  % SZS status Theorem for theBenchmark
% 0.03/0.32  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------