↑ Up

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

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

% Computer : n022.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 17:59:36 EDT 2022

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

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

cnf(partitions_union,axiom,
    ( c(X)
    | d(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_union) ).

cnf(partitions_exclusive,hypothesis,
    ( ~ c(X)
    | ~ d(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_exclusive) ).

cnf(partition_c_not_empty,hypothesis,
    c(a1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition_c_not_empty) ).

cnf(partition_d_not_empty,hypothesis,
    d(a2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition_d_not_empty) ).

cnf(conjecture_1,negated_conjecture,
    ( d(f(X,Y))
    | ~ c(X)
    | ~ c(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_1) ).

cnf(conjecture_2,negated_conjecture,
    ( c(f(X,Y))
    | ~ d(X)
    | ~ d(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture_2) ).

cnf(10,plain,
    d(f(a1,a1)),
    inference('HYPERRESOLVE',[status(thm)],[conjecture_1,partition_c_not_empty,partition_c_not_empty]) ).

cnf(11,plain,
    c(f(a2,a2)),
    inference('HYPERRESOLVE',[status(thm)],[conjecture_2,partition_d_not_empty,partition_d_not_empty]) ).

cnf(12,plain,
    ( c(X)
    | c(f(a2,X)) ),
    inference('HYPERRESOLVE',[status(thm)],[conjecture_2,partition_d_not_empty,partitions_union]) ).

cnf(22,plain,
    c(f(a2,f(a1,a1))),
    inference('HYPERRESOLVE',[status(thm)],[conjecture_2,10,partition_d_not_empty]) ).

cnf(27,plain,
    d(f(a2,f(a2,a1))),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[conjecture_1,11,partition_c_not_empty]),f_is_associative,theory(equality)]) ).

cnf(54,plain,
    ~ d(f(a2,f(a1,a1))),
    inference('UR-RESOLVE',[status(thm)],[partitions_exclusive,22]) ).

cnf(66,plain,
    c(f(a2,a1)),
    inference('HYPERRESOLVE',[status(thm)],[partitions_exclusive,27,12]) ).

cnf(76,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[conjecture_1,66,partition_c_not_empty]),54,f_is_associative,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n022.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  8 03:24:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T03:24:50
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-08T03:24:50
% 0.20/0.48  
% 0.20/0.52  ; Recognized associativity assertion (= (|f| ?X (|f| ?Y ?Z)) (|f| (|f| ?X ?Y) ?Z)).
% 0.20/0.52  
% 0.20/0.52  #||
% 0.20/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.52  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;       161 formulas have been input or derived (from 20 formulas).
% 0.20/0.52  ;        76 (47%) were retained.  Of these,
% 0.20/0.52  ;           76 (100%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.001   2%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.001   2%   Assert                       (7 calls)
% 0.20/0.52  ;     0.007  15%   Process new row              (122 calls)
% 0.20/0.52  ;     0.005  10%   Resolution                   (38 calls)
% 0.20/0.52  ;     0.000   0%   Paramodulation               (19 calls)
% 0.20/0.52  ;     0.000   0%   Factoring                    (3 calls)
% 0.20/0.52  ;     0.000   0%   Condensing                   (37 calls)
% 0.20/0.52  ;     0.002   4%   Forward subsumption          (37 calls)
% 0.20/0.52  ;     0.001   2%   Backward subsumption         (33 calls)
% 0.20/0.52  ;     0.000   0%   Clause clause subsumption    (130 calls)
% 0.20/0.52  ;     0.006  12%   Forward simplification       (122 calls)
% 0.20/0.52  ;     0.000   0%   Backward simplification      (76 calls)
% 0.20/0.52  ;     0.005  10%   Ordering                     (497 calls)
% 0.20/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.52  ;     0.020  42%   Other
% 0.20/0.52  ;     0.048        Total
% 0.20/0.52  ;     0.050        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 148 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 33 entries (33 at peak, 33 added, 0 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 71 nodes (71 at peak, 71 added, 0 deleted).
% 0.20/0.52  ;  Retrieved 90 possibly forward subsuming rows in 37 calls.
% 0.20/0.52  ;  Retrieved 47 possibly backward subsumed rows in 33 calls.
% 0.20/0.52  ; Path-index has 150 entries (150 at peak, 150 added, 0 deleted).
% 0.20/0.52  ; Path-index has 192 nodes (192 at peak, 192 added, 0 deleted).
% 0.20/0.52  ; Trie-index has 150 entries (150 at peak, 150 added, 0 deleted).
% 0.20/0.52  ; Trie-index has 413 nodes (413 at peak, 413 added, 0 deleted).
% 0.20/0.52  ; Retrieved 338 generalization terms in 497 calls.
% 0.20/0.52  ; Retrieved 55 instance terms in 54 calls.
% 0.20/0.52  ; Retrieved 716 unifiable terms in 165 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of rows to process has 23 entries:
% 0.20/0.52  ;     3 with value 13              8 with value 15              12 with value 18
% 0.20/0.52  ; The agenda of rows to give has 56 entries:
% 0.20/0.52  ;     1 with value (4 10)         12 with value (4 14)           2 with value (4 18)
% 0.20/0.52  ;     1 with value (4 11)          4 with value (4 16)           9 with value (4 19)
% 0.20/0.52  ;     3 with value (4 12)          8 with value (4 17)          13 with value (4 20)
% 0.20/0.52  ;     3 with value (4 13)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.05 seconds of real time
% 0.20/0.52    0.043298 seconds of user run time
% 0.20/0.52    0.006926 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    2,976,104 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T03:24:50
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  * 
%------------------------------------------------------------------------------