↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Result   : Theorem 0.12s 0.40s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   35 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   31 (  13   ~;   0   |;  16   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   30 (   6 sgn  14   !;  14   ?)

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

fof(l36_co,conjecture,
    ! [U,V,W,X] :
      ( ( less_than(X,W)
        & pair_in_list(create_slb,V,W) )
     => pair_in_list(update_slb(create_slb,X),V,W) ),
    file('theBenchmark.p',l36_co) ).

fof(f_10_1,plain,
    ! [U,V] : ~ pair_in_list(create_slb,U,V),
    inference(fof_nnf,[status(thm)],[ax22]) ).

fof(f_10_2,plain,
    ! [U_30,U_29] : ~ pair_in_list(create_slb,U_30,U_29),
    inference(variable_rename,[status(thm)],[f_10_1]) ).

cnf(f_10_3,plain,
    ~ pair_in_list(create_slb,U_30,U_29),
    inference(clausify,[status(thm)],[f_10_2]) ).

fof(f_19_1,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( less_than(X,W)
          & pair_in_list(create_slb,V,W) )
       => pair_in_list(update_slb(create_slb,X),V,W) ),
    inference(negate,[status(cth)],[l36_co]) ).

fof(f_19_2,negated_conjecture,
    ? [U,V,W,X] :
      ( ~ pair_in_list(update_slb(create_slb,X),V,W)
      & less_than(X,W)
      & pair_in_list(create_slb,V,W) ),
    inference(fof_nnf,[status(thm)],[f_19_1]) ).

fof(f_19_3,negated_conjecture,
    ? [U_72,U_71,U_70,U_69] :
      ( ~ pair_in_list(update_slb(create_slb,U_69),U_71,U_70)
      & less_than(U_69,U_70)
      & pair_in_list(create_slb,U_71,U_70) ),
    inference(variable_rename,[status(thm)],[f_19_2]) ).

fof(f_19_4,negated_conjecture,
    ? [U_71,U_70,U_69] :
      ( ~ pair_in_list(update_slb(create_slb,U_69),U_71,U_70)
      & less_than(U_69,U_70)
      & pair_in_list(create_slb,U_71,U_70) ),
    inference(miniscope,[status(thm)],[f_19_3]) ).

fof(f_19_5,negated_conjecture,
    ? [U_70,U_69] :
      ( ~ pair_in_list(update_slb(create_slb,U_69),sK1,U_70)
      & less_than(U_69,U_70)
      & pair_in_list(create_slb,sK1,U_70) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_71,sK1)],[f_19_4]) ).

fof(f_19_6,negated_conjecture,
    ? [U_69] :
      ( ~ pair_in_list(update_slb(create_slb,U_69),sK1,sK2)
      & less_than(U_69,sK2)
      & pair_in_list(create_slb,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_70,sK2)],[f_19_5]) ).

fof(f_19_7,negated_conjecture,
    ( ~ pair_in_list(update_slb(create_slb,sK3),sK1,sK2)
    & less_than(sK3,sK2)
    & pair_in_list(create_slb,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_69,sK3)],[f_19_6]) ).

fof(f_19_8,negated_conjecture,
    ( ~ pair_in_list(update_slb(create_slb,sK3),sK1,sK2)
    & less_than(sK3,sK2)
    & pair_in_list(create_slb,sK1,sK2) ),
    inference(definitional_conversion,[status(esa)],[f_19_7]) ).

cnf(f_19_9,negated_conjecture,
    pair_in_list(create_slb,sK1,sK2),
    inference(clausify,[status(thm)],[f_19_8]) ).

cnf(t1,plain,
    ~ pair_in_list(create_slb,sK1,sK2),
    inference(start,[status(thm),parent(0:0)],[f_10_3]) ).

cnf(t2,plain,
    pair_in_list(create_slb,sK1,sK2),
    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  : SWV400+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.09/0.35  % Computer : n001.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 03:35:55 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.12/0.40  % SZS status Theorem for theBenchmark
% 0.12/0.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------