↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n013.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 : Thu Sep 24 09:09:17 AM UTC 2026

% Result   : Theorem 0.02s 0.38s
% Output   : Proof 0.02s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

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

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

fof(f_1_2,negated_conjecture,
    ( ( ~ s
      & ( r
        | ~ q )
      & p
      & ( s
        | ~ r
        | ~ p )
      & ( s
        | q
        | ~ p ) )
    | ( ( ( ~ s
          & r
          & p )
        | ( ~ s
          & ~ q
          & p ) )
      & ( s
        | ( ~ r
          & q )
        | ~ p ) ) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ( ( ~ s
      | ~ sP4 )
    & ( r
      | ~ q
      | ~ sP4 )
    & ( p
      | ~ sP4 )
    & ( s
      | ~ r
      | ~ p
      | ~ sP4 )
    & ( s
      | q
      | ~ p
      | ~ sP4 )
    & ( ~ s
      | ~ sP2 )
    & ( r
      | ~ sP2 )
    & ( p
      | ~ sP2 )
    & ( ~ s
      | ~ sP1 )
    & ( ~ q
      | ~ sP1 )
    & ( p
      | ~ sP1 )
    & ( ~ r
      | ~ sP0 )
    & ( q
      | ~ sP0 )
    & ( sP2
      | sP1
      | ~ sP3 )
    & ( s
      | sP0
      | ~ p
      | ~ sP3 )
    & ( sP4
      | sP3 ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1,sP2,sP3,sP4])],[f_1_2]) ).

cnf(f_1_4,negated_conjecture,
    ( sP4
    | sP3 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_5,negated_conjecture,
    ( s
    | sP0
    | ~ p
    | ~ sP3 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_6,negated_conjecture,
    ( sP2
    | sP1
    | ~ sP3 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_7,negated_conjecture,
    ( q
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_8,negated_conjecture,
    ( ~ r
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_9,negated_conjecture,
    ( p
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_10,negated_conjecture,
    ( ~ q
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_11,negated_conjecture,
    ( ~ s
    | ~ sP1 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_12,negated_conjecture,
    ( p
    | ~ sP2 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_13,negated_conjecture,
    ( r
    | ~ sP2 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_14,negated_conjecture,
    ( ~ s
    | ~ sP2 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_15,negated_conjecture,
    ( s
    | q
    | ~ p
    | ~ sP4 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_16,negated_conjecture,
    ( s
    | ~ r
    | ~ p
    | ~ sP4 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_17,negated_conjecture,
    ( p
    | ~ sP4 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_18,negated_conjecture,
    ( r
    | ~ q
    | ~ sP4 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(f_1_19,negated_conjecture,
    ( ~ s
    | ~ sP4 ),
    inference(clausify,[status(thm)],[f_1_3]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN047+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a FOF_THM_PRP problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n013.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Sun Sep 20 06:22:07 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.38  % SZS status Theorem for theBenchmark
% 0.02/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------