↑ Up

ConnectPP---0.7.2.THM-Prf.s

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

% Result   : Theorem 19.35s 24.65s
% Output   : Proof 19.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   37 (  32 unt;   0 def)
%            Number of atoms       :   45 (  39 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  18   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :   83 (   5 sgn  50   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax42,axiom,
    ! [U,V,W,X] : insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W),
    file('SWV007+3.ax',ax42) ).

fof(ax55,axiom,
    ! [U,V,W,X,Y] : i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X),
    file('SWV007+4.ax',ax55) ).

fof(main2_l12,lemma,
    ! [U,V,W,X,Y] : i(triple(U,W,X)) = i(triple(V,W,Y)),
    file('theBenchmark.p',main2_l12) ).

fof(co2,conjecture,
    ! [U,V,W,X] : i(insert_cpq(triple(U,V,W),X)) = insert_pq(i(triple(U,V,W)),X),
    file('theBenchmark.p',co2) ).

fof(f_42_1,plain,
    ! [U,V,W,X] : insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W),
    inference(fof_nnf,[status(thm)],[ax42]) ).

fof(f_42_2,plain,
    ! [U_152,U_151,U_150,U_149] : insert_cpq(triple(U_152,U_151,U_150),U_149) = triple(insert_pqp(U_152,U_149),insert_slb(U_151,pair(U_149,bottom)),U_150),
    inference(variable_rename,[status(thm)],[f_42_1]) ).

cnf(f_42_3,plain,
    insert_cpq(triple(U_152,U_151,U_150),U_149) = triple(insert_pqp(U_152,U_149),insert_slb(U_151,pair(U_149,bottom)),U_150),
    inference(clausify,[status(thm)],[f_42_2]) ).

fof(f_55_1,plain,
    ! [U,V,W,X,Y] : i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X),
    inference(fof_nnf,[status(thm)],[ax55]) ).

fof(f_55_2,plain,
    ! [U_193,U_192,U_191,U_190,U_189] : i(triple(U_193,insert_slb(U_192,pair(U_190,U_189)),U_191)) = insert_pq(i(triple(U_193,U_192,U_191)),U_190),
    inference(variable_rename,[status(thm)],[f_55_1]) ).

cnf(f_55_3,plain,
    i(triple(U_193,insert_slb(U_192,pair(U_190,U_189)),U_191)) = insert_pq(i(triple(U_193,U_192,U_191)),U_190),
    inference(clausify,[status(thm)],[f_55_2]) ).

fof(f_63_1,plain,
    ! [U,V,W,X,Y] : i(triple(U,W,X)) = i(triple(V,W,Y)),
    inference(fof_nnf,[status(thm)],[main2_l12]) ).

fof(f_63_2,plain,
    ! [U_237,U_236,U_235,U_234,U_233] : i(triple(U_237,U_235,U_234)) = i(triple(U_236,U_235,U_233)),
    inference(variable_rename,[status(thm)],[f_63_1]) ).

cnf(f_63_3,plain,
    i(triple(U_237,U_235,U_234)) = i(triple(U_236,U_235,U_233)),
    inference(clausify,[status(thm)],[f_63_2]) ).

fof(f_64_1,negated_conjecture,
    ~ ! [U,V,W,X] : i(insert_cpq(triple(U,V,W),X)) = insert_pq(i(triple(U,V,W)),X),
    inference(negate,[status(cth)],[co2]) ).

fof(f_64_2,negated_conjecture,
    ? [U,V,W,X] : i(insert_cpq(triple(U,V,W),X)) != insert_pq(i(triple(U,V,W)),X),
    inference(fof_nnf,[status(thm)],[f_64_1]) ).

fof(f_64_3,negated_conjecture,
    ? [U_241,U_240,U_239,U_238] : i(insert_cpq(triple(U_241,U_240,U_239),U_238)) != insert_pq(i(triple(U_241,U_240,U_239)),U_238),
    inference(variable_rename,[status(thm)],[f_64_2]) ).

fof(f_64_4,negated_conjecture,
    ? [U_240,U_239,U_238] : i(insert_cpq(triple(sK5,U_240,U_239),U_238)) != insert_pq(i(triple(sK5,U_240,U_239)),U_238),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_241,sK5)],[f_64_3]) ).

fof(f_64_5,negated_conjecture,
    ? [U_239,U_238] : i(insert_cpq(triple(sK5,sK6,U_239),U_238)) != insert_pq(i(triple(sK5,sK6,U_239)),U_238),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_240,sK6)],[f_64_4]) ).

fof(f_64_6,negated_conjecture,
    ? [U_238] : i(insert_cpq(triple(sK5,sK6,sK7),U_238)) != insert_pq(i(triple(sK5,sK6,sK7)),U_238),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_239,sK7)],[f_64_5]) ).

fof(f_64_7,negated_conjecture,
    i(insert_cpq(triple(sK5,sK6,sK7),sK8)) != insert_pq(i(triple(sK5,sK6,sK7)),sK8),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_238,sK8)],[f_64_6]) ).

fof(f_64_8,negated_conjecture,
    i(insert_cpq(triple(sK5,sK6,sK7),sK8)) != insert_pq(i(triple(sK5,sK6,sK7)),sK8),
    inference(definitional_conversion,[status(esa)],[f_64_7]) ).

cnf(f_64_9,negated_conjecture,
    i(insert_cpq(triple(sK5,sK6,sK7),sK8)) != insert_pq(i(triple(sK5,sK6,sK7)),sK8),
    inference(clausify,[status(thm)],[f_64_8]) ).

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(equality_25,axiom,
    ( i(Eq_x_0) = i(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

cnf(t2,plain,
    ( i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)) != insert_pq(i(triple(sK5,sK6,sK7)),sK8)
    | i(insert_cpq(triple(sK5,sK6,sK7),sK8)) != i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7))
    | i(insert_cpq(triple(sK5,sK6,sK7),sK8)) = insert_pq(i(triple(sK5,sK6,sK7)),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,
    ( insert_cpq(triple(sK5,sK6,sK7),sK8) != triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)
    | i(insert_cpq(triple(sK5,sK6,sK7),sK8)) = i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_25]) ).

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

cnf(t6,plain,
    insert_cpq(triple(sK5,sK6,sK7),sK8) = triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7),
    inference(extension,[status(thm),parent(t4:2)],[f_42_3]) ).

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

cnf(t8,plain,
    ( i(triple(sK5,insert_slb(sK6,pair(sK8,bottom)),sK7)) != insert_pq(i(triple(sK5,sK6,sK7)),sK8)
    | i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)) != i(triple(sK5,insert_slb(sK6,pair(sK8,bottom)),sK7))
    | i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)) = insert_pq(i(triple(sK5,sK6,sK7)),sK8) ),
    inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).

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

cnf(t10,plain,
    i(triple(insert_pqp(sK5,sK8),insert_slb(sK6,pair(sK8,bottom)),sK7)) = i(triple(sK5,insert_slb(sK6,pair(sK8,bottom)),sK7)),
    inference(extension,[status(thm),parent(t8:2)],[f_63_3]) ).

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

cnf(t12,plain,
    i(triple(sK5,insert_slb(sK6,pair(sK8,bottom)),sK7)) = insert_pq(i(triple(sK5,sK6,sK7)),sK8),
    inference(extension,[status(thm),parent(t8:3)],[f_55_3]) ).

cnf(t13,plain,
    $false,
    inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV415+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.12/5.38  % Computer : n007.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Sun Sep 20 03:29:40 UTC 2026
% 0.12/5.38  % CPUTime  : 
% 19.35/24.65  % SZS status Theorem for theBenchmark
% 19.35/24.65  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------