↑ Up

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

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

% Computer : n017.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 02:26:55 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
    ( equalish(add(additive_identity,X),X)
    | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).

cnf(existence_of_inverse_addition,axiom,
    ( equalish(add(X,additive_inverse(X)),additive_identity)
    | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).

cnf(well_definedness_of_additive_identity,axiom,
    defined(additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).

cnf(well_definedness_of_additive_inverse,axiom,
    ( defined(additive_inverse(X))
    | ~ defined(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).

cnf(transitivity_of_equality,axiom,
    ( equalish(X,Y)
    | ~ equalish(X,Z)
    | ~ equalish(Z,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).

cnf(additive_inverse_not_equal_to_additive_identity_1,negated_conjecture,
    ~ equalish(additive_inverse(additive_identity),additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_not_equal_to_additive_identity_1) ).

cnf(31,plain,
    defined(additive_inverse(additive_identity)),
    inference('HYPERRESOLVE',[status(thm)],[well_definedness_of_additive_inverse,well_definedness_of_additive_identity]) ).

cnf(37,plain,
    equalish(add(additive_identity,additive_inverse(additive_identity)),additive_identity),
    inference('HYPERRESOLVE',[status(thm)],[existence_of_inverse_addition,well_definedness_of_additive_identity]) ).

cnf(198,plain,
    equalish(add(additive_identity,additive_inverse(additive_identity)),additive_inverse(additive_identity)),
    inference('HYPERRESOLVE',[status(thm)],[existence_of_identity_addition,31]) ).

cnf(16481,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[transitivity_of_equality,37,additive_inverse_not_equal_to_additive_identity_1]),198]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : FLD006-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.14  % Command  : run-snark %s %d
% 0.15/0.36  % Computer : n017.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Mon Jun  6 18:09:01 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.22/0.49  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.50  * 
% 0.22/0.50  * 
% 0.22/0.50  #<PACKAGE "SNARK-USER">
% 0.22/0.50  * 
% 0.22/0.50  SNARK-TPTP-OPTIONS
% 0.22/0.50  * 
% 0.22/0.51  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.51   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.51   (USE-FACTORING :POS)
% 0.22/0.51   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.51   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.51   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.51   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.51   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.51   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.51   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.51   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.51   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.51   (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.51  * 
% 0.22/0.51  "."
% 0.22/0.51  * 
% 0.22/0.51  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-06T18:09:02
% 0.22/0.51  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-06T18:09:02
% 0.22/0.52  
% 0.22/0.52  ; Recognized commutativity assertion (OR (|equalish| ?X ?Y) (NOT (|equalish| ?Y ?X))).
% 3.97/4.18  ; Declaring equalish to be commutative.
% 3.97/4.18  
% 3.97/4.18  #||
% 3.97/4.18  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.97/4.18  % SZS output start Refutation
% See solution above
% 3.97/4.18  ||#
% 3.97/4.18  
% 3.97/4.18  ; Summary of computation:
% 3.97/4.18  ;     36955 formulas have been input or derived (from 69 formulas).
% 3.97/4.18  ;     16481 (45%) were retained.  Of these,
% 3.97/4.18  ;           10 ( 0%) were simplified or subsumed later,
% 3.97/4.18  ;        16471 (100%) are still being kept.
% 3.97/4.18  ; 
% 3.97/4.18  ; Run time in seconds excluding printing time:
% 3.97/4.18  ;     0.006   0%   Read assertion file          (1 call)
% 3.97/4.18  ;     0.001   0%   Assert                       (28 calls)
% 3.97/4.18  ;     2.061  56%   Process new row              (36,585 calls)
% 3.97/4.18  ;     0.540  15%   Resolution                   (136 calls)
% 3.97/4.18  ;     0.002   0%   Paramodulation               (68 calls)
% 3.97/4.18  ;     0.000   0%   Factoring                    (1 call)
% 3.97/4.18  ;     0.000   0%   Condensing                   (369 calls)
% 3.97/4.18  ;     0.014   0%   Forward subsumption          (369 calls)
% 3.97/4.18  ;     0.007   0%   Backward subsumption         (227 calls)
% 3.97/4.18  ;     0.001   0%   Clause clause subsumption    (732 calls)
% 3.97/4.18  ;     0.381  10%   Forward simplification       (36,585 calls)
% 3.97/4.18  ;     0.514  14%   Backward simplification      (16,481 calls)
% 3.97/4.18  ;     0.001   0%   Ordering                     (451 calls)
% 3.97/4.18  ;     0.000   0%   Sortal reasoning             (32 calls)
% 3.97/4.18  ;     0.001   0%   Purity testing               (1 call)
% 3.97/4.18  ;     0.125   3%   Other
% 3.97/4.18  ;     3.654        Total
% 3.97/4.18  ;     3.677        Real time
% 3.97/4.19  ; 
% 3.97/4.19  ; Term-hash-array has 46,395 terms in all.
% 3.97/4.19  ; Feature-vector-row-index has 217 entries (217 at peak, 227 added, 10 deleted).
% 3.97/4.19  ; Feature-vector-row-index has 736 nodes (736 at peak, 754 added, 18 deleted).
% 3.97/4.19  ;  Retrieved 749 possibly forward subsuming rows in 369 calls.
% 3.97/4.19  ;  Retrieved 111 possibly backward subsumed rows in 227 calls.
% 3.97/4.19  ; Path-index has 46,392 entries (46,392 at peak, 46,406 added, 14 deleted).
% 3.97/4.19  ; Path-index has 1,513 nodes (1,513 at peak, 1,521 added, 8 deleted).
% 3.97/4.19  ; Trie-index has 46,392 entries (46,392 at peak, 46,406 added, 14 deleted).
% 3.97/4.19  ; Trie-index has 254,814 nodes (254,814 at peak, 254,842 added, 28 deleted).
% 3.97/4.19  ; Retrieved 19,968 generalization terms in 37,525 calls.
% 3.97/4.19  ; Retrieved 17,975 instance terms in 16,253 calls.
% 3.97/4.19  ; Retrieved 1,193,503 unifiable terms in 4,806 calls.
% 3.97/4.19  ; 
% 3.97/4.19  ; The agenda of rows to process has 159 entries:
% 3.97/4.19  ;     8 with value 13             16 with value 16              64 with value 20
% 3.97/4.19  ;    14 with value 14             24 with value 18              32 with value 21
% 3.97/4.19  ;     1 with value 15
% 3.97/4.19  ; The agenda of rows to give has 16402 entries:
% 3.97/4.19  ;    43 with value (4 10)        192 with value (4 19)        2616 with value (4 27)
% 3.97/4.19  ;   100 with value (4 11)        248 with value (4 20)         192 with value (4 28)
% 3.97/4.19  ;   113 with value (4 12)        344 with value (4 21)        3000 with value (4 29)
% 3.97/4.19  ;   179 with value (4 13)        104 with value (4 22)         264 with value (4 30)
% 3.97/4.19  ;   124 with value (4 14)        850 with value (4 23)        3172 with value (4 31)
% 3.97/4.19  ;   212 with value (4 15)         36 with value (4 24)         240 with value (4 32)
% 3.97/4.19  ;   148 with value (4 16)       1648 with value (4 25)         992 with value (4 33)
% 3.97/4.19  ;    50 with value (4 17)        127 with value (4 26)        1216 with value (4 35)
% 3.97/4.19  ;   192 with value (4 18)
% 3.97/4.19  Evaluation took:
% 3.97/4.19    3.679 seconds of real time
% 3.97/4.19    3.383377 seconds of user run time
% 3.97/4.19    0.274201 seconds of system run time
% 3.97/4.19    [Run times include 0.817 seconds GC run time.]
% 3.97/4.19    0 calls to %EVAL
% 3.97/4.19    0 page faults and
% 3.97/4.19    244,274,984 bytes consed.
% 3.97/4.19  :PROOF-FOUND
% 3.97/4.19  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-06T18:09:05
% 3.97/4.19  :PROOF-FOUND
% 3.97/4.19  * 
%------------------------------------------------------------------------------