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

View Problem - Process Solution

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

% Computer : n032.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 0.97s 1.20s
% Output   : Refutation 0.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;   2 RR)
%            Number of literals    :   16 (  15 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   33 (  14 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_commutativity_of_meet,negated_conjecture,
    meet(b,a) != meet(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_commutativity_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(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(34,plain,
    meet(meet(X,Y),X) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[7,13,theory(equality)]) ).

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

cnf(1906,plain,
    meet(meet(X,Y),meet(Y,X)) = meet(Y,X),
    inference('PARAMODULATE',[status(thm)],[21,49,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(1971,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_commutativity_of_meet,1970,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09  % Problem  : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.09  % Command  : run-snark %s %d
% 0.08/0.28  % Computer : n032.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Wed Jun 29 13:31:43 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 0.12/0.36  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37  * 
% 0.12/0.37  * 
% 0.12/0.37  #<PACKAGE "SNARK-USER">
% 0.12/0.37  * 
% 0.12/0.37  SNARK-TPTP-OPTIONS
% 0.12/0.37  * 
% 0.12/0.37  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.12/0.37   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.12/0.37   (USE-FACTORING :POS)
% 0.12/0.37   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.12/0.37   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.12/0.37   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.12/0.37   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.12/0.37   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.12/0.37   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.12/0.37   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.12/0.37   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.12/0.37   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.12/0.37   (DECLARE-TPTP-SYMBOLS2))
% 0.12/0.37  * 
% 0.12/0.37  "."
% 0.12/0.37  * 
% 0.12/0.37  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T13:31:43
% 0.12/0.37  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-29T13:31:43
% 0.97/1.20  
% 0.97/1.20  
% 0.97/1.20  #||
% 0.97/1.20  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.97/1.20  % SZS output start Refutation
% See solution above
% 0.97/1.20  ||#
% 0.97/1.20  
% 0.97/1.20  ; Summary of computation:
% 0.97/1.20  ;     16846 formulas have been input or derived (from 130 formulas).
% 0.97/1.20  ;      1971 (12%) were retained.  Of these,
% 0.97/1.20  ;            1 ( 0%) were simplified or subsumed later,
% 0.97/1.20  ;         1970 (100%) are still being kept.
% 0.97/1.20  ; 
% 0.97/1.20  ; Run time in seconds excluding printing time:
% 0.97/1.20  ;     0.001   0%   Read assertion file          (1 call)
% 0.97/1.20  ;     0.000   0%   Assert                       (5 calls)
% 0.97/1.20  ;     0.177  21%   Process new row              (12,467 calls)
% 0.97/1.20  ;     0.014   2%   Resolution                   (258 calls)
% 0.97/1.20  ;     0.174  21%   Paramodulation               (129 calls)
% 0.97/1.20  ;     0.331  40%   Forward simplification       (12,467 calls)
% 0.97/1.20  ;     0.033   4%   Backward simplification      (1,971 calls)
% 0.97/1.20  ;     0.039   5%   Ordering                     (21,328 calls)
% 0.97/1.20  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.97/1.20  ;     0.000   0%   Purity testing               (1 call)
% 0.97/1.20  ;     0.057   7%   Other
% 0.97/1.20  ;     0.826        Total
% 0.97/1.20  ;     0.828        Real time
% 0.97/1.20  ; 
% 0.97/1.20  ; Term-hash-array has 5,458 terms in all.
% 0.97/1.20  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.97/1.20  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.97/1.20  ; Path-index has 5,455 entries (5,460 at peak, 5,460 added, 5 deleted).
% 0.97/1.20  ; Path-index has 5,135 nodes (5,145 at peak, 5,145 added, 10 deleted).
% 0.97/1.20  ; Trie-index has 5,455 entries (5,460 at peak, 5,460 added, 5 deleted).
% 0.97/1.20  ; Trie-index has 14,107 nodes (14,118 at peak, 14,118 added, 11 deleted).
% 0.97/1.20  ; Retrieved 200,400 generalization terms in 79,763 calls.
% 0.97/1.20  ; Retrieved 7,245 instance terms in 1,970 calls.
% 0.97/1.20  ; Retrieved 47,176 unifiable terms in 822 calls.
% 0.97/1.20  ; 
% 0.97/1.20  ; The agenda of rows to process has 221 entries:
% 0.97/1.20  ;    17 with value 19             25 with value 25              13 with value 31
% 0.97/1.20  ;     1 with value 20             15 with value 26              10 with value 32
% 0.97/1.20  ;     7 with value 21             29 with value 27              14 with value 33
% 0.97/1.20  ;    23 with value 22             11 with value 28               1 with value 36
% 0.97/1.20  ;     9 with value 23              8 with value 29               1 with value 38
% 0.97/1.20  ;    35 with value 24              2 with value 30
% 0.97/1.20  ; The agenda of rows to give has 1841 entries:
% 0.97/1.20  ;     1 with value (4 14)        124 with value (4 30)          91 with value (4 39)
% 0.97/1.20  ;     1 with value (4 19)        126 with value (4 31)          49 with value (4 40)
% 0.97/1.20  ;    57 with value (4 22)        157 with value (4 32)          11 with value (4 41)
% 0.97/1.20  ;    79 with value (4 23)         62 with value (4 33)          18 with value (4 42)
% 0.97/1.20  ;   130 with value (4 24)        126 with value (4 34)          11 with value (4 43)
% 0.97/1.20  ;    79 with value (4 25)         43 with value (4 35)           8 with value (4 44)
% 0.97/1.20  ;   140 with value (4 26)         17 with value (4 36)           6 with value (4 45)
% 0.97/1.20  ;   199 with value (4 27)         32 with value (4 37)           4 with value (4 46)
% 0.97/1.20  ;   120 with value (4 28)         48 with value (4 38)           2 with value (4 47)
% 0.97/1.20  ;   100 with value (4 29)
% 0.97/1.20  Evaluation took:
% 0.97/1.20    0.828 seconds of real time
% 0.97/1.20    0.75012 seconds of user run time
% 0.97/1.20    0.077569 seconds of system run time
% 0.97/1.20    [Run times include 0.064 seconds GC run time.]
% 0.97/1.20    0 calls to %EVAL
% 0.97/1.20    0 page faults and
% 0.97/1.20    65,360,640 bytes consed.
% 0.97/1.20  :PROOF-FOUND
% 0.97/1.20  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T13:31:44
% 0.97/1.20  :PROOF-FOUND
% 0.97/1.20  * 
%------------------------------------------------------------------------------