↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV268-2 : TPTP v9.3.1. Released v3.2.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 : n020.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:09 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.61s
% Output   : Proof 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   29 (  20 unt;   0 nHn;  27 RR)
%            Number of literals    :   46 (  22 equ;  19 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Message_Oparts__idem_0,axiom,
    c_Message_Oparts(c_Message_Oparts(V_H)) = c_Message_Oparts(V_H),
    file('theBenchmark.p',cls_Message_Oparts__idem_0) ).

cnf(cls_Message_Oparts__mono_0,axiom,
    ( c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
    | ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg)) ),
    file('theBenchmark.p',cls_Message_Oparts__mono_0) ).

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

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

cnf(equality_6,axiom,
    ( c_lessequals(Eq_y_0,Eq_y_1,Eq_y_2)
    | ~ c_lessequals(Eq_x_0,Eq_x_1,Eq_x_2)
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(t1,plain,
    ~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(start,[status(thm),parent(0:0)],[cls_conjecture_1]) ).

cnf(t2,plain,
    ( c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))) != c_Message_Oparts(v_H)
    | tc_set(tc_Message_Omsg) != tc_set(tc_Message_Omsg)
    | ~ c_lessequals(c_Message_Oparts(c_Message_Oparts(v_G)),c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))),tc_set(tc_Message_Omsg))
    | c_Message_Oparts(c_Message_Oparts(v_G)) != c_Message_Oparts(v_G)
    | c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ),
    inference(extension,[status(thm),parent(t1:1)],[equality_6]) ).

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

cnf(t4,plain,
    c_Message_Oparts(c_Message_Oparts(v_G)) = c_Message_Oparts(v_G),
    inference(extension,[status(thm),parent(t2:2)],[cls_Message_Oparts__idem_0]) ).

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

cnf(t6,plain,
    ( ~ c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(c_Message_Oparts(v_H)),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(c_Message_Oparts(v_G)),c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))),tc_set(tc_Message_Omsg)) ),
    inference(extension,[status(thm),parent(t2:3)],[cls_Message_Oparts__mono_0]) ).

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

cnf(t8,plain,
    ( ~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(c_Message_Oparts(v_H)),tc_set(tc_Message_Omsg)) ),
    inference(extension,[status(thm),parent(t6:2)],[cls_Message_Oparts__mono_0]) ).

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

cnf(t10,plain,
    c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
    inference(extension,[status(thm),parent(t8:2)],[cls_conjecture_0]) ).

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

cnf(t12,plain,
    ( tc_Message_Omsg != tc_Message_Omsg
    | tc_set(tc_Message_Omsg) = tc_set(tc_Message_Omsg) ),
    inference(extension,[status(thm),parent(t2:4)],[equality_5]) ).

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

cnf(t14,plain,
    tc_Message_Omsg = tc_Message_Omsg,
    inference(extension,[status(thm),parent(t12:2)],[equality_1]) ).

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

cnf(t16,plain,
    ( c_Message_Oparts(c_Message_Oparts(v_H)) != c_Message_Oparts(v_H)
    | c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))) != c_Message_Oparts(c_Message_Oparts(v_H))
    | c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))) = c_Message_Oparts(v_H) ),
    inference(extension,[status(thm),parent(t2:5)],[equality_3]) ).

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

cnf(t18,plain,
    c_Message_Oparts(c_Message_Oparts(c_Message_Oparts(v_H))) = c_Message_Oparts(c_Message_Oparts(v_H)),
    inference(extension,[status(thm),parent(t16:2)],[cls_Message_Oparts__idem_0]) ).

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

cnf(t20,plain,
    c_Message_Oparts(c_Message_Oparts(v_H)) = c_Message_Oparts(v_H),
    inference(extension,[status(thm),parent(t16:3)],[cls_Message_Oparts__idem_0]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV268-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.58  % Computer : n020.cluster.edu
% 0.10/0.58  % Model    : x86_64 x86_64
% 0.10/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.58  % Memory   : 8046.5625MB
% 0.10/0.58  % OS       : Linux 6.8.0-71-generic
% 0.10/0.58  % CPULimit : 300
% 0.10/0.58  % WCLimit  : 300
% 0.10/0.58  % DateTime : Sun Sep 20 03:16:02 UTC 2026
% 0.10/0.58  % CPUTime  : 
% 0.10/0.61  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.61  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------