↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET864-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 : n003.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:42 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.39s
% Output   : Proof 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (  13 unt;   0 nHn;  21 RR)
%            Number of literals    :   33 (   4 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
    ( c_Union(V_c,T_a) = V_u
    | ~ c_lessequals(c_Union(V_c,T_a),V_u,tc_set(T_a))
    | ~ c_in(V_c,c_Zorn_Omaxchain(V_S,T_a),tc_set(tc_set(T_a)))
    | ~ c_in(V_u,V_S,tc_set(T_a)) ),
    file('theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    ( ~ c_in(V_U,v_S,tc_set(t_a))
    | c_in(v_x(V_U),v_S,tc_set(t_a)) ),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_4,negated_conjecture,
    ( ~ c_in(V_U,v_S,tc_set(t_a))
    | c_lessequals(V_U,v_x(V_U),tc_set(t_a)) ),
    file('theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( ~ c_in(V_U,v_S,tc_set(t_a))
    | V_U != v_x(V_U) ),
    file('theBenchmark.p',cls_conjecture_5) ).

cnf(t1,plain,
    ( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
    | c_Union(v_c,t_a) != v_x(c_Union(v_c,t_a)) ),
    inference(start,[status(thm),parent(0:0)],[cls_conjecture_5]) ).

cnf(t2,plain,
    ( ~ c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a))
    | ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
    | c_Union(v_c,t_a) = v_x(c_Union(v_c,t_a)) ),
    inference(extension,[status(thm),parent(t1:1)],[cls_Zorn_Omaxchain__Zorn_0]) ).

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

cnf(t4,plain,
    ( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
    | c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)) ),
    inference(extension,[status(thm),parent(t2:2)],[cls_conjecture_3]) ).

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

cnf(t6,plain,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    inference(extension,[status(thm),parent(t4:2)],[cls_conjecture_2]) ).

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

cnf(t8,plain,
    ( ~ c_in(c_Union(v_c,t_a),v_S,tc_set(t_a))
    | c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a)) ),
    inference(extension,[status(thm),parent(t2:3)],[cls_conjecture_4]) ).

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

cnf(t10,plain,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    inference(extension,[status(thm),parent(t8:2)],[cls_conjecture_2]) ).

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

cnf(t12,plain,
    c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
    inference(extension,[status(thm),parent(t2:4)],[cls_conjecture_0]) ).

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

cnf(t14,plain,
    c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
    inference(extension,[status(thm),parent(t1:2)],[cls_conjecture_2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET864-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.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 19 23:07:28 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------