↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n008.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:33:15 PM UTC 2026

% Result   : Unsatisfiable 4.90s 1.26s
% Output   : Proof 4.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   8 unt;   0 def)
%            Number of atoms       :    8 (   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    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    4 (   2 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f6,hypothesis,
    p(h),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',role_hypothesis) ).

fof(f6_nnf,plain,
    p(h),
    inference(nnf_transformation,[status(thm)],[f6]) ).

cnf(c6,plain,
    p(h),
    inference(cnf_transformation,[status(esa)],[f6_nnf]) ).

cnf(f7,negated_conjecture,
    ~ p(X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',role_negated_conjecture) ).

fof(f7_nnf,plain,
    ! [X] : ~ p(X),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X] : ~ p(X),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ~ p(X0),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(p11,plain,
    $false,
    inference(resolution,[status(thm)],[c6,c7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN000-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.53  % Computer : n008.cluster.edu
% 0.09/0.53  % Model    : x86_64 x86_64
% 0.09/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.53  % Memory   : 8046.5625MB
% 0.09/0.53  % OS       : Linux 6.8.0-71-generic
% 0.09/0.54  % CPULimit : 300
% 0.09/0.54  % WCLimit  : 300
% 0.09/0.54  % DateTime : Thu Sep 24 23:49:25 UTC 2026
% 0.09/0.54  % CPUTime  : 
% 0.09/0.54  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.90/1.26  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.90/1.26  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------