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

View Problem - Process Solution

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

% Computer : n008.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:14 EDT 2022

% Result   : Unsatisfiable 1.06s 1.31s
% Output   : Refutation 1.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   14 (  11 unt;   0 nHn;   6 RR)
%            Number of literals    :   19 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   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(not(not(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(20,plain,
    ~ theorem(or(not(or(q,not(p))),or(not(or(not(not(p)),q)),q))),
    inference('UR-RESOLVE',[status(thm)],[rule_3,prove_this,axiom_1_4]) ).

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(776,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(3945,plain,
    theorem(or(not(or(X,Y)),or(not(or(not(Y),X)),X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,776,axiom_1_5]) ).

cnf(3946,plain,
    $false,
    inference('REWRITE',[status(thm)],[20,3945]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL213-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul  4 09:19:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  * 
% 0.18/0.46  * 
% 0.18/0.47  #<PACKAGE "SNARK-USER">
% 0.18/0.47  * 
% 0.18/0.47  SNARK-TPTP-OPTIONS
% 0.18/0.47  * 
% 0.18/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.47   (USE-FACTORING :POS)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.47  * 
% 0.18/0.47  "."
% 0.18/0.47  * 
% 0.18/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T09:19:23
% 0.18/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-04T09:19:23
% 1.06/1.31  
% 1.06/1.31  
% 1.06/1.31  #||
% 1.06/1.31  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.06/1.31  % SZS output start Refutation
% See solution above
% 1.06/1.31  ||#
% 1.06/1.31  
% 1.06/1.31  ; Summary of computation:
% 1.06/1.31  ;      5843 formulas have been input or derived (from 252 formulas).
% 1.06/1.31  ;      3946 (68%) were retained.  Of these,
% 1.06/1.31  ;            1 ( 0%) were simplified or subsumed later,
% 1.06/1.31  ;         3945 (100%) are still being kept.
% 1.06/1.31  ; 
% 1.06/1.31  ; Run time in seconds excluding printing time:
% 1.06/1.31  ;     0.002   0%   Read assertion file          (1 call)
% 1.06/1.31  ;     0.000   0%   Assert                       (9 calls)
% 1.06/1.31  ;     0.409  49%   Process new row              (5,066 calls)
% 1.06/1.31  ;     0.137  16%   Resolution                   (502 calls)
% 1.06/1.31  ;     0.056   7%   Paramodulation               (251 calls)
% 1.06/1.31  ;     0.000   0%   Condensing                   (3 calls)
% 1.06/1.31  ;     0.000   0%   Forward subsumption          (3 calls)
% 1.06/1.31  ;     0.000   0%   Backward subsumption         (3 calls)
% 1.06/1.31  ;     0.000   0%   Clause clause subsumption    (3 calls)
% 1.06/1.31  ;     0.102  12%   Forward simplification       (5,066 calls)
% 1.06/1.31  ;     0.088  10%   Backward simplification      (3,946 calls)
% 1.06/1.31  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.06/1.31  ;     0.000   0%   Purity testing               (1 call)
% 1.06/1.31  ;     0.045   5%   Other
% 1.06/1.31  ;     0.839        Total
% 1.06/1.31  ;     0.841        Real time
% 1.06/1.31  ; 
% 1.06/1.31  ; Term-hash-array has 9,051 terms in all.
% 1.06/1.31  ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 1.06/1.31  ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 1.06/1.31  ;  Retrieved 3 possibly forward subsuming rows in 3 calls.
% 1.06/1.31  ;  Retrieved 0 possibly backward subsumed rows in 3 calls.
% 1.06/1.31  ; Path-index has 9,049 entries (9,053 at peak, 9,053 added, 4 deleted).
% 1.06/1.31  ; Path-index has 2,926 nodes (2,927 at peak, 2,927 added, 1 deleted).
% 1.06/1.31  ; Trie-index has 9,049 entries (9,053 at peak, 9,053 added, 4 deleted).
% 1.06/1.31  ; Trie-index has 23,848 nodes (23,868 at peak, 23,868 added, 20 deleted).
% 1.06/1.31  ; Retrieved 44,569 generalization terms in 5,121 calls.
% 1.06/1.31  ; Retrieved 9,240 instance terms in 3,942 calls.
% 1.06/1.31  ; Retrieved 22,471 unifiable terms in 5,273 calls.
% 1.06/1.31  ; 
% 1.06/1.31  ; The agenda of rows to process has 24 entries:
% 1.06/1.31  ;     1 with value 25              1 with value 32               2 with value 36
% 1.06/1.31  ;     2 with value 27              1 with value 33               2 with value 37
% 1.06/1.31  ;     1 with value 28              6 with value 34               1 with value 41
% 1.06/1.31  ;     5 with value 29              2 with value 35
% 1.06/1.31  ; The agenda of rows to give has 3693 entries:
% 1.06/1.31  ;    61 with value (4 21)        436 with value (4 32)           3 with value (4 43)
% 1.06/1.31  ;   108 with value (4 22)        452 with value (4 33)           1 with value (4 44)
% 1.06/1.31  ;    93 with value (4 23)        331 with value (4 34)           1 with value (4 46)
% 1.06/1.31  ;   137 with value (4 24)        188 with value (4 35)           1 with value (4 47)
% 1.06/1.31  ;   139 with value (4 25)        175 with value (4 36)           2 with value (4 48)
% 1.06/1.31  ;   150 with value (4 26)         81 with value (4 37)           1 with value (4 52)
% 1.06/1.31  ;   155 with value (4 27)         29 with value (4 38)           1 with value (4 53)
% 1.06/1.31  ;   173 with value (4 28)         44 with value (4 39)           1 with value (4 54)
% 1.06/1.31  ;   192 with value (4 29)         58 with value (4 40)           1 with value (4 56)
% 1.06/1.31  ;   279 with value (4 30)         25 with value (4 41)           1 with value (4 60)
% 1.06/1.31  ;   374 with value (4 31)
% 1.06/1.31  Evaluation took:
% 1.06/1.31    0.842 seconds of real time
% 1.06/1.31    0.800779 seconds of user run time
% 1.06/1.31    0.040723 seconds of system run time
% 1.06/1.31    [Run times include 0.07 seconds GC run time.]
% 1.06/1.31    0 calls to %EVAL
% 1.06/1.31    0 page faults and
% 1.06/1.31    58,761,816 bytes consed.
% 1.06/1.31  :PROOF-FOUND
% 1.06/1.31  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-04T09:19:24
% 1.06/1.31  :PROOF-FOUND
% 1.06/1.31  * 
%------------------------------------------------------------------------------