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

View Problem - Process Solution

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

% Computer : n023.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:23:32 EDT 2022

% Result   : Theorem 0.43s 0.59s
% Output   : Refutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   25 (  16 unt;   2 nHn;  18 RR)
%            Number of literals    :   38 (   4 equ;  13 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ modus_ponens
    | ~ is_a_theorem(X)
    | ~ is_a_theorem(implies(X,Y))
    | is_a_theorem(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).

cnf(57,axiom,
    ( ~ op_implies_and
    | implies(X,Y) = not(and(X,not(Y))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).

cnf(60,axiom,
    op_implies_and,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).

cnf(62,axiom,
    modus_ponens,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).

cnf(81,axiom,
    ( modus_ponens_strict_implies
    | is_a_theorem('SKOLEMAAAU57') ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).

cnf(82,axiom,
    ( modus_ponens_strict_implies
    | is_a_theorem(strict_implies('SKOLEMAAAU57','SKOLEMAAAU58')) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).

cnf(83,axiom,
    ( modus_ponens_strict_implies
    | ~ is_a_theorem('SKOLEMAAAU58') ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).

cnf(93,axiom,
    ( ~ axiom_M
    | is_a_theorem(implies(necessarily(X),X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_M) ).

cnf(130,axiom,
    ( ~ op_strict_implies
    | strict_implies(X,Y) = necessarily(implies(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_strict_implies) ).

cnf(135,axiom,
    axiom_M,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+3.ax',km4b_axiom_M) ).

cnf(138,axiom,
    op_strict_implies,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_op_strict_implies) ).

cnf(140,negated_conjecture,
    ~ modus_ponens_strict_implies,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_modus_ponens_strict_implies) ).

cnf(141,plain,
    is_a_theorem('SKOLEMAAAU57'),
    inference('REWRITE',[status(thm)],[81,140]) ).

cnf(142,plain,
    is_a_theorem(strict_implies('SKOLEMAAAU57','SKOLEMAAAU58')),
    inference('REWRITE',[status(thm)],[82,140]) ).

cnf(143,plain,
    ~ is_a_theorem('SKOLEMAAAU58'),
    inference('REWRITE',[status(thm)],[83,140]) ).

cnf(145,plain,
    strict_implies(X,Y) = necessarily(implies(X,Y)),
    inference('REWRITE',[status(thm)],[130,138]) ).

cnf(170,plain,
    is_a_theorem(necessarily(implies('SKOLEMAAAU57','SKOLEMAAAU58'))),
    inference('REWRITE',[status(thm)],[142,145,theory(equality)]) ).

cnf(178,plain,
    is_a_theorem(implies(necessarily(X),X)),
    inference('REWRITE',[status(thm)],[93,135]) ).

cnf(216,plain,
    ( ~ is_a_theorem(X)
    | ~ is_a_theorem(implies(X,Y))
    | is_a_theorem(Y) ),
    inference('REWRITE',[status(thm)],[1,62]) ).

cnf(218,plain,
    implies(X,Y) = not(and(X,not(Y))),
    inference('REWRITE',[status(thm)],[57,60]) ).

cnf(250,plain,
    is_a_theorem(not(and(necessarily(X),not(X)))),
    inference('REWRITE',[status(thm)],[178,218,theory(equality)]) ).

cnf(274,plain,
    ( ~ is_a_theorem(X)
    | ~ is_a_theorem(not(and(X,not(Y))))
    | is_a_theorem(Y) ),
    inference('REWRITE',[status(thm)],[216,218,theory(equality)]) ).

cnf(282,plain,
    is_a_theorem(necessarily(not(and('SKOLEMAAAU57',not('SKOLEMAAAU58'))))),
    inference('REWRITE',[status(thm)],[170,218,theory(equality)]) ).

cnf(315,plain,
    is_a_theorem(not(and('SKOLEMAAAU57',not('SKOLEMAAAU58')))),
    inference('HYPERRESOLVE',[status(thm)],[274,282,250]) ).

cnf(316,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[274,141,143]),315]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL538+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n023.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 21:09:57 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-04T21:09:58
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-07-04T21:09:58
% 0.20/0.50  WARNING:
% 0.20/0.50     #:|op_necessarily| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.20/0.50  WARNING:
% 0.20/0.50     #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.20/0.50  WARNING:
% 0.20/0.50     #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.20/0.50  WARNING:
% 0.20/0.50     #:|op_implies| is a proposition that occurs only positively; disabling rows that contain it.
% 0.43/0.59  
% 0.43/0.59  
% 0.43/0.59  #||
% 0.43/0.59  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.59  % SZS output start Refutation
% See solution above
% 0.43/0.59  ||#
% 0.43/0.59  
% 0.43/0.59  ; Summary of computation:
% 0.43/0.59  ;       345 formulas have been input or derived (from 56 formulas).
% 0.43/0.59  ;       316 (92%) were retained.  Of these,
% 0.43/0.59  ;          198 (63%) were simplified or subsumed later,
% 0.43/0.59  ;          118 (37%) are still being kept.
% 0.43/0.59  ; 
% 0.43/0.59  ; Run time in seconds excluding printing time:
% 0.43/0.59  ;     0.015  12%   Read assertion file          (1 call)
% 0.43/0.59  ;     0.007   6%   Assert                       (89 calls)
% 0.43/0.59  ;     0.032  26%   Process new row              (331 calls)
% 0.43/0.59  ;     0.002   2%   Resolution                   (110 calls)
% 0.43/0.59  ;     0.000   0%   Paramodulation               (55 calls)
% 0.43/0.59  ;     0.000   0%   Factoring                    (2 calls)
% 0.43/0.59  ;     0.003   2%   Condensing                   (220 calls)
% 0.43/0.59  ;     0.011   9%   Forward subsumption          (220 calls)
% 0.43/0.59  ;     0.003   2%   Backward subsumption         (220 calls)
% 0.43/0.59  ;     0.008   6%   Forward simplification       (327 calls)
% 0.43/0.59  ;     0.018  14%   Backward simplification      (316 calls)
% 0.43/0.59  ;     0.002   2%   Ordering                     (36 calls)
% 0.43/0.59  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.43/0.59  ;     0.001   1%   Purity testing               (1 call)
% 0.43/0.59  ;     0.022  18%   Other
% 0.43/0.59  ;     0.125        Total
% 0.43/0.59  ;     0.127        Real time
% 0.43/0.59  ; 
% 0.43/0.59  ; Term-hash-array has 1,079 terms in all.
% 0.43/0.59  ; Feature-vector-row-index has 52 entries (77 at peak, 220 added, 168 deleted).
% 0.43/0.59  ; Feature-vector-row-index has 498 nodes (542 at peak, 1,739 added, 1,241 deleted).
% 0.43/0.59  ;  Retrieved 16 possibly forward subsuming rows in 220 calls.
% 0.43/0.59  ;  Retrieved 14 possibly backward subsumed rows in 220 calls.
% 0.43/0.59  ; Path-index has 608 entries (615 at peak, 1,592 added, 984 deleted).
% 0.43/0.59  ; Path-index has 2,326 nodes (2,332 at peak, 4,132 added, 1,806 deleted).
% 0.43/0.59  ; Trie-index has 608 entries (615 at peak, 1,592 added, 984 deleted).
% 0.43/0.59  ; Trie-index has 2,517 nodes (2,540 at peak, 5,604 added, 3,087 deleted).
% 0.43/0.59  ; Retrieved 153 generalization terms in 530 calls.
% 0.43/0.59  ; Retrieved 281 instance terms in 95 calls.
% 0.43/0.59  ; Retrieved 1,287 unifiable terms in 295 calls.
% 0.43/0.59  ; 
% 0.43/0.59  ; The agenda of rows to process has 7 entries:
% 0.43/0.59  ;     1 with value 11              1 with value 18               1 with value 22
% 0.43/0.59  ;     1 with value 15              3 with value 19
% 0.43/0.59  ; The agenda of input rows to give has 50 entries:
% 0.43/0.59  ;     1 with value 17              4 with value 23               2 with value 34
% 0.43/0.59  ;     8 with value 18              4 with value 24               2 with value 35
% 0.43/0.59  ;     2 with value 19              2 with value 25               2 with value 36
% 0.43/0.59  ;     2 with value 20              3 with value 27               2 with value 37
% 0.43/0.59  ;     4 with value 21              4 with value 30               3 with value 39
% 0.43/0.59  ;     2 with value 22              3 with value 32
% 0.43/0.59  ; The agenda of rows to give has 12 entries:
% 0.43/0.59  ;     2 with value (4 6)           1 with value (4 11)           3 with value (4 15)
% 0.43/0.59  ;     4 with value (4 7)           1 with value (4 14)           1 with value (4 18)
% 0.43/0.59  Evaluation took:
% 0.43/0.59    0.127 seconds of real time
% 0.43/0.59    0.117826 seconds of user run time
% 0.43/0.59    0.008975 seconds of system run time
% 0.43/0.59    0 calls to %EVAL
% 0.43/0.59    0 page faults and
% 0.43/0.59    9,683,048 bytes consed.
% 0.43/0.59  :PROOF-FOUND
% 0.43/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T21:09:58
% 0.43/0.59  :PROOF-FOUND
% 0.43/0.59  * 
%------------------------------------------------------------------------------