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

View Problem - Process Solution

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

% Computer : n013.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:07 EDT 2022

% Result   : Unsatisfiable 0.55s 0.73s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   21 (  20 unt;   0 nHn;   4 RR)
%            Number of literals    :   23 (   0 equ;   4 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   69 (  33 sgn)

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

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

cnf(prove_ic_3,negated_conjecture,
    ~ is_a_theorem(implies(implies(implies(a,b),a),a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_3) ).

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

cnf(5,plain,
    ~ is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,U)),implies(V,implies(implies(U,X),implies(Z,X)))),implies(implies(implies(a,b),a),a))),
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,ic_JLukasiewicz_4,prove_ic_3]) ).

cnf(6,plain,
    is_a_theorem(implies(implies(implies(implies(X,Y),implies(Z,Y)),implies(Y,U)),implies(V,implies(Y,U)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,4,ic_JLukasiewicz_4]) ).

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

cnf(10,plain,
    is_a_theorem(implies(X,implies(implies(Y,Z),implies(Z,implies(Y,Z))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,6,6]) ).

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

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

cnf(17,plain,
    is_a_theorem(implies(X,implies(implies(implies(Y,Z),U),implies(implies(implies(U,V),Z),U)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,ic_JLukasiewicz_4]) ).

cnf(23,plain,
    is_a_theorem(implies(implies(X,Y),implies(Y,implies(X,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,10,6]) ).

cnf(27,plain,
    is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(Z,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,23,ic_JLukasiewicz_4]) ).

cnf(34,plain,
    is_a_theorem(implies(implies(implies(X,Y),X),implies(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,27,6]) ).

cnf(40,plain,
    is_a_theorem(implies(X,implies(Y,implies(Z,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,34,6]) ).

cnf(54,plain,
    is_a_theorem(implies(X,implies(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,40,34]) ).

cnf(60,plain,
    is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),implies(U,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,54,ic_JLukasiewicz_4]) ).

cnf(181,plain,
    is_a_theorem(implies(implies(implies(X,Y),X),implies(Z,X))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,60,54]) ).

cnf(465,plain,
    is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(implies(Z,U),Y),Z))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,17,16]) ).

cnf(484,plain,
    is_a_theorem(implies(X,implies(implies(implies(Y,Z),Y),Y))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,465,181]) ).

cnf(485,plain,
    $false,
    inference('REWRITE',[status(thm)],[5,484]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL088-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n013.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 : Mon Jul  4 11:59:29 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.48  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49  * 
% 0.20/0.49  * 
% 0.20/0.50  #<PACKAGE "SNARK-USER">
% 0.20/0.50  * 
% 0.20/0.50  SNARK-TPTP-OPTIONS
% 0.20/0.50  * 
% 0.20/0.50  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.50   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.50   (USE-FACTORING :POS)
% 0.20/0.50   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.50   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.50   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.50   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.50   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.50   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.50   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.50   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.50   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.50   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.50  * 
% 0.20/0.50  "."
% 0.20/0.50  * 
% 0.20/0.50  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T11:59:29
% 0.20/0.50  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-07-04T11:59:29
% 0.55/0.73  
% 0.55/0.73  
% 0.55/0.73  #||
% 0.55/0.73  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.55/0.73  % SZS output start Refutation
% See solution above
% 0.55/0.75  ||#
% 0.55/0.75  
% 0.55/0.75  ; Summary of computation:
% 0.55/0.75  ;      1940 formulas have been input or derived (from 44 formulas).
% 0.55/0.75  ;       485 (25%) were retained.  Of these,
% 0.55/0.75  ;           63 (13%) were simplified or subsumed later,
% 0.55/0.75  ;          422 (87%) are still being kept.
% 0.55/0.75  ; 
% 0.55/0.75  ; Run time in seconds excluding printing time:
% 0.55/0.75  ;     0.001   0%   Read assertion file          (1 call)
% 0.55/0.75  ;     0.000   0%   Assert                       (3 calls)
% 0.55/0.75  ;     0.070  30%   Process new row              (1,400 calls)
% 0.55/0.75  ;     0.055  24%   Resolution                   (86 calls)
% 0.55/0.75  ;     0.005   2%   Paramodulation               (43 calls)
% 0.55/0.75  ;     0.000   0%   Condensing                   (1 call)
% 0.55/0.75  ;     0.000   0%   Forward subsumption          (1 call)
% 0.55/0.75  ;     0.000   0%   Backward subsumption         (1 call)
% 0.55/0.75  ;     0.035  15%   Forward simplification       (1,389 calls)
% 0.55/0.75  ;     0.033  14%   Backward simplification      (485 calls)
% 0.55/0.75  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.55/0.75  ;     0.000   0%   Purity testing               (1 call)
% 0.55/0.75  ;     0.031  13%   Other
% 0.55/0.75  ;     0.230        Total
% 0.55/0.75  ;     0.250        Real time
% 0.55/0.75  ; 
% 0.55/0.75  ; Term-hash-array has 1,543 terms in all.
% 0.55/0.75  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.55/0.75  ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 0.55/0.75  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.55/0.75  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.55/0.75  ; Path-index has 1,388 entries (1,439 at peak, 1,553 added, 165 deleted).
% 0.55/0.75  ; Path-index has 913 nodes (921 at peak, 930 added, 17 deleted).
% 0.55/0.75  ; Trie-index has 1,388 entries (1,439 at peak, 1,553 added, 165 deleted).
% 0.55/0.75  ; Trie-index has 3,247 nodes (3,384 at peak, 3,779 added, 532 deleted).
% 0.55/0.75  ; Retrieved 8,803 generalization terms in 1,387 calls.
% 0.55/0.75  ; Retrieved 4,072 instance terms in 483 calls.
% 0.55/0.75  ; Retrieved 46,219 unifiable terms in 1,335 calls.
% 0.55/0.75  ; 
% 0.55/0.75  ; The agenda of rows to process has 87 entries:
% 0.55/0.75  ;     9 with value 26              8 with value 34               8 with value 41
% 0.55/0.75  ;     6 with value 27              5 with value 35               2 with value 42
% 0.55/0.75  ;     1 with value 28              1 with value 36               1 with value 44
% 0.55/0.75  ;     1 with value 29              1 with value 37               1 with value 46
% 0.55/0.75  ;     7 with value 30              7 with value 38               4 with value 47
% 0.55/0.75  ;     8 with value 31              2 with value 39               1 with value 55
% 0.55/0.75  ;     5 with value 32              9 with value 40
% 0.55/0.75  ; The agenda of rows to give has 384 entries:
% 0.55/0.75  ;     1 with value (4 16)         27 with value (4 33)          10 with value (4 42)
% 0.55/0.75  ;     1 with value (4 24)         29 with value (4 34)          17 with value (4 43)
% 0.55/0.75  ;     1 with value (4 26)         30 with value (4 35)          20 with value (4 44)
% 0.55/0.75  ;     7 with value (4 27)         33 with value (4 36)          12 with value (4 45)
% 0.55/0.75  ;    11 with value (4 28)         24 with value (4 37)           5 with value (4 46)
% 0.55/0.75  ;    10 with value (4 29)         34 with value (4 38)           3 with value (4 47)
% 0.55/0.75  ;    25 with value (4 30)         29 with value (4 39)           5 with value (4 48)
% 0.55/0.75  ;    13 with value (4 31)         12 with value (4 40)           1 with value (4 49)
% 0.55/0.75  ;    15 with value (4 32)          9 with value (4 41)
% 0.55/0.75  Evaluation took:
% 0.55/0.75    0.25 seconds of real time
% 0.55/0.75    0.238334 seconds of user run time
% 0.55/0.75    0.012043 seconds of system run time
% 0.55/0.75    [Run times include 0.015 seconds GC run time.]
% 0.55/0.75    0 calls to %EVAL
% 0.55/0.75    0 page faults and
% 0.55/0.75    13,096,048 bytes consed.
% 0.55/0.75  :PROOF-FOUND
% 0.55/0.75  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T11:59:30
% 0.55/0.75  :PROOF-FOUND
% 0.55/0.75  * 
%------------------------------------------------------------------------------