TSTP Solution File: CAT011-3 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n028.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  : 600s
% DateTime : Fri Jul 15 00:07:08 EDT 2022

% Result   : Unsatisfiable 0.10s 0.37s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   12 (   8 unt;   0 nHn;  10 RR)
%            Number of literals    :   16 (   8 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   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   :    7 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(domain_has_elements,axiom,
    ( ~ there_exists(domain(X))
    | there_exists(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_has_elements) ).

cnf(domain_codomain_composition1,axiom,
    ( ~ there_exists(compose(X,Y))
    | domain(X) = codomain(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).

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

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

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

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

cnf(19,plain,
    there_exists(a),
    inference('HYPERRESOLVE',[status(thm)],[domain_has_elements,assume_domain_exists]) ).

cnf(30,plain,
    ( ~ there_exists(X)
    | domain(codomain(X)) = codomain(X) ),
    inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,compose_codomain,theory(equality)]) ).

cnf(31,plain,
    ( ~ there_exists(X)
    | domain(X) = codomain(domain(X)) ),
    inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,compose_domain,theory(equality)]) ).

cnf(139,plain,
    domain(codomain(domain(a))) = codomain(domain(a)),
    inference('HYPERRESOLVE',[status(thm)],[30,assume_domain_exists]) ).

cnf(152,plain,
    domain(a) = codomain(domain(a)),
    inference('HYPERRESOLVE',[status(thm)],[31,19]) ).

cnf(153,plain,
    $false,
    inference('REWRITE',[status(thm)],[139,prove_domain_is_idempotent,152,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.06  % Problem  : CAT011-3 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.07  % Command  : run-snark %s %d
% 0.06/0.25  % Computer : n028.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Sun May 29 15:37:18 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.10/0.32  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.33  * 
% 0.10/0.33  * 
% 0.10/0.33  #<PACKAGE "SNARK-USER">
% 0.10/0.33  * 
% 0.10/0.33  SNARK-TPTP-OPTIONS
% 0.10/0.33  * 
% 0.10/0.33  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.10/0.33   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.10/0.33   (USE-FACTORING :POS)
% 0.10/0.33   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.10/0.33   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.10/0.33   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.10/0.33   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.10/0.33   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.10/0.33   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.10/0.33   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.10/0.33   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.10/0.33   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.10/0.33   (DECLARE-TPTP-SYMBOLS2))
% 0.10/0.33  * 
% 0.10/0.33  "."
% 0.10/0.33  * 
% 0.10/0.33  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T15:37:18
% 0.10/0.33  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-05-29T15:37:18
% 0.10/0.34  
% 0.10/0.37  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.10/0.37  
% 0.10/0.37  #||
% 0.10/0.37  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % SZS output start Refutation
% See solution above
% 0.10/0.37  ||#
% 0.10/0.37  
% 0.10/0.37  ; Summary of computation:
% 0.10/0.37  ;       423 formulas have been input or derived (from 43 formulas).
% 0.10/0.37  ;       153 (36%) were retained.  Of these,
% 0.10/0.37  ;           38 (25%) were simplified or subsumed later,
% 0.10/0.37  ;          115 (75%) are still being kept.
% 0.10/0.37  ; 
% 0.10/0.37  ; Run time in seconds excluding printing time:
% 0.10/0.37  ;     0.002   5%   Read assertion file          (1 call)
% 0.10/0.37  ;     0.000   0%   Assert                       (19 calls)
% 0.10/0.37  ;     0.006  16%   Process new row              (352 calls)
% 0.10/0.37  ;     0.005  13%   Resolution                   (84 calls)
% 0.10/0.37  ;     0.001   3%   Paramodulation               (42 calls)
% 0.10/0.37  ;     0.000   0%   Factoring                    (2 calls)
% 0.10/0.37  ;     0.002   5%   Condensing                   (78 calls)
% 0.10/0.37  ;     0.001   3%   Forward subsumption          (78 calls)
% 0.10/0.37  ;     0.001   3%   Backward subsumption         (66 calls)
% 0.10/0.37  ;     0.000   0%   Clause clause subsumption    (172 calls)
% 0.10/0.37  ;     0.005  13%   Forward simplification       (348 calls)
% 0.10/0.37  ;     0.002   5%   Backward simplification      (153 calls)
% 0.10/0.37  ;     0.001   3%   Ordering                     (324 calls)
% 0.10/0.37  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.10/0.37  ;     0.000   0%   Purity testing               (1 call)
% 0.10/0.37  ;     0.012  32%   Other
% 0.10/0.37  ;     0.038        Total
% 0.10/0.37  ;     0.039        Real time
% 0.10/0.37  ; 
% 0.10/0.37  ; Term-hash-array has 305 terms in all.
% 0.10/0.37  ; Feature-vector-row-index has 58 entries (64 at peak, 66 added, 8 deleted).
% 0.10/0.37  ; Feature-vector-row-index has 174 nodes (190 at peak, 203 added, 29 deleted).
% 0.10/0.37  ;  Retrieved 175 possibly forward subsuming rows in 78 calls.
% 0.10/0.37  ;  Retrieved 25 possibly backward subsumed rows in 66 calls.
% 0.10/0.37  ; Path-index has 234 entries (289 at peak, 306 added, 72 deleted).
% 0.10/0.37  ; Path-index has 687 nodes (718 at peak, 763 added, 76 deleted).
% 0.10/0.37  ; Trie-index has 234 entries (289 at peak, 306 added, 72 deleted).
% 0.10/0.37  ; Trie-index has 795 nodes (892 at peak, 986 added, 191 deleted).
% 0.10/0.37  ; Retrieved 308 generalization terms in 709 calls.
% 0.10/0.37  ; Retrieved 99 instance terms in 98 calls.
% 0.10/0.37  ; Retrieved 2,484 unifiable terms in 432 calls.
% 0.10/0.37  ; 
% 0.10/0.37  ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.10/0.37  ;     2 with value 0
% 0.10/0.37  ; The agenda of rows to process has 18 entries:
% 0.10/0.37  ;     1 with value 14              1 with value 19               6 with value 22
% 0.10/0.37  ;     1 with value 15              1 with value 20               4 with value 24
% 0.10/0.37  ;     4 with value 18
% 0.10/0.37  ; The agenda of rows to give has 76 entries:
% 0.10/0.37  ;     1 with value (4 11)          5 with value (4 19)           2 with value (4 29)
% 0.10/0.37  ;     2 with value (4 13)         10 with value (4 20)           2 with value (4 34)
% 0.10/0.37  ;     8 with value (4 14)          2 with value (4 22)           2 with value (4 35)
% 0.10/0.37  ;    14 with value (4 15)          2 with value (4 24)           2 with value (4 36)
% 0.10/0.37  ;     2 with value (4 16)          2 with value (4 26)           4 with value (4 43)
% 0.10/0.37  ;     6 with value (4 17)          2 with value (4 28)           4 with value (4 49)
% 0.10/0.37  ;     4 with value (4 18)
% 0.10/0.37  Evaluation took:
% 0.10/0.37    0.04 seconds of real time
% 0.10/0.37    0.033551 seconds of user run time
% 0.10/0.37    0.005861 seconds of system run time
% 0.10/0.37    0 calls to %EVAL
% 0.10/0.37    0 page faults and
% 0.10/0.37    3,918,840 bytes consed.
% 0.10/0.37  :PROOF-FOUND
% 0.10/0.37  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T15:37:18
% 0.10/0.37  :PROOF-FOUND
% 0.10/0.37  * 
%------------------------------------------------------------------------------