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

View Problem - Process Solution

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

% Computer : n014.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:15 EDT 2022

% Result   : Unsatisfiable 2.92s 3.16s
% Output   : Refutation 2.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (  12 unt;   0 nHn;   7 RR)
%            Number of literals    :   20 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

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

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

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

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

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

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

cnf(rule_3,axiom,
    ( theorem(or(not(X),Y))
    | ~ axiom(or(not(X),Z))
    | ~ theorem(or(not(Z),Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(or(not(p),q)),or(not(or(p,q)),q))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

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

cnf(17,plain,
    ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q))),
    inference('UR-RESOLVE',[status(thm)],[rule_2,prove_this,axiom_1_5]) ).

cnf(38,plain,
    theorem(or(not(or(X,or(Y,Y))),or(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,11,axiom_1_6]) ).

cnf(1189,plain,
    theorem(or(not(or(not(X),Y)),or(not(or(Y,X)),Y))),
    inference('HYPERRESOLVE',[status(thm)],[rule_3,38,axiom_1_6]) ).

cnf(4786,plain,
    ~ theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))),
    inference('UR-RESOLVE',[status(thm)],[rule_3,17,axiom_1_4]) ).

cnf(13408,plain,
    theorem(or(not(or(X,Y)),or(not(or(not(Y),X)),X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,1189,axiom_1_5]) ).

cnf(13409,plain,
    $false,
    inference('REWRITE',[status(thm)],[4786,13408]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : LCL215-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12  % Command  : run-snark %s %d
% 0.12/0.32  % Computer : n014.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon Jul  4 18:46:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44  * 
% 0.18/0.44  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45   (USE-FACTORING :POS)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45  * 
% 0.18/0.45  "."
% 0.18/0.45  * 
% 0.18/0.45  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T18:46:54
% 0.18/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-04T18:46:54
% 2.92/3.16  
% 2.92/3.16  
% 2.92/3.16  #||
% 2.92/3.16  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.92/3.16  % SZS output start Refutation
% See solution above
% 2.92/3.16  ||#
% 2.92/3.16  
% 2.92/3.16  ; Summary of computation:
% 2.92/3.16  ;     15467 formulas have been input or derived (from 362 formulas).
% 2.92/3.16  ;     13409 (87%) were retained.  Of these,
% 2.92/3.16  ;            1 ( 0%) were simplified or subsumed later,
% 2.92/3.16  ;        13408 (100%) are still being kept.
% 2.92/3.16  ; 
% 2.92/3.16  ; Run time in seconds excluding printing time:
% 3.06/3.23  ;     0.002   0%   Read assertion file          (1 call)
% 3.06/3.23  ;     0.000   0%   Assert                       (9 calls)
% 3.06/3.23  ;     1.289  48%   Process new row              (14,647 calls)
% 3.06/3.23  ;     0.453  17%   Resolution                   (722 calls)
% 3.06/3.23  ;     0.122   5%   Paramodulation               (361 calls)
% 3.06/3.23  ;     0.000   0%   Condensing                   (3 calls)
% 3.06/3.23  ;     0.000   0%   Forward subsumption          (3 calls)
% 3.06/3.23  ;     0.000   0%   Backward subsumption         (3 calls)
% 3.06/3.23  ;     0.000   0%   Clause clause subsumption    (3 calls)
% 3.06/3.23  ;     0.351  13%   Forward simplification       (14,647 calls)
% 3.06/3.23  ;     0.411  15%   Backward simplification      (13,409 calls)
% 3.06/3.23  ;     0.001   0%   Sortal reasoning             (32 calls)
% 3.06/3.23  ;     0.000   0%   Purity testing               (1 call)
% 3.06/3.23  ;     0.082   3%   Other
% 3.06/3.23  ;     2.711        Total
% 3.06/3.23  ;     2.782        Real time
% 3.06/3.23  ; 
% 3.06/3.23  ; Term-hash-array has 28,188 terms in all.
% 3.06/3.23  ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 3.06/3.23  ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 3.06/3.23  ;  Retrieved 3 possibly forward subsuming rows in 3 calls.
% 3.06/3.23  ;  Retrieved 0 possibly backward subsumed rows in 3 calls.
% 3.06/3.23  ; Path-index has 28,188 entries (28,190 at peak, 28,190 added, 2 deleted).
% 3.06/3.23  ; Path-index has 3,285 nodes (3,285 at peak, 3,285 added, 0 deleted).
% 3.06/3.23  ; Trie-index has 28,188 entries (28,190 at peak, 28,190 added, 2 deleted).
% 3.06/3.23  ; Trie-index has 59,120 nodes (59,131 at peak, 59,131 added, 11 deleted).
% 3.06/3.23  ; Retrieved 120,981 generalization terms in 14,702 calls.
% 3.06/3.23  ; Retrieved 27,666 instance terms in 13,405 calls.
% 3.06/3.23  ; Retrieved 68,998 unifiable terms in 11,373 calls.
% 3.06/3.23  ; 
% 3.06/3.23  ; The agenda of rows to process has 74 entries:
% 3.06/3.23  ;     1 with value 25              2 with value 31              13 with value 36
% 3.06/3.23  ;     2 with value 27              4 with value 32               9 with value 37
% 3.06/3.23  ;     1 with value 28              5 with value 33               6 with value 38
% 3.06/3.23  ;     5 with value 29             11 with value 34               1 with value 39
% 3.06/3.23  ;     1 with value 30             13 with value 35
% 3.06/3.23  ; The agenda of rows to give has 13046 entries:
% 3.06/3.23  ;    84 with value (4 21)       1477 with value (4 31)           1 with value (4 41)
% 3.06/3.23  ;   140 with value (4 22)       1753 with value (4 32)           2 with value (4 42)
% 3.06/3.23  ;   145 with value (4 23)       1824 with value (4 33)           4 with value (4 43)
% 3.06/3.23  ;   200 with value (4 24)       1546 with value (4 34)           3 with value (4 44)
% 3.06/3.23  ;   212 with value (4 25)       1130 with value (4 35)           3 with value (4 46)
% 3.06/3.23  ;   302 with value (4 26)        654 with value (4 36)           2 with value (4 48)
% 3.06/3.23  ;   367 with value (4 27)        471 with value (4 37)           1 with value (4 50)
% 3.06/3.23  ;   536 with value (4 28)        234 with value (4 38)           1 with value (4 52)
% 3.06/3.23  ;   780 with value (4 29)         40 with value (4 39)           1 with value (4 53)
% 3.06/3.23  ;  1127 with value (4 30)          5 with value (4 40)           1 with value (4 60)
% 3.06/3.23  Evaluation took:
% 3.06/3.23    2.783 seconds of real time
% 3.06/3.23    2.626532 seconds of user run time
% 3.06/3.23    0.154802 seconds of system run time
% 3.06/3.23    [Run times include 0.446 seconds GC run time.]
% 3.06/3.23    0 calls to %EVAL
% 3.06/3.23    0 page faults and
% 3.06/3.23    188,902,032 bytes consed.
% 3.06/3.23  :PROOF-FOUND
% 3.06/3.23  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T18:46:56
% 3.06/3.23  :PROOF-FOUND
% 3.06/3.23  * 
%------------------------------------------------------------------------------