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

View Problem - Process Solution

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

% Computer : n024.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:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(codomain_has_elements,axiom,
    ( ~ there_exists(codomain(X))
    | there_exists(X) ),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/CAT003-0.ax',domain_codomain_composition1) ).

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

cnf(ad_exists,hypothesis,
    there_exists(compose(a,d)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ad_exists) ).

cnf(xd_equals_x,hypothesis,
    ( ~ there_exists(compose(X,d))
    | compose(X,d) = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xd_equals_x) ).

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(27,plain,
    there_exists(domain(a)),
    inference('HYPERRESOLVE',[status(thm)],[composition_implies_domain,ad_exists]) ).

cnf(33,plain,
    domain(a) = codomain(d),
    inference('HYPERRESOLVE',[status(thm)],[domain_codomain_composition1,ad_exists]) ).

cnf(34,plain,
    codomain(d) != d,
    inference('REWRITE',[status(thm)],[prove_domain_of_a_is_d,33,theory(equality)]) ).

cnf(39,plain,
    there_exists(codomain(d)),
    inference('REWRITE',[status(thm)],[27,33,theory(equality)]) ).

cnf(45,plain,
    ~ there_exists(d),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[xd_equals_x,compose_codomain,theory(equality)]),34]) ).

cnf(74,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[codomain_has_elements,45]),39]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : CAT005-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.32  % Computer : n024.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun May 29 20:43:51 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.18/0.43  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  * 
% 0.18/0.44  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45   (USE-FACTORING :POS)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45  * 
% 0.18/0.45  "."
% 0.18/0.45  * 
% 0.18/0.45  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T20:43:51
% 0.18/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-05-29T20:43:51
% 0.18/0.46  
% 0.18/0.49  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.18/0.49  
% 0.18/0.49  #||
% 0.18/0.49  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.49  % SZS output start Refutation
% See solution above
% 0.18/0.49  ||#
% 0.18/0.49  
% 0.18/0.49  ; Summary of computation:
% 0.18/0.49  ;       115 formulas have been input or derived (from 24 formulas).
% 0.18/0.49  ;        74 (64%) were retained.  Of these,
% 0.18/0.49  ;           10 (14%) were simplified or subsumed later,
% 0.18/0.49  ;           64 (86%) are still being kept.
% 0.18/0.49  ; 
% 0.18/0.49  ; Run time in seconds excluding printing time:
% 0.18/0.49  ;     0.004   9%   Read assertion file          (1 call)
% 0.18/0.49  ;     0.001   2%   Assert                       (21 calls)
% 0.18/0.49  ;     0.005  11%   Process new row              (105 calls)
% 0.18/0.49  ;     0.001   2%   Resolution                   (46 calls)
% 0.18/0.49  ;     0.001   2%   Paramodulation               (23 calls)
% 0.18/0.49  ;     0.000   0%   Factoring                    (2 calls)
% 0.18/0.49  ;     0.001   2%   Condensing                   (42 calls)
% 0.18/0.49  ;     0.000   0%   Forward subsumption          (42 calls)
% 0.18/0.49  ;     0.000   0%   Backward subsumption         (38 calls)
% 0.18/0.49  ;     0.000   0%   Clause clause subsumption    (56 calls)
% 0.18/0.49  ;     0.005  11%   Forward simplification       (105 calls)
% 0.18/0.49  ;     0.001   2%   Backward simplification      (74 calls)
% 0.18/0.49  ;     0.004   9%   Ordering                     (198 calls)
% 0.18/0.49  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.18/0.49  ;     0.000   0%   Purity testing               (1 call)
% 0.18/0.49  ;     0.021  48%   Other
% 0.18/0.49  ;     0.044        Total
% 0.18/0.49  ;     0.046        Real time
% 0.18/0.49  ; 
% 0.18/0.49  ; Term-hash-array has 131 terms in all.
% 0.18/0.49  ; Feature-vector-row-index has 38 entries (38 at peak, 38 added, 0 deleted).
% 0.18/0.49  ; Feature-vector-row-index has 98 nodes (98 at peak, 98 added, 0 deleted).
% 0.18/0.49  ;  Retrieved 43 possibly forward subsuming rows in 42 calls.
% 0.18/0.49  ;  Retrieved 13 possibly backward subsumed rows in 38 calls.
% 0.18/0.49  ; Path-index has 121 entries (122 at peak, 133 added, 12 deleted).
% 0.18/0.49  ; Path-index has 293 nodes (295 at peak, 314 added, 21 deleted).
% 0.18/0.49  ; Trie-index has 121 entries (122 at peak, 133 added, 12 deleted).
% 0.18/0.49  ; Trie-index has 326 nodes (330 at peak, 359 added, 33 deleted).
% 0.18/0.49  ; Retrieved 81 generalization terms in 250 calls.
% 0.18/0.49  ; Retrieved 50 instance terms in 47 calls.
% 0.18/0.49  ; Retrieved 569 unifiable terms in 149 calls.
% 0.18/0.49  ; 
% 0.18/0.49  ; The agenda of rows to process has 1 entry:
% 0.18/0.49  ;     1 with value 7
% 0.18/0.49  ; The agenda of rows to give has 42 entries:
% 0.18/0.49  ;     1 with value (4 5)           2 with value (4 11)           4 with value (4 19)
% 0.18/0.49  ;     4 with value (4 6)           2 with value (4 13)           7 with value (4 20)
% 0.18/0.49  ;     2 with value (4 8)           3 with value (4 14)           2 with value (4 22)
% 0.18/0.49  ;     4 with value (4 9)           6 with value (4 15)           2 with value (4 34)
% 0.18/0.49  ;     1 with value (4 10)          2 with value (4 18)
% 0.18/0.49  Evaluation took:
% 0.18/0.49    0.047 seconds of real time
% 0.18/0.49    0.035881 seconds of user run time
% 0.18/0.49    0.010657 seconds of system run time
% 0.18/0.49    0 calls to %EVAL
% 0.18/0.49    0 page faults and
% 0.18/0.49    2,661,608 bytes consed.
% 0.18/0.49  :PROOF-FOUND
% 0.18/0.49  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T20:43:51
% 0.18/0.49  :PROOF-FOUND
% 0.18/0.49  * 
%------------------------------------------------------------------------------