↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWB002+3 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n018.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 : Sun Sep 27 08:51:25 AM UTC 2026

% Result   : Theorem 0.12s 0.40s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   4   ~;   1   |;   5   &)
%                                         (   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   :    8 (   0 sgn   0   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
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(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_conclusion_fullish_002_Existential_Blank_Nodes_neg,negated_conjecture,
    ~ ? [BNODE_x,BNODE_y] :
        ( iext(uri_ex_q,BNODE_y,BNODE_x)
        & iext(uri_ex_p,BNODE_x,BNODE_y) ),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).

fof(nnf_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(sk_testcase_premise_fullish_002_Existential_Blank_Nodes,plain,
    ( iext(uri_ex_q,sK0,uri_ex_s)
    & iext(uri_ex_p,uri_ex_s,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(BNODE_o,sK0)],[nnf_1]) ).

cnf(c_317,plain,
    iext(uri_ex_p,uri_ex_s,sK0),
    inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_002_Existential_Blank_Nodes]) ).

cnf(c_318,plain,
    iext(uri_ex_q,sK0,uri_ex_s),
    inference(split_conjunct,[status(thm)],[sk_testcase_premise_fullish_002_Existential_Blank_Nodes]) ).

cnf(c_319,negated_conjecture,
    ( ~ iext(uri_ex_q,B,A)
    | ~ iext(uri_ex_p,A,B) ),
    inference(clausify,[status(thm)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes_neg]) ).

cnf(c_341,negated_conjecture,
    ~ iext(uri_ex_p,uri_ex_s,sK0),
    inference(resolve,[status(thm)],[c_319,c_318]) ).

cnf(c_340,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_317,c_341]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWB002+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n018.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 11:40:37 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 351391 was started by sandbox on n018,
% 0.09/0.35  % Sat Sep 26 11:40:37 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.38  
% 0.12/0.38  % From the command line: assign(max_seconds, 300).
% 0.12/0.38  
% 0.12/0.38  % SInE: 1 to sos, 138 to usable, of 139 axioms (tolerance 2.00, depth 0 fixpoint).
% 0.12/0.40  
% 0.12/0.40  % SZS status Theorem for theBenchmark
% 0.12/0.40  
% 0.12/0.40  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.40  % Length of proof is 6.
% 0.12/0.40  % Level of proof is 2.
% 0.12/0.40  % Maximum clause weight is 13.000.
% 0.12/0.40  % Given clauses 3.
% 0.12/0.40  
% 0.12/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------