↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 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:39:25 EDT 2022

% Result   : Unsatisfiable 0.19s 0.55s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   19 (  19 unt;   0 nHn;   3 RR)
%            Number of literals    :   19 (  18 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    divide(X,inverse(divide(divide(Y,Z),divide(X,Z)))) = Y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(multiply,axiom,
    multiply(X,Y) = divide(X,inverse(Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

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

cnf(4,plain,
    divide(a,inverse(b)) != divide(b,inverse(a)),
    inference('REWRITE',[status(thm)],[prove_these_axioms_4,multiply,theory(equality)]) ).

cnf(5,plain,
    divide(X,inverse(divide(Y,divide(X,inverse(divide(divide(Y,Z),divide(U,Z))))))) = U,
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

cnf(7,plain,
    divide(X,inverse(divide(Y,Y))) = X,
    inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).

cnf(13,plain,
    divide(X,inverse(divide(Y,X))) = Y,
    inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]) ).

cnf(16,plain,
    divide(inverse(divide(X,Y)),inverse(X)) = Y,
    inference('PARAMODULATE',[status(thm)],[13,13,theory(equality)]) ).

cnf(18,plain,
    divide(divide(X,Y),inverse(divide(Z,divide(Z,Y)))) = X,
    inference('PARAMODULATE',[status(thm)],[5,13,theory(equality)]) ).

cnf(27,plain,
    X = inverse(divide(divide(Y,Y),X)),
    inference('PARAMODULATE',[status(thm)],[7,16,theory(equality)]) ).

cnf(28,plain,
    divide(inverse(X),inverse(Y)) = inverse(divide(X,Y)),
    inference('PARAMODULATE',[status(thm)],[13,16,theory(equality)]) ).

cnf(42,plain,
    divide(X,divide(Y,Y)) = X,
    inference('PARAMODULATE',[status(thm)],[7,27,theory(equality)]) ).

cnf(45,plain,
    divide(divide(X,X),inverse(Y)) = Y,
    inference('PARAMODULATE',[status(thm)],[13,42,theory(equality)]) ).

cnf(47,plain,
    inverse(divide(X,divide(Y,inverse(X)))) = Y,
    inference('PARAMODULATE',[status(thm)],[13,28,theory(equality)]) ).

cnf(69,plain,
    divide(divide(X,inverse(Y)),X) = Y,
    inference('PARAMODULATE',[status(thm)],[13,47,theory(equality)]) ).

cnf(79,plain,
    X = divide(Y,divide(Y,X)),
    inference('PARAMODULATE',[status(thm)],[45,18,theory(equality)]) ).

cnf(80,plain,
    divide(divide(X,Y),inverse(Y)) = X,
    inference('REWRITE',[status(thm)],[18,79,theory(equality)]) ).

cnf(102,plain,
    divide(X,inverse(Y)) = divide(Y,inverse(X)),
    inference('PARAMODULATE',[status(thm)],[80,69,theory(equality)]) ).

cnf(103,plain,
    $false,
    inference('REWRITE',[status(thm)],[4,102,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n005.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 23:49:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:49:39
% 0.19/0.47  ; 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-13T23:49:39
% 0.19/0.55  
% 0.19/0.55  
% 0.19/0.55  #||
% 0.19/0.55  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55  % SZS output start Refutation
% See solution above
% 0.19/0.55  ||#
% 0.19/0.55  
% 0.19/0.55  ; Summary of computation:
% 0.19/0.55  ;       620 formulas have been input or derived (from 26 formulas).
% 0.19/0.55  ;       103 (17%) were retained.  Of these,
% 0.19/0.55  ;           69 (67%) were simplified or subsumed later,
% 0.19/0.55  ;           34 (33%) are still being kept.
% 0.19/0.55  ; 
% 0.19/0.55  ; Run time in seconds excluding printing time:
% 0.19/0.55  ;     0.001   1%   Read assertion file          (1 call)
% 0.19/0.55  ;     0.000   0%   Assert                       (3 calls)
% 0.19/0.55  ;     0.013  17%   Process new row              (567 calls)
% 0.19/0.55  ;     0.002   3%   Resolution                   (50 calls)
% 0.19/0.55  ;     0.013  17%   Paramodulation               (25 calls)
% 0.19/0.55  ;     0.010  13%   Forward simplification       (511 calls)
% 0.19/0.55  ;     0.009  12%   Backward simplification      (102 calls)
% 0.19/0.55  ;     0.001   1%   Ordering                     (1,007 calls)
% 0.19/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.55  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.55  ;     0.028  36%   Other
% 0.19/0.55  ;     0.077        Total
% 0.19/0.55  ;     0.079        Real time
% 0.19/0.55  ; 
% 0.19/0.55  ; Term-hash-array has 398 terms in all.
% 0.19/0.55  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.55  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.55  ; Path-index has 117 entries (228 at peak, 423 added, 306 deleted).
% 0.19/0.55  ; Path-index has 825 nodes (853 at peak, 1,187 added, 362 deleted).
% 0.19/0.55  ; Trie-index has 117 entries (228 at peak, 423 added, 306 deleted).
% 0.19/0.55  ; Trie-index has 304 nodes (704 at peak, 1,277 added, 973 deleted).
% 0.19/0.55  ; Retrieved 963 generalization terms in 2,153 calls.
% 0.19/0.55  ; Retrieved 389 instance terms in 116 calls.
% 0.19/0.55  ; Retrieved 1,495 unifiable terms in 171 calls.
% 0.19/0.55  ; 
% 0.19/0.55  ; The agenda of rows to process has 18 entries:
% 0.19/0.55  ;     5 with value 21              4 with value 23               4 with value 25
% 0.19/0.55  ;     3 with value 22              2 with value 24
% 0.19/0.55  ; The agenda of rows to give has 27 entries:
% 0.19/0.55  ;     1 with value (4 13)          2 with value (4 19)           2 with value (4 25)
% 0.19/0.55  ;     1 with value (4 16)          2 with value (4 20)           2 with value (4 26)
% 0.19/0.55  ;     1 with value (4 17)          8 with value (4 22)           2 with value (4 30)
% 0.19/0.55  ;     2 with value (4 18)          4 with value (4 24)
% 0.19/0.55  Evaluation took:
% 0.19/0.55    0.079 seconds of real time
% 0.19/0.55    0.070265 seconds of user run time
% 0.19/0.55    0.009244 seconds of system run time
% 0.19/0.55    0 calls to %EVAL
% 0.19/0.55    0 page faults and
% 0.19/0.55    4,962,792 bytes consed.
% 0.19/0.55  :PROOF-FOUND
% 0.19/0.55  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T23:49:39
% 0.19/0.55  :PROOF-FOUND
% 0.19/0.55  * 
%------------------------------------------------------------------------------