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

View Problem - Process Solution

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

% Computer : n021.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 : Sat Jul 16 11:37:06 EDT 2022

% Result   : Unsatisfiable 0.21s 0.57s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   7 unt;   0 nHn;   6 RR)
%            Number of literals    :    7 (   6 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    2 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

cnf(ax_glb1d_1,hypothesis,
    least_upper_bound(a,c) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_1) ).

cnf(ax_glb1d_2,hypothesis,
    least_upper_bound(b,c) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_glb1d_2) ).

cnf(prove_ax_glb1d,negated_conjecture,
    greatest_lower_bound(a,greatest_lower_bound(b,c)) != c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1d) ).

cnf(35,plain,
    greatest_lower_bound(c,b) = c,
    inference('PARAMODULATE',[status(thm)],[glb_absorbtion,ax_glb1d_2,theory(equality)]) ).

cnf(37,plain,
    greatest_lower_bound(a,c) != c,
    inference('REWRITE',[status(thm)],[prove_ax_glb1d,35,theory(equality)]) ).

cnf(38,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[glb_absorbtion,ax_glb1d_1,theory(equality)]),37]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.15  % Command  : run-snark %s %d
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Tue Jun 14 02:02:12 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.21/0.50  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.51  * 
% 0.21/0.51  * 
% 0.21/0.51  #<PACKAGE "SNARK-USER">
% 0.21/0.51  * 
% 0.21/0.51  SNARK-TPTP-OPTIONS
% 0.21/0.51  * 
% 0.21/0.51  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.51   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.51   (USE-FACTORING :POS)
% 0.21/0.51   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.51   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.51   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.51   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.51   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.51   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.51   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.51   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.51   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.51   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.51  * 
% 0.21/0.51  "."
% 0.21/0.51  * 
% 0.21/0.51  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T02:02:12
% 0.21/0.52  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-06-14T02:02:12
% 0.21/0.53  
% 0.21/0.53  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.53  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.21/0.53  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.21/0.53  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.21/0.53  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.21/0.53  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.21/0.53  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.21/0.53  ; Declaring greatest_lower_bound to be commutative.
% 0.21/0.53  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.21/0.53  ; Declaring least_upper_bound to be commutative.
% 0.21/0.57  ; Declaring least_upper_bound to be associative-commutative.
% 0.21/0.57  
% 0.21/0.57  #||
% 0.21/0.57  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.57  % SZS output start Refutation
% See solution above
% 0.21/0.57  ||#
% 0.21/0.57  
% 0.21/0.57  ; Summary of computation:
% 0.21/0.57  ;       236 formulas have been input or derived (from 15 formulas).
% 0.21/0.57  ;        38 (16%) were retained.  Of these,
% 0.21/0.57  ;            1 ( 3%) were simplified or subsumed later,
% 0.21/0.57  ;           37 (97%) are still being kept.
% 0.21/0.57  ; 
% 0.21/0.57  ; Run time in seconds:
% 0.21/0.57  ;     0.004   7%   Read assertion file          (1 call)
% 0.21/0.57  ;     0.001   2%   Assert                       (18 calls)
% 0.21/0.57  ;     0.001   2%   Process new row              (158 calls)
% 0.21/0.57  ;     0.002   4%   Resolution                   (28 calls)
% 0.21/0.57  ;     0.009  17%   Paramodulation               (14 calls)
% 0.21/0.57  ;     0.003   6%   Embedding                    (18 calls)
% 0.21/0.57  ;     0.009  17%   Forward simplification       (144 calls)
% 0.21/0.57  ;     0.001   2%   Backward simplification      (24 calls)
% 0.21/0.57  ;     0.000   0%   Ordering                     (157 calls)
% 0.21/0.57  ;     0.000   0%   Ordering ac                  (62 calls)
% 0.21/0.57  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.21/0.57  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.57  ;     0.024  44%   Other
% 0.21/0.57  ;     0.054        Total
% 0.21/0.57  ;     0.056        Real time
% 0.21/0.57  ; 
% 0.21/0.57  ; Term-hash-array has 114 terms in all.
% 0.21/0.57  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.21/0.57  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.21/0.57  ; Path-index has 116 entries (116 at peak, 118 added, 2 deleted).
% 0.21/0.57  ; Path-index has 134 nodes (134 at peak, 136 added, 2 deleted).
% 0.21/0.57  ; Trie-index has 116 entries (116 at peak, 118 added, 2 deleted).
% 0.21/0.57  ; Trie-index has 72 nodes (72 at peak, 72 added, 0 deleted).
% 0.21/0.57  ; Retrieved 2,743 generalization terms in 695 calls.
% 0.21/0.57  ; Retrieved 28 instance terms in 25 calls.
% 0.21/0.57  ; Retrieved 207 unifiable terms in 67 calls.
% 0.21/0.57  ; 
% 0.21/0.57  ; The agenda of rows to process has 71 entries:
% 0.21/0.57  ;     2 with value 8               9 with value 17               3 with value 25
% 0.21/0.57  ;     2 with value 10              3 with value 19               1 with value 26
% 0.21/0.57  ;    13 with value 11              2 with value 20               3 with value 27
% 0.21/0.57  ;     2 with value 12              6 with value 21               1 with value 29
% 0.21/0.57  ;     6 with value 13              2 with value 22               1 with value 31
% 0.21/0.57  ;    11 with value 15              2 with value 23               1 with value 33
% 0.21/0.57  ;     1 with value 16
% 0.21/0.57  ; The agenda of input rows to give has 7 entries:
% 0.21/0.57  ;     1 with value 7               1 with value 14               4 with value 16
% 0.21/0.57  ;     1 with value 10
% 0.21/0.57  ; The agenda of rows to give has 16 entries:
% 0.21/0.57  ;     2 with value (4 8)           4 with value (4 18)           2 with value (4 24)
% 0.21/0.57  ;     4 with value (4 11)          2 with value (4 21)           2 with value (4 30)
% 0.21/0.57  Evaluation took:
% 0.21/0.57    0.056 seconds of real time
% 0.21/0.57    0.04911 seconds of user run time
% 0.21/0.57    0.006937 seconds of system run time
% 0.21/0.57    0 calls to %EVAL
% 0.21/0.57    0 page faults and
% 0.21/0.57    2,849,776 bytes consed.
% 0.21/0.57  :PROOF-FOUND
% 0.21/0.57  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T02:02:12
% 0.21/0.57  :PROOF-FOUND
% 0.21/0.57  * 
%------------------------------------------------------------------------------