↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n011.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:40 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f139,axiom,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).

fof(f139_nnf,plain,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    inference(nnf_transformation,[status(thm)],[f139]) ).

cnf(c267,plain,
    iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
    inference(cnf_transformation,[status(esa)],[f139_nnf]) ).

fof(f138,conjecture,
    ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).

fof(f138_neg,negated_conjecture,
    ~ ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
    inference(negated_conjecture,[status(cth)],[f138]) ).

fof(f138_nnf,plain,
    ! [BNODE_x] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x),
    inference(nnf_transformation,[status(thm)],[f138_neg]) ).

fof(f138_sk,plain,
    ! [BNODE_x] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x),
    inference(skolemisation,[status(esa)],[f138_nnf]) ).

cnf(c266,plain,
    ~ iext(uri_ex_p,uri_ex_s,X0),
    inference(cnf_transformation,[status(esa)],[f138_sk]) ).

cnf(p275,plain,
    $false,
    inference(resolution,[status(thm)],[c267,c266]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB003+3 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34   % Computer : n011.cluster.edu
% 0.08/0.34   % Model    : x86_64 x86_64
% 0.08/0.34   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34   % Memory   : 8046.5625MB
% 0.08/0.34   % OS       : Linux 6.8.0-71-generic
% 0.08/15.59  % CPULimit : 300
% 0.08/15.59  % WCLimit  : 300
% 0.08/15.59  % DateTime : Thu Sep 24 15:19:22 UTC 2026
% 0.08/15.59  % CPUTime  : 
% 0.08/15.59  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.15/16.86  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.15/16.86  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------