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

View Problem - Process Solution

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

% Computer : n029.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:04 EDT 2022

% Result   : Unsatisfiable 3.08s 3.27s
% Output   : Refutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   13 (  10 unt;   0 nHn;   7 RR)
%            Number of literals    :   18 (   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   :   20 (   4 sgn)

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

cnf(axiom_1_4,axiom,
    axiom(or(not(or(X,Y)),or(Y,X))),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

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

cnf(rule_2,axiom,
    ( theorem(X)
    | ~ axiom(or(not(Y),X))
    | ~ theorem(Y) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).

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

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

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

cnf(139,plain,
    theorem(or(not(X),or(X,Y))),
    inference('HYPERRESOLVE',[status(thm)],[rule_3,12,axiom_1_3]) ).

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

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

cnf(13024,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[rule_3,1348,axiom_1_4,157]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL201-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 13:59:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T13:59:41
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-03T13:59:41
% 3.08/3.27  
% 3.08/3.27  
% 3.08/3.27  #||
% 3.08/3.27  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.08/3.27  % SZS output start Refutation
% See solution above
% 3.08/3.27  ||#
% 3.08/3.27  
% 3.08/3.27  ; Summary of computation:
% 3.08/3.27  ;     15278 formulas have been input or derived (from 390 formulas).
% 3.08/3.27  ;     13024 (85%) were retained.  Of these,
% 3.08/3.27  ;            2 ( 0%) were simplified or subsumed later,
% 3.08/3.27  ;        13022 (100%) are still being kept.
% 3.08/3.27  ; 
% 3.08/3.27  ; Run time in seconds excluding printing time:
% 3.08/3.27  ;     0.002   0%   Read assertion file          (1 call)
% 3.08/3.27  ;     0.001   0%   Assert                       (9 calls)
% 3.08/3.27  ;     1.343  48%   Process new row              (14,324 calls)
% 3.08/3.27  ;     0.436  16%   Resolution                   (778 calls)
% 3.08/3.27  ;     0.130   5%   Paramodulation               (389 calls)
% 3.08/3.27  ;     0.000   0%   Condensing                   (3 calls)
% 3.08/3.27  ;     0.000   0%   Forward subsumption          (3 calls)
% 3.08/3.27  ;     0.000   0%   Backward subsumption         (3 calls)
% 3.08/3.27  ;     0.000   0%   Clause clause subsumption    (3 calls)
% 3.08/3.27  ;     0.343  12%   Forward simplification       (14,324 calls)
% 3.08/3.27  ;     0.425  15%   Backward simplification      (13,024 calls)
% 3.08/3.27  ;     0.000   0%   Sortal reasoning             (32 calls)
% 3.08/3.27  ;     0.000   0%   Purity testing               (1 call)
% 3.08/3.27  ;     0.101   4%   Other
% 3.08/3.27  ;     2.781        Total
% 3.08/3.27  ;     2.795        Real time
% 3.08/3.27  ; 
% 3.08/3.27  ; Term-hash-array has 27,302 terms in all.
% 3.08/3.27  ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 3.08/3.27  ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 3.08/3.27  ;  Retrieved 3 possibly forward subsuming rows in 3 calls.
% 3.08/3.27  ;  Retrieved 0 possibly backward subsumed rows in 3 calls.
% 3.08/3.27  ; Path-index has 27,302 entries (27,302 at peak, 27,305 added, 3 deleted).
% 3.08/3.27  ; Path-index has 3,372 nodes (3,372 at peak, 3,372 added, 0 deleted).
% 3.08/3.27  ; Trie-index has 27,302 entries (27,302 at peak, 27,305 added, 3 deleted).
% 3.08/3.27  ; Trie-index has 56,075 nodes (56,075 at peak, 56,075 added, 0 deleted).
% 3.08/3.27  ; Retrieved 119,989 generalization terms in 14,379 calls.
% 3.08/3.27  ; Retrieved 26,920 instance terms in 13,020 calls.
% 3.08/3.27  ; Retrieved 68,771 unifiable terms in 12,313 calls.
% 3.08/3.27  ; 
% 3.08/3.27  ; The agenda of rows to process has 214 entries:
% 3.08/3.27  ;     1 with value 11              1 with value 25              25 with value 35
% 3.08/3.27  ;     1 with value 14              1 with value 26              38 with value 36
% 3.08/3.27  ;     3 with value 16              3 with value 27              54 with value 37
% 3.08/3.27  ;     1 with value 17              1 with value 29              32 with value 38
% 3.08/3.27  ;     1 with value 19              1 with value 30               1 with value 39
% 3.08/3.27  ;     1 with value 20              8 with value 31               1 with value 42
% 3.08/3.27  ;     2 with value 21              4 with value 32               1 with value 43
% 3.08/3.27  ;     6 with value 22              9 with value 33               1 with value 48
% 3.08/3.27  ;     2 with value 24             14 with value 34               1 with value 50
% 3.08/3.27  ; The agenda of rows to give has 12632 entries:
% 3.08/3.27  ;    83 with value (4 21)       1393 with value (4 31)           3 with value (4 41)
% 3.08/3.27  ;   149 with value (4 22)       1556 with value (4 32)           2 with value (4 42)
% 3.08/3.27  ;   142 with value (4 23)       1682 with value (4 33)           4 with value (4 43)
% 3.08/3.27  ;   218 with value (4 24)       1606 with value (4 34)           1 with value (4 44)
% 3.08/3.27  ;   257 with value (4 25)       1135 with value (4 35)           2 with value (4 46)
% 3.08/3.27  ;   327 with value (4 26)        701 with value (4 36)           2 with value (4 48)
% 3.08/3.27  ;   453 with value (4 27)        290 with value (4 37)           1 with value (4 52)
% 3.08/3.27  ;   607 with value (4 28)        120 with value (4 38)           1 with value (4 53)
% 3.08/3.27  ;   779 with value (4 29)         28 with value (4 39)           1 with value (4 60)
% 3.08/3.27  ;  1081 with value (4 30)          8 with value (4 40)
% 3.08/3.27  Evaluation took:
% 3.08/3.27    2.797 seconds of real time
% 3.08/3.27    2.620367 seconds of user run time
% 3.08/3.27    0.163829 seconds of system run time
% 3.08/3.27    [Run times include 0.408 seconds GC run time.]
% 3.08/3.27    0 calls to %EVAL
% 3.08/3.27    0 page faults and
% 3.08/3.27    180,798,600 bytes consed.
% 3.08/3.27  :PROOF-FOUND
% 3.08/3.27  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T13:59:44
% 3.08/3.27  :PROOF-FOUND
% 3.08/3.27  * 
%------------------------------------------------------------------------------