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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP156-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:10 EDT 2022

% Result   : Unsatisfiable 0.37s 0.62s
% Output   : Refutation 0.37s
% 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(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

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

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP156-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/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 : Tue Jun 14 13:23:54 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.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:23:54
% 0.20/0.47  ; 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-14T13:23:54
% 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.37/0.62  ; Declaring least_upper_bound to be associative-commutative.
% 0.37/0.62  
% 0.37/0.62  #||
% 0.37/0.62  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.62  % SZS output start Refutation
% See solution above
% 0.37/0.63  ||#
% 0.37/0.63  
% 0.37/0.63  ; Summary of computation:
% 0.37/0.63  ;       572 formulas have been input or derived (from 20 formulas).
% 0.37/0.63  ;       101 (18%) were retained.  Of these,
% 0.37/0.63  ;            1 ( 1%) were simplified or subsumed later,
% 0.37/0.63  ;          100 (99%) are still being kept.
% 0.37/0.63  ; 
% 0.37/0.63  ; Run time in seconds excluding printing time:
% 0.37/0.63  ;     0.004   3%   Read assertion file          (1 call)
% 0.37/0.63  ;     0.000   0%   Assert                       (17 calls)
% 0.37/0.63  ;     0.015  10%   Process new row              (557 calls)
% 0.37/0.63  ;     0.001   1%   Resolution                   (38 calls)
% 0.37/0.63  ;     0.017  11%   Paramodulation               (19 calls)
% 0.37/0.63  ;     0.003   2%   Embedding                    (46 calls)
% 0.37/0.63  ;     0.075  50%   Forward simplification       (515 calls)
% 0.37/0.63  ;     0.004   3%   Backward simplification      (59 calls)
% 0.37/0.63  ;     0.003   2%   Ordering                     (465 calls)
% 0.37/0.63  ;     0.003   2%   Ordering ac                  (148 calls)
% 0.37/0.63  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.63  ;     0.000   0%   Purity testing               (1 call)
% 0.37/0.63  ;     0.026  17%   Other
% 0.37/0.63  ;     0.151        Total
% 0.37/0.63  ;     0.152        Real time
% 0.37/0.63  ; 
% 0.37/0.63  ; Term-hash-array has 334 terms in all.
% 0.37/0.63  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.37/0.63  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.37/0.63  ; Path-index has 334 entries (335 at peak, 339 added, 5 deleted).
% 0.37/0.63  ; Path-index has 303 nodes (307 at peak, 308 added, 5 deleted).
% 0.37/0.63  ; Trie-index has 334 entries (335 at peak, 339 added, 5 deleted).
% 0.37/0.63  ; Trie-index has 184 nodes (189 at peak, 190 added, 6 deleted).
% 0.37/0.63  ; Retrieved 42,593 generalization terms in 5,649 calls.
% 0.37/0.63  ; Retrieved 256 instance terms in 82 calls.
% 0.37/0.63  ; Retrieved 424 unifiable terms in 96 calls.
% 0.37/0.63  ; 
% 0.37/0.63  ; The agenda of rows to process has 1 entry:
% 0.37/0.63  ;     1 with value 16
% 0.37/0.63  ; The agenda of rows to give has 81 entries:
% 0.37/0.63  ;     1 with value (4 8)           2 with value (4 18)           4 with value (4 27)
% 0.37/0.63  ;     4 with value (4 11)          9 with value (4 20)          12 with value (4 28)
% 0.37/0.63  ;     1 with value (4 12)          8 with value (4 21)           4 with value (4 30)
% 0.37/0.63  ;     1 with value (4 13)          4 with value (4 22)           4 with value (4 31)
% 0.37/0.63  ;     7 with value (4 15)          4 with value (4 24)           4 with value (4 33)
% 0.37/0.63  ;     2 with value (4 16)          4 with value (4 25)           4 with value (4 36)
% 0.37/0.63  ;     2 with value (4 17)
% 0.37/0.63  Evaluation took:
% 0.37/0.63    0.153 seconds of real time
% 0.37/0.63    0.13749 seconds of user run time
% 0.37/0.63    0.015177 seconds of system run time
% 0.37/0.63    0 calls to %EVAL
% 0.37/0.63    0 page faults and
% 0.37/0.63    8,026,208 bytes consed.
% 0.37/0.63  :PROOF-FOUND
% 0.37/0.63  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:23:55
% 0.47/0.63  :PROOF-FOUND
% 0.47/0.63  * 
%------------------------------------------------------------------------------