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

View Problem - Process Solution

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

% Computer : n018.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:11 EDT 2022

% Result   : Unsatisfiable 0.88s 1.06s
% Output   : Refutation 0.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   22 (  15 unt;   0 nHn;  19 RR)
%            Number of literals    :   30 (  10 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   2 sgn)

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

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

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

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

cnf(associativity_of_compose,axiom,
    compose(X,compose(Y,Z)) = compose(compose(X,Y),Z),
    file('/export/starexec/sandbox2/benchmark/Axioms/CAT003-0.ax',associativity_of_compose) ).

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

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

cnf(assume_ab_exists,hypothesis,
    there_exists(compose(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_ab_exists) ).

cnf(assume_bc_exists,hypothesis,
    there_exists(compose(b,c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_bc_exists) ).

cnf(prove_a_bc_exists,negated_conjecture,
    ~ there_exists(compose(a,compose(b,c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_bc_exists) ).

cnf(20,plain,
    ~ there_exists(compose(compose(a,b),c)),
    inference('REWRITE',[status(thm)],[prove_a_bc_exists,associativity_of_compose,theory(equality)]) ).

cnf(30,plain,
    ( ~ there_exists(X)
    | there_exists(domain(X)) ),
    inference('PARAMODULATE',[status(thm)],[composition_implies_domain,compose_domain,theory(equality)]) ).

cnf(32,plain,
    there_exists(codomain(b)),
    inference('HYPERRESOLVE',[status(thm)],[composition_implies_codomain,assume_bc_exists]) ).

cnf(36,plain,
    domain(b) = codomain(c),
    inference('HYPERRESOLVE',[status(thm)],[domain_codomain_composition1,assume_bc_exists]) ).

cnf(41,plain,
    compose(X,Y) = compose(compose(X,Y),domain(Y)),
    inference('PARAMODULATE',[status(thm)],[associativity_of_compose,compose_domain,theory(equality)]) ).

cnf(66,plain,
    there_exists(b),
    inference('HYPERRESOLVE',[status(thm)],[codomain_has_elements,32]) ).

cnf(89,plain,
    compose(b,codomain(c)) = b,
    inference('PARAMODULATE',[status(thm)],[compose_domain,36,theory(equality)]) ).

cnf(98,plain,
    there_exists(domain(compose(a,b))),
    inference('HYPERRESOLVE',[status(thm)],[30,assume_ab_exists]) ).

cnf(148,plain,
    domain(compose(a,b)) != codomain(c),
    inference('UR-RESOLVE',[status(thm)],[domain_codomain_composition2,98,20]) ).

cnf(205,plain,
    codomain(c) = codomain(codomain(c)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,89,theory(equality)]),36,66,theory(equality)]) ).

cnf(362,plain,
    ( ~ there_exists(compose(X,Y))
    | domain(compose(X,Y)) = codomain(domain(Y)) ),
    inference('PARAMODULATE',[status(thm)],[domain_codomain_composition1,41,theory(equality)]) ).

cnf(1584,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[362,assume_ab_exists]),148,205,36,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : CAT018-3 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n018.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun May 29 21:16:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T21:16:41
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-05-29T21:16:41
% 0.20/0.51  
% 0.88/1.06  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.88/1.06  
% 0.88/1.06  #||
% 0.88/1.06  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.88/1.06  % SZS output start Refutation
% See solution above
% 0.88/1.06  ||#
% 0.88/1.06  
% 0.88/1.06  ; Summary of computation:
% 0.88/1.06  ;      6515 formulas have been input or derived (from 282 formulas).
% 0.88/1.06  ;      1584 (24%) were retained.  Of these,
% 0.88/1.06  ;          550 (35%) were simplified or subsumed later,
% 0.88/1.06  ;         1034 (65%) are still being kept.
% 0.88/1.06  ; 
% 0.88/1.06  ; Run time in seconds excluding printing time:
% 0.88/1.06  ;     0.004   1%   Read assertion file          (1 call)
% 0.88/1.06  ;     0.001   0%   Assert                       (20 calls)
% 0.88/1.06  ;     0.134  24%   Process new row              (6,024 calls)
% 0.88/1.06  ;     0.103  18%   Resolution                   (562 calls)
% 0.88/1.06  ;     0.016   3%   Paramodulation               (281 calls)
% 0.88/1.06  ;     0.000   0%   Factoring                    (15 calls)
% 0.88/1.06  ;     0.010   2%   Condensing                   (949 calls)
% 0.88/1.06  ;     0.033   6%   Forward subsumption          (949 calls)
% 0.88/1.06  ;     0.009   2%   Backward subsumption         (490 calls)
% 0.88/1.06  ;     0.006   1%   Clause clause subsumption    (2,670 calls)
% 0.88/1.06  ;     0.128  23%   Forward simplification       (5,998 calls)
% 0.88/1.06  ;     0.033   6%   Backward simplification      (1,583 calls)
% 0.88/1.06  ;     0.036   6%   Ordering                     (9,390 calls)
% 0.88/1.06  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.88/1.06  ;     0.000   0%   Purity testing               (1 call)
% 0.88/1.06  ;     0.054  10%   Other
% 0.88/1.06  ;     0.567        Total
% 0.88/1.06  ;     0.568        Real time
% 0.88/1.06  ; 
% 0.88/1.06  ; Term-hash-array has 2,709 terms in all.
% 0.88/1.06  ; Feature-vector-row-index has 418 entries (425 at peak, 490 added, 72 deleted).
% 0.88/1.06  ; Feature-vector-row-index has 2,103 nodes (2,172 at peak, 2,409 added, 306 deleted).
% 0.88/1.06  ;  Retrieved 3,223 possibly forward subsuming rows in 949 calls.
% 0.88/1.06  ;  Retrieved 281 possibly backward subsumed rows in 490 calls.
% 0.88/1.06  ; Path-index has 1,742 entries (1,795 at peak, 2,712 added, 970 deleted).
% 0.88/1.06  ; Path-index has 6,440 nodes (6,467 at peak, 8,688 added, 2,248 deleted).
% 0.88/1.06  ; Trie-index has 1,742 entries (1,795 at peak, 2,712 added, 970 deleted).
% 0.88/1.06  ; Trie-index has 8,171 nodes (8,411 at peak, 12,967 added, 4,796 deleted).
% 0.88/1.06  ; Retrieved 14,805 generalization terms in 35,077 calls.
% 0.88/1.06  ; Retrieved 1,105 instance terms in 1,104 calls.
% 0.88/1.06  ; Retrieved 81,974 unifiable terms in 6,837 calls.
% 0.88/1.06  ; 
% 0.88/1.06  ; The agenda of rows to process has 26 entries:
% 0.88/1.06  ;     2 with value 14              1 with value 20               1 with value 25
% 0.88/1.06  ;     1 with value 15              6 with value 22               3 with value 26
% 0.88/1.06  ;     1 with value 16              3 with value 23               1 with value 28
% 0.88/1.06  ;     3 with value 17              1 with value 24               2 with value 31
% 0.88/1.06  ;     1 with value 19
% 0.88/1.06  ; The agenda of rows to give has 775 entries:
% 0.88/1.06  ;     1 with value (4 13)         54 with value (4 26)          10 with value (4 33)
% 0.88/1.06  ;    77 with value (4 19)         36 with value (4 27)           8 with value (4 34)
% 0.88/1.06  ;   107 with value (4 20)         14 with value (4 28)           2 with value (4 35)
% 0.88/1.06  ;   102 with value (4 21)         13 with value (4 29)           4 with value (4 36)
% 0.88/1.06  ;    79 with value (4 22)         30 with value (4 30)          12 with value (4 37)
% 0.88/1.06  ;    67 with value (4 23)         18 with value (4 31)           4 with value (4 38)
% 0.88/1.06  ;    58 with value (4 24)          2 with value (4 32)          22 with value (4 39)
% 0.88/1.06  ;    55 with value (4 25)
% 0.88/1.06  Evaluation took:
% 0.88/1.06    0.569 seconds of real time
% 0.88/1.06    0.519043 seconds of user run time
% 0.88/1.06    0.050078 seconds of system run time
% 0.88/1.06    [Run times include 0.026 seconds GC run time.]
% 0.88/1.06    0 calls to %EVAL
% 0.88/1.06    0 page faults and
% 0.88/1.06    39,575,416 bytes consed.
% 0.88/1.06  :PROOF-FOUND
% 0.88/1.06  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T21:16:42
% 0.88/1.06  :PROOF-FOUND
% 0.88/1.06  * 
%------------------------------------------------------------------------------