↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : CAT006-4 : TPTP v9.3.1. Released v1.0.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 : n015.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:07 AM UTC 2026

% Result   : Unsatisfiable 120.51s 120.85s
% Output   : Proof 121.61s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(equivalence_implies_existence1,axiom,
    ( there_exists(X)
    | ~ equivalent(X,Y) ),
    file('CAT004-0.ax',equivalence_implies_existence1) ).

cnf(equivalence_implies_existence2,axiom,
    ( X = Y
    | ~ equivalent(X,Y) ),
    file('CAT004-0.ax',equivalence_implies_existence2) ).

cnf(existence_and_equality_implies_equivalence1,axiom,
    ( equivalent(X,Y)
    | X != Y
    | ~ there_exists(X) ),
    file('CAT004-0.ax',existence_and_equality_implies_equivalence1) ).

cnf(domain_has_elements,axiom,
    ( there_exists(X)
    | ~ there_exists(domain(X)) ),
    file('CAT004-0.ax',domain_has_elements) ).

cnf(codomain_has_elements,axiom,
    ( there_exists(X)
    | ~ there_exists(codomain(X)) ),
    file('CAT004-0.ax',codomain_has_elements) ).

cnf(composition_implies_domain,axiom,
    ( there_exists(domain(X))
    | ~ there_exists(compose(X,Y)) ),
    file('CAT004-0.ax',composition_implies_domain) ).

cnf(domain_codomain_composition1,axiom,
    ( domain(X) = codomain(Y)
    | ~ there_exists(compose(X,Y)) ),
    file('CAT004-0.ax',domain_codomain_composition1) ).

cnf(domain_codomain_composition2,axiom,
    ( there_exists(compose(X,Y))
    | domain(X) != codomain(Y)
    | ~ there_exists(domain(X)) ),
    file('CAT004-0.ax',domain_codomain_composition2) ).

cnf(associativity_of_compose,axiom,
    compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    file('CAT004-0.ax',associativity_of_compose) ).

cnf(compose_domain,axiom,
    compose(X,domain(X)) = X,
    file('CAT004-0.ax',compose_domain) ).

cnf(compose_codomain,axiom,
    compose(codomain(X),X) = X,
    file('CAT004-0.ax',compose_codomain) ).

cnf(da_exists,hypothesis,
    there_exists(compose(d,a)),
    file('theBenchmark.p',da_exists) ).

cnf(xd_equals_x,hypothesis,
    ( compose(X,d) = X
    | ~ there_exists(compose(X,d)) ),
    file('theBenchmark.p',xd_equals_x) ).

cnf(dx_equals_x,hypothesis,
    ( compose(d,X) = X
    | ~ there_exists(compose(d,X)) ),
    file('theBenchmark.p',dx_equals_x) ).

cnf(prove_codomain_of_a_is_d,negated_conjecture,
    codomain(a) != d,
    file('theBenchmark.p',prove_codomain_of_a_is_d) ).

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,
    ( domain(Eq_x_0) = domain(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

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

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

cnf(equality_8,axiom,
    ( there_exists(Eq_y_0)
    | ~ there_exists(Eq_x_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CAT006-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.00/0.07  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46  % Computer : n015.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Sun Sep 20 14:05:50 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 120.51/120.85  % SZS status Unsatisfiable for theBenchmark
% 120.51/120.85  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------