↑ Up

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

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

% Computer : n018.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 : Thu Jul 14 23:48:51 EDT 2022

% Result   : Unsatisfiable 0.51s 0.70s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;   2 RR)
%            Number of literals    :   15 (  14 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-3 aty)
%            Number of variables   :   38 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity,axiom,
    multiply(multiply(X,Y,Z),U,multiply(X,Y,V)) = multiply(X,Y,multiply(Z,U,V)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).

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

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

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

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

cnf(6,plain,
    multiply(X,Y,X) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[ternary_multiply_2,associativity,theory(equality)]),ternary_multiply_2,theory(equality)]) ).

cnf(8,plain,
    multiply(multiply(X,Y,Z),U,Y) = multiply(X,Y,multiply(Z,U,Y)),
    inference('PARAMODULATE',[status(thm)],[associativity,ternary_multiply_1,theory(equality)]) ).

cnf(10,plain,
    multiply(multiply(X,Y,Z),Z,multiply(X,Y,U)) = multiply(X,Y,Z),
    inference('PARAMODULATE',[status(thm)],[associativity,ternary_multiply_2,theory(equality)]) ).

cnf(66,plain,
    multiply(multiply(X,Y,Z),Z,Y) = multiply(X,Y,Z),
    inference('PARAMODULATE',[status(thm)],[8,ternary_multiply_2,theory(equality)]) ).

cnf(67,plain,
    multiply(multiply(X,Y,inverse(Z)),Z,Y) = Y,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,left_inverse,theory(equality)]),ternary_multiply_1,theory(equality)]) ).

cnf(118,plain,
    multiply(multiply(X,inverse(Y),Z),Y,Z) = Z,
    inference('PARAMODULATE',[status(thm)],[67,66,theory(equality)]) ).

cnf(197,plain,
    multiply(multiply(X,Y,Z),Z,X) = multiply(X,Y,Z),
    inference('PARAMODULATE',[status(thm)],[10,6,theory(equality)]) ).

cnf(230,plain,
    multiply(multiply(X,Y,Z),X,Z) = multiply(X,Y,Z),
    inference('PARAMODULATE',[status(thm)],[66,197,theory(equality)]) ).

cnf(258,plain,
    multiply(X,inverse(X),Y) = Y,
    inference('PARAMODULATE',[status(thm)],[118,230,theory(equality)]) ).

cnf(259,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_equation,258,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : BOO002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun  1 19:38:29 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/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.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T19:38:29
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-01T19:38:29
% 0.51/0.70  
% 0.51/0.70  
% 0.51/0.70  #||
% 0.51/0.70  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.70  % SZS output start Refutation
% See solution above
% 0.51/0.70  ||#
% 0.51/0.70  
% 0.51/0.70  ; Summary of computation:
% 0.51/0.70  ;       785 formulas have been input or derived (from 24 formulas).
% 0.51/0.70  ;       259 (33%) were retained.  Of these,
% 0.51/0.70  ;           16 ( 6%) were simplified or subsumed later,
% 0.51/0.70  ;          243 (94%) are still being kept.
% 0.51/0.70  ; 
% 0.51/0.70  ; Run time in seconds:
% 0.51/0.70  ;     0.001   0%   Read assertion file          (1 call)
% 0.51/0.70  ;     0.000   0%   Assert                       (5 calls)
% 0.51/0.70  ;     0.041  18%   Process new row              (708 calls)
% 0.51/0.70  ;     0.001   0%   Resolution                   (46 calls)
% 0.51/0.70  ;     0.021   9%   Paramodulation               (23 calls)
% 0.51/0.70  ;     0.056  25%   Forward simplification       (708 calls)
% 0.51/0.70  ;     0.025  11%   Backward simplification      (259 calls)
% 0.51/0.70  ;     0.051  23%   Ordering                     (3,444 calls)
% 0.51/0.70  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.51/0.70  ;     0.000   0%   Purity testing               (1 call)
% 0.51/0.70  ;     0.027  12%   Other
% 0.51/0.70  ;     0.223        Total
% 0.51/0.70  ;     0.225        Real time
% 0.51/0.70  ; 
% 0.51/0.70  ; Term-hash-array has 799 terms in all.
% 0.51/0.70  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.51/0.70  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.51/0.70  ; Path-index has 766 entries (770 at peak, 810 added, 44 deleted).
% 0.51/0.70  ; Path-index has 238 nodes (247 at peak, 248 added, 10 deleted).
% 0.51/0.70  ; Trie-index has 766 entries (770 at peak, 810 added, 44 deleted).
% 0.51/0.70  ; Trie-index has 1,568 nodes (1,579 at peak, 1,623 added, 55 deleted).
% 0.51/0.70  ; Retrieved 29,601 generalization terms in 3,506 calls.
% 0.51/0.70  ; Retrieved 8,641 instance terms in 385 calls.
% 0.51/0.70  ; Retrieved 5,836 unifiable terms in 126 calls.
% 0.51/0.70  ; 
% 0.51/0.70  ; The agenda of rows to process has 56 entries:
% 0.51/0.70  ;     1 with value 14             14 with value 22               2 with value 30
% 0.51/0.70  ;     5 with value 15              5 with value 25               4 with value 32
% 0.51/0.70  ;     1 with value 16              4 with value 26               1 with value 35
% 0.51/0.70  ;     5 with value 18              7 with value 29               1 with value 39
% 0.51/0.70  ;     6 with value 19
% 0.51/0.70  ; The agenda of rows to give has 220 entries:
% 0.51/0.70  ;     1 with value (4 14)         18 with value (4 24)          10 with value (4 31)
% 0.51/0.70  ;     2 with value (4 18)         13 with value (4 25)          17 with value (4 32)
% 0.51/0.70  ;     4 with value (4 19)          7 with value (4 26)          16 with value (4 33)
% 0.51/0.70  ;     2 with value (4 20)         25 with value (4 27)           5 with value (4 34)
% 0.51/0.70  ;    11 with value (4 21)         31 with value (4 28)           4 with value (4 35)
% 0.51/0.70  ;     6 with value (4 22)         14 with value (4 29)           6 with value (4 36)
% 0.51/0.70  ;     3 with value (4 23)         25 with value (4 30)
% 0.51/0.70  Evaluation took:
% 0.51/0.70    0.225 seconds of real time
% 0.51/0.70    0.204104 seconds of user run time
% 0.51/0.70    0.020162 seconds of system run time
% 0.51/0.70    0 calls to %EVAL
% 0.51/0.70    0 page faults and
% 0.51/0.70    11,614,128 bytes consed.
% 0.51/0.70  :PROOF-FOUND
% 0.51/0.70  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-01T19:38:30
% 0.51/0.70  :PROOF-FOUND
% 0.51/0.70  * 
%------------------------------------------------------------------------------