↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 30.54s 30.81s
% Output   : Proof 30.54s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_OUnCI_0,axiom,
    ( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
    | ~ c_in(V_c,V_B,T_a) ),
    file('theBenchmark.p',cls_Set_OUnCI_0) ).

cnf(cls_Set_OUnCI_1,axiom,
    ( c_in(V_c,c_union(V_A,V_B,T_a),T_a)
    | ~ c_in(V_c,V_A,T_a) ),
    file('theBenchmark.p',cls_Set_OUnCI_1) ).

cnf(cls_Set_OUnE_0,axiom,
    ( c_in(V_c,V_A,T_a)
    | c_in(V_c,V_B,T_a)
    | ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a) ),
    file('theBenchmark.p',cls_Set_OUnE_0) ).

cnf(cls_Set_OsubsetD_0,axiom,
    ( c_in(V_c,V_B,T_a)
    | ~ c_lessequals(V_A,V_B,tc_set(T_a))
    | ~ c_in(V_c,V_A,T_a) ),
    file('theBenchmark.p',cls_Set_OsubsetD_0) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_lessequals(V_A,V_B,tc_set(T_a))
    | c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a) ),
    file('theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( c_lessequals(V_A,V_B,tc_set(T_a))
    | ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a) ),
    file('theBenchmark.p',cls_Set_OsubsetI_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(v_x,v_X,t_a),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    file('theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( ~ c_lessequals(v_Y,V_U,tc_set(t_a))
    | ~ c_lessequals(v_Z,V_U,tc_set(t_a))
    | c_lessequals(v_X,V_U,tc_set(t_a)) ),
    file('theBenchmark.p',cls_conjecture_5) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET834-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN 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.10/0.37  % Computer : n011.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 19 23:02:24 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 30.54/30.81  % SZS status Unsatisfiable for theBenchmark
% 30.54/30.81  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------