↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n027.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:18 EDT 2022

% Result   : Unsatisfiable 62.29s 62.48s
% Output   : Refutation 62.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   14 (  14 unt;   0 nHn;   4 RR)
%            Number of literals    :   14 (  13 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   :   17 (   2 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(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(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(p06a_1,hypothesis,
    least_upper_bound(identity,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p06a_1) ).

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

cnf(29,plain,
    greatest_lower_bound(identity,b) = identity,
    inference('PARAMODULATE',[status(thm)],[glb_absorbtion,p06a_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(7376,plain,
    least_upper_bound(multiply(inverse(X),multiply(b,X)),identity) = multiply(inverse(X),multiply(b,X)),
    inference('PARAMODULATE',[status(thm)],[lub_absorbtion,7282,theory(equality)]) ).

cnf(7378,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_p06a,7376,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 11:53:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T11:53:17
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-06-13T11:53:17
% 0.19/0.48  
% 0.19/0.48  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.48  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.19/0.48  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.19/0.48  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.19/0.48  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.19/0.48  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.19/0.48  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.19/0.48  ; Declaring greatest_lower_bound to be commutative.
% 0.19/0.48  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.19/0.48  ; Declaring least_upper_bound to be commutative.
% 62.29/62.48  ; Declaring least_upper_bound to be associative-commutative.
% 62.29/62.48  
% 62.29/62.48  #||
% 62.29/62.48  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 62.29/62.48  % SZS output start Refutation
% See solution above
% 62.29/62.48  ||#
% 62.29/62.48  
% 62.29/62.48  ; Summary of computation:
% 62.29/62.48  ;     37355 formulas have been input or derived (from 183 formulas).
% 62.29/62.48  ;      7378 (20%) were retained.  Of these,
% 62.29/62.48  ;          389 ( 5%) were simplified or subsumed later,
% 62.29/62.48  ;         6989 (95%) are still being kept.
% 62.29/62.48  ; 
% 62.29/62.48  ; Run time in seconds excluding printing time:
% 62.29/62.48  ;     0.003   0%   Read assertion file          (1 call)
% 62.29/62.48  ;     0.000   0%   Assert                       (17 calls)
% 62.29/62.48  ;     1.636   3%   Process new row              (36,566 calls)
% 62.29/62.48  ;     0.031   0%   Resolution                   (364 calls)
% 62.29/62.48  ;     0.721   1%   Paramodulation               (182 calls)
% 62.29/62.48  ;     0.069   0%   Embedding                    (3,509 calls)
% 62.29/62.48  ;    56.022  90%   Forward simplification       (32,986 calls)
% 62.29/62.48  ;     2.404   4%   Backward simplification      (3,873 calls)
% 62.29/62.48  ;     0.645   1%   Ordering                     (166,138 calls)
% 62.29/62.48  ;     0.319   1%   Ordering ac                  (25,254 calls)
% 62.29/62.48  ;     0.000   0%   Sortal reasoning             (32 calls)
% 62.29/62.48  ;     0.000   0%   Purity testing               (1 call)
% 62.29/62.48  ;     0.161   0%   Other
% 62.29/62.48  ;    62.011        Total
% 62.29/62.48  ;    62.017        Real time
% 62.29/62.49  ; 
% 62.29/62.49  ; Term-hash-array has 20,198 terms in all.
% 62.29/62.49  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 62.29/62.49  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 62.29/62.49  ; Path-index has 19,303 entries (19,306 at peak, 20,283 added, 980 deleted).
% 62.29/62.49  ; Path-index has 2,814 nodes (2,824 at peak, 2,870 added, 56 deleted).
% 62.29/62.49  ; Trie-index has 19,303 entries (19,306 at peak, 20,283 added, 980 deleted).
% 62.29/62.49  ; Trie-index has 4,632 nodes (4,642 at peak, 4,847 added, 215 deleted).
% 62.29/62.49  ; Retrieved 149,070,083 generalization terms in 442,830 calls.
% 62.29/62.49  ; Retrieved 141,504 instance terms in 4,584 calls.
% 62.29/62.49  ; Retrieved 224,350 unifiable terms in 1,057 calls.
% 62.29/62.49  ; 
% 62.29/62.49  ; The agenda of rows to process has 21 entries:
% 62.29/62.49  ;     1 with value 24              2 with value 27               1 with value 33
% 62.29/62.49  ;     2 with value 25              7 with value 29               1 with value 34
% 62.29/62.49  ;     7 with value 26
% 62.29/62.49  ; The agenda of rows to give has 6810 entries:
% 62.29/62.49  ;     3 with value (4 18)        188 with value (4 37)          56 with value (4 54)
% 62.29/62.49  ;    48 with value (4 20)        308 with value (4 38)          46 with value (4 55)
% 62.29/62.49  ;    80 with value (4 21)        208 with value (4 39)          32 with value (4 56)
% 62.29/62.49  ;   110 with value (4 22)        154 with value (4 40)          32 with value (4 57)
% 62.29/62.49  ;   178 with value (4 23)        174 with value (4 41)          24 with value (4 58)
% 62.29/62.49  ;   145 with value (4 24)        174 with value (4 42)          24 with value (4 59)
% 62.29/62.49  ;   261 with value (4 25)        164 with value (4 43)           4 with value (4 60)
% 62.29/62.49  ;   241 with value (4 26)        142 with value (4 44)          26 with value (4 61)
% 62.29/62.49  ;   306 with value (4 27)        130 with value (4 45)           2 with value (4 62)
% 62.29/62.49  ;   339 with value (4 28)        102 with value (4 46)           8 with value (4 63)
% 62.29/62.49  ;   311 with value (4 29)        112 with value (4 47)          12 with value (4 64)
% 62.29/62.49  ;   364 with value (4 30)         80 with value (4 48)           6 with value (4 65)
% 62.29/62.49  ;   394 with value (4 31)         84 with value (4 49)           8 with value (4 66)
% 62.29/62.49  ;   278 with value (4 32)         64 with value (4 50)           4 with value (4 67)
% 62.29/62.49  ;   310 with value (4 33)         44 with value (4 51)           4 with value (4 69)
% 62.29/62.49  ;   346 with value (4 34)         44 with value (4 52)           8 with value (4 70)
% 62.29/62.49  ;   280 with value (4 35)         56 with value (4 53)           4 with value (4 71)
% 62.29/62.49  ;   288 with value (4 36)
% 62.29/62.49  Evaluation took:
% 62.29/62.49    62.018 seconds of real time
% 62.29/62.49    61.453777 seconds of user run time
% 62.29/62.49    0.560079 seconds of system run time
% 62.29/62.49    [Run times include 1.567 seconds GC run time.]
% 62.29/62.49    0 calls to %EVAL
% 62.29/62.49    0 page faults and
% 62.29/62.49    2,875,019,552 bytes consed.
% 62.29/62.49  :PROOF-FOUND
% 62.29/62.49  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T11:54:19
% 62.29/62.49  :PROOF-FOUND
% 62.29/62.49  * 
%------------------------------------------------------------------------------