TSTP Solution File: CAT005-1 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : CAT005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n006.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 : Wed Aug 30 18:14:04 EDT 2023

% Result   : Unsatisfiable 0.19s 0.58s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   33 (  14 unt;   8 typ;   0 def)
%            Number of atoms       :   44 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  21   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (   6   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   33 (   4 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    defined: ( $i * $i ) > $o ).

tff(decl_23,type,
    compose: ( $i * $i ) > $i ).

tff(decl_24,type,
    product: ( $i * $i * $i ) > $o ).

tff(decl_25,type,
    identity_map: $i > $o ).

tff(decl_26,type,
    domain: $i > $i ).

tff(decl_27,type,
    codomain: $i > $i ).

tff(decl_28,type,
    a: $i ).

tff(decl_29,type,
    d: $i ).

cnf(associative_property2,axiom,
    ( defined(X2,X4)
    | ~ product(X1,X2,X3)
    | ~ defined(X3,X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',associative_property2) ).

cnf(product_on_domain,axiom,
    product(X1,domain(X1),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',product_on_domain) ).

cnf(identity1,axiom,
    ( product(X1,X2,X2)
    | ~ defined(X1,X2)
    | ~ identity_map(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',identity1) ).

cnf(domain_is_an_identity_map,axiom,
    identity_map(domain(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',domain_is_an_identity_map) ).

cnf(ad_defined,hypothesis,
    defined(a,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ad_defined) ).

cnf(composition_is_well_defined,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',composition_is_well_defined) ).

cnf(identity2,axiom,
    ( product(X1,X2,X1)
    | ~ defined(X1,X2)
    | ~ identity_map(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT001-0.ax',identity2) ).

cnf(d_is_identity_map,hypothesis,
    identity_map(d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_identity_map) ).

cnf(prove_domain_of_a_is_d,negated_conjecture,
    domain(a) != d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_a_is_d) ).

cnf(c_0_9,axiom,
    ( defined(X2,X4)
    | ~ product(X1,X2,X3)
    | ~ defined(X3,X4) ),
    associative_property2 ).

cnf(c_0_10,axiom,
    product(X1,domain(X1),X1),
    product_on_domain ).

cnf(c_0_11,axiom,
    ( product(X1,X2,X2)
    | ~ defined(X1,X2)
    | ~ identity_map(X1) ),
    identity1 ).

cnf(c_0_12,axiom,
    identity_map(domain(X1)),
    domain_is_an_identity_map ).

cnf(c_0_13,plain,
    ( defined(domain(X1),X2)
    | ~ defined(X1,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    defined(a,d),
    ad_defined ).

cnf(c_0_15,plain,
    ( product(domain(X1),X2,X2)
    | ~ defined(domain(X1),X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    defined(domain(a),d),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    composition_is_well_defined ).

cnf(c_0_18,hypothesis,
    product(domain(a),d,d),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,axiom,
    ( product(X1,X2,X1)
    | ~ defined(X1,X2)
    | ~ identity_map(X2) ),
    identity2 ).

cnf(c_0_20,hypothesis,
    identity_map(d),
    d_is_identity_map ).

cnf(c_0_21,hypothesis,
    ( X1 = d
    | ~ product(domain(a),d,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,hypothesis,
    product(domain(a),d,domain(a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_20])]) ).

cnf(c_0_23,negated_conjecture,
    domain(a) != d,
    prove_domain_of_a_is_d ).

cnf(c_0_24,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : CAT005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34  % Computer : n006.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit   : 300
% 0.16/0.34  % WCLimit    : 300
% 0.16/0.34  % DateTime   : Sun Aug 27 00:05:07 EDT 2023
% 0.16/0.34  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.19/0.58  % Version  : CSE_E---1.5
% 0.19/0.58  % Problem  : theBenchmark.p
% 0.19/0.58  % Proof found
% 0.19/0.58  % SZS status Theorem for theBenchmark.p
% 0.19/0.58  % SZS output start Proof
% See solution above
% 0.19/0.58  % Total time : 0.008000 s
% 0.19/0.58  % SZS output end Proof
% 0.19/0.58  % Total time : 0.011000 s
%------------------------------------------------------------------------------