↑ Up

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

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

% Computer : n010.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:09 EDT 2022

% Result   : Unsatisfiable 0.40s 0.60s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   5 unt;   0 nHn;   3 RR)
%            Number of literals    :    5 (   4 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   2 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 (   0 sgn)

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

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

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

cnf(89,plain,
    multiply(b,X) = least_upper_bound(multiply(a,X),multiply(b,X)),
    inference('PARAMODULATE',[status(thm)],[monotony_lub2,ax_mono1a_1,theory(equality)]) ).

cnf(91,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_ax_mono1a,89,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n010.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 09:09:40 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 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-13T09:09:40
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-13T09:09:40
% 0.20/0.49  
% 0.20/0.49  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.20/0.49  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.20/0.49  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.20/0.49  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.20/0.49  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.20/0.49  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.20/0.49  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.20/0.49  ; Declaring greatest_lower_bound to be commutative.
% 0.20/0.49  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.20/0.49  ; Declaring least_upper_bound to be commutative.
% 0.40/0.60  ; Declaring least_upper_bound to be associative-commutative.
% 0.40/0.60  
% 0.40/0.60  #||
% 0.40/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.60  % SZS output start Refutation
% See solution above
% 0.40/0.60  ||#
% 0.40/0.60  
% 0.40/0.60  ; Summary of computation:
% 0.40/0.60  ;       504 formulas have been input or derived (from 18 formulas).
% 0.40/0.60  ;        91 (18%) were retained.  Of these,
% 0.40/0.60  ;            1 ( 1%) were simplified or subsumed later,
% 0.40/0.60  ;           90 (99%) are still being kept.
% 0.40/0.60  ; 
% 0.40/0.60  ; Run time in seconds excluding printing time:
% 0.40/0.60  ;     0.004   3%   Read assertion file          (1 call)
% 0.40/0.60  ;     0.000   0%   Assert                       (17 calls)
% 0.40/0.60  ;     0.010   8%   Process new row              (426 calls)
% 0.40/0.60  ;     0.000   0%   Resolution                   (34 calls)
% 0.40/0.60  ;     0.015  13%   Paramodulation               (17 calls)
% 0.40/0.60  ;     0.002   2%   Embedding                    (41 calls)
% 0.40/0.60  ;     0.051  43%   Forward simplification       (389 calls)
% 0.40/0.60  ;     0.004   3%   Backward simplification      (54 calls)
% 0.40/0.60  ;     0.000   0%   Ordering                     (370 calls)
% 0.40/0.60  ;     0.004   3%   Ordering ac                  (107 calls)
% 0.40/0.60  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.40/0.60  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.60  ;     0.027  23%   Other
% 0.40/0.60  ;     0.118        Total
% 0.40/0.60  ;     0.119        Real time
% 0.40/0.60  ; 
% 0.40/0.60  ; Term-hash-array has 290 terms in all.
% 0.40/0.60  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.40/0.60  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.40/0.60  ; Path-index has 290 entries (291 at peak, 295 added, 5 deleted).
% 0.40/0.60  ; Path-index has 268 nodes (272 at peak, 273 added, 5 deleted).
% 0.40/0.60  ; Trie-index has 290 entries (291 at peak, 295 added, 5 deleted).
% 0.40/0.60  ; Trie-index has 181 nodes (186 at peak, 187 added, 6 deleted).
% 0.40/0.60  ; Retrieved 23,880 generalization terms in 3,502 calls.
% 0.40/0.60  ; Retrieved 221 instance terms in 73 calls.
% 0.40/0.60  ; Retrieved 314 unifiable terms in 85 calls.
% 0.40/0.60  ; 
% 0.40/0.60  ; The agenda of rows to process has 66 entries:
% 0.40/0.60  ;     1 with value 15              4 with value 23               7 with value 30
% 0.40/0.60  ;     2 with value 18             12 with value 24               2 with value 32
% 0.40/0.60  ;     2 with value 19              8 with value 26               2 with value 34
% 0.40/0.60  ;    10 with value 20              4 with value 27               1 with value 36
% 0.40/0.60  ;     7 with value 22              4 with value 28
% 0.40/0.60  ; The agenda of input rows to give has 1 entry:
% 0.40/0.60  ;     1 with value 16
% 0.40/0.60  ; The agenda of rows to give has 72 entries:
% 0.40/0.60  ;     2 with value (4 8)           2 with value (4 18)           4 with value (4 27)
% 0.40/0.60  ;     4 with value (4 11)          9 with value (4 20)           8 with value (4 28)
% 0.40/0.60  ;     1 with value (4 12)          8 with value (4 21)           4 with value (4 30)
% 0.40/0.60  ;     1 with value (4 13)          4 with value (4 22)           4 with value (4 31)
% 0.40/0.60  ;     7 with value (4 15)          4 with value (4 24)           4 with value (4 33)
% 0.40/0.60  ;     2 with value (4 17)          4 with value (4 25)
% 0.40/0.60  Evaluation took:
% 0.40/0.60    0.12 seconds of real time
% 0.40/0.60    0.11149 seconds of user run time
% 0.40/0.60    0.008141 seconds of system run time
% 0.40/0.60    0 calls to %EVAL
% 0.40/0.60    0 page faults and
% 0.40/0.60    6,330,904 bytes consed.
% 0.40/0.60  :PROOF-FOUND
% 0.40/0.60  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T09:09:40
% 0.40/0.60  :PROOF-FOUND
% 0.40/0.60  * 
%------------------------------------------------------------------------------