↑ Up

FindProof---0.1.THM-Prf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ( p
   => ( r
      | q ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_3) ).

fof(f2_nnf,plain,
    ( r
    | q
    | ~ p ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ( r
    | q
    | ~ p ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c3,plain,
    ( r
    | q
    | ~ p ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

fof(f3,conjecture,
    ( p
  <=> q ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10) ).

fof(f3_neg,negated_conjecture,
    ~ ( p
    <=> q ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f3_nnf,plain,
    ( ( q
      & ~ p )
    | ( ~ q
      & p ) ),
    inference(nnf_transformation,[status(thm)],[f3_neg]) ).

fof(f3_sk,plain,
    ( ( q
      & ~ p )
    | ( ~ q
      & p ) ),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c5,plain,
    ( q
    | p ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p8,plain,
    ( q
    | r
    | q ),
    inference(resolution,[status(thm)],[c3,c5]) ).

cnf(p9,plain,
    ( r
    | q ),
    inference(factoring,[status(thm)],[p8]) ).

fof(f1,axiom,
    ( r
   => ( q
      & p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_2) ).

fof(f1_nnf,plain,
    ( ( q
      & p )
    | ~ r ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ( ( q
      & p )
    | ~ r ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c2,plain,
    ( q
    | ~ r ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p10,plain,
    ( q
    | q ),
    inference(resolution,[status(thm)],[p9,c2]) ).

cnf(p11,plain,
    q,
    inference(factoring,[status(thm)],[p10]) ).

fof(f0,axiom,
    ( q
   => r ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel10_1) ).

fof(f0_nnf,plain,
    ( r
    | ~ q ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ( r
    | ~ q ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( r
    | ~ q ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p13,plain,
    r,
    inference(resolution,[status(thm)],[p11,c0]) ).

cnf(c1,plain,
    ( p
    | ~ r ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p14,plain,
    p,
    inference(resolution,[status(thm)],[p13,c1]) ).

cnf(c6,plain,
    ( ~ p
    | ~ q ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p12,plain,
    ~ p,
    inference(resolution,[status(thm)],[p11,c6]) ).

cnf(p15,plain,
    $false,
    inference(resolution,[status(thm)],[p14,p12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN044+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n014.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 23:54:33 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.24/0.85  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.24/0.85  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------