↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN947+1 : TPTP v9.3.1. Released v3.1.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 : n010.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:11:15 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ! [X] :
      ? [Y] :
        ( q(Y)
        & p(X) )
   => ? [Z] :
      ! [Y] :
        ( r(Z)
        | p(Y) ) ),
    file('theBenchmark.p',prove_this) ).

fof(f_1_1,negated_conjecture,
    ( ~ ? [Z] :
        ! [Y] :
          ( r(Z)
          | p(Y) )
    & ! [X] :
      ? [Y] :
        ( q(Y)
        & p(X) ) ),
    inference(negate,[status(cth)],[prove_this]) ).

fof(f_1_2,negated_conjecture,
    ( ! [Z] :
      ? [Y] :
        ( ~ r(Z)
        & ~ p(Y) )
    & ! [X] :
      ? [Y] :
        ( q(Y)
        & p(X) ) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ( ! [U_3] :
      ? [U_2] :
        ( ~ r(U_3)
        & ~ p(U_2) )
    & ! [U_1] :
      ? [U_0] :
        ( q(U_0)
        & p(U_1) ) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

fof(f_1_4,negated_conjecture,
    ( ! [U_3] : ~ r(U_3)
    & ? [U_2] : ~ p(U_2)
    & ! [U_1] : p(U_1)
    & ? [U_0] : q(U_0) ),
    inference(miniscope,[status(thm)],[f_1_3]) ).

fof(f_1_5,negated_conjecture,
    ( ! [U_3] : ~ r(U_3)
    & ? [U_2] : ~ p(U_2)
    & ! [U_1] : p(U_1)
    & q(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_0,sK1)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( ! [U_3] : ~ r(U_3)
    & ~ p(sK2)
    & ! [U_1] : p(U_1)
    & q(sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_2,sK2)],[f_1_5]) ).

fof(f_1_7,negated_conjecture,
    ( ! [U_3] : ~ r(U_3)
    & ~ p(sK2)
    & ! [U_1] : p(U_1)
    & q(sK1) ),
    inference(definitional_conversion,[status(esa)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    q(sK1),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_9,negated_conjecture,
    p(U_1),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_10,negated_conjecture,
    ~ p(sK2),
    inference(clausify,[status(thm)],[f_1_7]) ).

cnf(f_1_11,negated_conjecture,
    ~ r(U_3),
    inference(clausify,[status(thm)],[f_1_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN947+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ 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.08/0.34  % Computer : n010.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep 20 07:29:23 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.12/0.37  % SZS status Theorem for theBenchmark
% 0.12/0.37  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------