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

View Problem - Process Solution

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

% Computer : n016.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 : Sun Jul 17 14:26:57 EDT 2022

% Result   : Theorem 7.50s 7.68s
% Output   : Refutation 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   42 (  37 unt;   0 nHn;   5 RR)
%            Number of literals    :   48 (  17 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   83 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    '+'(X,'0') = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).

cnf(2,axiom,
    '>='(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).

cnf(4,axiom,
    ( ~ '>='(X,Y)
    | ~ '>='(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).

cnf(5,axiom,
    ( ~ '>='('+'(X,Y),Z)
    | '>='(Y,'==>'(X,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).

cnf(6,axiom,
    ( '>='('+'(X,Y),Z)
    | ~ '>='(Y,'==>'(X,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).

cnf(7,axiom,
    '>='(X,'0'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).

cnf(8,axiom,
    ( ~ '>='(X,Y)
    | '>='('+'(X,Z),'+'(Y,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).

cnf(10,axiom,
    ( ~ '>='(X,Y)
    | '>='('==>'(Z,X),'==>'(Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_11) ).

cnf(13,axiom,
    '==>'('==>'(X,Y),Y) = '==>'('==>'(Y,X),X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_13) ).

cnf(14,axiom,
    '+'(X,X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).

cnf(15,plain,
    '+'(X,'+'(X,Y)) = '+'(X,Y),
    inference('EMBED',[status(thm)],[14]) ).

cnf(16,negated_conjecture,
    '==>'('==>'('==>'('SKOLEMAAAU1','1'),'SKOLEMAAAU1'),'SKOLEMAAAU1') != '0',
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).

cnf(17,plain,
    '>='('+'(X,Y),Y),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[8,7]),1,theory(equality)]) ).

cnf(22,plain,
    '>='(X,'==>'(Y,'+'(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[5,2]) ).

cnf(31,plain,
    '>='('+'(X,'==>'(X,Y)),Y),
    inference('HYPERRESOLVE',[status(thm)],[6,2]) ).

cnf(33,plain,
    '==>'('==>'('==>'(X,Y),Y),X) = '==>'('==>'('==>'(Y,X),X),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]),13,theory(equality)]) ).

cnf(36,plain,
    '>='(X,'==>'(Y,X)),
    inference('HYPERRESOLVE',[status(thm)],[5,17]) ).

cnf(37,plain,
    '>='(X,'==>'(Y,Y)),
    inference('HYPERRESOLVE',[status(thm)],[5,17]) ).

cnf(38,plain,
    '>='('+'(X,Y),'==>'(Z,Y)),
    inference('HYPERRESOLVE',[status(thm)],[5,17]) ).

cnf(39,plain,
    '>='(X,'==>'('+'(Y,Z),Z)),
    inference('HYPERRESOLVE',[status(thm)],[5,17]) ).

cnf(42,plain,
    '>='('==>'(X,'+'(Y,Z)),'==>'(X,Z)),
    inference('HYPERRESOLVE',[status(thm)],[10,17]) ).

cnf(50,plain,
    '>='(X,'==>'('==>'(X,Y),Y)),
    inference('PARAMODULATE',[status(thm)],[36,13,theory(equality)]) ).

cnf(53,plain,
    '>='('+'(X,Y),'+'('==>'(Z,X),Y)),
    inference('HYPERRESOLVE',[status(thm)],[8,36]) ).

cnf(55,plain,
    '0' = '==>'(X,X),
    inference('HYPERRESOLVE',[status(thm)],[4,37,7]) ).

cnf(73,plain,
    '>='('==>'('0',X),X),
    inference('PARAMODULATE',[status(thm)],[31,1,theory(equality)]) ).

cnf(78,plain,
    '>='('+'(X,'+'('==>'(X,Y),Z)),'+'(Y,Z)),
    inference('HYPERRESOLVE',[status(thm)],[8,31]) ).

cnf(88,plain,
    '==>'('0',X) = X,
    inference('HYPERRESOLVE',[status(thm)],[4,73,36]) ).

cnf(90,plain,
    '>='(X,'==>'(Y,'==>'(Z,Y))),
    inference('HYPERRESOLVE',[status(thm)],[5,38]) ).

cnf(104,plain,
    '0' = '==>'('+'(X,Y),Y),
    inference('HYPERRESOLVE',[status(thm)],[4,39,7]) ).

cnf(167,plain,
    '0' = '==>'(X,'==>'(Y,X)),
    inference('HYPERRESOLVE',[status(thm)],[4,90,7]) ).

cnf(321,plain,
    '==>'(X,Y) = '==>'('==>'('==>'(X,Y),Y),Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,167,theory(equality)]),88,theory(equality)]) ).

cnf(322,plain,
    '==>'('==>'('==>'(X,Y),Y),X) = '==>'(Y,X),
    inference('REWRITE',[status(thm)],[33,321,theory(equality)]) ).

cnf(745,plain,
    '>='('+'(X,'==>'(X,Y)),'+'(X,Y)),
    inference('PARAMODULATE',[status(thm)],[78,15,theory(equality)]) ).

cnf(868,plain,
    '+'(X,'==>'(X,Y)) = '+'(X,Y),
    inference('HYPERRESOLVE',[status(thm)],[4,745,53]) ).

cnf(1002,plain,
    '>='('==>'('==>'(X,Y),Y),'==>'('==>'(Y,X),X)),
    inference('PARAMODULATE',[status(thm)],[50,322,theory(equality)]) ).

cnf(1099,plain,
    '>='(X,'==>'('==>'(X,Y),'+'(X,Y))),
    inference('PARAMODULATE',[status(thm)],[22,868,theory(equality)]) ).

cnf(1100,plain,
    '>='('==>'(X,Y),'==>'(X,'+'(X,Y))),
    inference('PARAMODULATE',[status(thm)],[22,868,theory(equality)]) ).

cnf(2822,plain,
    '==>'(X,Y) = '==>'(X,'+'(X,Y)),
    inference('HYPERRESOLVE',[status(thm)],[4,1100,42]) ).

cnf(4678,plain,
    '>='('==>'('==>'(X,Y),'+'(X,Y)),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1002,104,theory(equality)]),88,2822,theory(equality)]) ).

cnf(4706,plain,
    '==>'('==>'(X,Y),'+'(X,Y)) = X,
    inference('HYPERRESOLVE',[status(thm)],[4,4678,1099]) ).

cnf(4863,plain,
    '==>'('==>'(X,Y),X) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2822,868,theory(equality)]),4706,theory(equality)]) ).

cnf(4864,plain,
    $false,
    inference('REWRITE',[status(thm)],[16,55,4863,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : LCL901+1 : TPTP v8.1.0. Released v5.5.0.
% 0.09/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n016.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 Jul  3 19:55:16 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.46  * 
% 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-07-03T19:55:16
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-07-03T19:55:16
% 0.19/0.47  
% 0.19/0.47  ; Recognized associativity assertion (= (+ (+ ?X ?Y) ?Z) (+ ?X (+ ?Y ?Z))).
% 0.19/0.47  ; Recognized commutativity assertion (= (+ ?X ?Y) (+ ?Y ?X)).
% 0.19/0.48  ; Recognized right identity assertion (= (+ ?X |0|) ?X).
% 0.19/0.48  ; Declaring + to be commutative.
% 7.50/7.68  ; Declaring + to be associative-commutative.
% 7.50/7.68  
% 7.50/7.68  #||
% 7.50/7.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.50/7.68  % SZS output start Refutation
% See solution above
% 7.50/7.68  ||#
% 7.50/7.68  
% 7.50/7.68  ; Summary of computation:
% 7.50/7.68  ;     29914 formulas have been input or derived (from 167 formulas).
% 7.50/7.68  ;      4864 (16%) were retained.  Of these,
% 7.50/7.68  ;         1254 (26%) were simplified or subsumed later,
% 7.50/7.68  ;         3610 (74%) are still being kept.
% 7.50/7.68  ; 
% 7.50/7.68  ; Run time in seconds excluding printing time:
% 7.50/7.68  ;     0.003   0%   Read assertion file          (1 call)
% 7.50/7.68  ;     0.001   0%   Assert                       (15 calls)
% 7.50/7.68  ;     0.462   6%   Process new row              (28,278 calls)
% 7.50/7.68  ;     0.532   7%   Resolution                   (332 calls)
% 7.50/7.68  ;     0.195   3%   Paramodulation               (166 calls)
% 7.50/7.68  ;     0.001   0%   Embedding                    (22 calls)
% 7.50/7.68  ;     0.036   0%   Condensing                   (235 calls)
% 7.50/7.68  ;     0.013   0%   Forward subsumption          (235 calls)
% 7.50/7.68  ;     0.000   0%   Backward subsumption         (65 calls)
% 7.50/7.68  ;     0.030   0%   Clause clause subsumption    (1,436 calls)
% 7.50/7.68  ;     5.050  70%   Forward simplification       (25,443 calls)
% 7.50/7.68  ;     0.759  11%   Backward simplification      (4,843 calls)
% 7.50/7.68  ;     0.006   0%   Ordering                     (4,347 calls)
% 7.50/7.68  ;     0.001   0%   Ordering ac                  (100 calls)
% 7.50/7.68  ;     0.000   0%   Sortal reasoning             (32 calls)
% 7.50/7.68  ;     0.000   0%   Purity testing               (1 call)
% 7.50/7.68  ;     0.126   2%   Other
% 7.50/7.68  ;     7.215        Total
% 7.50/7.68  ;     7.219        Real time
% 7.50/7.68  ; 
% 7.50/7.68  ; Term-hash-array has 12,399 terms in all.
% 7.50/7.68  ; Feature-vector-row-index has 60 entries (60 at peak, 65 added, 5 deleted).
% 7.50/7.68  ; Feature-vector-row-index has 239 nodes (239 at peak, 257 added, 18 deleted).
% 7.50/7.68  ;  Retrieved 1,846 possibly forward subsuming rows in 235 calls.
% 7.50/7.68  ;  Retrieved 193 possibly backward subsumed rows in 65 calls.
% 7.50/7.68  ; Path-index has 9,592 entries (9,792 at peak, 12,548 added, 2,956 deleted).
% 7.50/7.68  ; Path-index has 2,636 nodes (2,703 at peak, 2,910 added, 274 deleted).
% 7.50/7.68  ; Trie-index has 9,592 entries (9,792 at peak, 12,548 added, 2,956 deleted).
% 7.50/7.68  ; Trie-index has 4,781 nodes (5,003 at peak, 5,504 added, 723 deleted).
% 7.50/7.68  ; Retrieved 1,354,256 generalization terms in 82,768 calls.
% 7.50/7.68  ; Retrieved 35,703 instance terms in 4,780 calls.
% 7.50/7.68  ; Retrieved 505,092 unifiable terms in 10,122 calls.
% 7.50/7.68  ; 
% 7.50/7.68  ; The agenda of backward simplifiable rows to process has 84 entries:
% 7.50/7.68  ;    84 with value 0
% 7.50/7.68  ; The agenda of rows to process has 131 entries:
% 7.50/7.68  ;    34 with value 24              5 with value 30               1 with value 36
% 7.50/7.68  ;    12 with value 25              4 with value 31               4 with value 37
% 7.50/7.68  ;    23 with value 26              2 with value 32               4 with value 39
% 7.50/7.68  ;    13 with value 27              6 with value 33               1 with value 41
% 7.50/7.68  ;     8 with value 28              2 with value 34               2 with value 43
% 7.50/7.68  ;     6 with value 29              3 with value 35               1 with value 45
% 7.50/7.68  ; The agenda of rows to give has 3487 entries:
% 7.50/7.68  ;     1 with value (4 17)        346 with value (4 26)          38 with value (4 35)
% 7.50/7.68  ;     5 with value (4 18)        330 with value (4 27)          24 with value (4 36)
% 7.50/7.68  ;    60 with value (4 19)        364 with value (4 28)          25 with value (4 37)
% 7.50/7.68  ;   107 with value (4 20)        284 with value (4 29)          18 with value (4 38)
% 7.50/7.68  ;   152 with value (4 21)        223 with value (4 30)           8 with value (4 39)
% 7.50/7.68  ;   238 with value (4 22)         95 with value (4 31)           4 with value (4 40)
% 7.50/7.68  ;   276 with value (4 23)         54 with value (4 32)           3 with value (4 41)
% 7.50/7.68  ;   375 with value (4 24)         91 with value (4 33)           1 with value (4 44)
% 7.50/7.68  ;   311 with value (4 25)         53 with value (4 34)           1 with value (4 45)
% 7.50/7.68  Evaluation took:
% 7.50/7.68    7.22 seconds of real time
% 7.50/7.68    7.059898 seconds of user run time
% 7.50/7.68    0.159004 seconds of system run time
% 7.50/7.68    [Run times include 0.539 seconds GC run time.]
% 7.50/7.68    0 calls to %EVAL
% 7.50/7.68    0 page faults and
% 7.50/7.68    1,699,916,600 bytes consed.
% 7.50/7.68  :PROOF-FOUND
% 7.50/7.68  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T19:55:23
% 7.50/7.68  :PROOF-FOUND
% 7.50/7.68  * 
%------------------------------------------------------------------------------