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

View Problem - Process Solution

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

% Computer : n016.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:27 EDT 2022

% Result   : Theorem 0.38s 0.60s
% Output   : Refutation 0.38s
% 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('SKOLEMAAAV57') ),
    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('SKOLEMAAAV57','SKOLEMAAAV58')) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL007+0.ax',modus_ponens_strict_implies) ).

cnf(83,axiom,
    ( modus_ponens_strict_implies
    | ~ is_a_theorem('SKOLEMAAAV58') ),
    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+2.ax',km5_axiom_M) ).

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

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

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

cnf(141,plain,
    is_a_theorem(strict_implies('SKOLEMAAAV57','SKOLEMAAAV58')),
    inference('REWRITE',[status(thm)],[82,139]) ).

cnf(142,plain,
    ~ is_a_theorem('SKOLEMAAAV58'),
    inference('REWRITE',[status(thm)],[83,139]) ).

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

cnf(169,plain,
    is_a_theorem(necessarily(implies('SKOLEMAAAV57','SKOLEMAAAV58'))),
    inference('REWRITE',[status(thm)],[141,144,theory(equality)]) ).

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

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

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

cnf(249,plain,
    is_a_theorem(not(and(necessarily(X),not(X)))),
    inference('REWRITE',[status(thm)],[176,216,theory(equality)]) ).

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

cnf(281,plain,
    is_a_theorem(necessarily(not(and('SKOLEMAAAV57',not('SKOLEMAAAV58'))))),
    inference('REWRITE',[status(thm)],[169,216,theory(equality)]) ).

cnf(312,plain,
    is_a_theorem(not(and('SKOLEMAAAV57',not('SKOLEMAAAV58')))),
    inference('HYPERRESOLVE',[status(thm)],[273,281,249]) ).

cnf(313,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[273,140,142]),312]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL525+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n016.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 : Mon Jul  4 21:23:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T21:23:32
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-07-04T21:23:32
% 0.19/0.51  WARNING:
% 0.19/0.51     #:|op_necessarily| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.51  WARNING:
% 0.19/0.51     #:|op_implies_or| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.51  WARNING:
% 0.19/0.51     #:|op_and| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.19/0.51  WARNING:
% 0.19/0.51     #:|op_implies| is a proposition that occurs only positively; disabling rows that contain it.
% 0.38/0.60  
% 0.38/0.60  
% 0.38/0.60  #||
% 0.38/0.60  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.60  % SZS output start Refutation
% See solution above
% 0.38/0.60  ||#
% 0.38/0.60  
% 0.38/0.60  ; Summary of computation:
% 0.38/0.60  ;       338 formulas have been input or derived (from 55 formulas).
% 0.38/0.60  ;       313 (93%) were retained.  Of these,
% 0.38/0.60  ;          195 (62%) were simplified or subsumed later,
% 0.38/0.60  ;          118 (38%) are still being kept.
% 0.38/0.60  ; 
% 0.38/0.60  ; Run time in seconds excluding printing time:
% 0.38/0.60  ;     0.016  13%   Read assertion file          (1 call)
% 0.38/0.60  ;     0.007   6%   Assert                       (88 calls)
% 0.38/0.60  ;     0.041  33%   Process new row              (328 calls)
% 0.38/0.60  ;     0.001   1%   Resolution                   (108 calls)
% 0.38/0.60  ;     0.000   0%   Paramodulation               (54 calls)
% 0.38/0.60  ;     0.000   0%   Factoring                    (2 calls)
% 0.38/0.60  ;     0.002   2%   Condensing                   (222 calls)
% 0.38/0.60  ;     0.009   7%   Forward subsumption          (222 calls)
% 0.38/0.60  ;     0.007   6%   Backward subsumption         (222 calls)
% 0.38/0.60  ;     0.005   4%   Forward simplification       (324 calls)
% 0.38/0.60  ;     0.016  13%   Backward simplification      (313 calls)
% 0.38/0.60  ;     0.000   0%   Ordering                     (36 calls)
% 0.38/0.60  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.38/0.60  ;     0.001   1%   Purity testing               (1 call)
% 0.38/0.60  ;     0.019  15%   Other
% 0.38/0.60  ;     0.125        Total
% 0.38/0.60  ;     0.126        Real time
% 0.38/0.60  ; 
% 0.38/0.60  ; Term-hash-array has 1,083 terms in all.
% 0.38/0.60  ; Feature-vector-row-index has 56 entries (77 at peak, 222 added, 166 deleted).
% 0.38/0.60  ; Feature-vector-row-index has 535 nodes (559 at peak, 1,754 added, 1,219 deleted).
% 0.38/0.60  ;  Retrieved 16 possibly forward subsuming rows in 222 calls.
% 0.38/0.60  ;  Retrieved 14 possibly backward subsumed rows in 222 calls.
% 0.38/0.60  ; Path-index has 623 entries (623 at peak, 1,595 added, 972 deleted).
% 0.38/0.60  ; Path-index has 2,348 nodes (2,348 at peak, 4,138 added, 1,790 deleted).
% 0.38/0.60  ; Trie-index has 623 entries (623 at peak, 1,595 added, 972 deleted).
% 0.38/0.60  ; Trie-index has 2,560 nodes (2,560 at peak, 5,614 added, 3,054 deleted).
% 0.38/0.60  ; Retrieved 149 generalization terms in 529 calls.
% 0.38/0.60  ; Retrieved 275 instance terms in 90 calls.
% 0.38/0.60  ; Retrieved 1,121 unifiable terms in 269 calls.
% 0.38/0.60  ; 
% 0.38/0.60  ; The agenda of rows to process has 5 entries:
% 0.38/0.60  ;     1 with value 11              1 with value 18               3 with value 19
% 0.38/0.60  ; The agenda of input rows to give has 52 entries:
% 0.38/0.60  ;     1 with value 17              4 with value 24               2 with value 34
% 0.38/0.60  ;     9 with value 18              2 with value 25               2 with value 35
% 0.38/0.60  ;     4 with value 19              3 with value 27               2 with value 36
% 0.38/0.60  ;     2 with value 20              4 with value 30               2 with value 37
% 0.38/0.60  ;     5 with value 21              3 with value 32               3 with value 39
% 0.38/0.60  ;     4 with value 23
% 0.38/0.60  ; The agenda of rows to give has 11 entries:
% 0.38/0.60  ;     2 with value (4 6)           1 with value (4 11)           3 with value (4 15)
% 0.38/0.60  ;     4 with value (4 7)           1 with value (4 14)
% 0.38/0.60  Evaluation took:
% 0.38/0.60    0.127 seconds of real time
% 0.38/0.60    0.113873 seconds of user run time
% 0.38/0.60    0.013133 seconds of system run time
% 0.38/0.60    0 calls to %EVAL
% 0.38/0.60    0 page faults and
% 0.38/0.60    9,620,632 bytes consed.
% 0.38/0.60  :PROOF-FOUND
% 0.38/0.60  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T21:23:33
% 0.38/0.60  :PROOF-FOUND
% 0.38/0.60  * 
%------------------------------------------------------------------------------