↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : COM009-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 : n007.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:14:43 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) != v_F ),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( c_UNITY_Ototalize(v_F,t_a) = v_F
    | c_UNITY_Oall__total(v_F,t_a) ),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(cls_UNITY_Oall__total__imp__totalize_0,axiom,
    ( c_UNITY_Ototalize(V_F,T_a) = V_F
    | ~ c_UNITY_Oall__total(V_F,T_a) ),
    file('theBenchmark.p',cls_UNITY_Oall__total__imp__totalize_0) ).

cnf(cls_UNITY_Oall__total__totalize_0,axiom,
    c_UNITY_Oall__total(c_UNITY_Ototalize(V_F,T_a),T_a),
    file('theBenchmark.p',cls_UNITY_Oall__total__totalize_0) ).

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

cnf(equality_5,axiom,
    ( c_UNITY_Oall__total(Eq_y_0,Eq_y_1)
    | ~ c_UNITY_Oall__total(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(t1,plain,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) != v_F ),
    inference(start,[status(thm),parent(0:0)],[cls_conjecture_0]) ).

cnf(t2,plain,
    ( ~ c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) = v_F ),
    inference(extension,[status(thm),parent(t1:1)],[cls_UNITY_Oall__total__imp__totalize_0]) ).

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

cnf(t4,plain,
    ( c_UNITY_Ototalize(v_F,t_a) = v_F
    | c_UNITY_Oall__total(v_F,t_a) ),
    inference(extension,[status(thm),parent(t2:2)],[cls_conjecture_1]) ).

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

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

cnf(t7,plain,
    ( t_a != t_a
    | ~ c_UNITY_Oall__total(c_UNITY_Ototalize(v_F,t_a),t_a)
    | c_UNITY_Ototalize(v_F,t_a) != v_F
    | c_UNITY_Oall__total(v_F,t_a) ),
    inference(extension,[status(thm),parent(t1:2)],[equality_5]) ).

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

cnf(t9,plain,
    ( c_UNITY_Oall__total(v_F,t_a)
    | c_UNITY_Ototalize(v_F,t_a) = v_F ),
    inference(extension,[status(thm),parent(t7:2)],[cls_conjecture_1]) ).

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

cnf(t11,plain,
    $false,
    inference(reduction,[status(thm),parent(t9:2)],[t9:2,t1:2]) ).

cnf(t12,plain,
    c_UNITY_Oall__total(c_UNITY_Ototalize(v_F,t_a),t_a),
    inference(extension,[status(thm),parent(t7:3)],[cls_UNITY_Oall__total__totalize_0]) ).

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

cnf(t14,plain,
    t_a = t_a,
    inference(extension,[status(thm),parent(t7:4)],[equality_1]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COM009-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.06  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.43  % Computer : n007.cluster.edu
% 0.20/0.43  % Model    : x86_64 x86_64
% 0.20/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.43  % Memory   : 8046.5625MB
% 0.20/0.43  % OS       : Linux 6.8.0-71-generic
% 0.20/0.43  % CPULimit : 300
% 0.20/0.43  % WCLimit  : 300
% 0.20/0.43  % DateTime : Sun Sep 20 15:10:34 UTC 2026
% 0.20/0.43  % CPUTime  : 
% 0.20/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.46  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------