↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : CAT016-3 : TPTP v9.3.1. Released v1.0.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 : n016.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:10 AM UTC 2026

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

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

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

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

cnf(equivalence_implies_existence3,axiom,
    ( there_exists(Y)
    | ~ equivalent(X,Y) ),
    file('CAT003-0.ax',equivalence_implies_existence3) ).

cnf(assume_a_exists,hypothesis,
    there_exists(a),
    file('theBenchmark.p',assume_a_exists) ).

cnf(prove_domain_of_a_exists,negated_conjecture,
    ~ there_exists(domain(a)),
    file('theBenchmark.p',prove_domain_of_a_exists) ).

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

cnf(t1,plain,
    ~ there_exists(domain(a)),
    inference(start,[status(thm),parent(0:0)],[prove_domain_of_a_exists]) ).

cnf(t2,plain,
    ( ~ there_exists(compose(a,domain(a)))
    | there_exists(domain(a)) ),
    inference(extension,[status(thm),parent(t1:1)],[composition_implies_domain]) ).

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

cnf(t4,plain,
    ( ~ equivalent(a,compose(a,domain(a)))
    | there_exists(compose(a,domain(a))) ),
    inference(extension,[status(thm),parent(t2:2)],[equivalence_implies_existence3]) ).

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

cnf(t6,plain,
    ( a != compose(a,domain(a))
    | ~ there_exists(a)
    | equivalent(a,compose(a,domain(a))) ),
    inference(extension,[status(thm),parent(t4:2)],[existence_and_equality_implies_equivalence1]) ).

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

cnf(t8,plain,
    there_exists(a),
    inference(extension,[status(thm),parent(t6:2)],[assume_a_exists]) ).

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

cnf(t10,plain,
    ( compose(a,domain(a)) != a
    | a = compose(a,domain(a)) ),
    inference(extension,[status(thm),parent(t6:3)],[equality_2]) ).

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

cnf(t12,plain,
    compose(a,domain(a)) = a,
    inference(extension,[status(thm),parent(t10:2)],[compose_domain]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CAT016-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03  % 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.35  % Computer : n016.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 14:11:06 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.21/0.53  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.53  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------