↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LCL648+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 : n008.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:41 AM UTC 2026

% Result   : Theorem 0.09s 0.39s
% Output   : Proof 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   73 (  34   ~;  20   |;  19   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn   9   !;   7   ?)

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

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

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

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

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

fof(f_1_5,negated_conjecture,
    ( p101(sK2)
    & p201(sK2)
    & r1(sK1,sK2)
    & ! [U_0] :
        ( ~ p101(U_0)
        | ~ p201(U_0)
        | ~ r1(sK1,U_0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_1,sK2)],[f_1_4]) ).

fof(f_1_6,negated_conjecture,
    ( p101(sK2)
    & p201(sK2)
    & r1(sK1,sK2)
    & ! [U_0] :
        ( ~ p101(U_0)
        | ~ p201(U_0)
        | ~ r1(sK1,U_0) ) ),
    inference(definitional_conversion,[status(esa)],[f_1_5]) ).

cnf(f_1_7,negated_conjecture,
    ( ~ p101(U_0)
    | ~ p201(U_0)
    | ~ r1(sK1,U_0) ),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_8,negated_conjecture,
    r1(sK1,sK2),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_9,negated_conjecture,
    p201(sK2),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_10,negated_conjecture,
    p101(sK2),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(t1,plain,
    ( ~ p201(sK2)
    | ~ p101(sK2)
    | ~ r1(sK1,sK2) ),
    inference(start,[status(thm),parent(0:0)],[f_1_7]) ).

cnf(t2,plain,
    r1(sK1,sK2),
    inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    p101(sK2),
    inference(extension,[status(thm),parent(t1:2)],[f_1_10]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t1:2]) ).

cnf(t6,plain,
    p201(sK2),
    inference(extension,[status(thm),parent(t1:3)],[f_1_9]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t1:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL648+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.09/0.37  % Computer : n008.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 19 15:25:24 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.39  % SZS status Theorem for theBenchmark
% 0.09/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------