↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV395+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 : n012.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.06s 0.34s
% Output   : Proof 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  13   ~;   0   |;  25   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   30 (   2 sgn  14   !;  14   ?)

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

fof(l31_co,conjecture,
    ! [U,V,W,X] :
      ( ( ok(remove_cpq(triple(U,create_slb,V),W))
        & strictly_less_than(W,X)
        & pair_in_list(create_slb,W,X) )
     => pair_in_list(remove_slb(create_slb,W),W,X) ),
    file('theBenchmark.p',l31_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_42_1,negated_conjecture,
    ~ ! [U,V,W,X] :
        ( ( ok(remove_cpq(triple(U,create_slb,V),W))
          & strictly_less_than(W,X)
          & pair_in_list(create_slb,W,X) )
       => pair_in_list(remove_slb(create_slb,W),W,X) ),
    inference(negate,[status(cth)],[l31_co]) ).

fof(f_42_2,negated_conjecture,
    ? [U,V,W,X] :
      ( ~ pair_in_list(remove_slb(create_slb,W),W,X)
      & ok(remove_cpq(triple(U,create_slb,V),W))
      & strictly_less_than(W,X)
      & pair_in_list(create_slb,W,X) ),
    inference(fof_nnf,[status(thm)],[f_42_1]) ).

fof(f_42_3,negated_conjecture,
    ? [U_154,U_153,U_152,U_151] :
      ( ~ pair_in_list(remove_slb(create_slb,U_152),U_152,U_151)
      & ok(remove_cpq(triple(U_154,create_slb,U_153),U_152))
      & strictly_less_than(U_152,U_151)
      & pair_in_list(create_slb,U_152,U_151) ),
    inference(variable_rename,[status(thm)],[f_42_2]) ).

fof(f_42_4,negated_conjecture,
    ? [U_153,U_152,U_151] :
      ( ~ pair_in_list(remove_slb(create_slb,U_152),U_152,U_151)
      & ok(remove_cpq(triple(sK1,create_slb,U_153),U_152))
      & strictly_less_than(U_152,U_151)
      & pair_in_list(create_slb,U_152,U_151) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_154,sK1)],[f_42_3]) ).

fof(f_42_5,negated_conjecture,
    ? [U_152,U_151] :
      ( ~ pair_in_list(remove_slb(create_slb,U_152),U_152,U_151)
      & ok(remove_cpq(triple(sK1,create_slb,sK2),U_152))
      & strictly_less_than(U_152,U_151)
      & pair_in_list(create_slb,U_152,U_151) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_153,sK2)],[f_42_4]) ).

fof(f_42_6,negated_conjecture,
    ? [U_151] :
      ( ~ pair_in_list(remove_slb(create_slb,sK3),sK3,U_151)
      & ok(remove_cpq(triple(sK1,create_slb,sK2),sK3))
      & strictly_less_than(sK3,U_151)
      & pair_in_list(create_slb,sK3,U_151) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_152,sK3)],[f_42_5]) ).

fof(f_42_7,negated_conjecture,
    ( ~ pair_in_list(remove_slb(create_slb,sK3),sK3,sK4)
    & ok(remove_cpq(triple(sK1,create_slb,sK2),sK3))
    & strictly_less_than(sK3,sK4)
    & pair_in_list(create_slb,sK3,sK4) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_151,sK4)],[f_42_6]) ).

fof(f_42_8,negated_conjecture,
    ( ~ pair_in_list(remove_slb(create_slb,sK3),sK3,sK4)
    & ok(remove_cpq(triple(sK1,create_slb,sK2),sK3))
    & strictly_less_than(sK3,sK4)
    & pair_in_list(create_slb,sK3,sK4) ),
    inference(definitional_conversion,[status(esa)],[f_42_7]) ).

cnf(f_42_9,negated_conjecture,
    pair_in_list(create_slb,sK3,sK4),
    inference(clausify,[status(thm)],[f_42_8]) ).

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

cnf(t2,plain,
    pair_in_list(create_slb,sK3,sK4),
    inference(extension,[status(thm),parent(t1:1)],[f_42_9]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWV395+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.01  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.02  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Sun Sep 20 03:29:52 UTC 2026
% 0.03/0.30  % CPUTime  : 
% 0.06/0.34  % SZS status Theorem for theBenchmark
% 0.06/0.34  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------