↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP525-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n014.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:16 EDT 2022

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

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

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

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

cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).

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

cnf(6,plain,
    divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
    inference('REWRITE',[status(thm)],[prove_these_axioms_1,5,theory(equality)]) ).

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

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

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

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

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

cnf(33,plain,
    divide(X,X) = divide(Y,Y),
    inference('REWRITE',[status(thm)],[11,32,theory(equality)]) ).

cnf(34,plain,
    $false,
    inference('REWRITE',[status(thm)],[6,33,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP525-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n014.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 08:49:37 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 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.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:49:37
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-13T08:49:37
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  #||
% 0.19/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  ||#
% 0.19/0.51  
% 0.19/0.51  ; Summary of computation:
% 0.19/0.51  ;        57 formulas have been input or derived (from 9 formulas).
% 0.19/0.51  ;        34 (60%) were retained.  Of these,
% 0.19/0.51  ;            5 (15%) were simplified or subsumed later,
% 0.19/0.51  ;           29 (85%) are still being kept.
% 0.19/0.51  ; 
% 0.19/0.51  ; Run time in seconds excluding printing time:
% 0.19/0.51  ;     0.001   3%   Read assertion file          (1 call)
% 0.19/0.51  ;     0.000   0%   Assert                       (4 calls)
% 0.19/0.51  ;     0.004  12%   Process new row              (45 calls)
% 0.19/0.51  ;     0.000   0%   Resolution                   (16 calls)
% 0.19/0.51  ;     0.002   6%   Paramodulation               (8 calls)
% 0.19/0.51  ;     0.000   0%   Forward simplification       (45 calls)
% 0.19/0.51  ;     0.003   9%   Backward simplification      (34 calls)
% 0.19/0.51  ;     0.000   0%   Ordering                     (132 calls)
% 0.19/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.51  ;     0.022  69%   Other
% 0.19/0.51  ;     0.032        Total
% 0.19/0.51  ;     0.034        Real time
% 0.19/0.51  ; 
% 0.19/0.51  ; Term-hash-array has 115 terms in all.
% 0.19/0.51  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.51  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.51  ; Path-index has 99 entries (109 at peak, 123 added, 24 deleted).
% 0.19/0.51  ; Path-index has 400 nodes (414 at peak, 431 added, 31 deleted).
% 0.19/0.51  ; Trie-index has 99 entries (109 at peak, 123 added, 24 deleted).
% 0.19/0.51  ; Trie-index has 365 nodes (392 at peak, 424 added, 59 deleted).
% 0.19/0.51  ; Retrieved 35 generalization terms in 192 calls.
% 0.19/0.51  ; Retrieved 72 instance terms in 34 calls.
% 0.19/0.51  ; Retrieved 142 unifiable terms in 49 calls.
% 0.19/0.51  ; 
% 0.19/0.51  ; The agenda of backward simplifiable rows to process has 1 entry:
% 0.19/0.51  ;     1 with value 0
% 0.19/0.51  ; The agenda of rows to process has 9 entries:
% 0.19/0.51  ;     2 with value 15              2 with value 17               3 with value 19
% 0.19/0.51  ;     2 with value 16
% 0.19/0.51  ; The agenda of rows to give has 21 entries:
% 0.19/0.51  ;     1 with value (4 10)          2 with value (4 17)           2 with value (4 20)
% 0.19/0.51  ;     1 with value (4 14)          3 with value (4 18)           2 with value (4 21)
% 0.19/0.51  ;     3 with value (4 15)          1 with value (4 19)           2 with value (4 22)
% 0.19/0.51  ;     4 with value (4 16)
% 0.19/0.51  Evaluation took:
% 0.19/0.51    0.034 seconds of real time
% 0.19/0.51    0.030323 seconds of user run time
% 0.19/0.51    0.003969 seconds of system run time
% 0.19/0.51    0 calls to %EVAL
% 0.19/0.51    0 page faults and
% 0.19/0.51    2,378,712 bytes consed.
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:49:37
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  * 
%------------------------------------------------------------------------------