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

View Problem - Process Solution

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

% Computer : n021.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:31 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 (  18 unt;   0 nHn;  14 RR)
%            Number of literals    :   33 (   6 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    9 (   3 avg)
%            Number of predicates  :    9 (   7 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(77,axiom,
    ( ~ necessitation
    | ~ is_a_theorem(X)
    | is_a_theorem(necessarily(X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',necessitation) ).

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

cnf(128,axiom,
    ( axiom_m10
    | ~ is_a_theorem(strict_implies(possibly('SKOLEMAAAV94'),necessarily(possibly('SKOLEMAAAV94')))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',axiom_m10) ).

cnf(129,axiom,
    ( ~ op_possibly
    | possibly(X) = not(necessarily(not(X))) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+1.ax',op_possibly) ).

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(132,axiom,
    op_possibly,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_op_possibly) ).

cnf(133,axiom,
    necessitation,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_necessitation) ).

cnf(136,axiom,
    axiom_5,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+2.ax',km5_axiom_5) ).

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

cnf(139,negated_conjecture,
    ~ axiom_m10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s1_0_m10_axiom_m10) ).

cnf(140,plain,
    ~ is_a_theorem(strict_implies(possibly('SKOLEMAAAV94'),necessarily(possibly('SKOLEMAAAV94')))),
    inference('REWRITE',[status(thm)],[128,139]) ).

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

cnf(153,plain,
    ~ is_a_theorem(necessarily(implies(possibly('SKOLEMAAAV94'),necessarily(possibly('SKOLEMAAAV94'))))),
    inference('REWRITE',[status(thm)],[140,142,theory(equality)]) ).

cnf(173,plain,
    is_a_theorem(implies(possibly(X),necessarily(possibly(X)))),
    inference('REWRITE',[status(thm)],[99,136]) ).

cnf(176,plain,
    ( ~ is_a_theorem(X)
    | is_a_theorem(necessarily(X)) ),
    inference('REWRITE',[status(thm)],[77,133]) ).

cnf(177,plain,
    possibly(X) = not(necessarily(not(X))),
    inference('REWRITE',[status(thm)],[129,132]) ).

cnf(186,plain,
    is_a_theorem(implies(not(necessarily(not(X))),necessarily(not(necessarily(not(X)))))),
    inference('REWRITE',[status(thm)],[173,177,theory(equality)]) ).

cnf(193,plain,
    ~ is_a_theorem(necessarily(implies(not(necessarily(not('SKOLEMAAAV94'))),necessarily(not(necessarily(not('SKOLEMAAAV94'))))))),
    inference('REWRITE',[status(thm)],[153,177,theory(equality)]) ).

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

cnf(235,plain,
    is_a_theorem(not(and(not(necessarily(not(X))),not(necessarily(not(necessarily(not(X)))))))),
    inference('REWRITE',[status(thm)],[186,213,theory(equality)]) ).

cnf(238,plain,
    ~ is_a_theorem(necessarily(not(and(not(necessarily(not('SKOLEMAAAV94'))),not(necessarily(not(necessarily(not('SKOLEMAAAV94'))))))))),
    inference('REWRITE',[status(thm)],[193,213,theory(equality)]) ).

cnf(340,plain,
    is_a_theorem(necessarily(not(and(not(necessarily(not(X))),not(necessarily(not(necessarily(not(X))))))))),
    inference('HYPERRESOLVE',[status(thm)],[176,235]) ).

cnf(341,plain,
    $false,
    inference('REWRITE',[status(thm)],[238,340]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : LCL536+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul  4 15:28:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.45  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T15:28:17
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-07-04T15:28:17
% 0.19/0.49  WARNING:
% 0.19/0.49     #:|op_necessarily| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50  WARNING:
% 0.19/0.50     #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50  WARNING:
% 0.19/0.50     #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.50  WARNING:
% 0.19/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  ;       394 formulas have been input or derived (from 73 formulas).
% 0.43/0.59  ;       341 (87%) were retained.  Of these,
% 0.43/0.59  ;          193 (57%) were simplified or subsumed later,
% 0.43/0.59  ;          148 (43%) are still being kept.
% 0.43/0.59  ; 
% 0.43/0.59  ; Run time in seconds excluding printing time:
% 0.43/0.59  ;     0.016  12%   Read assertion file          (1 call)
% 0.43/0.59  ;     0.007   5%   Assert                       (88 calls)
% 0.43/0.59  ;     0.042  33%   Process new row              (381 calls)
% 0.43/0.59  ;     0.003   2%   Resolution                   (144 calls)
% 0.43/0.59  ;     0.003   2%   Paramodulation               (72 calls)
% 0.43/0.59  ;     0.000   0%   Factoring                    (4 calls)
% 0.43/0.59  ;     0.001   1%   Condensing                   (235 calls)
% 0.43/0.59  ;     0.006   5%   Forward subsumption          (235 calls)
% 0.43/0.59  ;     0.008   6%   Backward subsumption         (235 calls)
% 0.43/0.59  ;     0.000   0%   Clause clause subsumption    (4 calls)
% 0.43/0.59  ;     0.004   3%   Forward simplification       (377 calls)
% 0.43/0.59  ;     0.018  14%   Backward simplification      (341 calls)
% 0.43/0.59  ;     0.000   0%   Ordering                     (74 calls)
% 0.43/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.43/0.59  ;     0.001   1%   Purity testing               (1 call)
% 0.43/0.59  ;     0.019  15%   Other
% 0.43/0.59  ;     0.128        Total
% 0.43/0.59  ;     0.131        Real time
% 0.43/0.59  ; 
% 0.43/0.59  ; Term-hash-array has 1,223 terms in all.
% 0.43/0.59  ; Feature-vector-row-index has 73 entries (77 at peak, 235 added, 162 deleted).
% 0.43/0.59  ; Feature-vector-row-index has 658 nodes (658 at peak, 1,848 added, 1,190 deleted).
% 0.43/0.59  ;  Retrieved 19 possibly forward subsuming rows in 235 calls.
% 0.43/0.59  ;  Retrieved 12 possibly backward subsumed rows in 235 calls.
% 0.43/0.59  ; Path-index has 756 entries (766 at peak, 1,731 added, 975 deleted).
% 0.43/0.59  ; Path-index has 2,663 nodes (2,677 at peak, 4,457 added, 1,794 deleted).
% 0.43/0.59  ; Trie-index has 756 entries (766 at peak, 1,731 added, 975 deleted).
% 0.43/0.59  ; Trie-index has 2,983 nodes (3,017 at peak, 6,054 added, 3,071 deleted).
% 0.43/0.59  ; Retrieved 192 generalization terms in 668 calls.
% 0.43/0.59  ; Retrieved 305 instance terms in 105 calls.
% 0.43/0.59  ; Retrieved 2,610 unifiable terms in 506 calls.
% 0.43/0.59  ; 
% 0.43/0.59  ; The agenda of rows to process has 3 entries:
% 0.43/0.59  ;     1 with value 29              1 with value 30               1 with value 32
% 0.43/0.59  ; The agenda of input rows to give has 33 entries:
% 0.43/0.59  ;     4 with value 21              3 with value 27               2 with value 35
% 0.43/0.59  ;     4 with value 23              4 with value 30               2 with value 36
% 0.43/0.59  ;     2 with value 24              3 with value 32               2 with value 37
% 0.43/0.59  ;     2 with value 25              2 with value 34               3 with value 39
% 0.43/0.59  ; The agenda of rows to give has 42 entries:
% 0.43/0.59  ;     3 with value (4 7)           1 with value (4 19)           1 with value (4 25)
% 0.43/0.59  ;     4 with value (4 12)          4 with value (4 20)           2 with value (4 26)
% 0.43/0.59  ;     3 with value (4 13)          4 with value (4 21)           1 with value (4 27)
% 0.43/0.59  ;     1 with value (4 14)          2 with value (4 22)           2 with value (4 28)
% 0.43/0.59  ;     5 with value (4 15)          3 with value (4 23)           2 with value (4 29)
% 0.43/0.59  ;     1 with value (4 16)          2 with value (4 24)           1 with value (4 31)
% 0.43/0.59  Evaluation took:
% 0.43/0.59    0.131 seconds of real time
% 0.43/0.59    0.117012 seconds of user run time
% 0.43/0.59    0.013717 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    10,586,784 bytes consed.
% 0.43/0.59  :PROOF-FOUND
% 0.43/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T15:28:17
% 0.43/0.59  :PROOF-FOUND
% 0.43/0.59  * 
%------------------------------------------------------------------------------