↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LCL666+1.001 : TPTP v9.3.1. Released v4.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 08:49:46 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
    ! [X] : r1(X,X),
    file('theBenchmark.p',reflexivity) ).

fof(main,conjecture,
    ~ ? [X] :
        ~ ( ~ ( p101(X)
              & p201(X) )
          | ~ ! [Y] :
                ( ~ ( p101(Y)
                    & p201(Y) )
                | ~ r1(X,Y) ) ),
    file('theBenchmark.p',main) ).

fof(f_1_1,plain,
    ! [X] : r1(X,X),
    inference(fof_nnf,[status(thm)],[reflexivity]) ).

fof(f_1_2,plain,
    ! [U_0] : r1(U_0,U_0),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    r1(U_0,U_0),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_2_1,negated_conjecture,
    ? [X] :
      ~ ( ~ ( p101(X)
            & p201(X) )
        | ~ ! [Y] :
              ( ~ ( p101(Y)
                  & p201(Y) )
              | ~ r1(X,Y) ) ),
    inference(negate,[status(cth)],[main]) ).

fof(f_2_2,negated_conjecture,
    ? [X] :
      ( p101(X)
      & p201(X)
      & ! [Y] :
          ( ~ p101(Y)
          | ~ p201(Y)
          | ~ r1(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[f_2_1]) ).

fof(f_2_3,negated_conjecture,
    ? [U_2] :
      ( p101(U_2)
      & p201(U_2)
      & ! [U_1] :
          ( ~ p101(U_1)
          | ~ p201(U_1)
          | ~ r1(U_2,U_1) ) ),
    inference(variable_rename,[status(thm)],[f_2_2]) ).

fof(f_2_4,negated_conjecture,
    ( p101(sK1)
    & p201(sK1)
    & ! [U_1] :
        ( ~ p101(U_1)
        | ~ p201(U_1)
        | ~ r1(sK1,U_1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_2,sK1)],[f_2_3]) ).

fof(f_2_5,negated_conjecture,
    ( p101(sK1)
    & p201(sK1)
    & ! [U_1] :
        ( ~ p101(U_1)
        | ~ p201(U_1)
        | ~ r1(sK1,U_1) ) ),
    inference(definitional_conversion,[status(esa)],[f_2_4]) ).

cnf(f_2_6,negated_conjecture,
    ( ~ p101(U_1)
    | ~ p201(U_1)
    | ~ r1(sK1,U_1) ),
    inference(clausify,[status(thm)],[f_2_5]) ).

cnf(f_2_7,negated_conjecture,
    p201(sK1),
    inference(clausify,[status(thm)],[f_2_5]) ).

cnf(f_2_8,negated_conjecture,
    p101(sK1),
    inference(clausify,[status(thm)],[f_2_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL666+1.001 : TPTP v9.3.1. Released v4.0.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.10/0.36  % Computer : n013.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 19 15:34:40 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.39  % SZS status Theorem for theBenchmark
% 0.10/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------