↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN336+1 : TPTP v9.3.1. Released v2.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 09:10:05 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_15_1,conjecture,
    ! [X] :
    ? [Y1,Y2] :
    ! [Z] :
      ( big_f(X,Z)
     => ( big_f(Y1,Z)
       => ( big_f(Y2,Z)
         => ( big_f(Y1,X)
           => big_f(Z,Y2) ) ) ) ),
    file('theBenchmark.p',church_46_15_1) ).

fof(f_1_1,negated_conjecture,
    ~ ! [X] :
      ? [Y1,Y2] :
      ! [Z] :
        ( big_f(X,Z)
       => ( big_f(Y1,Z)
         => ( big_f(Y2,Z)
           => ( big_f(Y1,X)
             => big_f(Z,Y2) ) ) ) ),
    inference(negate,[status(cth)],[church_46_15_1]) ).

fof(f_1_2,negated_conjecture,
    ? [X] :
    ! [Y1,Y2] :
    ? [Z] :
      ( ~ big_f(Z,Y2)
      & big_f(Y1,X)
      & big_f(Y2,Z)
      & big_f(Y1,Z)
      & big_f(X,Z) ),
    inference(fof_nnf,[status(thm)],[f_1_1]) ).

fof(f_1_3,negated_conjecture,
    ? [U_3] :
    ! [U_2,U_1] :
    ? [U_0] :
      ( ~ big_f(U_0,U_1)
      & big_f(U_2,U_3)
      & big_f(U_1,U_0)
      & big_f(U_2,U_0)
      & big_f(U_3,U_0) ),
    inference(variable_rename,[status(thm)],[f_1_2]) ).

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

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

fof(f_1_6,negated_conjecture,
    ( ! [U_1,U_2] : ~ big_f(sK2(U_2,U_1),U_1)
    & ! [U_2] : big_f(U_2,sK1)
    & ! [U_1,U_2] : big_f(U_1,sK2(U_2,U_1))
    & ! [U_1,U_2] : big_f(U_2,sK2(U_2,U_1))
    & ! [U_1,U_2] : big_f(sK1,sK2(U_2,U_1)) ),
    inference(definitional_conversion,[status(esa)],[f_1_5]) ).

cnf(f_1_10,negated_conjecture,
    big_f(U_2,sK1),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(f_1_11,negated_conjecture,
    ~ big_f(sK2(U_2,U_1),U_1),
    inference(clausify,[status(thm)],[f_1_6]) ).

cnf(t1,plain,
    ~ big_f(sK2(U_49,sK1),sK1),
    inference(start,[status(thm),parent(0:0)],[f_1_11]) ).

cnf(t2,plain,
    big_f(sK2(U_49,sK1),sK1),
    inference(extension,[status(thm),parent(t1:1)],[f_1_10]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN336+1 : TPTP v9.3.1. Released v2.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.12/0.36  % Computer : n008.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Sun Sep 20 06:29:53 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.15/0.39  % SZS status Theorem for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------