↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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:33:34 PM UTC 2026

% Result   : Theorem 0.14s 5.79s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   27 (   6 unt;   0 def)
%            Number of atoms       :  125 (   0 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  152 (  54   ~;  68   |;  24   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    5 (   4 usr;   5 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( ( ( q
         => r )
        & p )
     => s )
  <=> ( ( s
        | ~ r
        | ~ p )
      & ( s
        | q
        | ~ p ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel17) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( ( ( q
           => r )
          & p )
       => s )
    <=> ( ( s
          | ~ r
          | ~ p )
        & ( s
          | q
          | ~ p ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ( ( s
        | ~ r
        | ~ p )
      & ( s
        | q
        | ~ p )
      & ~ s
      & ( r
        | ~ q )
      & p )
    | ( ( ( ~ s
          & r
          & p )
        | ( ~ s
          & ~ q
          & p ) )
      & ( s
        | ( ~ r
          & q )
        | ~ p ) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

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

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

cnf(p55,plain,
    ( s
    | q
    | s
    | q
    | ~ p ),
    inference(factoring,[status(thm)],[c3]) ).

cnf(p68,plain,
    ( s
    | s
    | q
    | ~ p ),
    inference(factoring,[status(thm)],[p55]) ).

cnf(p75,plain,
    ( s
    | q
    | ~ p ),
    inference(factoring,[status(thm)],[p68]) ).

cnf(c10,plain,
    ( p
    | p
    | p ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p61,plain,
    ( p
    | p ),
    inference(factoring,[status(thm)],[c10]) ).

cnf(p72,plain,
    p,
    inference(factoring,[status(thm)],[p61]) ).

cnf(p77,plain,
    ( s
    | q ),
    inference(resolution,[status(thm)],[p75,p72]) ).

cnf(c52,plain,
    ( ~ s
    | ~ s
    | ~ s ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p67,plain,
    ( ~ s
    | ~ s ),
    inference(factoring,[status(thm)],[c52]) ).

cnf(p74,plain,
    ~ s,
    inference(factoring,[status(thm)],[p67]) ).

cnf(p79,plain,
    q,
    inference(resolution,[status(thm)],[p77,p74]) ).

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

cnf(p63,plain,
    ( r
    | r
    | ~ q ),
    inference(factoring,[status(thm)],[c31]) ).

cnf(p73,plain,
    ( r
    | ~ q ),
    inference(factoring,[status(thm)],[p63]) ).

cnf(p80,plain,
    r,
    inference(resolution,[status(thm)],[p79,p73]) ).

cnf(c9,plain,
    ( s
    | ~ r
    | ~ p
    | s
    | ~ r
    | ~ p ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p58,plain,
    ( s
    | ~ r
    | s
    | ~ r
    | ~ p ),
    inference(factoring,[status(thm)],[c9]) ).

cnf(p70,plain,
    ( s
    | s
    | ~ r
    | ~ p ),
    inference(factoring,[status(thm)],[p58]) ).

cnf(p76,plain,
    ( s
    | ~ r
    | ~ p ),
    inference(factoring,[status(thm)],[p70]) ).

cnf(p78,plain,
    ( s
    | ~ r ),
    inference(resolution,[status(thm)],[p76,p72]) ).

cnf(p81,plain,
    s,
    inference(resolution,[status(thm)],[p80,p78]) ).

cnf(p82,plain,
    $false,
    inference(resolution,[status(thm)],[p81,p74]) ).

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