↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : COL064-7 : TPTP v8.1.0. Bugfixed v1.2.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 : Fri Jul 15 00:41:45 EDT 2022

% Result   : Unsatisfiable 115.34s 115.58s
% Output   : Refutation 115.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   5 RR)
%            Number of literals    :   24 (  23 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   72 (   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(t_definition,axiom,
    apply(apply(t,X),Y) = apply(Y,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).

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

cnf(4,plain,
    apply(apply(apply(apply(apply(apply(apply(b,b),t),apply(apply(b,b),t)),apply(apply(b,b),apply(apply(b,t),t))),x),y),z) != apply(apply(z,x),y),
    inference('REWRITE',[status(thm)],[prove_v_combinator,b_definition,theory(equality)]) ).

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

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

cnf(8,plain,
    apply(apply(apply(apply(apply(apply(b,b),b),apply(t,z)),apply(b,apply(t,y))),apply(apply(b,apply(t,x)),apply(apply(apply(b,b),t),apply(apply(b,b),t)))),apply(apply(b,b),apply(apply(b,t),t))) != apply(apply(z,x),y),
    inference('REWRITE',[status(thm)],[4,b_definition,7,theory(equality)]) ).

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

cnf(12,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(17,plain,
    apply(apply(apply(b,X),Y),Z) = apply(apply(apply(b,X),apply(t,Z)),Y),
    inference('PARAMODULATE',[status(thm)],[b_definition,5,theory(equality)]) ).

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

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

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

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

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

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

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

cnf(2291,plain,
    apply(apply(apply(apply(apply(b,b),X),apply(Y,Z)),apply(t,U)),V) = apply(apply(apply(apply(b,X),apply(t,Z)),Y),apply(V,U)),
    inference('PARAMODULATE',[status(thm)],[5,25,theory(equality)]) ).

cnf(3053,plain,
    apply(apply(apply(apply(apply(apply(b,b),b),apply(t,X)),apply(t,Y)),Z),apply(U,V)) = apply(apply(apply(apply(b,apply(Z,Y)),U),V),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[62,5,theory(equality)]),b_definition,theory(equality)]) ).

cnf(3541,plain,
    apply(apply(apply(b,X),apply(apply(b,Y),Z)),apply(U,V)) = apply(apply(apply(b,X),Y),apply(apply(apply(b,Z),U),V)),
    inference('PARAMODULATE',[status(thm)],[142,144,theory(equality)]) ).

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

cnf(3562,plain,
    apply(apply(apply(b,apply(t,z)),apply(apply(b,apply(t,y)),apply(t,x))),apply(apply(apply(apply(b,b),t),apply(apply(b,b),t)),apply(apply(b,b),apply(apply(b,t),t)))) != apply(apply(z,x),y),
    inference('REWRITE',[status(thm)],[8,3541,3561,theory(equality)]) ).

cnf(3617,plain,
    apply(apply(apply(apply(apply(b,b),t),X),apply(apply(b,Y),apply(apply(b,Z),U))),V) = apply(apply(apply(apply(b,Y),Z),apply(U,V)),X),
    inference('PARAMODULATE',[status(thm)],[54,144,theory(equality)]) ).

cnf(3769,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3562,7,theory(equality)]),19,687,3617,t_definition,b_definition,17,2291,3053,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : COL064-7 : TPTP v8.1.0. Bugfixed v1.2.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 : Tue May 31 15:08:43 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 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-05-31T15:08:43
% 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-05-31T15:08:43
% 115.34/115.58  
% 115.34/115.58  
% 115.34/115.58  #||
% 115.34/115.58  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 115.34/115.58  % SZS output start Refutation
% See solution above
% 115.34/115.59  ||#
% 115.34/115.59  
% 115.34/115.59  ; Summary of computation:
% 115.34/115.59  ;      7367 formulas have been input or derived (from 39 formulas).
% 115.34/115.59  ;      3769 (51%) were retained.  Of these,
% 115.34/115.59  ;          142 ( 4%) were simplified or subsumed later,
% 115.34/115.59  ;         3627 (96%) are still being kept.
% 115.34/115.59  ; 
% 115.34/115.59  ; Run time in seconds excluding printing time:
% 115.34/115.59  ;     0.001   0%   Read assertion file          (1 call)
% 115.34/115.59  ;     0.000   0%   Assert                       (3 calls)
% 115.34/115.59  ;     0.775   1%   Process new row              (7,203 calls)
% 115.34/115.59  ;     0.021   0%   Resolution                   (76 calls)
% 115.34/115.59  ;     0.185   0%   Paramodulation               (38 calls)
% 115.34/115.59  ;    14.501  13%   Forward simplification       (6,556 calls)
% 115.34/115.59  ;     5.188   5%   Backward simplification      (3,768 calls)
% 115.34/115.59  ;    94.365  82%   Ordering                     (9,523,172 calls)
% 115.34/115.59  ;     0.001   0%   Sortal reasoning             (32 calls)
% 115.34/115.59  ;     0.000   0%   Purity testing               (1 call)
% 115.34/115.59  ;     0.072   0%   Other
% 115.34/115.59  ;   115.109        Total
% 115.34/115.59  ;   115.117        Real time
% 115.34/115.59  ; 
% 115.34/115.59  ; Term-hash-array has 12,673 terms in all.
% 115.34/115.59  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 115.34/115.59  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 115.34/115.59  ; Path-index has 12,209 entries (12,210 at peak, 12,831 added, 622 deleted).
% 115.34/115.59  ; Path-index has 2,088 nodes (2,089 at peak, 2,516 added, 428 deleted).
% 115.34/115.59  ; Trie-index has 12,209 entries (12,210 at peak, 12,831 added, 622 deleted).
% 115.34/115.59  ; Trie-index has 65,715 nodes (65,732 at peak, 73,058 added, 7,343 deleted).
% 115.34/115.59  ; Retrieved 2,283,387 generalization terms in 95,173 calls.
% 115.34/115.59  ; Retrieved 1,495,678 instance terms in 11,043 calls.
% 115.34/115.59  ; Retrieved 118,280 unifiable terms in 476 calls.
% 115.34/115.59  ; 
% 115.34/115.59  ; The agenda of rows to process has 137 entries:
% 115.34/115.59  ;     2 with value 48             12 with value 56               9 with value 63
% 115.34/115.59  ;     3 with value 49             15 with value 57               1 with value 64
% 115.34/115.59  ;     2 with value 51             14 with value 58               1 with value 66
% 115.34/115.59  ;     3 with value 52             10 with value 59               1 with value 67
% 115.34/115.59  ;     4 with value 53             19 with value 60               1 with value 71
% 115.34/115.59  ;     5 with value 54             19 with value 61               1 with value 72
% 115.34/115.59  ;     7 with value 55              8 with value 62
% 115.34/115.59  ; The agenda of rows to give has 3591 entries:
% 115.34/115.59  ;     2 with value (4 28)        276 with value (4 44)           2 with value (4 60)
% 115.34/115.59  ;    23 with value (4 29)        220 with value (4 45)           1 with value (4 76)
% 115.34/115.59  ;    18 with value (4 30)        108 with value (4 46)           2 with value (4 79)
% 115.34/115.59  ;    44 with value (4 31)         64 with value (4 47)           1 with value (4 80)
% 115.34/115.59  ;    50 with value (4 32)         37 with value (4 48)           3 with value (4 85)
% 115.34/115.59  ;    61 with value (4 33)         29 with value (4 49)           1 with value (4 86)
% 115.34/115.59  ;   110 with value (4 34)         24 with value (4 50)           2 with value (4 87)
% 115.34/115.59  ;   164 with value (4 35)         10 with value (4 51)           1 with value (4 89)
% 115.34/115.59  ;   187 with value (4 36)         18 with value (4 52)           1 with value (4 95)
% 115.34/115.59  ;   188 with value (4 37)          6 with value (4 53)           1 with value (4 96)
% 115.34/115.59  ;   255 with value (4 38)          6 with value (4 54)           1 with value (4 102)
% 115.34/115.59  ;   318 with value (4 39)          4 with value (4 55)           1 with value (4 106)
% 115.34/115.59  ;   369 with value (4 40)          3 with value (4 56)           1 with value (4 109)
% 115.34/115.59  ;   339 with value (4 41)          4 with value (4 57)           1 with value (4 115)
% 115.34/115.59  ;   298 with value (4 42)          2 with value (4 58)           1 with value (4 131)
% 115.34/115.59  ;   334 with value (4 43)
% 115.34/115.59  Evaluation took:
% 115.34/115.59    115.118 seconds of real time
% 115.34/115.59    105.023575 seconds of user run time
% 115.34/115.59    10.08985 seconds of system run time
% 115.34/115.59    [Run times include 6.007 seconds GC run time.]
% 115.34/115.59    0 calls to %EVAL
% 115.34/115.59    0 page faults and
% 115.34/115.59    7,875,976,600 bytes consed.
% 115.34/115.59  :PROOF-FOUND
% 115.34/115.59  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T15:10:38
% 115.34/115.59  :PROOF-FOUND
% 115.34/115.59  * 
%------------------------------------------------------------------------------