↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax54,axiom,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    file('SWV007+4.ax',ax54) ).

fof(l1_co,conjecture,
    ! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
    file('theBenchmark.p',l1_co) ).

fof(f_54_1,plain,
    ! [U,V] : i(triple(U,create_slb,V)) = create_pq,
    inference(fof_nnf,[status(thm)],[ax54]) ).

fof(f_54_2,plain,
    ! [U_188,U_187] : i(triple(U_188,create_slb,U_187)) = create_pq,
    inference(variable_rename,[status(thm)],[f_54_1]) ).

cnf(f_54_3,plain,
    i(triple(U_188,create_slb,U_187)) = create_pq,
    inference(clausify,[status(thm)],[f_54_2]) ).

fof(f_63_1,negated_conjecture,
    ~ ! [U,V,X,Y] : i(triple(U,create_slb,X)) = i(triple(V,create_slb,Y)),
    inference(negate,[status(cth)],[l1_co]) ).

fof(f_63_2,negated_conjecture,
    ? [U,V,X,Y] : i(triple(U,create_slb,X)) != i(triple(V,create_slb,Y)),
    inference(fof_nnf,[status(thm)],[f_63_1]) ).

fof(f_63_3,negated_conjecture,
    ? [U_236,U_235,U_234,U_233] : i(triple(U_236,create_slb,U_234)) != i(triple(U_235,create_slb,U_233)),
    inference(variable_rename,[status(thm)],[f_63_2]) ).

fof(f_63_4,negated_conjecture,
    ? [U_235,U_234,U_233] : i(triple(sK5,create_slb,U_234)) != i(triple(U_235,create_slb,U_233)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_236,sK5)],[f_63_3]) ).

fof(f_63_5,negated_conjecture,
    ? [U_234,U_233] : i(triple(sK5,create_slb,U_234)) != i(triple(sK6,create_slb,U_233)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_235,sK6)],[f_63_4]) ).

fof(f_63_6,negated_conjecture,
    ? [U_233] : i(triple(sK5,create_slb,sK7)) != i(triple(sK6,create_slb,U_233)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_234,sK7)],[f_63_5]) ).

fof(f_63_7,negated_conjecture,
    i(triple(sK5,create_slb,sK7)) != i(triple(sK6,create_slb,sK8)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_233,sK8)],[f_63_6]) ).

fof(f_63_8,negated_conjecture,
    i(triple(sK5,create_slb,sK7)) != i(triple(sK6,create_slb,sK8)),
    inference(definitional_conversion,[status(esa)],[f_63_7]) ).

cnf(f_63_9,negated_conjecture,
    i(triple(sK5,create_slb,sK7)) != i(triple(sK6,create_slb,sK8)),
    inference(clausify,[status(thm)],[f_63_8]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(t1,plain,
    i(triple(sK5,create_slb,sK7)) != i(triple(sK6,create_slb,sK8)),
    inference(start,[status(thm),parent(0:0)],[f_63_9]) ).

cnf(t2,plain,
    ( create_pq != i(triple(sK6,create_slb,sK8))
    | i(triple(sK5,create_slb,sK7)) != create_pq
    | i(triple(sK5,create_slb,sK7)) = i(triple(sK6,create_slb,sK8)) ),
    inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).

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

cnf(t4,plain,
    i(triple(sK5,create_slb,sK7)) = create_pq,
    inference(extension,[status(thm),parent(t2:2)],[f_54_3]) ).

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

cnf(t6,plain,
    ( i(triple(sK6,create_slb,sK8)) != create_pq
    | create_pq = i(triple(sK6,create_slb,sK8)) ),
    inference(extension,[status(thm),parent(t2:3)],[equality_2]) ).

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

cnf(t8,plain,
    i(triple(sK6,create_slb,sK8)) = create_pq,
    inference(extension,[status(thm),parent(t6:2)],[f_54_3]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV365+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.37  % Computer : n016.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 20 03:32:06 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 19.34/19.69  % SZS status Theorem for theBenchmark
% 19.34/19.69  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------