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

View Problem - Process Solution

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

% Computer : n020.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:31 EDT 2022

% Result   : Unsatisfiable 39.03s 39.28s
% Output   : Refutation 39.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   34 (  32 unt;   0 nHn;   5 RR)
%            Number of literals    :   37 (   4 equ;   5 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   66 (   7 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_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(and(p,q),and(q,p))),
    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(20,plain,
    implies(implies(X,not(Y)),Z) = or(and(X,Y),Z),
    inference('PARAMODULATE',[status(thm)],[implies_definition,10,theory(equality)]) ).

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(45,plain,
    theorem(implies(implies(X,Y),or(Y,not(X)))),
    inference('PARAMODULATE',[status(thm)],[14,implies_definition,theory(equality)]) ).

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

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

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

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

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

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

cnf(275,plain,
    theorem(or(implies(X,not(Y)),and(Y,X))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,10,theory(equality)]),implies_definition,theory(equality)]) ).

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

cnf(437,plain,
    ~ theorem(implies(and(p,q),implies(implies(q,not(p)),and(q,p)))),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[rule_2,216,prove_this]),20,theory(equality)]) ).

cnf(455,plain,
    theorem(implies(X,not(not(X)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,431,93]) ).

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

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

cnf(7319,plain,
    theorem(implies(or(X,Y),or(implies(Z,Y),X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,2055,201]) ).

cnf(7506,plain,
    theorem(or(implies(X,and(Y,Z)),implies(Z,not(Y)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,7319,275]) ).

cnf(71217,plain,
    theorem(implies(or(X,Y),implies(not(Y),X))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,506,2055]),implies_definition,theory(equality)]) ).

cnf(71744,plain,
    theorem(implies(and(X,Y),implies(Z,and(Y,X)))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,71217,7506]),10,theory(equality)]) ).

cnf(71745,plain,
    $false,
    inference('REWRITE',[status(thm)],[437,71744]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL238-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul  3 16:00:30 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T16:00:30
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-03T16:00:30
% 39.03/39.28  
% 39.03/39.28  
% 39.03/39.28  #||
% 39.03/39.28  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 39.03/39.28  % SZS output start Refutation
% See solution above
% 39.03/39.28  ||#
% 39.03/39.28  
% 39.03/39.28  ; Summary of computation:
% 39.03/39.28  ;    175315 formulas have been input or derived (from 649 formulas).
% 39.03/39.28  ;     71745 (41%) were retained.  Of these,
% 39.03/39.28  ;           59 ( 0%) were simplified or subsumed later,
% 39.03/39.28  ;        71686 (100%) are still being kept.
% 39.03/39.28  ; 
% 39.03/39.28  ; Run time in seconds excluding printing time:
% 39.03/39.28  ;     0.002   0%   Read assertion file          (1 call)
% 39.03/39.28  ;     0.000   0%   Assert                       (10 calls)
% 39.03/39.28  ;    10.907  28%   Process new row              (145,435 calls)
% 39.03/39.28  ;    18.380  47%   Resolution                   (1,296 calls)
% 39.03/39.28  ;     1.037   3%   Paramodulation               (648 calls)
% 39.03/39.28  ;     0.000   0%   Condensing                   (2 calls)
% 39.03/39.28  ;     0.000   0%   Forward subsumption          (2 calls)
% 39.03/39.28  ;     0.000   0%   Backward subsumption         (2 calls)
% 39.03/39.28  ;     3.626   9%   Forward simplification       (145,431 calls)
% 39.03/39.28  ;     4.147  11%   Backward simplification      (71,744 calls)
% 39.03/39.28  ;     0.006   0%   Ordering                     (1,707 calls)
% 39.03/39.28  ;     0.002   0%   Sortal reasoning             (32 calls)
% 39.03/39.28  ;     0.000   0%   Purity testing               (1 call)
% 39.03/39.28  ;     0.694   2%   Other
% 39.03/39.28  ;    38.801        Total
% 39.03/39.28  ;    38.803        Real time
% 39.12/39.29  ; 
% 39.12/39.29  ; Term-hash-array has 160,330 terms in all.
% 39.12/39.29  ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 39.12/39.29  ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 39.12/39.29  ;  Retrieved 0 possibly forward subsuming rows in 2 calls.
% 39.12/39.29  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 39.12/39.29  ; Path-index has 160,214 entries (160,224 at peak, 160,344 added, 130 deleted).
% 39.12/39.29  ; Path-index has 95,220 nodes (95,220 at peak, 95,220 added, 0 deleted).
% 39.12/39.29  ; Trie-index has 160,214 entries (160,224 at peak, 160,344 added, 130 deleted).
% 39.12/39.29  ; Trie-index has 566,739 nodes (566,795 at peak, 566,816 added, 77 deleted).
% 39.12/39.29  ; Retrieved 1,119,039 generalization terms in 409,219 calls.
% 39.12/39.29  ; Retrieved 267,430 instance terms in 71,741 calls.
% 39.12/39.29  ; Retrieved 18,650,309 unifiable terms in 26,775 calls.
% 39.12/39.29  ; 
% 39.12/39.29  ; The agenda of rows to process has 320 entries:
% 39.12/39.29  ;    64 with value 25             24 with value 30              13 with value 35
% 39.12/39.29  ;    41 with value 26             37 with value 31               9 with value 36
% 39.12/39.29  ;    63 with value 27             12 with value 32               4 with value 37
% 39.12/39.29  ;    13 with value 28              8 with value 33               1 with value 41
% 39.12/39.29  ;    19 with value 29             11 with value 34               1 with value 50
% 39.12/39.29  ; The agenda of rows to give has 71039 entries:
% 39.12/39.29  ;     1 with value (4 19)       3889 with value (4 35)          37 with value (4 51)
% 39.12/39.29  ;     2 with value (4 20)       1637 with value (4 36)         105 with value (4 53)
% 39.12/39.29  ;   434 with value (4 21)        967 with value (4 37)          79 with value (4 54)
% 39.12/39.29  ;   746 with value (4 22)        649 with value (4 38)           2 with value (4 55)
% 39.12/39.29  ;  1206 with value (4 23)        315 with value (4 39)           5 with value (4 56)
% 39.12/39.29  ;  1844 with value (4 24)        233 with value (4 40)          36 with value (4 57)
% 39.12/39.29  ;  2078 with value (4 25)        257 with value (4 41)          31 with value (4 58)
% 39.12/39.29  ;  3100 with value (4 26)        214 with value (4 42)           1 with value (4 59)
% 39.12/39.29  ;  4254 with value (4 27)         61 with value (4 43)          12 with value (4 60)
% 39.12/39.29  ;  4460 with value (4 28)        162 with value (4 44)          25 with value (4 61)
% 39.12/39.29  ;  5917 with value (4 29)        129 with value (4 45)          36 with value (4 62)
% 39.12/39.29  ;  7582 with value (4 30)         44 with value (4 46)           2 with value (4 65)
% 39.12/39.29  ;  7612 with value (4 31)         51 with value (4 47)           6 with value (4 66)
% 39.12/39.29  ;  9271 with value (4 32)         47 with value (4 48)           3 with value (4 67)
% 39.12/39.29  ;  7965 with value (4 33)         49 with value (4 49)           3 with value (4 69)
% 39.12/39.29  ;  5414 with value (4 34)         64 with value (4 50)           2 with value (4 70)
% 39.12/39.29  Evaluation took:
% 39.12/39.29    38.811 seconds of real time
% 39.12/39.29    37.202488 seconds of user run time
% 39.12/39.29    1.608069 seconds of system run time
% 39.12/39.29    [Run times include 9.507 seconds GC run time.]
% 39.12/39.29    0 calls to %EVAL
% 39.12/39.29    0 page faults and
% 39.12/39.29    1,442,427,288 bytes consed.
% 39.12/39.29  :PROOF-FOUND
% 39.12/39.29  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T16:01:09
% 39.12/39.29  :PROOF-FOUND
% 39.12/39.29  * 
%------------------------------------------------------------------------------