TSTP Solution File: LAT013-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : LAT013-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n014.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 : Sun Jul 17 06:41:50 EDT 2022

% Result   : Unsatisfiable 26.49s 26.70s
% Output   : Refutation 26.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   45 (  45 unt;   0 nHn;   2 RR)
%            Number of literals    :   45 (  44 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :  118 (  36 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(mckenzie1,axiom,
    join(X,meet(Y,meet(X,Z))) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie1) ).

cnf(mckenzie2,axiom,
    meet(X,join(Y,join(X,Z))) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie2) ).

cnf(mckenzie3,axiom,
    join(join(meet(X,Y),meet(Y,Z)),Y) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie3) ).

cnf(mckenzie4,axiom,
    meet(meet(join(X,Y),join(Y,Z)),Y) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',mckenzie4) ).

cnf(prove_associativity_of_meet,negated_conjecture,
    meet(meet(a,b),c) != meet(a,meet(b,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_associativity_of_meet) ).

cnf(6,plain,
    join(X,meet(Y,X)) = X,
    inference('PARAMODULATE',[status(thm)],[mckenzie1,mckenzie2,theory(equality)]) ).

cnf(7,plain,
    meet(X,join(Y,X)) = X,
    inference('PARAMODULATE',[status(thm)],[mckenzie2,mckenzie1,theory(equality)]) ).

cnf(9,plain,
    join(meet(X,Y),Y) = Y,
    inference('PARAMODULATE',[status(thm)],[mckenzie3,mckenzie1,theory(equality)]) ).

cnf(13,plain,
    join(X,meet(X,Y)) = X,
    inference('PARAMODULATE',[status(thm)],[mckenzie1,mckenzie4,theory(equality)]) ).

cnf(14,plain,
    meet(join(X,Y),Y) = Y,
    inference('PARAMODULATE',[status(thm)],[mckenzie4,mckenzie2,theory(equality)]) ).

cnf(21,plain,
    meet(meet(X,join(meet(Y,X),Z)),meet(Y,X)) = meet(Y,X),
    inference('PARAMODULATE',[status(thm)],[mckenzie4,6,theory(equality)]) ).

cnf(29,plain,
    join(X,join(Y,X)) = join(Y,X),
    inference('PARAMODULATE',[status(thm)],[9,7,theory(equality)]) ).

cnf(31,plain,
    meet(meet(X,Y),join(Z,Y)) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[mckenzie2,9,theory(equality)]) ).

cnf(33,plain,
    meet(meet(join(X,meet(Y,Z)),Z),meet(Y,Z)) = meet(Y,Z),
    inference('PARAMODULATE',[status(thm)],[mckenzie4,9,theory(equality)]) ).

cnf(34,plain,
    meet(meet(X,Y),X) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[7,13,theory(equality)]) ).

cnf(35,plain,
    meet(meet(X,join(meet(X,Y),Z)),meet(X,Y)) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[mckenzie4,13,theory(equality)]) ).

cnf(37,plain,
    meet(X,meet(Y,X)) = meet(Y,X),
    inference('PARAMODULATE',[status(thm)],[14,6,theory(equality)]) ).

cnf(39,plain,
    join(join(X,Y),meet(Z,Y)) = join(X,Y),
    inference('PARAMODULATE',[status(thm)],[mckenzie1,14,theory(equality)]) ).

cnf(49,plain,
    join(meet(X,Y),X) = X,
    inference('PARAMODULATE',[status(thm)],[29,13,theory(equality)]) ).

cnf(51,plain,
    join(meet(X,meet(Y,Z)),Y) = Y,
    inference('PARAMODULATE',[status(thm)],[29,mckenzie1,theory(equality)]) ).

cnf(56,plain,
    join(X,meet(meet(X,Y),Z)) = X,
    inference('PARAMODULATE',[status(thm)],[mckenzie1,34,theory(equality)]) ).

cnf(62,plain,
    join(meet(X,Y),join(Z,Y)) = join(Z,Y),
    inference('PARAMODULATE',[status(thm)],[9,31,theory(equality)]) ).

cnf(70,plain,
    join(join(X,Y),meet(Y,Z)) = join(X,Y),
    inference('PARAMODULATE',[status(thm)],[39,34,theory(equality)]) ).

cnf(93,plain,
    join(meet(X,meet(Y,Z)),Z) = Z,
    inference('PARAMODULATE',[status(thm)],[51,37,theory(equality)]) ).

cnf(99,plain,
    join(X,meet(meet(Y,X),Z)) = X,
    inference('PARAMODULATE',[status(thm)],[56,37,theory(equality)]) ).

cnf(184,plain,
    join(meet(meet(X,Y),Z),Y) = Y,
    inference('PARAMODULATE',[status(thm)],[93,34,theory(equality)]) ).

cnf(1906,plain,
    meet(meet(X,Y),meet(Y,X)) = meet(Y,X),
    inference('PARAMODULATE',[status(thm)],[21,49,theory(equality)]) ).

cnf(1914,plain,
    meet(meet(X,Y),meet(meet(Z,Y),X)) = meet(meet(Z,Y),X),
    inference('PARAMODULATE',[status(thm)],[21,184,theory(equality)]) ).

cnf(1970,plain,
    meet(X,Y) = meet(Y,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,1906,theory(equality)]),1906,theory(equality)]) ).

cnf(2270,plain,
    meet(meet(join(X,Y),Z),meet(Y,Z)) = meet(Y,Z),
    inference('PARAMODULATE',[status(thm)],[33,70,theory(equality)]) ).

cnf(2273,plain,
    meet(meet(X,Y),meet(meet(X,Z),Y)) = meet(meet(X,Z),Y),
    inference('PARAMODULATE',[status(thm)],[33,56,theory(equality)]) ).

cnf(2275,plain,
    meet(meet(X,Y),meet(meet(Z,X),Y)) = meet(meet(Z,X),Y),
    inference('PARAMODULATE',[status(thm)],[33,99,theory(equality)]) ).

cnf(2340,plain,
    meet(meet(X,Y),meet(join(Z,X),Y)) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[34,2270,theory(equality)]) ).

cnf(2404,plain,
    meet(meet(X,join(Y,Z)),meet(X,Z)) = meet(X,Z),
    inference('PARAMODULATE',[status(thm)],[35,62,theory(equality)]) ).

cnf(2462,plain,
    meet(meet(X,Y),meet(X,join(Z,Y))) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[34,2404,theory(equality)]) ).

cnf(7240,plain,
    meet(meet(X,meet(Y,Z)),meet(X,Z)) = meet(X,meet(Y,Z)),
    inference('PARAMODULATE',[status(thm)],[2462,6,theory(equality)]) ).

cnf(7241,plain,
    meet(meet(X,meet(Y,Z)),meet(X,Y)) = meet(X,meet(Y,Z)),
    inference('PARAMODULATE',[status(thm)],[2462,13,theory(equality)]) ).

cnf(20178,plain,
    meet(meet(X,Y),meet(Y,meet(X,Z))) = meet(Y,meet(X,Z)),
    inference('PARAMODULATE',[status(thm)],[2273,1970,theory(equality)]) ).

cnf(20185,plain,
    meet(X,meet(join(Y,X),Z)) = meet(X,Z),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[2273,2340,theory(equality)]),7240,theory(equality)]) ).

cnf(20326,plain,
    meet(meet(X,Y),meet(Y,Z)) = meet(meet(X,Y),Z),
    inference('PARAMODULATE',[status(thm)],[20185,6,theory(equality)]) ).

cnf(20327,plain,
    meet(meet(X,Y),meet(X,Z)) = meet(Y,meet(X,Z)),
    inference('REWRITE',[status(thm)],[20178,20326,theory(equality)]) ).

cnf(20454,plain,
    meet(meet(X,Y),meet(Z,X)) = meet(Z,meet(X,Y)),
    inference('REWRITE',[status(thm)],[7241,20327,theory(equality)]) ).

cnf(20472,plain,
    meet(meet(X,Y),meet(Z,Y)) = meet(meet(X,Y),Z),
    inference('REWRITE',[status(thm)],[1914,20454,theory(equality)]) ).

cnf(20639,plain,
    meet(X,meet(Y,Z)) = meet(meet(X,Y),Z),
    inference('REWRITE',[status(thm)],[2275,20454,20472,theory(equality)]) ).

cnf(20640,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_associativity_of_meet,20639,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LAT013-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 29 01:36:42 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-06-29T01:36:42
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-29T01:36:42
% 26.49/26.70  
% 26.49/26.70  
% 26.49/26.70  #||
% 26.49/26.70  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.49/26.70  % SZS output start Refutation
% See solution above
% 26.49/26.73  ||#
% 26.49/26.73  
% 26.49/26.73  ; Summary of computation:
% 26.49/26.73  ;    147194 formulas have been input or derived (from 346 formulas).
% 26.49/26.73  ;     20640 (14%) were retained.  Of these,
% 26.49/26.73  ;         9926 (48%) were simplified or subsumed later,
% 26.49/26.73  ;        10714 (52%) are still being kept.
% 26.49/26.73  ; 
% 26.49/26.73  ; Run time in seconds excluding printing time:
% 26.49/26.73  ;     0.001   0%   Read assertion file          (1 call)
% 26.49/26.73  ;     0.000   0%   Assert                       (5 calls)
% 26.49/26.73  ;     2.757  11%   Process new row              (122,049 calls)
% 26.49/26.73  ;     0.200   1%   Resolution                   (690 calls)
% 26.49/26.73  ;     2.351   9%   Paramodulation               (345 calls)
% 26.49/26.73  ;     9.288  35%   Forward simplification       (121,454 calls)
% 26.49/26.73  ;     3.957  15%   Backward simplification      (20,640 calls)
% 26.49/26.73  ;     7.292  28%   Ordering                     (1,593,038 calls)
% 26.49/26.73  ;     0.000   0%   Sortal reasoning             (32 calls)
% 26.49/26.73  ;     0.000   0%   Purity testing               (1 call)
% 26.49/26.73  ;     0.377   1%   Other
% 26.49/26.73  ;    26.223        Total
% 26.49/26.73  ;    26.258        Real time
% 26.49/26.73  ; 
% 26.49/26.73  ; Term-hash-array has 58,634 terms in all.
% 26.49/26.73  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 26.49/26.73  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 26.49/26.73  ; Path-index has 31,638 entries (49,881 at peak, 59,044 added, 27,406 deleted).
% 26.49/26.73  ; Path-index has 26,670 nodes (30,894 at peak, 31,799 added, 5,129 deleted).
% 26.49/26.73  ; Trie-index has 31,638 entries (49,881 at peak, 59,044 added, 27,406 deleted).
% 26.49/26.73  ; Trie-index has 75,628 nodes (143,459 at peak, 157,389 added, 81,761 deleted).
% 26.49/26.73  ; Retrieved 3,990,751 generalization terms in 1,013,942 calls.
% 26.49/26.73  ; Retrieved 731,780 instance terms in 21,140 calls.
% 26.49/26.73  ; Retrieved 939,413 unifiable terms in 2,458 calls.
% 26.49/26.73  ; 
% 26.49/26.73  ; The agenda of backward simplifiable rows to process has 353 entries:
% 26.49/26.73  ;   353 with value 0
% 26.49/26.73  ; The agenda of rows to process has 381 entries:
% 26.49/26.73  ;     1 with value 23             33 with value 29              11 with value 36
% 26.49/26.73  ;    55 with value 24             43 with value 30               8 with value 37
% 26.49/26.73  ;    40 with value 25             25 with value 31               8 with value 38
% 26.49/26.73  ;    53 with value 26             34 with value 33              13 with value 39
% 26.49/26.73  ;    22 with value 27             17 with value 34               1 with value 42
% 26.49/26.73  ;    16 with value 28              1 with value 35
% 26.49/26.73  ; The agenda of rows to give has 10497 entries:
% 26.49/26.73  ;     1 with value (4 19)       1198 with value (4 30)         206 with value (4 41)
% 26.49/26.73  ;     3 with value (4 20)        740 with value (4 31)         202 with value (4 42)
% 26.49/26.73  ;     1 with value (4 21)        574 with value (4 32)         234 with value (4 43)
% 26.49/26.73  ;     6 with value (4 22)        717 with value (4 33)         130 with value (4 44)
% 26.49/26.73  ;    21 with value (4 23)        476 with value (4 34)          87 with value (4 45)
% 26.49/26.73  ;   121 with value (4 24)        370 with value (4 35)           9 with value (4 46)
% 26.49/26.73  ;   223 with value (4 25)        592 with value (4 36)          26 with value (4 47)
% 26.49/26.73  ;   481 with value (4 26)        375 with value (4 37)         169 with value (4 48)
% 26.49/26.73  ;   409 with value (4 27)        727 with value (4 38)         610 with value (4 49)
% 26.49/26.73  ;   338 with value (4 28)        477 with value (4 39)         231 with value (4 50)
% 26.49/26.73  ;   611 with value (4 29)        132 with value (4 40)
% 26.49/26.73  Evaluation took:
% 26.49/26.73    26.26 seconds of real time
% 26.49/26.73    23.713793 seconds of user run time
% 26.49/26.73    2.541397 seconds of system run time
% 26.49/26.73    [Run times include 4.708 seconds GC run time.]
% 26.49/26.73    0 calls to %EVAL
% 26.49/26.73    0 page faults and
% 26.49/26.73    1,701,667,264 bytes consed.
% 26.49/26.73  :PROOF-FOUND
% 26.49/26.73  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T01:37:08
% 26.49/26.73  :PROOF-FOUND
% 26.49/26.73  * 
%------------------------------------------------------------------------------