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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP175-3 : 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:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
    multiply(identity,X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X),X) = identity,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).

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(monotony_glb1,axiom,
    multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).

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

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

cnf(prove_p06c,negated_conjecture,
    greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p06c) ).

cnf(29,plain,
    greatest_lower_bound(identity,b) = identity,
    inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p06c_1,theory(equality)]) ).

cnf(99,plain,
    X = greatest_lower_bound(X,multiply(b,X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[monotony_glb2,29,theory(equality)]),left_identity,theory(equality)]) ).

cnf(151,plain,
    multiply(X,Y) = greatest_lower_bound(multiply(X,Y),multiply(X,multiply(b,Y))),
    inference('PARAMODULATE',[status(thm)],[monotony_glb1,99,theory(equality)]) ).

cnf(7282,plain,
    identity = greatest_lower_bound(identity,multiply(inverse(X),multiply(b,X))),
    inference('PARAMODULATE',[status(thm)],[151,left_inverse,theory(equality)]) ).

cnf(7284,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_p06c,7282,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem  : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.15  % Command  : run-snark %s %d
% 0.14/0.36  % Computer : n024.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jun 14 05:53:33 EDT 2022
% 0.14/0.36  % 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-14T05:53:33
% 0.21/0.52  ; 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-14T05:53:33
% 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.
% 60.59/60.81  ; Declaring least_upper_bound to be associative-commutative.
% 60.59/60.81  
% 60.59/60.81  #||
% 60.59/60.81  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 60.59/60.81  % SZS output start Refutation
% See solution above
% 60.59/60.81  ||#
% 60.59/60.81  
% 60.59/60.81  ; Summary of computation:
% 60.59/60.81  ;     37265 formulas have been input or derived (from 182 formulas).
% 60.59/60.81  ;      7284 (20%) were retained.  Of these,
% 60.59/60.81  ;          381 ( 5%) were simplified or subsumed later,
% 60.59/60.81  ;         6903 (95%) are still being kept.
% 60.59/60.81  ; 
% 60.59/60.81  ; Run time in seconds excluding printing time:
% 60.59/60.81  ;     0.004   0%   Read assertion file          (1 call)
% 60.59/60.81  ;     0.001   0%   Assert                       (17 calls)
% 60.59/60.81  ;     1.581   3%   Process new row              (36,430 calls)
% 60.59/60.81  ;     0.029   0%   Resolution                   (362 calls)
% 60.59/60.81  ;     0.711   1%   Paramodulation               (181 calls)
% 60.59/60.81  ;     0.081   0%   Embedding                    (3,462 calls)
% 60.59/60.81  ;    54.516  90%   Forward simplification       (32,897 calls)
% 60.59/60.81  ;     2.280   4%   Backward simplification      (3,826 calls)
% 60.59/60.81  ;     0.574   1%   Ordering                     (165,008 calls)
% 60.59/60.81  ;     0.335   1%   Ordering ac                  (25,111 calls)
% 60.59/60.81  ;     0.000   0%   Sortal reasoning             (32 calls)
% 60.59/60.81  ;     0.000   0%   Purity testing               (1 call)
% 60.59/60.81  ;     0.174   0%   Other
% 60.59/60.81  ;    60.286        Total
% 60.59/60.81  ;    60.295        Real time
% 60.59/60.81  ; 
% 60.59/60.81  ; Term-hash-array has 19,950 terms in all.
% 60.59/60.81  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 60.59/60.81  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 60.59/60.81  ; Path-index has 19,071 entries (19,075 at peak, 20,034 added, 963 deleted).
% 60.59/60.81  ; Path-index has 2,770 nodes (2,779 at peak, 2,824 added, 54 deleted).
% 60.59/60.81  ; Trie-index has 19,071 entries (19,075 at peak, 20,034 added, 963 deleted).
% 60.59/60.81  ; Trie-index has 4,556 nodes (4,563 at peak, 4,767 added, 211 deleted).
% 60.59/60.81  ; Retrieved 148,864,055 generalization terms in 442,027 calls.
% 60.59/60.81  ; Retrieved 139,335 instance terms in 4,537 calls.
% 60.59/60.81  ; Retrieved 218,785 unifiable terms in 1,048 calls.
% 60.59/60.81  ; 
% 60.59/60.81  ; The agenda of rows to process has 68 entries:
% 60.59/60.81  ;     2 with value 18              1 with value 25               3 with value 31
% 60.59/60.81  ;     2 with value 19              2 with value 26               3 with value 32
% 60.59/60.81  ;     6 with value 21              2 with value 27               9 with value 34
% 60.59/60.81  ;     1 with value 22             15 with value 28               9 with value 35
% 60.59/60.81  ;     3 with value 23              5 with value 29               1 with value 36
% 60.59/60.81  ;     1 with value 24              2 with value 30               1 with value 37
% 60.59/60.81  ; The agenda of rows to give has 6725 entries:
% 60.59/60.81  ;     2 with value (4 18)        188 with value (4 37)          56 with value (4 54)
% 60.59/60.81  ;    48 with value (4 20)        308 with value (4 38)          46 with value (4 55)
% 60.59/60.81  ;    74 with value (4 21)        208 with value (4 39)          32 with value (4 56)
% 60.59/60.81  ;   110 with value (4 22)        154 with value (4 40)          32 with value (4 57)
% 60.59/60.81  ;   176 with value (4 23)        174 with value (4 41)          24 with value (4 58)
% 60.59/60.81  ;   141 with value (4 24)        174 with value (4 42)          24 with value (4 59)
% 60.59/60.81  ;   261 with value (4 25)        164 with value (4 43)           4 with value (4 60)
% 60.59/60.81  ;   241 with value (4 26)        142 with value (4 44)          26 with value (4 61)
% 60.59/60.81  ;   298 with value (4 27)        130 with value (4 45)           2 with value (4 62)
% 60.59/60.81  ;   319 with value (4 28)        102 with value (4 46)           8 with value (4 63)
% 60.59/60.81  ;   303 with value (4 29)        116 with value (4 47)          12 with value (4 64)
% 60.59/60.81  ;   362 with value (4 30)         80 with value (4 48)           6 with value (4 65)
% 60.59/60.81  ;   394 with value (4 31)         84 with value (4 49)           8 with value (4 66)
% 60.59/60.81  ;   278 with value (4 32)         64 with value (4 50)           4 with value (4 67)
% 60.59/60.81  ;   312 with value (4 33)         44 with value (4 51)           4 with value (4 69)
% 60.59/60.81  ;   322 with value (4 34)         44 with value (4 52)           8 with value (4 70)
% 60.59/60.81  ;   270 with value (4 35)         56 with value (4 53)           4 with value (4 71)
% 60.59/60.81  ;   282 with value (4 36)
% 60.59/60.81  Evaluation took:
% 60.59/60.81    60.296 seconds of real time
% 60.59/60.81    59.719418 seconds of user run time
% 60.59/60.81    0.568852 seconds of system run time
% 60.59/60.81    [Run times include 1.479 seconds GC run time.]
% 60.59/60.81    0 calls to %EVAL
% 60.59/60.81    0 page faults and
% 60.59/60.81    2,870,752,728 bytes consed.
% 60.59/60.81  :PROOF-FOUND
% 60.59/60.81  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T05:54:34
% 60.59/60.81  :PROOF-FOUND
% 60.59/60.81  * 
%------------------------------------------------------------------------------