↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : CAT011-3 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:11:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(domain_codomain_composition1,axiom,
    ( domain(X1) = codomain(X2)
    | ~ there_exists(compose(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).

cnf(compose_codomain,axiom,
    compose(codomain(X1),X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_codomain) ).

cnf(compose_domain,axiom,
    compose(X1,domain(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',compose_domain) ).

cnf(domain_has_elements,axiom,
    ( there_exists(X1)
    | ~ there_exists(domain(X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).

cnf(prove_domain_is_idempotent,negated_conjecture,
    domain(domain(a)) != domain(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).

cnf(assume_domain_exists,hypothesis,
    there_exists(domain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_domain_exists) ).

cnf(c_0_6,axiom,
    ( domain(X1) = codomain(X2)
    | ~ there_exists(compose(X1,X2)) ),
    domain_codomain_composition1 ).

cnf(c_0_7,axiom,
    compose(codomain(X1),X1) = X1,
    compose_codomain ).

cnf(c_0_8,axiom,
    compose(X1,domain(X1)) = X1,
    compose_domain ).

cnf(c_0_9,plain,
    ( domain(codomain(X1)) = codomain(X1)
    | ~ there_exists(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,plain,
    ( codomain(domain(X1)) = domain(X1)
    | ~ there_exists(X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_11,axiom,
    ( there_exists(X1)
    | ~ there_exists(domain(X1)) ),
    domain_has_elements ).

cnf(c_0_12,negated_conjecture,
    domain(domain(a)) != domain(a),
    prove_domain_is_idempotent ).

cnf(c_0_13,plain,
    ( domain(domain(X1)) = domain(X1)
    | ~ there_exists(domain(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,hypothesis,
    there_exists(domain(a)),
    assume_domain_exists ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : CAT011-3 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32  % Computer : n021.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit   : 300
% 0.13/0.32  % WCLimit    : 300
% 0.13/0.32  % DateTime   : Tue May  5 10:50:40 EDT 2026
% 0.13/0.32  % CPUTime    : 
% 0.13/0.33  % start to proof: theBenchmark
% 1.23/1.71  % Version  : CSE_E---1.7
% 1.23/1.71  % Problem  : theBenchmark.p
% 1.23/1.71  % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.71  % SZS output start CNFRefutation
% See solution above
% 1.23/1.71  % Total time : 1.370s
%------------------------------------------------------------------------------