TSTP Solution File: ALG079+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : ALG079+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n023.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 : Thu Jul 14 17:59:49 EDT 2022

% Result   : Theorem 0.41s 0.61s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   26
% Syntax   : Number of clauses     :   46 (  37 unt;   9 nHn;  46 RR)
%            Number of literals    :   70 (  69 equ;   6 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(8,axiom,
    e12 != e13,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

cnf(11,axiom,
    e20 != e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(12,axiom,
    e20 != e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(15,axiom,
    e21 != e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(16,axiom,
    e21 != e23,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(17,axiom,
    e21 != e24,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(46,axiom,
    op1(e10,e10) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(48,axiom,
    op1(e10,e12) = e12,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(52,axiom,
    op1(e11,e11) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(53,axiom,
    op1(e11,e12) = e14,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(58,axiom,
    op1(e12,e12) = e13,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(70,axiom,
    op1(e14,e14) = e12,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(77,axiom,
    op2(e21,e21) = e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(83,axiom,
    op2(e22,e22) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(89,axiom,
    op2(e23,e23) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(95,axiom,
    op2(e24,e24) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(96,negated_conjecture,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22
    | h(e10) = e23
    | h(e10) = e24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(97,negated_conjecture,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23
    | h(e11) = e24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(106,negated_conjecture,
    h(op1(e10,e10)) = op2(h(e10),h(e10)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(107,plain,
    h(e10) = op2(h(e10),h(e10)),
    inference('REWRITE',[status(thm)],[106,46,theory(equality)]) ).

cnf(110,negated_conjecture,
    h(op1(e10,e12)) = op2(h(e10),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(111,plain,
    h(e12) = op2(h(e10),h(e12)),
    inference('REWRITE',[status(thm)],[110,48,theory(equality)]) ).

cnf(118,negated_conjecture,
    h(op1(e11,e11)) = op2(h(e11),h(e11)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(119,plain,
    h(e10) = op2(h(e11),h(e11)),
    inference('REWRITE',[status(thm)],[118,52,theory(equality)]) ).

cnf(120,negated_conjecture,
    h(op1(e11,e12)) = op2(h(e11),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(121,plain,
    h(e14) = op2(h(e11),h(e12)),
    inference('REWRITE',[status(thm)],[120,53,theory(equality)]) ).

cnf(130,negated_conjecture,
    h(op1(e12,e12)) = op2(h(e12),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(131,plain,
    h(e13) = op2(h(e12),h(e12)),
    inference('REWRITE',[status(thm)],[130,58,theory(equality)]) ).

cnf(154,negated_conjecture,
    h(op1(e14,e14)) = op2(h(e14),h(e14)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(155,plain,
    h(e12) = op2(h(e14),h(e14)),
    inference('REWRITE',[status(thm)],[154,70,theory(equality)]) ).

cnf(213,negated_conjecture,
    j(h(e12)) = e12,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(214,negated_conjecture,
    j(h(e13)) = e13,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(217,plain,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22
    | h(e10) = e23 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,96,theory(equality)]),17,95,theory(equality)]) ).

cnf(219,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23
    | h(e10) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[119,97,theory(equality)]),95,theory(equality)]) ).

cnf(301,plain,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,217,theory(equality)]),16,89,theory(equality)]) ).

cnf(303,plain,
    ( h(e10) = e20
    | h(e10) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,301,theory(equality)]),15,83,theory(equality)]) ).

cnf(305,plain,
    h(e10) = e20,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,303,theory(equality)]),15,77,theory(equality)]) ).

cnf(307,plain,
    h(e12) = op2(e20,h(e12)),
    inference('REWRITE',[status(thm)],[111,305,theory(equality)]) ).

cnf(311,plain,
    e20 = op2(h(e11),h(e11)),
    inference('REWRITE',[status(thm)],[119,305,theory(equality)]) ).

cnf(339,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23 ),
    inference('REWRITE',[status(thm)],[219,11,305,theory(equality)]) ).

cnf(347,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,339,theory(equality)]),11,89,theory(equality)]) ).

cnf(349,plain,
    ( h(e11) = e20
    | h(e11) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,347,theory(equality)]),11,83,theory(equality)]) ).

cnf(351,plain,
    h(e11) = e20,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,349,theory(equality)]),12,77,theory(equality)]) ).

cnf(352,plain,
    h(e14) = h(e12),
    inference('REWRITE',[status(thm)],[121,307,351,theory(equality)]) ).

cnf(354,plain,
    h(e12) = h(e13),
    inference('REWRITE',[status(thm)],[155,131,352,theory(equality)]) ).

cnf(356,plain,
    $false,
    inference('REWRITE',[status(thm)],[214,8,213,354,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : ALG079+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.14  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jun  8 23:28:23 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 0.21/0.49  #<PACKAGE "SNARK-USER">
% 0.21/0.49  * 
% 0.21/0.49  SNARK-TPTP-OPTIONS
% 0.21/0.49  * 
% 0.21/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49   (USE-FACTORING :POS)
% 0.21/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49  * 
% 0.21/0.49  "."
% 0.21/0.49  * 
% 0.21/0.49  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T23:28:23
% 0.21/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-08T23:28:23
% 0.41/0.61  
% 0.41/0.61  
% 0.41/0.61  #||
% 0.41/0.61  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.61  % SZS output start Refutation
% See solution above
% 0.41/0.62  ||#
% 0.41/0.62  
% 0.41/0.62  ; Summary of computation:
% 0.41/0.62  ;       674 formulas have been input or derived (from 198 formulas).
% 0.41/0.62  ;       356 (53%) were retained.  Of these,
% 0.41/0.62  ;          189 (53%) were simplified or subsumed later,
% 0.41/0.62  ;          167 (47%) are still being kept.
% 0.41/0.62  ; 
% 0.41/0.62  ; Run time in seconds excluding printing time:
% 0.41/0.62  ;     0.014  11%   Read assertion file          (1 call)
% 0.41/0.62  ;     0.011   9%   Assert                       (6 calls)
% 0.41/0.62  ;     0.017  14%   Process new row              (565 calls)
% 0.41/0.62  ;     0.003   2%   Resolution                   (394 calls)
% 0.41/0.62  ;     0.008   7%   Paramodulation               (197 calls)
% 0.41/0.62  ;     0.000   0%   Factoring                    (16 calls)
% 0.41/0.62  ;     0.000   0%   Condensing                   (135 calls)
% 0.41/0.62  ;     0.008   7%   Forward subsumption          (135 calls)
% 0.41/0.62  ;     0.006   5%   Backward subsumption         (119 calls)
% 0.41/0.62  ;     0.001   1%   Clause clause subsumption    (68 calls)
% 0.41/0.62  ;     0.011   9%   Forward simplification       (502 calls)
% 0.41/0.62  ;     0.007   6%   Backward simplification      (306 calls)
% 0.41/0.62  ;     0.004   3%   Ordering                     (2,046 calls)
% 0.41/0.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.41/0.62  ;     0.000   0%   Purity testing               (1 call)
% 0.41/0.62  ;     0.033  27%   Other
% 0.41/0.62  ;     0.123        Total
% 0.41/0.62  ;     0.126        Real time
% 0.41/0.62  ; 
% 0.41/0.62  ; Term-hash-array has 455 terms in all.
% 0.41/0.62  ; Feature-vector-row-index has 34 entries (91 at peak, 119 added, 85 deleted).
% 0.41/0.62  ; Feature-vector-row-index has 411 nodes (808 at peak, 1,081 added, 670 deleted).
% 0.41/0.62  ;  Retrieved 32 possibly forward subsuming rows in 135 calls.
% 0.41/0.62  ;  Retrieved 36 possibly backward subsumed rows in 119 calls.
% 0.41/0.62  ; Path-index has 291 entries (405 at peak, 495 added, 204 deleted).
% 0.41/0.62  ; Path-index has 140 nodes (170 at peak, 170 added, 30 deleted).
% 0.41/0.62  ; Trie-index has 291 entries (405 at peak, 495 added, 204 deleted).
% 0.41/0.62  ; Trie-index has 483 nodes (691 at peak, 838 added, 355 deleted).
% 0.41/0.62  ; Retrieved 148 generalization terms in 1,791 calls.
% 0.41/0.62  ; Retrieved 186 instance terms in 186 calls.
% 0.41/0.62  ; Retrieved 180 unifiable terms in 1,219 calls.
% 0.41/0.62  ; 
% 0.41/0.62  ; The agenda of backward simplifiable rows to process has 48 entries:
% 0.41/0.62  ;    48 with value 0
% 0.41/0.62  ; The agenda of rows to process has 9 entries:
% 0.41/0.62  ;     2 with value 17              1 with value 18               6 with value 20
% 0.41/0.62  ; The agenda of input rows to give has 3 entries:
% 0.41/0.62  ;     2 with value 7               1 with value 11
% 0.41/0.62  ; The agenda of rows to give has 30 entries:
% 0.41/0.62  ;     1 with value (4 10)          8 with value (4 34)          16 with value (4 35)
% 0.41/0.62  ;     5 with value (4 31)
% 0.41/0.62  Evaluation took:
% 0.41/0.62    0.127 seconds of real time
% 0.41/0.62    0.111616 seconds of user run time
% 0.41/0.62    0.014949 seconds of system run time
% 0.41/0.62    0 calls to %EVAL
% 0.41/0.62    0 page faults and
% 0.41/0.62    9,200,936 bytes consed.
% 0.41/0.62  :PROOF-FOUND
% 0.41/0.62  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T23:28:23
% 0.41/0.62  :PROOF-FOUND
% 0.41/0.62  * 
%------------------------------------------------------------------------------