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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Sat Jul 16 11:37:08 EDT 2022

% Result   : Unsatisfiable 0.46s 0.66s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   7 unt;   0 nHn;   4 RR)
%            Number of literals    :    7 (   6 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   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_lub1c_1,hypothesis,
    least_upper_bound(a,c) = c,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_lub1c_1) ).

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

cnf(19,plain,
    least_upper_bound(b,least_upper_bound(c,X)) = least_upper_bound(c,X),
    inference('EMBED',[status(thm)],[ax_lub1c_2]) ).

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

cnf(43,plain,
    greatest_lower_bound(least_upper_bound(X,b),least_upper_bound(c,X)) = least_upper_bound(X,b),
    inference('PARAMODULATE',[status(thm)],[glb_absorbtion,19,theory(equality)]) ).

cnf(210,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,ax_lub1c_1,theory(equality)]),prove_ax_lub1c]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 06:06:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46   (USE-FACTORING :POS)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46  * 
% 0.18/0.46  "."
% 0.18/0.46  * 
% 0.18/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:06:22
% 0.18/0.46  ; 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-06-13T06:06:22
% 0.18/0.47  
% 0.18/0.47  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.18/0.47  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.18/0.47  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.18/0.47  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.18/0.47  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.18/0.47  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.18/0.47  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.18/0.47  ; Declaring greatest_lower_bound to be commutative.
% 0.18/0.47  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.18/0.47  ; Declaring least_upper_bound to be commutative.
% 0.46/0.66  ; Declaring least_upper_bound to be associative-commutative.
% 0.46/0.66  
% 0.46/0.66  #||
% 0.46/0.66  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.46/0.66  % SZS output start Refutation
% See solution above
% 0.46/0.66  ||#
% 0.46/0.66  
% 0.46/0.66  ; Summary of computation:
% 0.46/0.66  ;      1231 formulas have been input or derived (from 41 formulas).
% 0.46/0.66  ;       210 (17%) were retained.  Of these,
% 0.46/0.66  ;            6 ( 3%) were simplified or subsumed later,
% 0.46/0.66  ;          204 (97%) are still being kept.
% 0.46/0.66  ; 
% 0.46/0.66  ; Run time in seconds excluding printing time:
% 0.46/0.66  ;     0.004   2%   Read assertion file          (1 call)
% 0.46/0.66  ;     0.001   0%   Assert                       (18 calls)
% 0.46/0.66  ;     0.019   9%   Process new row              (1,126 calls)
% 0.46/0.66  ;     0.000   0%   Resolution                   (80 calls)
% 0.46/0.66  ;     0.027  13%   Paramodulation               (40 calls)
% 0.46/0.66  ;     0.005   2%   Embedding                    (92 calls)
% 0.46/0.66  ;     0.105  52%   Forward simplification       (1,038 calls)
% 0.46/0.66  ;     0.005   2%   Backward simplification      (122 calls)
% 0.46/0.66  ;     0.005   2%   Ordering                     (1,200 calls)
% 0.46/0.66  ;     0.002   1%   Ordering ac                  (351 calls)
% 0.46/0.66  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.46/0.66  ;     0.000   0%   Purity testing               (1 call)
% 0.46/0.66  ;     0.028  14%   Other
% 0.46/0.66  ;     0.201        Total
% 0.46/0.66  ;     0.202        Real time
% 0.46/0.66  ; 
% 0.46/0.66  ; Term-hash-array has 627 terms in all.
% 0.46/0.66  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.46/0.66  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.46/0.66  ; Path-index has 618 entries (618 at peak, 633 added, 15 deleted).
% 0.46/0.66  ; Path-index has 433 nodes (433 at peak, 445 added, 12 deleted).
% 0.46/0.66  ; Trie-index has 618 entries (618 at peak, 633 added, 15 deleted).
% 0.46/0.66  ; Trie-index has 296 nodes (296 at peak, 339 added, 43 deleted).
% 0.46/0.66  ; Retrieved 112,019 generalization terms in 9,564 calls.
% 0.46/0.66  ; Retrieved 343 instance terms in 145 calls.
% 0.46/0.66  ; Retrieved 2,360 unifiable terms in 209 calls.
% 0.46/0.66  ; 
% 0.46/0.66  ; The agenda of rows to process has 41 entries:
% 0.46/0.66  ;     2 with value 14              4 with value 21               3 with value 27
% 0.46/0.66  ;     3 with value 15              2 with value 23               3 with value 30
% 0.46/0.66  ;     4 with value 18              4 with value 24               1 with value 31
% 0.46/0.66  ;     3 with value 19              4 with value 25               1 with value 36
% 0.46/0.66  ;     5 with value 20              2 with value 26
% 0.46/0.66  ; The agenda of rows to give has 163 entries:
% 0.46/0.66  ;    12 with value (4 15)         32 with value (4 21)           8 with value (4 27)
% 0.46/0.66  ;    12 with value (4 16)         12 with value (4 22)          16 with value (4 28)
% 0.46/0.66  ;     6 with value (4 17)          8 with value (4 23)           4 with value (4 30)
% 0.46/0.66  ;    10 with value (4 18)          8 with value (4 24)           4 with value (4 31)
% 0.46/0.66  ;     4 with value (4 19)          4 with value (4 25)           4 with value (4 33)
% 0.46/0.66  ;    11 with value (4 20)          4 with value (4 26)           4 with value (4 36)
% 0.46/0.66  Evaluation took:
% 0.46/0.66    0.202 seconds of real time
% 0.46/0.66    0.184972 seconds of user run time
% 0.46/0.66    0.017335 seconds of system run time
% 0.46/0.66    0 calls to %EVAL
% 0.46/0.66    0 page faults and
% 0.46/0.66    11,949,720 bytes consed.
% 0.46/0.66  :PROOF-FOUND
% 0.46/0.66  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T06:06:23
% 0.46/0.66  :PROOF-FOUND
% 0.46/0.66  * 
%------------------------------------------------------------------------------