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

View Problem - Process Solution

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

% Computer : n004.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.80s 0.99s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   22 (  21 unt;   0 nHn;   5 RR)
%            Number of literals    :   24 (   0 equ;   5 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    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   95 (  54 sgn)

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

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

cnf(prove_ic_1,negated_conjecture,
    ~ is_a_theorem(implies(a,a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_1) ).

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

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

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

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

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

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

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

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

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

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

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

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

cnf(99,plain,
    ~ is_a_theorem(implies(implies(X,implies(implies(X,Y),implies(Z,implies(U,Y)))),implies(implies(implies(implies(V,W),implies(X1,Y1)),implies(implies(Y1,V),implies(Z1,implies(X1,V)))),implies(a,a)))),
    inference('UR-RESOLVE',[status(thm)],[condensed_detachment,5,25]) ).

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

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

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

cnf(936,plain,
    is_a_theorem(implies(X,implies(Y,implies(Z,implies(U,U))))),
    inference('HYPERRESOLVE',[status(thm)],[condensed_detachment,916,76]) ).

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

cnf(974,plain,
    $false,
    inference('REWRITE',[status(thm)],[99,973]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : LCL090-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jul  2 22:22:53 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T22:22:53
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-02T22:22:53
% 0.80/0.99  
% 0.80/0.99  
% 0.80/0.99  #||
% 0.80/0.99  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.80/0.99  % SZS output start Refutation
% See solution above
% 0.80/0.99  ||#
% 0.80/0.99  
% 0.80/0.99  ; Summary of computation:
% 0.80/0.99  ;      3499 formulas have been input or derived (from 63 formulas).
% 0.80/0.99  ;       974 (28%) were retained.  Of these,
% 0.80/0.99  ;          672 (69%) were simplified or subsumed later,
% 0.80/0.99  ;          302 (31%) are still being kept.
% 0.80/0.99  ; 
% 0.80/0.99  ; Run time in seconds excluding printing time:
% 0.80/0.99  ;     0.002   0%   Read assertion file          (1 call)
% 0.80/0.99  ;     0.000   0%   Assert                       (3 calls)
% 0.80/0.99  ;     0.144  29%   Process new row              (2,444 calls)
% 0.80/0.99  ;     0.086  18%   Resolution                   (124 calls)
% 0.80/0.99  ;     0.019   4%   Paramodulation               (62 calls)
% 0.80/0.99  ;     0.000   0%   Condensing                   (1 call)
% 0.80/0.99  ;     0.000   0%   Forward subsumption          (1 call)
% 0.80/0.99  ;     0.000   0%   Backward subsumption         (1 call)
% 0.80/0.99  ;     0.063  13%   Forward simplification       (2,413 calls)
% 0.80/0.99  ;     0.141  29%   Backward simplification      (974 calls)
% 0.80/0.99  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.80/0.99  ;     0.000   0%   Purity testing               (1 call)
% 0.80/0.99  ;     0.034   7%   Other
% 0.80/0.99  ;     0.489        Total
% 0.80/0.99  ;     0.508        Real time
% 0.80/1.00  ; 
% 0.80/1.00  ; Term-hash-array has 3,245 terms in all.
% 0.80/1.00  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.80/1.00  ; Feature-vector-row-index has 4 nodes (4 at peak, 4 added, 0 deleted).
% 0.80/1.00  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.80/1.00  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.80/1.00  ; Path-index has 1,585 entries (2,748 at peak, 3,266 added, 1,681 deleted).
% 0.80/1.00  ; Path-index has 1,551 nodes (1,578 at peak, 1,632 added, 81 deleted).
% 0.80/1.00  ; Trie-index has 1,585 entries (2,748 at peak, 3,266 added, 1,681 deleted).
% 0.80/1.00  ; Trie-index has 6,017 nodes (12,160 at peak, 14,171 added, 8,154 deleted).
% 0.80/1.00  ; Retrieved 8,281 generalization terms in 2,410 calls.
% 0.80/1.00  ; Retrieved 10,298 instance terms in 972 calls.
% 0.80/1.00  ; Retrieved 86,672 unifiable terms in 2,111 calls.
% 0.80/1.00  ; 
% 0.80/1.00  ; The agenda of rows to process has 52 entries:
% 0.80/1.00  ;     5 with value 25              5 with value 33               1 with value 40
% 0.80/1.00  ;     4 with value 28              1 with value 34               1 with value 41
% 0.80/1.00  ;     4 with value 30              1 with value 35               1 with value 43
% 0.80/1.00  ;    19 with value 31              4 with value 37               1 with value 44
% 0.80/1.00  ;     4 with value 32              1 with value 38
% 0.80/1.00  ; The agenda of rows to give has 271 entries:
% 0.80/1.00  ;     1 with value (4 25)         14 with value (4 39)          15 with value (4 49)
% 0.80/1.00  ;     1 with value (4 28)         18 with value (4 40)           7 with value (4 50)
% 0.80/1.00  ;     3 with value (4 30)         20 with value (4 41)           6 with value (4 51)
% 0.80/1.00  ;     2 with value (4 31)         17 with value (4 42)           3 with value (4 52)
% 0.80/1.00  ;     4 with value (4 32)         11 with value (4 43)           3 with value (4 53)
% 0.80/1.00  ;     5 with value (4 33)         18 with value (4 44)           2 with value (4 55)
% 0.80/1.00  ;     6 with value (4 34)         20 with value (4 45)           2 with value (4 56)
% 0.80/1.00  ;     6 with value (4 35)         14 with value (4 46)           1 with value (4 57)
% 0.80/1.00  ;    10 with value (4 36)         17 with value (4 47)           1 with value (4 60)
% 0.80/1.00  ;    15 with value (4 37)         14 with value (4 48)           1 with value (4 63)
% 0.80/1.00  ;    14 with value (4 38)
% 0.80/1.00  Evaluation took:
% 0.80/1.00    0.509 seconds of real time
% 0.80/1.00    0.464182 seconds of user run time
% 0.80/1.00    0.028112 seconds of system run time
% 0.80/1.00    [Run times include 0.028 seconds GC run time.]
% 0.80/1.00    0 calls to %EVAL
% 0.80/1.00    0 page faults and
% 0.80/1.00    34,225,264 bytes consed.
% 0.80/1.00  :PROOF-FOUND
% 0.80/1.00  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-02T22:22:53
% 0.80/1.00  :PROOF-FOUND
% 0.80/1.00  * 
%------------------------------------------------------------------------------