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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CAT011-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %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  : 600s
% DateTime : Fri Jul 15 00:07:09 EDT 2022

% Result   : Unsatisfiable 0.20s 0.53s
% Output   : Refutation 0.20s
% 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/CAT004-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/CAT004-0.ax',domain_codomain_composition1) ).

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

cnf(compose_codomain,axiom,
    compose(codomain(X),X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/CAT004-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(14,plain,
    there_exists(a),
    inference('HYPERRESOLVE',[status(thm)],[domain_has_elements,assume_domain_exists]) ).

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

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

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

cnf(82,plain,
    domain(a) = codomain(domain(a)),
    inference('HYPERRESOLVE',[status(thm)],[21,14]) ).

cnf(83,plain,
    $false,
    inference('REWRITE',[status(thm)],[61,prove_domain_is_idempotent,82,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : CAT011-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun May 29 17:09:28 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T17:09:28
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-05-29T17:09:28
% 0.20/0.50  
% 0.20/0.53  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.20/0.53  
% 0.20/0.53  #||
% 0.20/0.53  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53  % SZS output start Refutation
% See solution above
% 0.20/0.53  ||#
% 0.20/0.53  
% 0.20/0.53  ; Summary of computation:
% 0.20/0.53  ;       249 formulas have been input or derived (from 34 formulas).
% 0.20/0.53  ;        83 (33%) were retained.  Of these,
% 0.20/0.53  ;           22 (27%) were simplified or subsumed later,
% 0.20/0.53  ;           61 (73%) are still being kept.
% 0.20/0.53  ; 
% 0.20/0.53  ; Run time in seconds excluding printing time:
% 0.20/0.53  ;     0.003   7%   Read assertion file          (1 call)
% 0.20/0.53  ;     0.001   2%   Assert                       (13 calls)
% 0.20/0.53  ;     0.005  11%   Process new row              (185 calls)
% 0.20/0.53  ;     0.004   9%   Resolution                   (66 calls)
% 0.20/0.53  ;     0.001   2%   Paramodulation               (33 calls)
% 0.20/0.53  ;     0.000   0%   Condensing                   (17 calls)
% 0.20/0.53  ;     0.001   2%   Forward subsumption          (17 calls)
% 0.20/0.53  ;     0.000   0%   Backward subsumption         (17 calls)
% 0.20/0.53  ;     0.000   0%   Clause clause subsumption    (13 calls)
% 0.20/0.53  ;     0.003   7%   Forward simplification       (180 calls)
% 0.20/0.53  ;     0.004   9%   Backward simplification      (83 calls)
% 0.20/0.53  ;     0.000   0%   Ordering                     (121 calls)
% 0.20/0.53  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.53  ;     0.023  51%   Other
% 0.20/0.53  ;     0.045        Total
% 0.20/0.53  ;     0.046        Real time
% 0.20/0.53  ; 
% 0.20/0.53  ; Term-hash-array has 144 terms in all.
% 0.20/0.53  ; Feature-vector-row-index has 17 entries (17 at peak, 17 added, 0 deleted).
% 0.20/0.53  ; Feature-vector-row-index has 53 nodes (53 at peak, 53 added, 0 deleted).
% 0.20/0.53  ;  Retrieved 11 possibly forward subsuming rows in 17 calls.
% 0.20/0.53  ;  Retrieved 2 possibly backward subsumed rows in 17 calls.
% 0.20/0.53  ; Path-index has 111 entries (119 at peak, 145 added, 34 deleted).
% 0.20/0.53  ; Path-index has 334 nodes (344 at peak, 373 added, 39 deleted).
% 0.20/0.53  ; Trie-index has 111 entries (119 at peak, 145 added, 34 deleted).
% 0.20/0.53  ; Trie-index has 372 nodes (390 at peak, 455 added, 83 deleted).
% 0.20/0.53  ; Retrieved 200 generalization terms in 397 calls.
% 0.20/0.53  ; Retrieved 78 instance terms in 77 calls.
% 0.20/0.53  ; Retrieved 824 unifiable terms in 333 calls.
% 0.20/0.53  ; 
% 0.20/0.53  ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.20/0.53  ;     2 with value 0
% 0.20/0.53  ; The agenda of rows to process has 9 entries:
% 0.20/0.53  ;     1 with value 14              1 with value 18               1 with value 20
% 0.20/0.53  ;     1 with value 16              1 with value 19               4 with value 22
% 0.20/0.53  ; The agenda of rows to give has 31 entries:
% 0.20/0.53  ;     1 with value (4 11)          1 with value (4 16)           9 with value (4 20)
% 0.20/0.53  ;     1 with value (4 13)          2 with value (4 17)           2 with value (4 22)
% 0.20/0.53  ;     4 with value (4 14)          3 with value (4 18)           1 with value (4 23)
% 0.20/0.53  ;     7 with value (4 15)
% 0.20/0.53  Evaluation took:
% 0.20/0.53    0.047 seconds of real time
% 0.20/0.53    0.036994 seconds of user run time
% 0.20/0.53    0.009997 seconds of system run time
% 0.20/0.53    0 calls to %EVAL
% 0.20/0.53    0 page faults and
% 0.20/0.53    2,665,776 bytes consed.
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.53  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T17:09:28
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.53  * 
%------------------------------------------------------------------------------