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

View Problem - Process Solution

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

% Computer : n015.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:22:02 EDT 2022

% Result   : Unsatisfiable 0.41s 0.58s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   25 (  23 unt;   0 nHn;   6 RR)
%            Number of literals    :   28 (   4 equ;   6 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    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   37 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
    axiom(implies(or(X,X),X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).

cnf(axiom_1_3,axiom,
    axiom(implies(X,or(Y,X))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).

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

cnf(implies_definition,axiom,
    implies(X,Y) = or(not(X),Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

cnf(rule_2,axiom,
    ( theorem(X)
    | ~ theorem(implies(Y,X))
    | ~ theorem(Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).

cnf(and_defn,axiom,
    and(X,Y) = not(or(not(X),not(Y))),
    file('/export/starexec/sandbox2/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(equivalent_defn,axiom,
    equivalent(X,Y) = and(implies(X,Y),implies(Y,X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

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

cnf(13,plain,
    ~ theorem(equivalent(and(not(p),q),and(not(p),q))),
    inference('REWRITE',[status(thm)],[prove_this,10,theory(equality)]) ).

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

cnf(15,plain,
    theorem(implies(X,or(Y,X))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_3]) ).

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

cnf(27,plain,
    theorem(implies(implies(X,Y),implies(or(Z,X),or(Z,Y)))),
    inference('HYPERRESOLVE',[status(thm)],[rule_1,axiom_1_6]) ).

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

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

cnf(79,plain,
    theorem(implies(X,and(X,X))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_2,41,29]),implies_definition,10,theory(equality)]) ).

cnf(86,plain,
    theorem(implies(implies(X,X),equivalent(X,X))),
    inference('PARAMODULATE',[status(thm)],[79,equivalent_defn,theory(equality)]) ).

cnf(136,plain,
    ~ theorem(implies(and(not(p),q),and(not(p),q))),
    inference('UR-RESOLVE',[status(thm)],[rule_2,86,13]) ).

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

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

cnf(296,plain,
    theorem(implies(X,X)),
    inference('HYPERRESOLVE',[status(thm)],[rule_2,210,15]) ).

cnf(297,plain,
    $false,
    inference('REWRITE',[status(thm)],[136,296]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL301-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n015.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul  4 17:48:02 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 0.21/0.47  #<PACKAGE "SNARK-USER">
% 0.21/0.47  * 
% 0.21/0.47  SNARK-TPTP-OPTIONS
% 0.21/0.47  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T17:48:02
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-04T17:48:02
% 0.41/0.58  
% 0.41/0.58  
% 0.41/0.58  #||
% 0.41/0.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.58  % SZS output start Refutation
% See solution above
% 0.41/0.58  ||#
% 0.41/0.58  
% 0.41/0.58  ; Summary of computation:
% 0.41/0.58  ;      1391 formulas have been input or derived (from 63 formulas).
% 0.41/0.58  ;       297 (21%) were retained.  Of these,
% 0.41/0.58  ;            5 ( 2%) were simplified or subsumed later,
% 0.41/0.58  ;          292 (98%) are still being kept.
% 0.41/0.58  ; 
% 0.41/0.58  ; Run time in seconds excluding printing time:
% 0.41/0.58  ;     0.003   3%   Read assertion file          (1 call)
% 0.41/0.58  ;     0.001   1%   Assert                       (11 calls)
% 0.41/0.58  ;     0.039  36%   Process new row              (955 calls)
% 0.41/0.58  ;     0.017  16%   Resolution                   (124 calls)
% 0.41/0.58  ;     0.005   5%   Paramodulation               (62 calls)
% 0.41/0.58  ;     0.000   0%   Condensing                   (2 calls)
% 0.41/0.58  ;     0.000   0%   Forward subsumption          (2 calls)
% 0.41/0.58  ;     0.000   0%   Backward subsumption         (2 calls)
% 0.41/0.58  ;     0.010   9%   Forward simplification       (955 calls)
% 0.41/0.58  ;     0.003   3%   Backward simplification      (295 calls)
% 0.41/0.58  ;     0.000   0%   Ordering                     (138 calls)
% 0.41/0.58  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.41/0.58  ;     0.000   0%   Purity testing               (1 call)
% 0.41/0.58  ;     0.029  27%   Other
% 0.41/0.58  ;     0.107        Total
% 0.41/0.58  ;     0.108        Real time
% 0.41/0.58  ; 
% 0.41/0.58  ; Term-hash-array has 753 terms in all.
% 0.41/0.58  ; Feature-vector-row-index has 2 entries (2 at peak, 2 added, 0 deleted).
% 0.41/0.58  ; Feature-vector-row-index has 6 nodes (6 at peak, 6 added, 0 deleted).
% 0.41/0.58  ;  Retrieved 0 possibly forward subsuming rows in 2 calls.
% 0.41/0.58  ;  Retrieved 0 possibly backward subsumed rows in 2 calls.
% 0.41/0.58  ; Path-index has 749 entries (750 at peak, 755 added, 6 deleted).
% 0.41/0.58  ; Path-index has 3,200 nodes (3,204 at peak, 3,222 added, 22 deleted).
% 0.41/0.58  ; Trie-index has 749 entries (750 at peak, 755 added, 6 deleted).
% 0.41/0.58  ; Trie-index has 4,225 nodes (4,233 at peak, 4,278 added, 53 deleted).
% 0.41/0.58  ; Retrieved 1,293 generalization terms in 2,072 calls.
% 0.41/0.58  ; Retrieved 459 instance terms in 292 calls.
% 0.41/0.58  ; Retrieved 6,378 unifiable terms in 648 calls.
% 0.41/0.58  ; 
% 0.41/0.58  ; The agenda of rows to process has 37 entries:
% 0.41/0.58  ;     8 with value 13              6 with value 18               1 with value 23
% 0.41/0.58  ;     1 with value 14              1 with value 20               1 with value 27
% 0.41/0.58  ;     6 with value 15              7 with value 21               2 with value 29
% 0.41/0.58  ;     4 with value 16
% 0.41/0.58  ; The agenda of rows to give has 229 entries:
% 0.41/0.58  ;     1 with value (4 10)         10 with value (4 22)          12 with value (4 27)
% 0.41/0.58  ;     6 with value (4 17)         11 with value (4 23)          12 with value (4 28)
% 0.41/0.58  ;    22 with value (4 18)         10 with value (4 24)          22 with value (4 29)
% 0.41/0.58  ;    21 with value (4 19)         19 with value (4 25)           2 with value (4 33)
% 0.41/0.58  ;    33 with value (4 20)         11 with value (4 26)           1 with value (4 39)
% 0.41/0.58  ;    36 with value (4 21)
% 0.41/0.58  Evaluation took:
% 0.41/0.58    0.109 seconds of real time
% 0.41/0.58    0.098797 seconds of user run time
% 0.41/0.59    0.00996 seconds of system run time
% 0.41/0.59    0 calls to %EVAL
% 0.41/0.59    0 page faults and
% 0.41/0.59    7,455,496 bytes consed.
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-04T17:48:02
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  * 
%------------------------------------------------------------------------------