↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SET838-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 : n005.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 1.04s 1.38s
% Output   : Proof 1.04s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    v_f(v_g(v_x)) = v_x,
    file('theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( v_f(v_g(V_U)) != V_U
    | V_U = v_x ),
    file('theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    ( v_g(v_f(V_U)) != V_U
    | v_g(v_f(v_xa(V_U))) = v_xa(V_U) ),
    file('theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    ( v_g(v_f(V_U)) != V_U
    | v_xa(V_U) != V_U ),
    file('theBenchmark.p',cls_conjecture_3) ).

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

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( v_g(Eq_x_0) = v_g(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( v_f(Eq_x_0) = v_f(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( v_xa(Eq_x_0) = v_xa(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

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