↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV392+1 : TPTP v9.3.1. Released v3.3.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 : n001.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:03:34 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax20,axiom,
    ! [U] : ~ contains_slb(create_slb,U),
    file('SWV007+2.ax',ax20) ).

fof(l28_co,conjecture,
    ! [U,V] :
      ( pair_in_list(create_slb,U,V)
     => ! [W] :
          ( contains_slb(create_slb,W)
         => ( U = W
            | pair_in_list(remove_slb(create_slb,W),U,V) ) ) ),
    file('theBenchmark.p',l28_co) ).

fof(f_8_1,plain,
    ! [U] : ~ contains_slb(create_slb,U),
    inference(fof_nnf,[status(thm)],[ax20]) ).

fof(f_8_2,plain,
    ! [U_16] : ~ contains_slb(create_slb,U_16),
    inference(variable_rename,[status(thm)],[f_8_1]) ).

cnf(f_8_3,plain,
    ~ contains_slb(create_slb,U_16),
    inference(clausify,[status(thm)],[f_8_2]) ).

fof(f_19_1,negated_conjecture,
    ~ ! [U,V] :
        ( pair_in_list(create_slb,U,V)
       => ! [W] :
            ( contains_slb(create_slb,W)
           => ( U = W
              | pair_in_list(remove_slb(create_slb,W),U,V) ) ) ),
    inference(negate,[status(cth)],[l28_co]) ).

fof(f_19_2,negated_conjecture,
    ? [U,V] :
      ( ? [W] :
          ( U != W
          & ~ pair_in_list(remove_slb(create_slb,W),U,V)
          & contains_slb(create_slb,W) )
      & pair_in_list(create_slb,U,V) ),
    inference(fof_nnf,[status(thm)],[f_19_1]) ).

fof(f_19_3,negated_conjecture,
    ? [U_71,U_70] :
      ( ? [U_69] :
          ( U_71 != U_69
          & ~ pair_in_list(remove_slb(create_slb,U_69),U_71,U_70)
          & contains_slb(create_slb,U_69) )
      & pair_in_list(create_slb,U_71,U_70) ),
    inference(variable_rename,[status(thm)],[f_19_2]) ).

fof(f_19_4,negated_conjecture,
    ? [U_70] :
      ( ? [U_69] :
          ( sK1 != U_69
          & ~ pair_in_list(remove_slb(create_slb,U_69),sK1,U_70)
          & contains_slb(create_slb,U_69) )
      & pair_in_list(create_slb,sK1,U_70) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_71,sK1)],[f_19_3]) ).

fof(f_19_5,negated_conjecture,
    ( ? [U_69] :
        ( sK1 != U_69
        & ~ pair_in_list(remove_slb(create_slb,U_69),sK1,sK2)
        & contains_slb(create_slb,U_69) )
    & pair_in_list(create_slb,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_70,sK2)],[f_19_4]) ).

fof(f_19_6,negated_conjecture,
    ( sK1 != sK3
    & ~ pair_in_list(remove_slb(create_slb,sK3),sK1,sK2)
    & contains_slb(create_slb,sK3)
    & pair_in_list(create_slb,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_69,sK3)],[f_19_5]) ).

fof(f_19_7,negated_conjecture,
    ( sK1 != sK3
    & ~ pair_in_list(remove_slb(create_slb,sK3),sK1,sK2)
    & contains_slb(create_slb,sK3)
    & pair_in_list(create_slb,sK1,sK2) ),
    inference(definitional_conversion,[status(esa)],[f_19_6]) ).

cnf(f_19_9,negated_conjecture,
    contains_slb(create_slb,sK3),
    inference(clausify,[status(thm)],[f_19_7]) ).

cnf(t1,plain,
    ~ contains_slb(create_slb,sK3),
    inference(start,[status(thm),parent(0:0)],[f_8_3]) ).

cnf(t2,plain,
    contains_slb(create_slb,sK3),
    inference(extension,[status(thm),parent(t1:1)],[f_19_9]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV392+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ 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 : n001.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.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sun Sep 20 03:35:40 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.13/0.39  % SZS status Theorem for theBenchmark
% 0.13/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------