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

View Problem - Process Solution

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

% Computer : n017.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.50s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    4 (   4 unt;   0 nHn;   4 RR)
%            Number of literals    :    4 (   3 equ;   1 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax_glb1b_1_1,hypothesis,
    greatest_lower_bound(a,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_glb1b_1_1) ).

cnf(ax_glb1b_2_2,hypothesis,
    greatest_lower_bound(b,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_glb1b_2_2) ).

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

cnf(21,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_ax_glb1b,ax_glb1b_1_1,ax_glb1b_2_2,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP139-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 13 18:30:38 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46  * 
% 0.21/0.46  * 
% 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.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47   (USE-FACTORING :POS)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.47  * 
% 0.21/0.47  "."
% 0.21/0.47  * 
% 0.21/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:30:38
% 0.21/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-13T18:30:38
% 0.21/0.48  
% 0.21/0.49  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.49  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.21/0.49  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.21/0.49  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.21/0.49  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.21/0.49  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.21/0.49  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.21/0.49  ; Declaring greatest_lower_bound to be commutative.
% 0.21/0.49  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.21/0.49  ; Declaring least_upper_bound to be commutative.
% 0.21/0.50  ; Declaring least_upper_bound to be associative-commutative.
% 0.21/0.50  
% 0.21/0.50  #||
% 0.21/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50  % SZS output start Refutation
% See solution above
% 0.21/0.50  ||#
% 0.21/0.50  
% 0.21/0.50  ; Summary of computation:
% 0.21/0.50  ;        25 formulas have been input or derived (from 1 formulas).
% 0.21/0.50  ;        21 (84%) were retained.  Of these,
% 0.21/0.50  ;            1 ( 5%) were simplified or subsumed later,
% 0.21/0.50  ;           20 (95%) are still being kept.
% 0.21/0.50  ; 
% 0.21/0.50  ; Run time in seconds excluding printing time:
% 0.21/0.50  ;     0.003  11%   Read assertion file          (1 call)
% 0.21/0.50  ;     0.001   4%   Assert                       (18 calls)
% 0.21/0.50  ;     0.003  11%   Process new row              (24 calls)
% 0.21/0.50  ;     0.000   0%   Embedding                    (10 calls)
% 0.21/0.50  ;     0.000   0%   Forward simplification       (18 calls)
% 0.21/0.50  ;     0.000   0%   Backward simplification      (14 calls)
% 0.21/0.50  ;     0.000   0%   Ordering                     (26 calls)
% 0.21/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.21/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.50  ;     0.021  75%   Other
% 0.21/0.50  ;     0.028        Total
% 0.21/0.50  ;     0.029        Real time
% 0.21/0.50  ; 
% 0.21/0.50  ; Term-hash-array has 54 terms in all.
% 0.21/0.50  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.21/0.50  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.21/0.50  ; Path-index has 58 entries (58 at peak, 58 added, 0 deleted).
% 0.21/0.50  ; Path-index has 105 nodes (105 at peak, 105 added, 0 deleted).
% 0.21/0.50  ; Trie-index has 58 entries (58 at peak, 58 added, 0 deleted).
% 0.21/0.50  ; Trie-index has 66 nodes (66 at peak, 66 added, 0 deleted).
% 0.21/0.50  ; Retrieved 29 generalization terms in 43 calls.
% 0.21/0.50  ; Retrieved 15 instance terms in 15 calls.
% 0.21/0.50  ; 
% 0.21/0.50  ; The agenda of input rows to give has 19 entries:
% 0.21/0.50  ;     9 with value 7               4 with value 10               4 with value 16
% 0.21/0.50  ;     1 with value 9               1 with value 14
% 0.21/0.50  Evaluation took:
% 0.21/0.50    0.03 seconds of real time
% 0.21/0.50    0.02084 seconds of user run time
% 0.21/0.50    0.008413 seconds of system run time
% 0.21/0.50    0 calls to %EVAL
% 0.21/0.50    0 page faults and
% 0.21/0.50    1,485,648 bytes consed.
% 0.21/0.50  :PROOF-FOUND
% 0.21/0.50  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T18:30:38
% 0.21/0.50  :PROOF-FOUND
% 0.21/0.50  * 
%------------------------------------------------------------------------------