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

View Problem - Process Solution

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

% Computer : n017.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:51 EDT 2022

% Result   : Theorem 0.46s 0.63s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   25
% Syntax   : Number of clauses     :   44 (  32 unt;  12 nHn;  44 RR)
%            Number of literals    :   74 (  73 equ;   7 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(11,axiom,
    e20 != e21,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

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

cnf(13,axiom,
    e20 != e23,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

cnf(14,axiom,
    e20 != e24,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

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

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

cnf(18,axiom,
    e22 != e23,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

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

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

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

cnf(64,axiom,
    op1(e13,e13) = e10,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

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

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

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

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

cnf(95,axiom,
    op2(e24,e24) = e20,
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(102,negated_conjecture,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13
    | j(e21) = e14 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

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

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

cnf(168,negated_conjecture,
    j(op2(e21,e21)) = op1(j(e21),j(e21)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(169,plain,
    j(e22) = op1(j(e21),j(e21)),
    inference('REWRITE',[status(thm)],[168,77,theory(equality)]) ).

cnf(180,negated_conjecture,
    j(op2(e22,e22)) = op1(j(e22),j(e22)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(181,plain,
    j(e23) = op1(j(e22),j(e22)),
    inference('REWRITE',[status(thm)],[180,83,theory(equality)]) ).

cnf(207,negated_conjecture,
    h(j(e21)) = e21,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(208,negated_conjecture,
    h(j(e22)) = e22,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(209,negated_conjecture,
    h(j(e23)) = e23,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(212,negated_conjecture,
    j(h(e11)) = e11,
    file('/export/starexec/sandbox2/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)]),14,95,theory(equality)]) ).

cnf(261,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13
    | j(e22) = e10 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[169,102,theory(equality)]),70,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)]),18,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(375,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e21) = e13 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[208,261,theory(equality)]),12,305,theory(equality)]) ).

cnf(377,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12
    | j(e22) = e10 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[169,375,theory(equality)]),64,theory(equality)]) ).

cnf(392,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e21) = e12 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[208,377,theory(equality)]),12,305,theory(equality)]) ).

cnf(394,plain,
    ( j(e21) = e10
    | j(e21) = e11
    | j(e22) = e10 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[169,392,theory(equality)]),58,theory(equality)]) ).

cnf(409,plain,
    ( j(e21) = e10
    | j(e21) = e11 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[208,394,theory(equality)]),12,305,theory(equality)]) ).

cnf(410,plain,
    ( j(e21) = e10
    | h(e11) = e21 ),
    inference('PARAMODULATE',[status(thm)],[207,409,theory(equality)]) ).

cnf(418,plain,
    h(e11) = e21,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[207,410,theory(equality)]),11,305,theory(equality)]) ).

cnf(428,plain,
    j(e21) = e11,
    inference('REWRITE',[status(thm)],[212,418,theory(equality)]) ).

cnf(429,plain,
    j(e22) = e10,
    inference('REWRITE',[status(thm)],[169,52,428,theory(equality)]) ).

cnf(430,plain,
    j(e23) = e10,
    inference('REWRITE',[status(thm)],[181,46,429,theory(equality)]) ).

cnf(431,plain,
    $false,
    inference('REWRITE',[status(thm)],[209,13,305,430,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ALG089+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun  8 09:54:18 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 0.19/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T09:54:18
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-08T09:54:18
% 0.46/0.63  
% 0.46/0.63  
% 0.46/0.63  #||
% 0.46/0.63  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.63  % SZS output start Refutation
% See solution above
% 0.46/0.63  ||#
% 0.46/0.63  
% 0.46/0.63  ; Summary of computation:
% 0.46/0.63  ;       867 formulas have been input or derived (from 209 formulas).
% 0.46/0.63  ;       431 (50%) were retained.  Of these,
% 0.46/0.63  ;          284 (66%) were simplified or subsumed later,
% 0.46/0.63  ;          147 (34%) are still being kept.
% 0.46/0.63  ; 
% 0.46/0.63  ; Run time in seconds excluding printing time:
% 0.46/0.63  ;     0.014   9%   Read assertion file          (1 call)
% 0.46/0.63  ;     0.012   8%   Assert                       (6 calls)
% 0.46/0.63  ;     0.035  23%   Process new row              (703 calls)
% 0.46/0.63  ;     0.001   1%   Resolution                   (416 calls)
% 0.46/0.63  ;     0.011   7%   Paramodulation               (208 calls)
% 0.46/0.63  ;     0.000   0%   Factoring                    (27 calls)
% 0.46/0.63  ;     0.000   0%   Condensing                   (196 calls)
% 0.46/0.63  ;     0.011   7%   Forward subsumption          (196 calls)
% 0.46/0.63  ;     0.009   6%   Backward subsumption         (186 calls)
% 0.46/0.63  ;     0.000   0%   Clause clause subsumption    (154 calls)
% 0.46/0.63  ;     0.012   8%   Forward simplification       (631 calls)
% 0.46/0.63  ;     0.007   5%   Backward simplification      (381 calls)
% 0.46/0.63  ;     0.009   6%   Ordering                     (2,738 calls)
% 0.46/0.63  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.46/0.63  ;     0.000   0%   Purity testing               (1 call)
% 0.46/0.63  ;     0.030  20%   Other
% 0.46/0.63  ;     0.151        Total
% 0.46/0.63  ;     0.155        Real time
% 0.46/0.63  ; 
% 0.46/0.63  ; Term-hash-array has 518 terms in all.
% 0.46/0.63  ; Feature-vector-row-index has 17 entries (105 at peak, 186 added, 169 deleted).
% 0.46/0.63  ; Feature-vector-row-index has 153 nodes (896 at peak, 1,619 added, 1,466 deleted).
% 0.46/0.63  ;  Retrieved 42 possibly forward subsuming rows in 196 calls.
% 0.46/0.63  ;  Retrieved 112 possibly backward subsumed rows in 186 calls.
% 0.46/0.63  ; Path-index has 259 entries (428 at peak, 577 added, 318 deleted).
% 0.46/0.63  ; Path-index has 134 nodes (170 at peak, 170 added, 36 deleted).
% 0.46/0.63  ; Trie-index has 259 entries (428 at peak, 577 added, 318 deleted).
% 0.46/0.63  ; Trie-index has 441 nodes (716 at peak, 974 added, 533 deleted).
% 0.46/0.63  ; Retrieved 241 generalization terms in 2,666 calls.
% 0.46/0.63  ; Retrieved 194 instance terms in 194 calls.
% 0.46/0.63  ; Retrieved 190 unifiable terms in 1,266 calls.
% 0.46/0.63  ; 
% 0.46/0.63  ; The agenda of backward simplifiable rows to process has 99 entries:
% 0.46/0.63  ;    99 with value 0
% 0.46/0.63  ; The agenda of rows to process has 9 entries:
% 0.46/0.63  ;     1 with value 21              2 with value 23               4 with value 24
% 0.46/0.63  ;     2 with value 22
% 0.46/0.63  ; The agenda of input rows to give has 12 entries:
% 0.46/0.63  ;     3 with value 6               9 with value 10
% 0.46/0.63  ; The agenda of rows to give has 11 entries:
% 0.46/0.63  ;     1 with value (4 14)          6 with value (4 35)           3 with value (4 50)
% 0.46/0.63  ;     1 with value (4 31)
% 0.46/0.63  Evaluation took:
% 0.46/0.63    0.155 seconds of real time
% 0.46/0.63    0.133586 seconds of user run time
% 0.46/0.63    0.020948 seconds of system run time
% 0.46/0.63    0 calls to %EVAL
% 0.46/0.63    0 page faults and
% 0.46/0.63    11,109,320 bytes consed.
% 0.46/0.63  :PROOF-FOUND
% 0.46/0.63  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T09:54:18
% 0.46/0.63  :PROOF-FOUND
% 0.46/0.63  * 
%------------------------------------------------------------------------------