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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP176-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n028.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 0.21s 0.52s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    1
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    5 (   5 unt;   0 nHn;   2 RR)
%            Number of literals    :    5 (   4 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;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(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(prove_p07,negated_conjecture,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p07) ).

cnf(17,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_p07,associativity,monotony_lub1,monotony_lub2,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13  % Problem  : GRP176-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.14  % Command  : run-snark %s %d
% 0.15/0.35  % Computer : n028.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Mon Jun 13 21:38:38 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 0.21/0.49  #<PACKAGE "SNARK-USER">
% 0.21/0.49  * 
% 0.21/0.49  SNARK-TPTP-OPTIONS
% 0.21/0.49  * 
% 0.21/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.49   (USE-FACTORING :POS)
% 0.21/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.49  * 
% 0.21/0.49  "."
% 0.21/0.49  * 
% 0.21/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T21:38:38
% 0.21/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-06-13T21:38:38
% 0.21/0.50  
% 0.21/0.50  ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.21/0.50  ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 0.21/0.51  ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 0.21/0.51  ; Recognized commutativity assertion (= (|greatest_lower_bound| ?X ?Y) (|greatest_lower_bound| ?Y ?X)).
% 0.21/0.51  ; Recognized commutativity assertion (= (|least_upper_bound| ?X ?Y) (|least_upper_bound| ?Y ?X)).
% 0.21/0.51  ; Recognized associativity assertion (= (|greatest_lower_bound| ?X (|greatest_lower_bound| ?Y ?Z)) (|greatest_lower_bound| (|greatest_lower_bound| ?X ?Y) ?Z)).
% 0.21/0.51  ; Recognized associativity assertion (= (|least_upper_bound| ?X (|least_upper_bound| ?Y ?Z)) (|least_upper_bound| (|least_upper_bound| ?X ?Y) ?Z)).
% 0.21/0.51  ; Declaring greatest_lower_bound to be commutative.
% 0.21/0.51  ; Declaring greatest_lower_bound to be associative-commutative.
% 0.21/0.51  ; Declaring least_upper_bound to be commutative.
% 0.21/0.52  ; Declaring least_upper_bound to be associative-commutative.
% 0.21/0.52  
% 0.21/0.52  #||
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52  % SZS output start Refutation
% See solution above
% 0.21/0.52  ||#
% 0.21/0.52  
% 0.21/0.52  ; Summary of computation:
% 0.21/0.52  ;        21 formulas have been input or derived (from 1 formulas).
% 0.21/0.52  ;        17 (81%) were retained.  Of these,
% 0.21/0.52  ;            1 ( 6%) were simplified or subsumed later,
% 0.21/0.52  ;           16 (94%) are still being kept.
% 0.21/0.52  ; 
% 0.21/0.52  ; Run time in seconds excluding printing time:
% 0.21/0.52  ;     0.004  14%   Read assertion file          (1 call)
% 0.21/0.52  ;     0.001   3%   Assert                       (16 calls)
% 0.21/0.52  ;     0.000   0%   Process new row              (20 calls)
% 0.21/0.52  ;     0.000   0%   Embedding                    (8 calls)
% 0.21/0.52  ;     0.001   3%   Forward simplification       (16 calls)
% 0.21/0.52  ;     0.001   3%   Backward simplification      (12 calls)
% 0.21/0.52  ;     0.000   0%   Ordering                     (30 calls)
% 0.21/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.21/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.52  ;     0.022  76%   Other
% 0.21/0.52  ;     0.029        Total
% 0.21/0.52  ;     0.031        Real time
% 0.21/0.52  ; 
% 0.21/0.52  ; Term-hash-array has 45 terms in all.
% 0.21/0.52  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.21/0.52  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.21/0.52  ; Path-index has 50 entries (50 at peak, 50 added, 0 deleted).
% 0.21/0.52  ; Path-index has 99 nodes (99 at peak, 99 added, 0 deleted).
% 0.21/0.52  ; Trie-index has 50 entries (50 at peak, 50 added, 0 deleted).
% 0.21/0.52  ; Trie-index has 66 nodes (66 at peak, 66 added, 0 deleted).
% 0.21/0.52  ; Retrieved 39 generalization terms in 59 calls.
% 0.21/0.52  ; Retrieved 13 instance terms in 13 calls.
% 0.21/0.52  ; 
% 0.21/0.52  ; The agenda of input rows to give has 15 entries:
% 0.21/0.52  ;     5 with value 7               4 with value 10               4 with value 16
% 0.21/0.52  ;     1 with value 9               1 with value 14
% 0.21/0.52  Evaluation took:
% 0.21/0.52    0.031 seconds of real time
% 0.21/0.52    0.027288 seconds of user run time
% 0.21/0.52    0.004058 seconds of system run time
% 0.21/0.52    0 calls to %EVAL
% 0.21/0.52    0 page faults and
% 0.21/0.52    1,673,976 bytes consed.
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T21:38:38
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  * 
%------------------------------------------------------------------------------