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

View Problem - Process Solution

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

% Computer : n019.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:10 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    6 (   5 unt;   0 nHn;   5 RR)
%            Number of literals    :    7 (   1 equ;   3 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    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :    4 (   2 sgn)

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

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

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

cnf(prove_domain_of_a_exists,negated_conjecture,
    ~ there_exists(domain(a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_domain_of_a_exists) ).

cnf(18,plain,
    ~ there_exists(compose(a,X)),
    inference('UR-RESOLVE',[status(thm)],[composition_implies_domain,prove_domain_of_a_exists]) ).

cnf(36,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,compose_domain,theory(equality)]),assume_a_exists]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CAT016-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun May 29 23:26:10 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T23:26:11
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-05-29T23:26:11
% 0.20/0.48  
% 0.20/0.50  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.20/0.50  
% 0.20/0.50  #||
% 0.20/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.50  ||#
% 0.20/0.50  
% 0.20/0.50  ; Summary of computation:
% 0.20/0.50  ;        59 formulas have been input or derived (from 17 formulas).
% 0.20/0.50  ;        36 (61%) were retained.  Of these,
% 0.20/0.50  ;           36 (100%) are still being kept.
% 0.20/0.50  ; 
% 0.20/0.50  ; Run time in seconds:
% 0.20/0.50  ;     0.003   9%   Read assertion file          (1 call)
% 0.20/0.50  ;     0.001   3%   Assert                       (13 calls)
% 0.20/0.50  ;     0.003   9%   Process new row              (50 calls)
% 0.20/0.50  ;     0.000   0%   Resolution                   (32 calls)
% 0.20/0.50  ;     0.000   0%   Paramodulation               (16 calls)
% 0.20/0.50  ;     0.000   0%   Condensing                   (16 calls)
% 0.20/0.50  ;     0.000   0%   Forward subsumption          (16 calls)
% 0.20/0.50  ;     0.000   0%   Backward subsumption         (16 calls)
% 0.20/0.50  ;     0.000   0%   Clause clause subsumption    (13 calls)
% 0.20/0.50  ;     0.001   3%   Forward simplification       (50 calls)
% 0.20/0.50  ;     0.000   0%   Backward simplification      (36 calls)
% 0.20/0.50  ;     0.003   9%   Ordering                     (104 calls)
% 0.20/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.50  ;     0.022  67%   Other
% 0.20/0.50  ;     0.033        Total
% 0.20/0.50  ;     0.034        Real time
% 0.20/0.50  ; 
% 0.20/0.50  ; Term-hash-array has 67 terms in all.
% 0.20/0.50  ; Feature-vector-row-index has 16 entries (16 at peak, 16 added, 0 deleted).
% 0.20/0.50  ; Feature-vector-row-index has 43 nodes (43 at peak, 43 added, 0 deleted).
% 0.20/0.50  ;  Retrieved 11 possibly forward subsuming rows in 16 calls.
% 0.20/0.50  ;  Retrieved 2 possibly backward subsumed rows in 16 calls.
% 0.20/0.50  ; Path-index has 68 entries (68 at peak, 68 added, 0 deleted).
% 0.20/0.50  ; Path-index has 179 nodes (179 at peak, 179 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 68 entries (68 at peak, 68 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 213 nodes (213 at peak, 213 added, 0 deleted).
% 0.20/0.50  ; Retrieved 61 generalization terms in 116 calls.
% 0.20/0.50  ; Retrieved 32 instance terms in 31 calls.
% 0.20/0.50  ; Retrieved 190 unifiable terms in 96 calls.
% 0.20/0.50  ; 
% 0.20/0.50  ; The agenda of rows to process has 4 entries:
% 0.20/0.50  ;     1 with value 9               2 with value 10               1 with value 11
% 0.20/0.50  ; The agenda of rows to give has 19 entries:
% 0.20/0.50  ;     2 with value (4 8)           2 with value (4 13)           1 with value (4 18)
% 0.20/0.50  ;     1 with value (4 9)           2 with value (4 14)           7 with value (4 20)
% 0.20/0.50  ;     1 with value (4 11)          3 with value (4 15)
% 0.20/0.50  Evaluation took:
% 0.20/0.50    0.035 seconds of real time
% 0.20/0.50    0.029202 seconds of user run time
% 0.20/0.50    0.005383 seconds of system run time
% 0.20/0.50    0 calls to %EVAL
% 0.20/0.50    0 page faults and
% 0.20/0.50    1,805,864 bytes consed.
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T23:26:11
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  * 
%------------------------------------------------------------------------------