TSTP Solution File: LCL076-3 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n014.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:01 EDT 2022

% Result   : Unsatisfiable 1.21s 1.38s
% Output   : Refutation 1.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (  13 unt;   0 nHn;   6 RR)
%            Number of literals    :   19 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   25 (   7 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(cn_18,axiom,
    is_a_theorem(implies(X,implies(Y,X))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).

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

cnf(cn_49,axiom,
    is_a_theorem(implies(implies(not(X),not(Y)),implies(Y,X))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).

cnf(transitivity,axiom,
    ( ~ is_a_theorem(implies(X,Y))
    | ~ is_a_theorem(implies(Y,Z))
    | is_a_theorem(implies(X,Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).

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

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

cnf(10,plain,
    ~ is_a_theorem(implies(not(not(not(a))),not(a))),
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,cn_49,prove_cn_40]) ).

cnf(13,plain,
    is_a_theorem(implies(implies(X,Y),implies(X,X))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,cn_35,cn_18]) ).

cnf(18,plain,
    is_a_theorem(implies(not(X),implies(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[transitivity,cn_18,cn_49]) ).

cnf(31,plain,
    is_a_theorem(implies(not(not(X)),implies(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[transitivity,18,cn_49]) ).

cnf(41,plain,
    is_a_theorem(implies(X,X)),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,13,cn_18]) ).

cnf(46,plain,
    is_a_theorem(implies(implies(implies(X,Y),X),implies(implies(X,Y),Y))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,41,cn_35]) ).

cnf(134,plain,
    ~ is_a_theorem(implies(implies(X,not(a)),not(a))),
    inference('UR-RESOLVE',[status(thm)],[transitivity,31,10]) ).

cnf(4084,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,46,8,134]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL076-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n014.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul  3 02:06:39 EDT 2022
% 0.12/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-03T02:06:40
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-03T02:06:40
% 1.21/1.38  
% 1.21/1.38  
% 1.21/1.38  #||
% 1.21/1.38  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.21/1.38  % SZS output start Refutation
% See solution above
% 1.21/1.38  ||#
% 1.21/1.38  
% 1.21/1.38  ; Summary of computation:
% 1.21/1.38  ;     10161 formulas have been input or derived (from 123 formulas).
% 1.21/1.38  ;      4084 (40%) were retained.  Of these,
% 1.21/1.38  ;            5 ( 0%) were simplified or subsumed later,
% 1.21/1.38  ;         4079 (100%) are still being kept.
% 1.21/1.38  ; 
% 1.21/1.38  ; Run time in seconds excluding printing time:
% 1.21/1.38  ;     0.002   0%   Read assertion file          (1 call)
% 1.21/1.38  ;     0.000   0%   Assert                       (6 calls)
% 1.21/1.38  ;     0.343  38%   Process new row              (8,449 calls)
% 1.21/1.38  ;     0.281  31%   Resolution                   (244 calls)
% 1.21/1.38  ;     0.011   1%   Paramodulation               (122 calls)
% 1.21/1.38  ;     0.000   0%   Condensing                   (2 calls)
% 1.21/1.38  ;     0.000   0%   Forward subsumption          (2 calls)
% 1.21/1.38  ;     0.000   0%   Backward subsumption         (2 calls)
% 1.21/1.38  ;     0.000   0%   Clause clause subsumption    (1 call)
% 1.21/1.38  ;     0.120  13%   Forward simplification       (8,420 calls)
% 1.21/1.38  ;     0.098  11%   Backward simplification      (4,084 calls)
% 1.21/1.38  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.21/1.38  ;     0.000   0%   Purity testing               (1 call)
% 1.21/1.38  ;     0.057   6%   Other
% 1.21/1.38  ;     0.912        Total
% 1.21/1.38  ;     0.914        Real time
% 1.21/1.38  ; 
% 1.21/1.38  ; Term-hash-array has 9,468 terms in all.
% 1.21/1.38  ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 1.21/1.38  ; Feature-vector-row-index has 7 nodes (7 at peak, 7 added, 0 deleted).
% 1.21/1.38  ;  Retrieved 1 possibly forward subsuming row in 2 calls.
% 1.21/1.38  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 1.21/1.38  ; Path-index has 9,460 entries (9,460 at peak, 9,470 added, 10 deleted).
% 1.21/1.38  ; Path-index has 1,997 nodes (1,997 at peak, 1,997 added, 0 deleted).
% 1.21/1.38  ; Trie-index has 9,460 entries (9,460 at peak, 9,470 added, 10 deleted).
% 1.21/1.38  ; Trie-index has 20,791 nodes (20,791 at peak, 20,807 added, 16 deleted).
% 1.21/1.38  ; Retrieved 61,885 generalization terms in 8,419 calls.
% 1.21/1.38  ; Retrieved 10,987 instance terms in 4,081 calls.
% 1.21/1.38  ; Retrieved 394,136 unifiable terms in 5,246 calls.
% 1.21/1.38  ; 
% 1.21/1.38  ; The agenda of rows to process has 272 entries:
% 1.21/1.38  ;     1 with value 10             21 with value 20              14 with value 28
% 1.21/1.38  ;     4 with value 13             10 with value 21              17 with value 29
% 1.21/1.38  ;     1 with value 14             27 with value 22               9 with value 30
% 1.21/1.38  ;     1 with value 15             35 with value 23              21 with value 31
% 1.21/1.38  ;    17 with value 16              7 with value 24              20 with value 32
% 1.21/1.38  ;     3 with value 17             17 with value 25               2 with value 33
% 1.21/1.38  ;     8 with value 18             12 with value 26               2 with value 34
% 1.21/1.38  ;    19 with value 19              4 with value 27
% 1.21/1.38  ; The agenda of rows to give has 3957 entries:
% 1.21/1.38  ;    41 with value (4 19)        286 with value (4 25)         471 with value (4 30)
% 1.21/1.38  ;    72 with value (4 20)        367 with value (4 26)         280 with value (4 31)
% 1.21/1.38  ;   121 with value (4 21)        481 with value (4 27)         129 with value (4 32)
% 1.21/1.38  ;   154 with value (4 22)        492 with value (4 28)          41 with value (4 33)
% 1.21/1.38  ;   194 with value (4 23)        537 with value (4 29)          20 with value (4 34)
% 1.21/1.38  ;   271 with value (4 24)
% 1.21/1.38  Evaluation took:
% 1.21/1.38    0.915 seconds of real time
% 1.21/1.38    0.841323 seconds of user run time
% 1.21/1.38    0.072752 seconds of system run time
% 1.21/1.38    [Run times include 0.097 seconds GC run time.]
% 1.21/1.38    0 calls to %EVAL
% 1.21/1.38    0 page faults and
% 1.21/1.38    64,332,992 bytes consed.
% 1.21/1.38  :PROOF-FOUND
% 1.21/1.38  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T02:06:41
% 1.21/1.38  :PROOF-FOUND
% 1.21/1.38  * 
%------------------------------------------------------------------------------