↑ Up

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

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

% Computer : n026.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 : Fri Jul 15 00:41:46 EDT 2022

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

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

cnf(q_definition,axiom,
    apply(apply(apply(q,X),Y),Z) = apply(Y,apply(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_definition) ).

cnf(w_definition,axiom,
    apply(apply(w,X),Y) = apply(apply(X,Y),Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_definition) ).

cnf(prove_p_combinator,negated_conjecture,
    apply(apply(apply(apply(apply(apply(b,apply(w,apply(q,apply(q,q)))),q),x),y),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p_combinator) ).

cnf(5,plain,
    apply(apply(apply(w,apply(apply(apply(apply(apply(q,w),b),apply(q,apply(q,q))),q),x)),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference('REWRITE',[status(thm)],[prove_p_combinator,w_definition,q_definition,theory(equality)]) ).

cnf(10,plain,
    apply(apply(apply(w,b),X),Y) = apply(X,apply(X,Y)),
    inference('PARAMODULATE',[status(thm)],[b_definition,w_definition,theory(equality)]) ).

cnf(14,plain,
    apply(apply(apply(apply(b,w),X),Y),Z) = apply(apply(apply(X,Y),Z),Z),
    inference('PARAMODULATE',[status(thm)],[w_definition,b_definition,theory(equality)]) ).

cnf(19,plain,
    apply(apply(apply(apply(apply(b,b),X),Y),Z),U) = apply(apply(X,Y),apply(Z,U)),
    inference('PARAMODULATE',[status(thm)],[b_definition,b_definition,theory(equality)]) ).

cnf(21,plain,
    apply(apply(w,apply(q,X)),Y) = apply(Y,apply(X,Y)),
    inference('PARAMODULATE',[status(thm)],[w_definition,q_definition,theory(equality)]) ).

cnf(22,plain,
    apply(apply(apply(w,q),X),Y) = apply(X,apply(X,Y)),
    inference('PARAMODULATE',[status(thm)],[q_definition,w_definition,theory(equality)]) ).

cnf(23,plain,
    apply(apply(apply(b,X),Y),Z) = apply(apply(apply(q,Y),X),Z),
    inference('PARAMODULATE',[status(thm)],[b_definition,q_definition,theory(equality)]) ).

cnf(24,plain,
    apply(apply(apply(apply(apply(b,w),apply(q,x)),apply(apply(q,q),apply(q,x))),y),z) != apply(apply(x,y),apply(apply(x,y),z)),
    inference('REWRITE',[status(thm)],[5,q_definition,21,19,23,theory(equality)]) ).

cnf(34,plain,
    apply(apply(apply(apply(q,X),apply(q,Y)),Z),U) = apply(apply(X,Z),apply(Y,U)),
    inference('PARAMODULATE',[status(thm)],[q_definition,q_definition,theory(equality)]) ).

cnf(136,plain,
    apply(apply(apply(w,b),X),Y) = apply(apply(apply(w,q),X),Y),
    inference('PARAMODULATE',[status(thm)],[10,22,theory(equality)]) ).

cnf(1003,plain,
    apply(apply(apply(apply(b,w),apply(q,X)),Y),Z) = apply(apply(Y,apply(X,Z)),Z),
    inference('PARAMODULATE',[status(thm)],[14,q_definition,theory(equality)]) ).

cnf(1004,plain,
    $false,
    inference('REWRITE',[status(thm)],[24,10,136,w_definition,34,1003,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem  : COL066-3 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.11/0.14  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n026.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue May 31 05:17:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T05:17:11
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-05-31T05:17:11
% 2.85/3.05  
% 2.85/3.05  
% 2.85/3.05  #||
% 2.85/3.05  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.85/3.05  % SZS output start Refutation
% See solution above
% 2.85/3.05  ||#
% 2.85/3.05  
% 2.85/3.05  ; Summary of computation:
% 2.85/3.05  ;      3297 formulas have been input or derived (from 32 formulas).
% 2.85/3.05  ;      1004 (30%) were retained.  Of these,
% 2.85/3.05  ;           68 ( 7%) were simplified or subsumed later,
% 2.85/3.05  ;          936 (93%) are still being kept.
% 2.85/3.05  ; 
% 2.85/3.05  ; Run time in seconds excluding printing time:
% 2.85/3.05  ;     0.002   0%   Read assertion file          (1 call)
% 2.85/3.05  ;     0.000   0%   Assert                       (4 calls)
% 2.85/3.05  ;     0.146   6%   Process new row              (3,070 calls)
% 2.85/3.05  ;     0.003   0%   Resolution                   (62 calls)
% 2.85/3.05  ;     0.073   3%   Paramodulation               (31 calls)
% 2.85/3.05  ;     0.826  32%   Forward simplification       (2,958 calls)
% 2.85/3.05  ;     0.162   6%   Backward simplification      (1,003 calls)
% 2.85/3.05  ;     1.309  51%   Ordering                     (207,244 calls)
% 2.85/3.05  ;     0.000   0%   Sortal reasoning             (32 calls)
% 2.85/3.05  ;     0.000   0%   Purity testing               (1 call)
% 2.85/3.05  ;     0.038   1%   Other
% 2.85/3.05  ;     2.559        Total
% 2.85/3.05  ;     2.562        Real time
% 2.85/3.05  ; 
% 2.85/3.05  ; Term-hash-array has 3,419 terms in all.
% 2.85/3.05  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 2.85/3.05  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 2.85/3.05  ; Path-index has 3,250 entries (3,260 at peak, 3,454 added, 204 deleted).
% 2.85/3.05  ; Path-index has 765 nodes (789 at peak, 862 added, 97 deleted).
% 2.85/3.05  ; Trie-index has 3,250 entries (3,260 at peak, 3,454 added, 204 deleted).
% 2.85/3.05  ; Trie-index has 15,836 nodes (15,901 at peak, 16,903 added, 1,067 deleted).
% 2.85/3.05  ; Retrieved 478,140 generalization terms in 39,278 calls.
% 2.85/3.05  ; Retrieved 62,347 instance terms in 2,766 calls.
% 2.85/3.05  ; Retrieved 27,439 unifiable terms in 323 calls.
% 2.85/3.05  ; 
% 2.85/3.05  ; The agenda of rows to process has 214 entries:
% 2.85/3.05  ;     3 with value 26             16 with value 35               2 with value 46
% 2.85/3.05  ;     2 with value 27             29 with value 36               2 with value 47
% 2.85/3.05  ;    11 with value 28              9 with value 37               1 with value 48
% 2.85/3.05  ;    21 with value 29              1 with value 38               1 with value 49
% 2.85/3.05  ;     9 with value 30              4 with value 39               2 with value 51
% 2.85/3.05  ;    21 with value 31              5 with value 40               2 with value 54
% 2.85/3.05  ;    13 with value 32              2 with value 41               1 with value 59
% 2.85/3.05  ;    19 with value 33              1 with value 43               2 with value 60
% 2.85/3.05  ;    33 with value 34              1 with value 44               1 with value 66
% 2.85/3.05  ; The agenda of rows to give has 907 entries:
% 2.85/3.05  ;     8 with value (4 23)         98 with value (4 33)           4 with value (4 44)
% 2.85/3.05  ;    19 with value (4 24)         64 with value (4 34)           3 with value (4 46)
% 2.85/3.05  ;    30 with value (4 25)         86 with value (4 35)           2 with value (4 47)
% 2.85/3.05  ;    50 with value (4 26)         25 with value (4 36)           1 with value (4 48)
% 2.85/3.05  ;    37 with value (4 27)         37 with value (4 37)           1 with value (4 49)
% 2.85/3.05  ;    58 with value (4 28)         29 with value (4 38)           3 with value (4 52)
% 2.85/3.05  ;    66 with value (4 29)         12 with value (4 39)           1 with value (4 57)
% 2.85/3.05  ;    89 with value (4 30)          6 with value (4 40)           1 with value (4 61)
% 2.85/3.05  ;    95 with value (4 31)          5 with value (4 41)           1 with value (4 65)
% 2.85/3.05  ;    73 with value (4 32)          3 with value (4 42)
% 2.85/3.05  Evaluation took:
% 2.85/3.05    2.562 seconds of real time
% 2.85/3.05    2.264026 seconds of user run time
% 2.85/3.05    0.297713 seconds of system run time
% 2.85/3.05    [Run times include 0.095 seconds GC run time.]
% 2.85/3.05    0 calls to %EVAL
% 2.85/3.05    0 page faults and
% 2.85/3.05    167,433,816 bytes consed.
% 2.85/3.05  :PROOF-FOUND
% 2.85/3.05  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T05:17:13
% 2.85/3.05  :PROOF-FOUND
% 2.85/3.05  * 
%------------------------------------------------------------------------------