↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LAT014-1 : TPTP v9.3.1. Released v2.2.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 : n005.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:47:40 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.41s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   31 (  22 unt;   0 nHn;  22 RR)
%            Number of literals    :   46 (  35 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   49 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(mckenzie2,axiom,
    meet(X,join(Y,join(X,Z))) = X,
    file('theBenchmark.p',mckenzie2) ).

cnf(mckenzie3,axiom,
    join(join(meet(X,Y),meet(Y,Z)),Y) = Y,
    file('theBenchmark.p',mckenzie3) ).

cnf(mckenzie4,axiom,
    meet(meet(join(X,Y),join(Y,Z)),Y) = Y,
    file('theBenchmark.p',mckenzie4) ).

cnf(prove_absorbtion,negated_conjecture,
    meet(a,join(a,b)) != a,
    file('theBenchmark.p',prove_absorbtion) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

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(equality_4,axiom,
    ( meet(Eq_x_0,Eq_x_1) = meet(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(t1,plain,
    meet(a,join(a,b)) != a,
    inference(start,[status(thm),parent(0:0)],[prove_absorbtion]) ).

cnf(t2,plain,
    ( meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) != a
    | meet(a,join(a,b)) != meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)))
    | meet(a,join(a,b)) = a ),
    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,
    ( join(a,b) != join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))
    | a != meet(meet(join(U_197,a),join(a,U_199)),a)
    | meet(a,join(a,b)) = meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_4]) ).

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

cnf(t6,plain,
    ( meet(meet(join(U_197,a),join(a,U_199)),a) != a
    | a = meet(meet(join(U_197,a),join(a,U_199)),a) ),
    inference(extension,[status(thm),parent(t4:2)],[equality_2]) ).

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

cnf(t8,plain,
    meet(meet(join(U_197,a),join(a,U_199)),a) = a,
    inference(extension,[status(thm),parent(t6:2)],[mckenzie4]) ).

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

cnf(t10,plain,
    ( join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)) != join(a,b)
    | join(a,b) = join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)) ),
    inference(extension,[status(thm),parent(t4:3)],[equality_2]) ).

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

cnf(t12,plain,
    join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)) = join(a,b),
    inference(extension,[status(thm),parent(t10:2)],[mckenzie3]) ).

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

cnf(t14,plain,
    ( meet(a,join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) != a
    | meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) != meet(a,join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)))
    | meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) = a ),
    inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).

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

cnf(t16,plain,
    ( join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)) != join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))
    | meet(meet(join(U_197,a),join(a,U_199)),a) != a
    | meet(meet(meet(join(U_197,a),join(a,U_199)),a),join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) = meet(a,join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) ),
    inference(extension,[status(thm),parent(t14:2)],[equality_4]) ).

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

cnf(t18,plain,
    meet(meet(join(U_197,a),join(a,U_199)),a) = a,
    inference(extension,[status(thm),parent(t16:2)],[mckenzie4]) ).

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

cnf(t20,plain,
    join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)) = join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b)),
    inference(extension,[status(thm),parent(t16:3)],[equality_1]) ).

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

cnf(t22,plain,
    meet(a,join(join(meet(U_187,join(a,b)),meet(join(a,b),U_189)),join(a,b))) = a,
    inference(extension,[status(thm),parent(t14:3)],[mckenzie2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT014-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ 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.09/0.35  % Computer : n005.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 19 12:28:18 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.12/0.41  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.41  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------