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

View Problem - Process Solution

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

% Computer : n026.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 18:00:09 EDT 2022

% Result   : Theorem 2.30s 2.49s
% Output   : Refutation 2.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   28 (   8 unt;   6 nHn;  28 RR)
%            Number of literals    :   72 (  71 equ;  25 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(512,negated_conjecture,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4
    | op(e5,e5) = e5
    | op(e6,e6) = e6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(513,negated_conjecture,
    ( op(e0,e0) != e0
    | op(e1,e1) != e1
    | op(e2,e2) != e2
    | op(e3,e3) != e3
    | op(e4,e4) != e4
    | op(e5,e5) != e5
    | op(e6,e6) != e6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(514,negated_conjecture,
    ( op(e0,e0) != e0
    | op(e1,e1) = e1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(520,negated_conjecture,
    ( op(e1,e1) != e1
    | op(e0,e0) = e0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(521,negated_conjecture,
    ( op(e1,e1) != e1
    | op(e2,e2) = e2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(527,negated_conjecture,
    ( op(e2,e2) != e2
    | op(e1,e1) = e1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(528,negated_conjecture,
    ( op(e2,e2) != e2
    | op(e3,e3) = e3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(534,negated_conjecture,
    ( op(e3,e3) != e3
    | op(e2,e2) = e2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(535,negated_conjecture,
    ( op(e3,e3) != e3
    | op(e4,e4) = e4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(541,negated_conjecture,
    ( op(e4,e4) != e4
    | op(e3,e3) = e3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(542,negated_conjecture,
    ( op(e4,e4) != e4
    | op(e5,e5) = e5 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(548,negated_conjecture,
    ( op(e5,e5) != e5
    | op(e4,e4) = e4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(549,negated_conjecture,
    ( op(e5,e5) != e5
    | op(e6,e6) = e6 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(555,negated_conjecture,
    ( op(e6,e6) != e6
    | op(e5,e5) = e5 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(2233,plain,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4
    | op(e5,e5) = e5 ),
    inference('HYPERRESOLVE',[status(thm)],[555,512]) ).

cnf(2237,plain,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3
    | op(e4,e4) = e4 ),
    inference('HYPERRESOLVE',[status(thm)],[548,2233]) ).

cnf(2238,plain,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2
    | op(e3,e3) = e3 ),
    inference('HYPERRESOLVE',[status(thm)],[541,2237]) ).

cnf(2239,plain,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1
    | op(e2,e2) = e2 ),
    inference('HYPERRESOLVE',[status(thm)],[534,2238]) ).

cnf(2240,plain,
    ( op(e0,e0) = e0
    | op(e1,e1) = e1 ),
    inference('HYPERRESOLVE',[status(thm)],[527,2239]) ).

cnf(2241,plain,
    op(e0,e0) = e0,
    inference('HYPERRESOLVE',[status(thm)],[520,2240]) ).

cnf(2596,plain,
    ( op(e1,e1) != e1
    | op(e2,e2) != e2
    | op(e3,e3) != e3
    | op(e4,e4) != e4
    | op(e5,e5) != e5
    | op(e6,e6) != e6 ),
    inference('REWRITE',[status(thm)],[513,2241,theory(equality)]) ).

cnf(2597,plain,
    op(e1,e1) = e1,
    inference('REWRITE',[status(thm)],[514,2241,theory(equality)]) ).

cnf(2923,plain,
    op(e2,e2) = e2,
    inference('REWRITE',[status(thm)],[521,2597,theory(equality)]) ).

cnf(3220,plain,
    op(e3,e3) = e3,
    inference('REWRITE',[status(thm)],[528,2923,theory(equality)]) ).

cnf(3488,plain,
    op(e4,e4) = e4,
    inference('REWRITE',[status(thm)],[535,3220,theory(equality)]) ).

cnf(3727,plain,
    op(e5,e5) = e5,
    inference('REWRITE',[status(thm)],[542,3488,theory(equality)]) ).

cnf(3937,plain,
    op(e6,e6) = e6,
    inference('REWRITE',[status(thm)],[549,3727,theory(equality)]) ).

cnf(4516,plain,
    $false,
    inference('REWRITE',[status(thm)],[2596,3937,3727,3488,3220,2923,2597,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : ALG194+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n026.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 : Wed Jun  8 03:46:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 0.18/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46   (USE-FACTORING :POS)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46  * 
% 0.18/0.46  "."
% 0.18/0.46  * 
% 0.18/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T03:46:02
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-08T03:46:02
% 2.30/2.49  
% 2.30/2.49  
% 2.30/2.49  #||
% 2.30/2.49  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.30/2.49  % SZS output start Refutation
% See solution above
% 2.30/2.49  ||#
% 2.30/2.49  
% 2.30/2.49  ; Summary of computation:
% 2.30/2.49  ;      5890 formulas have been input or derived (from 561 formulas).
% 2.30/2.49  ;      4516 (77%) were retained.  Of these,
% 2.30/2.49  ;         3405 (75%) were simplified or subsumed later,
% 2.30/2.49  ;         1111 (25%) are still being kept.
% 2.30/2.49  ; 
% 2.30/2.49  ; Run time in seconds excluding printing time:
% 2.30/2.49  ;     0.084   4%   Read assertion file          (1 call)
% 2.30/2.49  ;     0.102   5%   Assert                       (6 calls)
% 2.30/2.49  ;     0.418  21%   Process new row              (5,651 calls)
% 2.30/2.49  ;     0.018   1%   Resolution                   (1,120 calls)
% 2.30/2.49  ;     0.080   4%   Paramodulation               (560 calls)
% 2.30/2.49  ;     0.001   0%   Factoring                    (153 calls)
% 2.30/2.49  ;     0.009   0%   Condensing                   (4,190 calls)
% 2.30/2.49  ;     0.401  20%   Forward subsumption          (4,190 calls)
% 2.30/2.49  ;     0.240  12%   Backward subsumption         (4,060 calls)
% 2.30/2.49  ;     0.061   3%   Clause clause subsumption    (8,532 calls)
% 2.30/2.49  ;     0.314  15%   Forward simplification       (5,537 calls)
% 2.30/2.49  ;     0.239  12%   Backward simplification      (4,516 calls)
% 2.30/2.49  ;     0.026   1%   Ordering                     (20,973 calls)
% 2.30/2.49  ;     0.000   0%   Sortal reasoning             (32 calls)
% 2.30/2.49  ;     0.000   0%   Purity testing               (1 call)
% 2.30/2.49  ;     0.041   2%   Other
% 2.30/2.49  ;     2.034        Total
% 2.30/2.49  ;     2.036        Real time
% 2.30/2.49  ; 
% 2.30/2.49  ; Term-hash-array has 1,023 terms in all.
% 2.30/2.49  ; Feature-vector-row-index has 746 entries (1,871 at peak, 4,060 added, 3,314 deleted).
% 2.30/2.49  ; Feature-vector-row-index has 4,348 nodes (11,413 at peak, 23,620 added, 19,272 deleted).
% 2.30/2.49  ;  Retrieved 4,521 possibly forward subsuming rows in 4,190 calls.
% 2.30/2.49  ;  Retrieved 4,124 possibly backward subsumed rows in 4,060 calls.
% 2.30/2.49  ; Path-index has 831 entries (1,030 at peak, 1,268 added, 437 deleted).
% 2.30/2.49  ; Path-index has 118 nodes (118 at peak, 124 added, 6 deleted).
% 2.30/2.49  ; Trie-index has 831 entries (1,030 at peak, 1,268 added, 437 deleted).
% 2.30/2.49  ; Trie-index has 1,442 nodes (1,764 at peak, 2,100 added, 658 deleted).
% 2.30/2.49  ; Retrieved 4,117 generalization terms in 60,457 calls.
% 2.30/2.49  ; Retrieved 455 instance terms in 455 calls.
% 2.30/2.49  ; Retrieved 589 unifiable terms in 3,881 calls.
% 2.30/2.49  ; 
% 2.30/2.49  ; The agenda of backward simplifiable rows to process has 183 entries:
% 2.30/2.49  ;   183 with value 0
% 2.30/2.49  ; The agenda of rows to process has 26 entries:
% 2.30/2.49  ;     2 with value 17              1 with value 23               1 with value 41
% 2.30/2.49  ;    17 with value 20              5 with value 24
% 2.30/2.49  ; The agenda of input rows to give has 198 entries:
% 2.30/2.49  ;    84 with value 7             114 with value 35
% 2.30/2.49  ; The agenda of rows to give has 639 entries:
% 2.30/2.49  ;     6 with value (4 8)         452 with value (4 36)         100 with value (4 57)
% 2.30/2.49  ;     1 with value (4 13)         80 with value (4 39)
% 2.30/2.49  Evaluation took:
% 2.30/2.49    2.036 seconds of real time
% 2.30/2.49    1.925099 seconds of user run time
% 2.30/2.49    0.111342 seconds of system run time
% 2.30/2.49    [Run times include 0.149 seconds GC run time.]
% 2.30/2.49    0 calls to %EVAL
% 2.30/2.49    0 page faults and
% 2.30/2.49    206,233,336 bytes consed.
% 2.30/2.49  :PROOF-FOUND
% 2.30/2.49  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T03:46:04
% 2.30/2.49  :PROOF-FOUND
% 2.30/2.49  * 
%------------------------------------------------------------------------------