↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN044+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/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:16 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel10_1,axiom,
    ( q
   => r ),
    file('theBenchmark.p',pel10_1) ).

fof(pel10_2,axiom,
    ( r
   => ( q
      & p ) ),
    file('theBenchmark.p',pel10_2) ).

fof(pel10_3,axiom,
    ( p
   => ( r
      | q ) ),
    file('theBenchmark.p',pel10_3) ).

fof(pel10,conjecture,
    ( p
  <=> q ),
    file('theBenchmark.p',pel10) ).

fof(f_1_1,plain,
    ( r
    | ~ q ),
    inference(fof_nnf,[status(thm)],[pel10_1]) ).

cnf(f_1_2,plain,
    ( r
    | ~ q ),
    inference(clausify,[status(thm)],[f_1_1]) ).

fof(f_2_1,plain,
    ( ( q
      & p )
    | ~ r ),
    inference(fof_nnf,[status(thm)],[pel10_2]) ).

cnf(f_2_2,plain,
    ( p
    | ~ r ),
    inference(clausify,[status(thm)],[f_2_1]) ).

cnf(f_2_3,plain,
    ( q
    | ~ r ),
    inference(clausify,[status(thm)],[f_2_1]) ).

fof(f_3_1,plain,
    ( r
    | q
    | ~ p ),
    inference(fof_nnf,[status(thm)],[pel10_3]) ).

cnf(f_3_2,plain,
    ( r
    | q
    | ~ p ),
    inference(clausify,[status(thm)],[f_3_1]) ).

fof(f_4_1,negated_conjecture,
    ~ ( p
    <=> q ),
    inference(negate,[status(cth)],[pel10]) ).

fof(f_4_2,negated_conjecture,
    ( ( ~ p
      & q )
    | ( ~ q
      & p ) ),
    inference(fof_nnf,[status(thm)],[f_4_1]) ).

fof(f_4_3,negated_conjecture,
    ( ( ~ p
      | ~ sP1 )
    & ( q
      | ~ sP1 )
    & ( ~ q
      | ~ sP0 )
    & ( p
      | ~ sP0 )
    & ( sP1
      | sP0 ) ),
    inference(definitional_conversion,[status(esa),new_symbols(definitional,[sP0,sP1])],[f_4_2]) ).

cnf(f_4_4,negated_conjecture,
    ( sP1
    | sP0 ),
    inference(clausify,[status(thm)],[f_4_3]) ).

cnf(f_4_5,negated_conjecture,
    ( p
    | ~ sP0 ),
    inference(clausify,[status(thm)],[f_4_3]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN044+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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37  % Computer : n013.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sun Sep 20 06:22:26 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.39  % SZS status Theorem for theBenchmark
% 0.09/5.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------