↑ Up

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

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

% Computer : n005.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:13 EDT 2022

% Result   : Unsatisfiable 0.48s 0.67s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   3 RR)
%            Number of literals    :   13 (  12 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

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

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

cnf(associativity,axiom,
    multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).

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

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

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

cnf(82,plain,
    X = multiply(inverse(Y),multiply(Y,X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).

cnf(89,plain,
    multiply(X,b) = least_upper_bound(multiply(X,b),multiply(X,identity)),
    inference('PARAMODULATE',[status(thm)],[monotony_lub1,lat2a_2,theory(equality)]) ).

cnf(178,plain,
    X = multiply(inverse(inverse(X)),identity),
    inference('PARAMODULATE',[status(thm)],[82,left_inverse,theory(equality)]) ).

cnf(179,plain,
    multiply(X,Y) = multiply(inverse(inverse(X)),Y),
    inference('PARAMODULATE',[status(thm)],[82,82,theory(equality)]) ).

cnf(180,plain,
    X = multiply(X,identity),
    inference('REWRITE',[status(thm)],[178,179,theory(equality)]) ).

cnf(182,plain,
    multiply(X,b) = least_upper_bound(multiply(X,b),X),
    inference('REWRITE',[status(thm)],[89,180,theory(equality)]) ).

cnf(184,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_lat2a,182,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP166-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n005.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 07:45:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:45:39
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-06-14T07:45:39
% 0.20/0.50  
% 0.20/0.50  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.50  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.20/0.50  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.20/0.50  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.20/0.50  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.20/0.50  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.20/0.50  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.20/0.50  ; Declaring greatest_lower_bound to be commutative.
% 0.20/0.50  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.20/0.50  ; Declaring least_upper_bound to be commutative.
% 0.48/0.67  ; Declaring least_upper_bound to be associative-commutative.
% 0.48/0.67  
% 0.48/0.67  #||
% 0.48/0.67  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.67  % SZS output start Refutation
% See solution above
% 0.48/0.67  ||#
% 0.48/0.67  
% 0.48/0.67  ; Summary of computation:
% 0.48/0.67  ;      1117 formulas have been input or derived (from 34 formulas).
% 0.48/0.67  ;       184 (16%) were retained.  Of these,
% 0.48/0.67  ;           20 (11%) were simplified or subsumed later,
% 0.48/0.67  ;          164 (89%) are still being kept.
% 0.48/0.67  ; 
% 0.48/0.67  ; Run time in seconds excluding printing time:
% 0.48/0.67  ;     0.003   2%   Read assertion file          (1 call)
% 0.48/0.67  ;     0.001   1%   Assert                       (18 calls)
% 0.48/0.67  ;     0.016   9%   Process new row              (1,042 calls)
% 0.48/0.67  ;     0.001   1%   Resolution                   (66 calls)
% 0.48/0.67  ;     0.019  10%   Paramodulation               (33 calls)
% 0.48/0.67  ;     0.005   3%   Embedding                    (85 calls)
% 0.48/0.67  ;     0.101  54%   Forward simplification       (961 calls)
% 0.48/0.67  ;     0.003   2%   Backward simplification      (103 calls)
% 0.48/0.67  ;     0.002   1%   Ordering                     (923 calls)
% 0.48/0.67  ;     0.006   3%   Ordering ac                  (324 calls)
% 0.48/0.67  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.48/0.67  ;     0.000   0%   Purity testing               (1 call)
% 0.48/0.67  ;     0.028  15%   Other
% 0.48/0.67  ;     0.186        Total
% 0.48/0.67  ;     0.189        Real time
% 0.48/0.67  ; 
% 0.48/0.67  ; Term-hash-array has 536 terms in all.
% 0.48/0.67  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.48/0.67  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.48/0.67  ; Path-index has 490 entries (533 at peak, 543 added, 53 deleted).
% 0.48/0.67  ; Path-index has 332 nodes (352 at peak, 355 added, 23 deleted).
% 0.48/0.67  ; Trie-index has 490 entries (533 at peak, 543 added, 53 deleted).
% 0.48/0.67  ; Trie-index has 194 nodes (214 at peak, 228 added, 34 deleted).
% 0.48/0.67  ; Retrieved 109,953 generalization terms in 9,177 calls.
% 0.48/0.67  ; Retrieved 320 instance terms in 126 calls.
% 0.48/0.67  ; Retrieved 1,924 unifiable terms in 168 calls.
% 0.48/0.67  ; 
% 0.48/0.67  ; The agenda of backward simplifiable rows to process has 7 entries:
% 0.48/0.67  ;     7 with value 0
% 0.48/0.67  ; The agenda of rows to process has 8 entries:
% 0.48/0.67  ;     4 with value 18              4 with value 20
% 0.48/0.67  ; The agenda of rows to give has 131 entries:
% 0.48/0.67  ;     1 with value (4 9)           8 with value (4 18)           4 with value (4 25)
% 0.48/0.67  ;     1 with value (4 11)          8 with value (4 19)           4 with value (4 27)
% 0.48/0.67  ;     4 with value (4 12)          9 with value (4 20)          12 with value (4 28)
% 0.48/0.67  ;     7 with value (4 13)         16 with value (4 21)           4 with value (4 30)
% 0.48/0.67  ;     5 with value (4 15)         12 with value (4 22)           4 with value (4 31)
% 0.48/0.67  ;     4 with value (4 16)          8 with value (4 23)           4 with value (4 33)
% 0.48/0.67  ;     8 with value (4 17)          4 with value (4 24)           4 with value (4 36)
% 0.48/0.67  Evaluation took:
% 0.48/0.67    0.189 seconds of real time
% 0.48/0.67    0.180534 seconds of user run time
% 0.48/0.67    0.008044 seconds of system run time
% 0.48/0.67    0 calls to %EVAL
% 0.48/0.67    0 page faults and
% 0.48/0.67    11,884,696 bytes consed.
% 0.48/0.67  :PROOF-FOUND
% 0.48/0.67  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T07:45:39
% 0.48/0.67  :PROOF-FOUND
% 0.48/0.67  * 
%------------------------------------------------------------------------------