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

View Problem - Process Solution

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

% Computer : n028.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.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   12 (   6 unt;   2 nHn;  10 RR)
%            Number of literals    :   22 (  11 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_and_equality_implies_equivalence1,axiom,
    ( ~ there_exists(X)
    | X != Y
    | equivalent(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',existence_and_equality_implies_equivalence1) ).

cnf(equivalence_implies_existence3,axiom,
    ( ~ equivalent(X,Y)
    | there_exists(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',equivalence_implies_existence3) ).

cnf(indiscernibles1,axiom,
    ( there_exists(f1(X,Y))
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles1) ).

cnf(indiscernibles2,axiom,
    ( X = f1(X,Y)
    | Y = f1(X,Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/CAT003-0.ax',indiscernibles2) ).

cnf(equality_of_a_and_b1,hypothesis,
    ( ~ there_exists(X)
    | a != X
    | b = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b1) ).

cnf(equality_of_a_and_b2,hypothesis,
    ( ~ there_exists(X)
    | a = X
    | b != X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality_of_a_and_b2) ).

cnf(prove_a_equals_b,negated_conjecture,
    a != b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_b) ).

cnf(22,plain,
    there_exists(f1(a,b)),
    inference('UR-RESOLVE',[status(thm)],[indiscernibles1,prove_a_equals_b]) ).

cnf(29,plain,
    ~ there_exists(a),
    inference('UR-RESOLVE',[status(thm)],[equality_of_a_and_b1,prove_a_equals_b,theory(equality)]) ).

cnf(59,plain,
    ~ equivalent(X,a),
    inference('UR-RESOLVE',[status(thm)],[equivalence_implies_existence3,29]) ).

cnf(66,plain,
    f1(a,b) != a,
    inference('UR-RESOLVE',[status(thm)],[existence_and_equality_implies_equivalence1,22,59]) ).

cnf(69,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[equality_of_a_and_b2,22,indiscernibles2]),prove_a_equals_b,66]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun May 29 19:53:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.45  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T19:53:04
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-05-29T19:53:04
% 0.19/0.47  
% 0.19/0.50  ; Recognized associativity assertion (= (|compose| ?X (|compose| ?Y ?Z)) (|compose| (|compose| ?X ?Y) ?Z)).
% 0.19/0.50  
% 0.19/0.50  #||
% 0.19/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50  % SZS output start Refutation
% See solution above
% 0.19/0.50  ||#
% 0.19/0.50  
% 0.19/0.50  ; Summary of computation:
% 0.19/0.50  ;       112 formulas have been input or derived (from 27 formulas).
% 0.19/0.50  ;        69 (62%) were retained.  Of these,
% 0.19/0.50  ;            2 ( 3%) were simplified or subsumed later,
% 0.19/0.50  ;           67 (97%) are still being kept.
% 0.19/0.50  ; 
% 0.19/0.50  ; Run time in seconds excluding printing time:
% 0.19/0.50  ;     0.004  10%   Read assertion file          (1 call)
% 0.19/0.50  ;     0.001   2%   Assert                       (20 calls)
% 0.19/0.50  ;     0.008  19%   Process new row              (95 calls)
% 0.19/0.50  ;     0.001   2%   Resolution                   (52 calls)
% 0.19/0.50  ;     0.002   5%   Paramodulation               (26 calls)
% 0.19/0.50  ;     0.000   0%   Factoring                    (2 calls)
% 0.19/0.50  ;     0.000   0%   Condensing                   (42 calls)
% 0.19/0.50  ;     0.001   2%   Forward subsumption          (42 calls)
% 0.19/0.50  ;     0.000   0%   Backward subsumption         (38 calls)
% 0.19/0.50  ;     0.000   0%   Clause clause subsumption    (52 calls)
% 0.19/0.50  ;     0.002   5%   Forward simplification       (95 calls)
% 0.19/0.50  ;     0.000   0%   Backward simplification      (69 calls)
% 0.19/0.50  ;     0.002   5%   Ordering                     (210 calls)
% 0.19/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.50  ;     0.021  50%   Other
% 0.19/0.50  ;     0.042        Total
% 0.19/0.50  ;     0.045        Real time
% 0.19/0.50  ; 
% 0.19/0.50  ; Term-hash-array has 117 terms in all.
% 0.19/0.50  ; Feature-vector-row-index has 38 entries (38 at peak, 38 added, 0 deleted).
% 0.19/0.50  ; Feature-vector-row-index has 94 nodes (94 at peak, 94 added, 0 deleted).
% 0.19/0.50  ;  Retrieved 43 possibly forward subsuming rows in 42 calls.
% 0.19/0.50  ;  Retrieved 9 possibly backward subsumed rows in 38 calls.
% 0.19/0.50  ; Path-index has 117 entries (117 at peak, 119 added, 2 deleted).
% 0.19/0.50  ; Path-index has 260 nodes (260 at peak, 262 added, 2 deleted).
% 0.19/0.50  ; Trie-index has 117 entries (117 at peak, 119 added, 2 deleted).
% 0.19/0.50  ; Trie-index has 301 nodes (301 at peak, 304 added, 3 deleted).
% 0.19/0.50  ; Retrieved 68 generalization terms in 199 calls.
% 0.19/0.50  ; Retrieved 45 instance terms in 42 calls.
% 0.19/0.50  ; Retrieved 877 unifiable terms in 171 calls.
% 0.19/0.50  ; 
% 0.19/0.50  ; The agenda of rows to process has 9 entries:
% 0.19/0.50  ;     2 with value 16              1 with value 20               2 with value 31
% 0.19/0.50  ;     4 with value 18
% 0.19/0.50  ; The agenda of rows to give has 40 entries:
% 0.19/0.50  ;     5 with value (4 7)           2 with value (4 13)           6 with value (4 19)
% 0.19/0.50  ;     2 with value (4 9)           3 with value (4 14)           7 with value (4 20)
% 0.19/0.50  ;     2 with value (4 10)          6 with value (4 15)           2 with value (4 34)
% 0.19/0.50  ;     3 with value (4 11)          2 with value (4 18)
% 0.19/0.50  Evaluation took:
% 0.19/0.50    0.045 seconds of real time
% 0.19/0.50    0.039016 seconds of user run time
% 0.19/0.50    0.005907 seconds of system run time
% 0.19/0.50    0 calls to %EVAL
% 0.19/0.50    0 page faults and
% 0.19/0.50    2,550,832 bytes consed.
% 0.19/0.50  :PROOF-FOUND
% 0.19/0.50  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T19:53:04
% 0.19/0.50  :PROOF-FOUND
% 0.19/0.50  * 
%------------------------------------------------------------------------------