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

View Problem - Process Solution

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

% Computer : n024.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:11 EDT 2022

% Result   : Unsatisfiable 0.42s 0.59s
% Output   : Refutation 0.42s
% 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   1 sgn)

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

cnf(monotony_lub1,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).

cnf(ax_mono2c_1,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono2c_1) ).

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

cnf(19,plain,
    least_upper_bound(b,a) = b,
    inference('PARAMODULATE',[status(thm)],[lub_absorbtion,ax_mono2c_1,theory(equality)]) ).

cnf(101,plain,
    multiply(X,b) = least_upper_bound(multiply(X,b),multiply(X,a)),
    inference('PARAMODULATE',[status(thm)],[monotony_lub1,19,theory(equality)]) ).

cnf(103,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_ax_mono2c,101,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n024.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 22:17:18 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 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-13T22:17:18
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-13T22:17:18
% 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.42/0.59  ; Declaring least_upper_bound to be associative-commutative.
% 0.42/0.59  
% 0.42/0.59  #||
% 0.42/0.59  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.59  % SZS output start Refutation
% See solution above
% 0.42/0.60  ||#
% 0.42/0.60  
% 0.42/0.60  ; Summary of computation:
% 0.42/0.60  ;       573 formulas have been input or derived (from 20 formulas).
% 0.42/0.60  ;       103 (18%) were retained.  Of these,
% 0.42/0.60  ;            1 ( 1%) were simplified or subsumed later,
% 0.42/0.60  ;          102 (99%) are still being kept.
% 0.42/0.60  ; 
% 0.42/0.60  ; Run time in seconds:
% 0.42/0.60  ;     0.004   3%   Read assertion file          (1 call)
% 0.42/0.60  ;     0.001   1%   Assert                       (17 calls)
% 0.42/0.60  ;     0.010   7%   Process new row              (559 calls)
% 0.42/0.60  ;     0.001   1%   Resolution                   (38 calls)
% 0.42/0.60  ;     0.012   9%   Paramodulation               (19 calls)
% 0.42/0.60  ;     0.003   2%   Embedding                    (47 calls)
% 0.42/0.60  ;     0.070  51%   Forward simplification       (516 calls)
% 0.42/0.60  ;     0.005   4%   Backward simplification      (60 calls)
% 0.42/0.60  ;     0.005   4%   Ordering                     (467 calls)
% 0.42/0.60  ;     0.000   0%   Ordering ac                  (148 calls)
% 0.42/0.60  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.42/0.60  ;     0.000   0%   Purity testing               (1 call)
% 0.42/0.60  ;     0.026  19%   Other
% 0.42/0.60  ;     0.137        Total
% 0.42/0.60  ;     0.137        Real time
% 0.42/0.60  ; 
% 0.42/0.60  ; Term-hash-array has 339 terms in all.
% 0.42/0.60  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.42/0.60  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.42/0.60  ; Path-index has 339 entries (340 at peak, 344 added, 5 deleted).
% 0.42/0.60  ; Path-index has 308 nodes (312 at peak, 313 added, 5 deleted).
% 0.42/0.60  ; Trie-index has 339 entries (340 at peak, 344 added, 5 deleted).
% 0.42/0.60  ; Trie-index has 186 nodes (192 at peak, 193 added, 7 deleted).
% 0.42/0.60  ; Retrieved 42,823 generalization terms in 5,654 calls.
% 0.42/0.60  ; Retrieved 253 instance terms in 83 calls.
% 0.42/0.60  ; Retrieved 429 unifiable terms in 96 calls.
% 0.42/0.60  ; 
% 0.42/0.60  ; The agenda of rows to give has 83 entries:
% 0.42/0.60  ;     1 with value (4 8)           2 with value (4 18)           4 with value (4 27)
% 0.42/0.60  ;     4 with value (4 11)          9 with value (4 20)          12 with value (4 28)
% 0.42/0.60  ;     1 with value (4 12)          8 with value (4 21)           4 with value (4 30)
% 0.42/0.60  ;     1 with value (4 13)          4 with value (4 22)           4 with value (4 31)
% 0.42/0.60  ;     7 with value (4 15)          4 with value (4 24)           4 with value (4 33)
% 0.42/0.60  ;     4 with value (4 16)          4 with value (4 25)           4 with value (4 36)
% 0.42/0.60  ;     2 with value (4 17)
% 0.42/0.60  Evaluation took:
% 0.42/0.60    0.137 seconds of real time
% 0.42/0.60    0.131215 seconds of user run time
% 0.42/0.60    0.006382 seconds of system run time
% 0.42/0.60    0 calls to %EVAL
% 0.42/0.60    0 page faults and
% 0.42/0.60    8,026,696 bytes consed.
% 0.42/0.60  :PROOF-FOUND
% 0.42/0.60  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T22:17:18
% 0.42/0.60  :PROOF-FOUND
% 0.42/0.60  * 
%------------------------------------------------------------------------------