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

View Problem - Process Solution

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

% Computer : n011.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:17 EDT 2022

% Result   : Unsatisfiable 1.29s 1.48s
% Output   : Refutation 1.29s
% 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    :    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/sandbox2/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/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(axiom_1_6,axiom,
    axiom(or(not(or(not(X),Y)),or(not(or(Z,X)),or(Z,Y)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

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(or(not(p),q)),or(not(or(not(p),not(q))),not(p)))),
    file('/export/starexec/sandbox2/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(not(p),not(q))),or(not(or(not(p),q)),not(p)))),
    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(791,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(4961,plain,
    theorem(or(not(or(X,not(Y))),or(not(or(X,Y)),X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_3,791,axiom_1_4]) ).

cnf(4962,plain,
    $false,
    inference('REWRITE',[status(thm)],[17,4961]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL217-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n011.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 18:21:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 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/sandbox2/benchmark/theBenchmark.p 2022-07-03T18:21:21
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-07-03T18:21:21
% 1.29/1.48  
% 1.29/1.48  
% 1.29/1.48  #||
% 1.29/1.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.29/1.48  % SZS output start Refutation
% See solution above
% 1.29/1.48  ||#
% 1.29/1.48  
% 1.29/1.48  ; Summary of computation:
% 1.29/1.48  ;      6899 formulas have been input or derived (from 253 formulas).
% 1.29/1.48  ;      4962 (72%) were retained.  Of these,
% 1.29/1.48  ;            1 ( 0%) were simplified or subsumed later,
% 1.29/1.48  ;         4961 (100%) are still being kept.
% 1.29/1.48  ; 
% 1.29/1.48  ; Run time in seconds excluding printing time:
% 1.29/1.48  ;     0.002   0%   Read assertion file          (1 call)
% 1.29/1.48  ;     0.001   0%   Assert                       (9 calls)
% 1.29/1.48  ;     0.461  46%   Process new row              (6,120 calls)
% 1.29/1.48  ;     0.152  15%   Resolution                   (504 calls)
% 1.29/1.48  ;     0.062   6%   Paramodulation               (252 calls)
% 1.29/1.48  ;     0.000   0%   Condensing                   (3 calls)
% 1.29/1.48  ;     0.000   0%   Forward subsumption          (3 calls)
% 1.29/1.48  ;     0.000   0%   Backward subsumption         (3 calls)
% 1.29/1.48  ;     0.000   0%   Clause clause subsumption    (3 calls)
% 1.29/1.48  ;     0.157  16%   Forward simplification       (6,120 calls)
% 1.29/1.48  ;     0.133  13%   Backward simplification      (4,962 calls)
% 1.29/1.48  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.29/1.48  ;     0.000   0%   Purity testing               (1 call)
% 1.29/1.48  ;     0.040   4%   Other
% 1.29/1.48  ;     1.008        Total
% 1.29/1.48  ;     1.009        Real time
% 1.29/1.48  ; 
% 1.29/1.48  ; Term-hash-array has 11,152 terms in all.
% 1.29/1.48  ; Feature-vector-row-index has 3 entries (3 at peak, 3 added, 0 deleted).
% 1.29/1.48  ; Feature-vector-row-index has 15 nodes (15 at peak, 15 added, 0 deleted).
% 1.29/1.48  ;  Retrieved 3 possibly forward subsuming rows in 3 calls.
% 1.29/1.48  ;  Retrieved 0 possibly backward subsumed rows in 3 calls.
% 1.29/1.48  ; Path-index has 11,152 entries (11,154 at peak, 11,154 added, 2 deleted).
% 1.29/1.48  ; Path-index has 3,047 nodes (3,047 at peak, 3,047 added, 0 deleted).
% 1.29/1.48  ; Trie-index has 11,152 entries (11,154 at peak, 11,154 added, 2 deleted).
% 1.29/1.48  ; Trie-index has 28,848 nodes (28,859 at peak, 28,859 added, 11 deleted).
% 1.29/1.48  ; Retrieved 52,002 generalization terms in 6,175 calls.
% 1.29/1.48  ; Retrieved 11,187 instance terms in 4,958 calls.
% 1.29/1.48  ; Retrieved 28,460 unifiable terms in 5,722 calls.
% 1.29/1.48  ; 
% 1.29/1.48  ; The agenda of rows to process has 34 entries:
% 1.29/1.48  ;     4 with value 22              4 with value 29               6 with value 35
% 1.29/1.48  ;     1 with value 23              1 with value 31               1 with value 36
% 1.29/1.48  ;     1 with value 25              1 with value 32               4 with value 37
% 1.29/1.48  ;     1 with value 27              2 with value 33               3 with value 38
% 1.29/1.48  ;     2 with value 28              2 with value 34               1 with value 41
% 1.29/1.48  ; The agenda of rows to give has 4708 entries:
% 1.29/1.48  ;    72 with value (4 21)        504 with value (4 33)           2 with value (4 44)
% 1.29/1.48  ;   107 with value (4 22)        505 with value (4 34)           1 with value (4 45)
% 1.29/1.48  ;    93 with value (4 23)        402 with value (4 35)           1 with value (4 46)
% 1.29/1.48  ;   130 with value (4 24)        350 with value (4 36)           1 with value (4 48)
% 1.29/1.48  ;   126 with value (4 25)        181 with value (4 37)           1 with value (4 49)
% 1.29/1.48  ;   130 with value (4 26)         72 with value (4 38)           1 with value (4 50)
% 1.29/1.48  ;   170 with value (4 27)         49 with value (4 39)           1 with value (4 52)
% 1.29/1.48  ;   213 with value (4 28)         58 with value (4 40)           1 with value (4 53)
% 1.29/1.48  ;   237 with value (4 29)         34 with value (4 41)           1 with value (4 57)
% 1.29/1.48  ;   359 with value (4 30)          1 with value (4 42)           1 with value (4 59)
% 1.29/1.48  ;   461 with value (4 31)          5 with value (4 43)           1 with value (4 60)
% 1.29/1.48  ;   437 with value (4 32)
% 1.29/1.48  Evaluation took:
% 1.29/1.48    1.01 seconds of real time
% 1.29/1.48    0.949704 seconds of user run time
% 1.29/1.48    0.060329 seconds of system run time
% 1.29/1.48    [Run times include 0.119 seconds GC run time.]
% 1.29/1.48    0 calls to %EVAL
% 1.29/1.48    0 page faults and
% 1.29/1.48    72,034,296 bytes consed.
% 1.29/1.48  :PROOF-FOUND
% 1.29/1.48  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-03T18:21:22
% 1.29/1.48  :PROOF-FOUND
% 1.29/1.48  * 
%------------------------------------------------------------------------------