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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CAT017-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:10 EDT 2022

% Result   : Unsatisfiable 0.20s 0.53s
% 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    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :    4 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
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_a_exists,hypothesis,
    there_exists(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_a_exists) ).

cnf(prove_codomain_of_a_exists,negated_conjecture,
    ~ there_exists(codomain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_codomain_of_a_exists) ).

cnf(27,plain,
    ~ there_exists(compose(a,X)),
    inference('UR-RESOLVE',[status(thm)],[composition_implies_codomain,prove_codomain_of_a_exists]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : CAT017-3 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % 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 20:33:56 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-29T20:33:56
% 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-29T20:33:56
% 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/sandbox2/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  ;        99 formulas have been input or derived (from 23 formulas).
% 0.20/0.53  ;        56 (57%) were retained.  Of these,
% 0.20/0.53  ;           56 (100%) 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                       (19 calls)
% 0.20/0.53  ;     0.003   7%   Process new row              (84 calls)
% 0.20/0.53  ;     0.000   0%   Resolution                   (44 calls)
% 0.20/0.53  ;     0.002   5%   Paramodulation               (22 calls)
% 0.20/0.53  ;     0.000   0%   Factoring                    (2 calls)
% 0.20/0.53  ;     0.000   0%   Condensing                   (38 calls)
% 0.20/0.53  ;     0.004  10%   Forward subsumption          (38 calls)
% 0.20/0.53  ;     0.001   2%   Backward subsumption         (34 calls)
% 0.20/0.53  ;     0.000   0%   Clause clause subsumption    (52 calls)
% 0.20/0.53  ;     0.002   5%   Forward simplification       (84 calls)
% 0.20/0.53  ;     0.000   0%   Backward simplification      (56 calls)
% 0.20/0.53  ;     0.000   0%   Ordering                     (190 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.025  61%   Other
% 0.20/0.53  ;     0.041        Total
% 0.20/0.53  ;     0.042        Real time
% 0.20/0.53  ; 
% 0.20/0.53  ; Term-hash-array has 99 terms in all.
% 0.20/0.53  ; Feature-vector-row-index has 34 entries (34 at peak, 34 added, 0 deleted).
% 0.20/0.53  ; Feature-vector-row-index has 82 nodes (82 at peak, 82 added, 0 deleted).
% 0.20/0.53  ;  Retrieved 41 possibly forward subsuming rows in 38 calls.
% 0.20/0.53  ;  Retrieved 11 possibly backward subsumed rows in 34 calls.
% 0.20/0.53  ; Path-index has 100 entries (100 at peak, 100 added, 0 deleted).
% 0.20/0.53  ; Path-index has 250 nodes (250 at peak, 250 added, 0 deleted).
% 0.20/0.53  ; Trie-index has 100 entries (100 at peak, 100 added, 0 deleted).
% 0.20/0.53  ; Trie-index has 275 nodes (275 at peak, 275 added, 0 deleted).
% 0.20/0.53  ; Retrieved 71 generalization terms in 187 calls.
% 0.20/0.53  ; Retrieved 34 instance terms in 33 calls.
% 0.20/0.53  ; Retrieved 513 unifiable terms in 138 calls.
% 0.20/0.53  ; 
% 0.20/0.53  ; The agenda of rows to process has 5 entries:
% 0.20/0.53  ;     2 with value 9               2 with value 10               1 with value 11
% 0.20/0.53  ; The agenda of rows to give has 33 entries:
% 0.20/0.53  ;     3 with value (4 8)           3 with value (4 14)           4 with value (4 19)
% 0.20/0.53  ;     2 with value (4 9)           6 with value (4 15)           7 with value (4 20)
% 0.20/0.53  ;     2 with value (4 11)          2 with value (4 18)           2 with value (4 34)
% 0.20/0.53  ;     2 with value (4 13)
% 0.20/0.53  Evaluation took:
% 0.20/0.53    0.043 seconds of real time
% 0.20/0.53    0.03767 seconds of user run time
% 0.20/0.53    0.0056 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,099,792 bytes consed.
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.53  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-29T20:33:56
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.53  * 
%------------------------------------------------------------------------------