TSTP Solution File: LCL121-1 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n029.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:20:23 EDT 2022

% Result   : Unsatisfiable 24.73s 24.93s
% Output   : Refutation 24.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   28 (  27 unt;   0 nHn;   4 RR)
%            Number of literals    :   30 (   0 equ;   4 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   91 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( ~ is_a_theorem(equivalent(X,Y))
    | ~ is_a_theorem(X)
    | is_a_theorem(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

cnf(lg_2,axiom,
    is_a_theorem(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U)))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).

cnf(prove_lg_1,negated_conjecture,
    ~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_1) ).

cnf(4,plain,
    is_a_theorem(equivalent(equivalent(X,equivalent(X,equivalent(equivalent(Y,Z),equivalent(equivalent(Y,U),equivalent(Z,U))))),equivalent(equivalent(V,W),equivalent(equivalent(V,X1),equivalent(W,X1))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,lg_2,lg_2]) ).

cnf(6,plain,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,Z),equivalent(Y,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,lg_2]) ).

cnf(9,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(equivalent(X,U),equivalent(Y,U)),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,6]) ).

cnf(14,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(equivalent(X,U),equivalent(Z,U)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,6]) ).

cnf(16,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),U),equivalent(equivalent(equivalent(equivalent(X,V),equivalent(Y,V)),Z),U))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,9,6]) ).

cnf(21,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,Y),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,14]) ).

cnf(24,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),V),equivalent(equivalent(X,equivalent(Y,U)),V))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,14,4]) ).

cnf(27,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),Z),equivalent(U,Z)),equivalent(equivalent(X,Y),U))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,21,9]) ).

cnf(30,plain,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,14]) ).

cnf(31,plain,
    is_a_theorem(equivalent(equivalent(X,equivalent(equivalent(Y,Z),equivalent(U,Z))),equivalent(X,equivalent(Y,U)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,4]) ).

cnf(36,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(X,Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,30,9]) ).

cnf(39,plain,
    is_a_theorem(equivalent(X,X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,36,30]) ).

cnf(41,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),U),equivalent(equivalent(X,Z),U))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,36,6]) ).

cnf(42,plain,
    ~ is_a_theorem(equivalent(equivalent(a,X),equivalent(equivalent(a,equivalent(equivalent(b,equivalent(c,c)),b)),X))),
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,36,prove_lg_1]) ).

cnf(47,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(Z,equivalent(Y,U))),equivalent(equivalent(X,U),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,31,9]) ).

cnf(82,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(Z,Y)),equivalent(U,Z)),equivalent(equivalent(X,V),equivalent(U,V)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,16,14]) ).

cnf(123,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),Z),equivalent(equivalent(X,U),equivalent(Z,equivalent(U,Y))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,41,41]) ).

cnf(136,plain,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(X,equivalent(Z,Z)),Y))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,82,31]) ).

cnf(145,plain,
    is_a_theorem(equivalent(equivalent(X,equivalent(Y,Y)),X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,136,39]) ).

cnf(207,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Z),Y)),X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,145,9]) ).

cnf(211,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),Z),X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,145,47]) ).

cnf(774,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),equivalent(Z,Y)),X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,24,207]) ).

cnf(1059,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(equivalent(Y,Y),Z)),U),equivalent(X,equivalent(U,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,123,211]) ).

cnf(1064,plain,
    is_a_theorem(equivalent(equivalent(equivalent(X,equivalent(Y,Z)),U),equivalent(X,equivalent(U,equivalent(Z,Y))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,123,774]) ).

cnf(12120,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,1064,1059,42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL121-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n029.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 : Sat Jul  2 17:05:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T17:05:55
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-02T17:05:55
% 24.73/24.93  
% 24.73/24.93  
% 24.73/24.93  #||
% 24.73/24.93  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.73/24.93  % SZS output start Refutation
% See solution above
% 24.73/24.93  ||#
% 24.73/24.93  
% 24.73/24.93  ; Summary of computation:
% 24.73/24.93  ;     68392 formulas have been input or derived (from 225 formulas).
% 24.73/24.93  ;     12120 (18%) were retained.  Of these,
% 24.73/24.93  ;           11 ( 0%) were simplified or subsumed later,
% 24.73/24.93  ;        12109 (100%) are still being kept.
% 24.73/24.93  ; 
% 24.73/24.93  ; Run time in seconds excluding printing time:
% 24.73/24.93  ;     0.002   0%   Read assertion file          (1 call)
% 24.73/24.93  ;     0.000   0%   Assert                       (3 calls)
% 24.73/24.93  ;     1.661   7%   Process new row              (59,473 calls)
% 24.73/24.93  ;    19.012  78%   Resolution                   (448 calls)
% 24.73/24.93  ;     0.523   2%   Paramodulation               (224 calls)
% 24.73/24.93  ;     0.000   0%   Condensing                   (1 call)
% 24.73/24.93  ;     0.000   0%   Forward subsumption          (1 call)
% 24.73/24.93  ;     0.000   0%   Backward subsumption         (1 call)
% 24.73/24.93  ;     1.566   6%   Forward simplification       (59,467 calls)
% 24.73/24.93  ;     1.487   6%   Backward simplification      (12,120 calls)
% 24.73/24.93  ;     0.000   0%   Sortal reasoning             (32 calls)
% 24.73/24.93  ;     0.000   0%   Purity testing               (1 call)
% 24.73/24.93  ;     0.207   1%   Other
% 24.73/24.93  ;    24.458        Total
% 24.73/24.93  ;    24.462        Real time
% 24.73/24.93  ; 
% 24.73/24.93  ; Term-hash-array has 34,448 terms in all.
% 24.73/24.93  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 24.73/24.93  ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 24.73/24.93  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 24.73/24.93  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 24.73/24.93  ; Path-index has 34,429 entries (34,429 at peak, 34,458 added, 29 deleted).
% 24.73/24.93  ; Path-index has 2,494 nodes (2,494 at peak, 2,498 added, 4 deleted).
% 24.73/24.93  ; Trie-index has 34,429 entries (34,429 at peak, 34,458 added, 29 deleted).
% 24.73/24.93  ; Trie-index has 86,750 nodes (86,750 at peak, 86,925 added, 175 deleted).
% 24.73/24.93  ; Retrieved 943,828 generalization terms in 59,468 calls.
% 24.73/24.93  ; Retrieved 236,903 instance terms in 12,118 calls.
% 24.73/24.93  ; Retrieved 36,481,809 unifiable terms in 36,688 calls.
% 24.73/24.93  ; 
% 24.73/24.93  ; The agenda of rows to process has 681 entries:
% 24.73/24.93  ;     8 with value 25              2 with value 37               8 with value 46
% 24.73/24.93  ;     4 with value 26             50 with value 39               4 with value 48
% 24.73/24.93  ;    28 with value 30            131 with value 40               6 with value 49
% 24.73/24.93  ;    32 with value 31             60 with value 41               6 with value 50
% 24.73/24.93  ;     1 with value 32              2 with value 42               1 with value 53
% 24.73/24.93  ;    18 with value 34             28 with value 44               6 with value 54
% 24.73/24.93  ;   134 with value 35             59 with value 45               1 with value 62
% 24.73/24.93  ;    92 with value 36
% 24.73/24.93  ; The agenda of rows to give has 11887 entries:
% 24.73/24.93  ;    38 with value (4 34)       1525 with value (4 45)          70 with value (4 56)
% 24.73/24.93  ;   142 with value (4 35)        576 with value (4 46)          35 with value (4 57)
% 24.73/24.93  ;   154 with value (4 36)        409 with value (4 47)          35 with value (4 58)
% 24.73/24.93  ;   164 with value (4 37)        564 with value (4 48)          49 with value (4 59)
% 24.73/24.93  ;   369 with value (4 38)        650 with value (4 49)          38 with value (4 60)
% 24.73/24.93  ;   776 with value (4 39)        389 with value (4 50)          51 with value (4 61)
% 24.73/24.93  ;   788 with value (4 40)        263 with value (4 51)          46 with value (4 62)
% 24.73/24.93  ;   519 with value (4 41)        369 with value (4 52)           6 with value (4 63)
% 24.73/24.93  ;   541 with value (4 42)        403 with value (4 53)           2 with value (4 64)
% 24.73/24.93  ;   911 with value (4 43)        299 with value (4 54)           1 with value (4 65)
% 24.73/24.93  ;  1611 with value (4 44)         94 with value (4 55)
% 24.73/24.93  Evaluation took:
% 24.73/24.93    24.463 seconds of real time
% 24.73/24.93    24.025152 seconds of user run time
% 24.73/24.93    0.437123 seconds of system run time
% 24.73/24.93    [Run times include 1.409 seconds GC run time.]
% 24.73/24.93    0 calls to %EVAL
% 24.73/24.93    0 page faults and
% 24.73/24.93    809,440,352 bytes consed.
% 24.73/24.93  :PROOF-FOUND
% 24.73/24.93  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-02T17:06:19
% 24.73/24.93  :PROOF-FOUND
% 24.73/24.93  * 
%------------------------------------------------------------------------------