↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__antisym_0,axiom,
    ( V_A = V_B
    | ~ c_lessequals(V_A,V_B,tc_set(T_a))
    | ~ c_lessequals(V_B,V_A,tc_set(T_a)) ),
    file('theBenchmark.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
    file('theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_4,negated_conjecture,
    v_n != c_Union(v_Y,tc_set(t_a)),
    file('theBenchmark.p',cls_conjecture_4) ).

cnf(t1,plain,
    v_n != c_Union(v_Y,tc_set(t_a)),
    inference(start,[status(thm),parent(0:0)],[cls_conjecture_4]) ).

cnf(t2,plain,
    ( ~ c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
    | ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a)))
    | v_n = c_Union(v_Y,tc_set(t_a)) ),
    inference(extension,[status(thm),parent(t1:1)],[cls_Set_Osubset__antisym_0]) ).

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

cnf(t4,plain,
    c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(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_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
    inference(extension,[status(thm),parent(t2:3)],[cls_conjecture_2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET855-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.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.09/0.36  % Computer : n008.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:05:08 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------