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

View Problem - Process Solution

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

% Computer : n018.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:21:39 EDT 2022

% Result   : Unsatisfiable 36.77s 36.94s
% Output   : Refutation 36.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  35 unt;   0 nHn;   7 RR)
%            Number of literals    :   40 (   4 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   70 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
    axiom(implies(or(X,X),X)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

cnf(axiom_1_3,axiom,
    axiom(implies(X,or(Y,X))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

cnf(axiom_1_4,axiom,
    axiom(implies(or(X,Y),or(Y,X))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).

cnf(axiom_1_5,axiom,
    axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).

cnf(axiom_1_6,axiom,
    axiom(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

cnf(implies_definition,axiom,
    implies(X,Y) = or(not(X),Y),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

cnf(rule_1,axiom,
    ( theorem(X)
    | ~ axiom(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).

cnf(rule_2,axiom,
    ( theorem(X)
    | ~ theorem(implies(Y,X))
    | ~ theorem(Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

cnf(and_defn,axiom,
    and(X,Y) = not(or(not(X),not(Y))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).

cnf(10,plain,
    and(X,Y) = not(implies(X,not(Y))),
    inference('REWRITE',[status(thm)],[and_defn,implies_definition,theory(equality)]) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(implies(implies(q,r),implies(and(p,q),r))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(12,plain,
    theorem(implies(or(X,X),X)),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_2]) ).

cnf(13,plain,
    theorem(implies(X,or(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).

cnf(14,plain,
    theorem(implies(or(X,Y),or(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_4]) ).

cnf(19,plain,
    implies(implies(X,not(Y)),Z) = or(and(X,Y),Z),
    inference('PARAMODULATE',[status(thm)],[implies_definition,10,theory(equality)]) ).

cnf(22,plain,
    theorem(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_5]) ).

cnf(25,plain,
    theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).

cnf(30,plain,
    theorem(implies(X,implies(Y,X))),
    inference('PARAMODULATE',[status(thm)],[13,implies_definition,theory(equality)]) ).

cnf(40,plain,
    theorem(implies(implies(X,Y),or(Y,not(X)))),
    inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).

cnf(41,plain,
    theorem(implies(or(X,not(Y)),implies(Y,X))),
    inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).

cnf(297,plain,
    theorem(implies(or(X,implies(Y,Z)),implies(Y,or(X,Z)))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).

cnf(310,plain,
    theorem(implies(or(X,or(Y,Y)),or(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,25,12]) ).

cnf(317,plain,
    theorem(implies(implies(X,Y),implies(implies(Z,X),implies(Z,Y)))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).

cnf(332,plain,
    theorem(implies(implies(X,or(Y,Y)),implies(X,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[310,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).

cnf(764,plain,
    theorem(implies(X,X)),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,332,13]) ).

cnf(792,plain,
    theorem(or(X,not(X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,764,40]) ).

cnf(819,plain,
    theorem(implies(implies(X,not(Y)),not(and(X,Y)))),
    inference('PARAMODULATE',[status(thm)],[792,19,theory(equality)]) ).

cnf(2945,plain,
    theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z)))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[297,implies_definition,theory(equality)]),implies_definition,theory(equality)]) ).

cnf(14925,plain,
    theorem(implies(or(X,Y),implies(implies(Y,Z),or(X,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,2945,25]) ).

cnf(14926,plain,
    theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,2945,317]) ).

cnf(62575,plain,
    theorem(implies(implies(not(X),Y),or(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,14925,792]) ).

cnf(76530,plain,
    ~ theorem(implies(and(p,q),q)),
    inference('UR-RESOLVE',[status(thm)],[rule_2,14926,prove_this]) ).

cnf(76534,plain,
    theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,14926,30]) ).

cnf(76846,plain,
    ~ theorem(or(q,not(and(p,q)))),
    inference('UR-RESOLVE',[status(thm)],[rule_2,76530,41]) ).

cnf(77207,plain,
    ~ theorem(implies(not(q),not(and(p,q)))),
    inference('UR-RESOLVE',[status(thm)],[rule_2,76846,62575]) ).

cnf(81234,plain,
    theorem(implies(not(X),not(and(Y,X)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,76534,819]) ).

cnf(81235,plain,
    $false,
    inference('REWRITE',[status(thm)],[77207,81234]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL250-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.32  % Computer : n018.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 600
% 0.13/0.32  % DateTime : Sun Jul  3 17:03:05 EDT 2022
% 0.13/0.32  % CPUTime  : 
% 0.18/0.43  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  * 
% 0.18/0.44  * 
% 0.18/0.44  #<PACKAGE "SNARK-USER">
% 0.18/0.44  * 
% 0.18/0.44  SNARK-TPTP-OPTIONS
% 0.18/0.44  * 
% 0.18/0.44  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.44   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.44   (USE-FACTORING :POS)
% 0.18/0.44   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.44   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.44   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.44   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.44   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.44   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.44   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.44   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.44   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.44   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.44  * 
% 0.18/0.44  "."
% 0.18/0.44  * 
% 0.18/0.44  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T17:03:05
% 0.18/0.44  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-07-03T17:03:05
% 36.77/36.94  
% 36.77/36.94  
% 36.77/36.94  #||
% 36.77/36.94  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 36.77/36.94  % SZS output start Refutation
% See solution above
% 36.77/36.94  ||#
% 36.77/36.94  
% 36.77/36.94  ; Summary of computation:
% 36.77/36.94  ;    142957 formulas have been input or derived (from 653 formulas).
% 36.77/36.94  ;     81235 (57%) were retained.  Of these,
% 36.77/36.94  ;           98 ( 0%) were simplified or subsumed later,
% 36.77/36.94  ;        81137 (100%) are still being kept.
% 36.77/36.94  ; 
% 36.77/36.94  ; Run time in seconds excluding printing time:
% 36.77/36.94  ;     0.003   0%   Read assertion file          (1 call)
% 36.77/36.94  ;     0.000   0%   Assert                       (10 calls)
% 36.77/36.94  ;    10.243  28%   Process new row              (123,122 calls)
% 36.77/36.94  ;    15.072  41%   Resolution                   (1,304 calls)
% 36.77/36.94  ;     0.737   2%   Paramodulation               (652 calls)
% 36.77/36.94  ;     0.000   0%   Condensing                   (2 calls)
% 36.77/36.94  ;     0.000   0%   Forward subsumption          (2 calls)
% 36.77/36.94  ;     0.000   0%   Backward subsumption         (2 calls)
% 36.77/36.94  ;     4.826  13%   Forward simplification       (123,120 calls)
% 36.77/36.94  ;     5.071  14%   Backward simplification      (81,234 calls)
% 36.77/36.94  ;     0.010   0%   Ordering                     (1,337 calls)
% 36.77/36.94  ;     0.000   0%   Sortal reasoning             (32 calls)
% 36.77/36.94  ;     0.000   0%   Purity testing               (1 call)
% 36.77/36.94  ;     0.531   1%   Other
% 36.77/36.94  ;    36.493        Total
% 36.77/36.94  ;    36.500        Real time
% 36.77/36.95  ; 
% 36.77/36.95  ; Term-hash-array has 172,278 terms in all.
% 36.77/36.95  ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 36.77/36.95  ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 36.77/36.95  ;  Retrieved 0 possibly forward subsuming rows in 2 calls.
% 36.77/36.95  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 36.77/36.95  ; Path-index has 172,076 entries (172,078 at peak, 172,283 added, 207 deleted).
% 36.77/36.95  ; Path-index has 58,410 nodes (58,410 at peak, 58,410 added, 0 deleted).
% 36.77/36.95  ; Trie-index has 172,076 entries (172,078 at peak, 172,283 added, 207 deleted).
% 36.77/36.95  ; Trie-index has 461,065 nodes (461,071 at peak, 461,092 added, 27 deleted).
% 36.77/36.95  ; Retrieved 1,250,158 generalization terms in 423,524 calls.
% 36.77/36.95  ; Retrieved 285,321 instance terms in 81,231 calls.
% 36.77/36.95  ; Retrieved 15,296,812 unifiable terms in 34,656 calls.
% 36.77/36.95  ; 
% 36.77/36.95  ; The agenda of rows to process has 554 entries:
% 36.77/36.95  ;    24 with value 19             14 with value 25              40 with value 31
% 36.77/36.95  ;    40 with value 20             20 with value 26              71 with value 32
% 36.77/36.95  ;    80 with value 21             14 with value 27               6 with value 33
% 36.77/36.95  ;    41 with value 22             19 with value 28               4 with value 34
% 36.77/36.95  ;    45 with value 23             33 with value 29               6 with value 37
% 36.77/36.95  ;    63 with value 24             34 with value 30
% 36.77/36.95  ; The agenda of rows to give has 80485 entries:
% 36.77/36.95  ;    21 with value (4 19)      12664 with value (4 32)          18 with value (4 45)
% 36.77/36.95  ;   123 with value (4 20)       7503 with value (4 33)          11 with value (4 46)
% 36.77/36.95  ;   544 with value (4 21)       3740 with value (4 34)          20 with value (4 47)
% 36.77/36.95  ;   712 with value (4 22)       1055 with value (4 35)          10 with value (4 48)
% 36.77/36.95  ;  1132 with value (4 23)        214 with value (4 36)           5 with value (4 49)
% 36.77/36.95  ;  1748 with value (4 24)        283 with value (4 37)           7 with value (4 50)
% 36.77/36.95  ;  2162 with value (4 25)        267 with value (4 38)           2 with value (4 51)
% 36.77/36.95  ;  3225 with value (4 26)        110 with value (4 39)           4 with value (4 52)
% 36.77/36.95  ;  4965 with value (4 27)         77 with value (4 40)          31 with value (4 53)
% 36.77/36.95  ;  6813 with value (4 28)         71 with value (4 41)           1 with value (4 55)
% 36.77/36.95  ;  8765 with value (4 29)         49 with value (4 42)           4 with value (4 56)
% 36.77/36.95  ; 12270 with value (4 30)         78 with value (4 43)           5 with value (4 59)
% 36.77/36.95  ; 11762 with value (4 31)         14 with value (4 44)
% 36.77/36.95  Evaluation took:
% 36.77/36.95    36.505 seconds of real time
% 36.77/36.95    34.90828 seconds of user run time
% 36.77/36.95    1.592329 seconds of system run time
% 36.77/36.95    [Run times include 9.004 seconds GC run time.]
% 36.77/36.95    0 calls to %EVAL
% 36.77/36.95    0 page faults and
% 36.77/36.95    1,454,371,440 bytes consed.
% 36.77/36.95  :PROOF-FOUND
% 36.77/36.95  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T17:03:41
% 36.77/36.95  :PROOF-FOUND
% 36.77/36.95  * 
%------------------------------------------------------------------------------