↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.21s 0.52s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   33 (  23 unt;   2 nHn;  30 RR)
%            Number of literals    :   55 (  21 equ;  22 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   27 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(cls_PropLog_Othms_OH_0,axiom,
    ( c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
    | ~ c_in(V_p,V_H,tc_PropLog_Opl(T_a)) ),
    file('theBenchmark.p',cls_PropLog_Othms_OH_0) ).

cnf(cls_PropLog_Othms__I_0,axiom,
    c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_p,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),
    file('theBenchmark.p',cls_PropLog_Othms__I_0) ).

cnf(cls_PropLog_Oweaken__right_0,axiom,
    ( c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))
    | ~ c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)) ),
    file('theBenchmark.p',cls_PropLog_Oweaken__right_0) ).

cnf(cls_Set_OinsertE_0,axiom,
    ( V_a = V_b
    | c_in(V_a,V_A,T_a)
    | ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a) ),
    file('theBenchmark.p',cls_Set_OinsertE_0) ).

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

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

cnf(equality_8,axiom,
    ( c_in(Eq_y_0,Eq_y_1,Eq_y_2)
    | ~ c_in(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_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(start,[status(thm),parent(0:0)],[cls_conjecture_1]) ).

cnf(t2,plain,
    ( ~ c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(extension,[status(thm),parent(t1:1)],[cls_PropLog_Oweaken__right_0]) ).

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

cnf(t4,plain,
    ( ~ c_in(v_pa,v_H,tc_PropLog_Opl(t_a))
    | c_in(v_pa,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) ),
    inference(extension,[status(thm),parent(t2:2)],[cls_PropLog_Othms_OH_0]) ).

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

cnf(t6,plain,
    ( v_pa = v_p
    | ~ c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a))
    | c_in(v_pa,v_H,tc_PropLog_Opl(t_a)) ),
    inference(extension,[status(thm),parent(t4:2)],[cls_Set_OinsertE_0]) ).

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

cnf(t8,plain,
    c_in(v_pa,c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),tc_PropLog_Opl(t_a)),
    inference(extension,[status(thm),parent(t6:2)],[cls_conjecture_0]) ).

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

cnf(t10,plain,
    ( v_pa != v_pa
    | t_a != t_a
    | c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a) = c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a)
    | v_pa != v_p ),
    inference(extension,[status(thm),parent(t6:3)],[equality_6]) ).

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

cnf(t12,plain,
    ( c_PropLog_Othms(v_H,t_a) != c_PropLog_Othms(v_H,t_a)
    | tc_PropLog_Opl(t_a) != tc_PropLog_Opl(t_a)
    | ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | c_in(c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))
    | c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a) != c_PropLog_Opl_Oop_A_N_62(v_p,v_pa,t_a) ),
    inference(extension,[status(thm),parent(t10:2)],[equality_8]) ).

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

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

cnf(t15,plain,
    c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,v_pa,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    inference(extension,[status(thm),parent(t12:3)],[cls_PropLog_Othms__I_0]) ).

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

cnf(t17,plain,
    tc_PropLog_Opl(t_a) = tc_PropLog_Opl(t_a),
    inference(extension,[status(thm),parent(t12:4)],[equality_1]) ).

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

cnf(t19,plain,
    c_PropLog_Othms(v_H,t_a) = c_PropLog_Othms(v_H,t_a),
    inference(extension,[status(thm),parent(t12:5)],[equality_1]) ).

cnf(t20,plain,
    $false,
    inference(connection,[status(thm),parent(t19:1)],[t19:1,t12:5]) ).

cnf(t21,plain,
    t_a = t_a,
    inference(extension,[status(thm),parent(t10:3)],[equality_1]) ).

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

cnf(t23,plain,
    v_pa = v_pa,
    inference(extension,[status(thm),parent(t10:4)],[equality_1]) ).

cnf(t24,plain,
    $false,
    inference(connection,[status(thm),parent(t23:1)],[t23:1,t10:4]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL434-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n008.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 19 15:03:23 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.21/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.52  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------