↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : CAT002-3 : TPTP v9.3.1. Released v1.0.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 : n026.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 08:14:05 AM UTC 2026

% Result   : Unsatisfiable 120.51s 120.83s
% Output   : Proof 120.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   33 (  24 unt;   0 nHn;  32 RR)
%            Number of literals    :   51 (  38 equ;  20 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity_of_compose,axiom,
    compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    file('CAT003-0.ax',associativity_of_compose) ).

cnf(cancellation_for_compose1,hypothesis,
    ( X = Z
    | compose(a,Z) != Y
    | compose(a,X) != Y ),
    file('theBenchmark.p',cancellation_for_compose1) ).

cnf(cancellation_for_compose2,hypothesis,
    ( X = Z
    | compose(b,Z) != Y
    | compose(b,X) != Y ),
    file('theBenchmark.p',cancellation_for_compose2) ).

cnf(ab_h_equals_ab_g,hypothesis,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    file('theBenchmark.p',ab_h_equals_ab_g) ).

cnf(prove_g_equals_h,negated_conjecture,
    g != h,
    file('theBenchmark.p',prove_g_equals_h) ).

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,
    g != h,
    inference(start,[status(thm),parent(0:0)],[prove_g_equals_h]) ).

cnf(t2,plain,
    ( compose(b,h) != compose(b,g)
    | compose(b,g) != compose(b,g)
    | g = h ),
    inference(extension,[status(thm),parent(t1:1)],[cancellation_for_compose2]) ).

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

cnf(t4,plain,
    ( compose(b,compose(b,g)) != compose(b,compose(b,g))
    | compose(b,compose(b,g)) != compose(b,compose(b,g))
    | compose(b,g) = compose(b,g) ),
    inference(extension,[status(thm),parent(t2:2)],[cancellation_for_compose2]) ).

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

cnf(t6,plain,
    ( compose(b,compose(b,compose(b,g))) != compose(compose(b,b),compose(b,g))
    | compose(b,compose(b,compose(b,g))) != compose(compose(b,b),compose(b,g))
    | compose(b,compose(b,g)) = compose(b,compose(b,g)) ),
    inference(extension,[status(thm),parent(t4:2)],[cancellation_for_compose2]) ).

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

cnf(t8,plain,
    compose(b,compose(b,compose(b,g))) = compose(compose(b,b),compose(b,g)),
    inference(extension,[status(thm),parent(t6:2)],[associativity_of_compose]) ).

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

cnf(t10,plain,
    compose(b,compose(b,compose(b,g))) = compose(compose(b,b),compose(b,g)),
    inference(extension,[status(thm),parent(t6:3)],[associativity_of_compose]) ).

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

cnf(t12,plain,
    ( compose(b,compose(b,compose(b,g))) != compose(compose(b,b),compose(b,g))
    | compose(b,compose(b,compose(b,g))) != compose(compose(b,b),compose(b,g))
    | compose(b,compose(b,g)) = compose(b,compose(b,g)) ),
    inference(extension,[status(thm),parent(t4:3)],[cancellation_for_compose2]) ).

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

cnf(t14,plain,
    compose(b,compose(b,compose(b,g))) = compose(compose(b,b),compose(b,g)),
    inference(extension,[status(thm),parent(t12:2)],[associativity_of_compose]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).

cnf(t16,plain,
    compose(b,compose(b,compose(b,g))) = compose(compose(b,b),compose(b,g)),
    inference(extension,[status(thm),parent(t12:3)],[associativity_of_compose]) ).

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

cnf(t18,plain,
    ( compose(a,compose(b,g)) != compose(compose(a,b),g)
    | compose(a,compose(b,h)) != compose(compose(a,b),g)
    | compose(b,h) = compose(b,g) ),
    inference(extension,[status(thm),parent(t2:3)],[cancellation_for_compose1]) ).

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

cnf(t20,plain,
    ( compose(compose(a,b),h) != compose(compose(a,b),g)
    | compose(a,compose(b,h)) != compose(compose(a,b),h)
    | compose(a,compose(b,h)) = compose(compose(a,b),g) ),
    inference(extension,[status(thm),parent(t18:2)],[equality_3]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).

cnf(t22,plain,
    compose(a,compose(b,h)) = compose(compose(a,b),h),
    inference(extension,[status(thm),parent(t20:2)],[associativity_of_compose]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).

cnf(t24,plain,
    compose(compose(a,b),h) = compose(compose(a,b),g),
    inference(extension,[status(thm),parent(t20:3)],[ab_h_equals_ab_g]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t20:3]) ).

cnf(t26,plain,
    compose(a,compose(b,g)) = compose(compose(a,b),g),
    inference(extension,[status(thm),parent(t18:3)],[associativity_of_compose]) ).

cnf(t27,plain,
    $false,
    inference(connection,[status(thm),parent(t26:1)],[t26:1,t18:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CAT002-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n026.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep 20 14:04:06 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 120.51/120.83  % SZS status Unsatisfiable for theBenchmark
% 120.51/120.83  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------