↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV413+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n006.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:36 AM UTC 2026

% Result   : Theorem 0.13s 5.40s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   75 (  27   ~;  17   |;  28   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  27   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l49_li3637,lemma,
    ! [U,V,W,X] :
      ( ( less_than(X,W)
        & pair_in_list(U,V,W) )
     => pair_in_list(update_slb(U,X),V,W) ),
    file('theBenchmark.p',l49_li3637) ).

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

fof(f_19_1,plain,
    ! [U,V,W,X] :
      ( pair_in_list(update_slb(U,X),V,W)
      | ~ less_than(X,W)
      | ~ pair_in_list(U,V,W) ),
    inference(fof_nnf,[status(thm)],[l49_li3637]) ).

fof(f_19_2,plain,
    ! [U_72,U_71,U_70,U_69] :
      ( pair_in_list(update_slb(U_72,U_69),U_71,U_70)
      | ~ less_than(U_69,U_70)
      | ~ pair_in_list(U_72,U_71,U_70) ),
    inference(variable_rename,[status(thm)],[f_19_1]) ).

cnf(f_19_3,plain,
    ( pair_in_list(update_slb(U_72,U_69),U_71,U_70)
    | ~ less_than(U_69,U_70)
    | ~ pair_in_list(U_72,U_71,U_70) ),
    inference(clausify,[status(thm)],[f_19_2]) ).

fof(f_20_1,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( less_than(X,W)
          & strictly_less_than(V,X)
          & pair_in_list(U,V,W) )
       => ? [Y] :
            ( less_than(X,Y)
            & pair_in_list(update_slb(U,X),V,Y) ) ),
    inference(negate,[status(cth)],[l49_co]) ).

fof(f_20_2,negated_conjecture,
    ? [U,V,W,X] :
      ( ! [Y] :
          ( ~ less_than(X,Y)
          | ~ pair_in_list(update_slb(U,X),V,Y) )
      & less_than(X,W)
      & strictly_less_than(V,X)
      & pair_in_list(U,V,W) ),
    inference(fof_nnf,[status(thm)],[f_20_1]) ).

fof(f_20_3,negated_conjecture,
    ? [U_77,U_76,U_75,U_74] :
      ( ! [U_73] :
          ( ~ less_than(U_74,U_73)
          | ~ pair_in_list(update_slb(U_77,U_74),U_76,U_73) )
      & less_than(U_74,U_75)
      & strictly_less_than(U_76,U_74)
      & pair_in_list(U_77,U_76,U_75) ),
    inference(variable_rename,[status(thm)],[f_20_2]) ).

fof(f_20_4,negated_conjecture,
    ? [U_76,U_75,U_74] :
      ( ! [U_73] :
          ( ~ less_than(U_74,U_73)
          | ~ pair_in_list(update_slb(sK1,U_74),U_76,U_73) )
      & less_than(U_74,U_75)
      & strictly_less_than(U_76,U_74)
      & pair_in_list(sK1,U_76,U_75) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_77,sK1)],[f_20_3]) ).

fof(f_20_5,negated_conjecture,
    ? [U_75,U_74] :
      ( ! [U_73] :
          ( ~ less_than(U_74,U_73)
          | ~ pair_in_list(update_slb(sK1,U_74),sK2,U_73) )
      & less_than(U_74,U_75)
      & strictly_less_than(sK2,U_74)
      & pair_in_list(sK1,sK2,U_75) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_76,sK2)],[f_20_4]) ).

fof(f_20_6,negated_conjecture,
    ? [U_74] :
      ( ! [U_73] :
          ( ~ less_than(U_74,U_73)
          | ~ pair_in_list(update_slb(sK1,U_74),sK2,U_73) )
      & less_than(U_74,sK3)
      & strictly_less_than(sK2,U_74)
      & pair_in_list(sK1,sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_75,sK3)],[f_20_5]) ).

fof(f_20_7,negated_conjecture,
    ( ! [U_73] :
        ( ~ less_than(sK4,U_73)
        | ~ pair_in_list(update_slb(sK1,sK4),sK2,U_73) )
    & less_than(sK4,sK3)
    & strictly_less_than(sK2,sK4)
    & pair_in_list(sK1,sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_74,sK4)],[f_20_6]) ).

fof(f_20_8,negated_conjecture,
    ( ! [U_73] :
        ( ~ less_than(sK4,U_73)
        | ~ pair_in_list(update_slb(sK1,sK4),sK2,U_73) )
    & less_than(sK4,sK3)
    & strictly_less_than(sK2,sK4)
    & pair_in_list(sK1,sK2,sK3) ),
    inference(definitional_conversion,[status(esa)],[f_20_7]) ).

cnf(f_20_9,negated_conjecture,
    pair_in_list(sK1,sK2,sK3),
    inference(clausify,[status(thm)],[f_20_8]) ).

cnf(f_20_11,negated_conjecture,
    less_than(sK4,sK3),
    inference(clausify,[status(thm)],[f_20_8]) ).

cnf(f_20_12,negated_conjecture,
    ( ~ less_than(sK4,U_73)
    | ~ pair_in_list(update_slb(sK1,sK4),sK2,U_73) ),
    inference(clausify,[status(thm)],[f_20_8]) ).

cnf(t1,plain,
    ( ~ less_than(sK4,sK3)
    | ~ pair_in_list(update_slb(sK1,sK4),sK2,sK3) ),
    inference(start,[status(thm),parent(0:0)],[f_20_12]) ).

cnf(t2,plain,
    ( ~ less_than(sK4,sK3)
    | ~ pair_in_list(sK1,sK2,sK3)
    | pair_in_list(update_slb(sK1,sK4),sK2,sK3) ),
    inference(extension,[status(thm),parent(t1:1)],[f_19_3]) ).

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

cnf(t4,plain,
    pair_in_list(sK1,sK2,sK3),
    inference(extension,[status(thm),parent(t2:2)],[f_20_9]) ).

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

cnf(t6,plain,
    less_than(sK4,sK3),
    inference(extension,[status(thm),parent(t2:3)],[f_20_11]) ).

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

cnf(t8,plain,
    less_than(sK4,sK3),
    inference(extension,[status(thm),parent(t1:2)],[f_20_11]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV413+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/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37  % Computer : n006.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sun Sep 20 03:31:19 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.13/5.40  % SZS status Theorem for theBenchmark
% 0.13/5.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------