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

View Problem - Process Solution

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

% Computer : n010.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:42:14 EDT 2022

% Result   : Unsatisfiable 0.37s 0.58s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   47 (  47 unt;   0 nHn;   2 RR)
%            Number of literals    :   47 (  46 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   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   :   87 (  24 sgn)

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

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

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

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

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

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

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

cnf(15,plain,
    meet(meet(X,join(Y,meet(Z,X))),meet(Z,X)) = meet(Z,X),
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,wal_absorbtion_3,theory(equality)]) ).

cnf(16,plain,
    join(X,meet(X,join(meet(join(X,Y),join(Z,X)),X))) = X,
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,wal_absorbtion_4,theory(equality)]) ).

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

cnf(22,plain,
    join(join(meet(X,Y),X),X) = X,
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_5,wal_absorbtion_4,theory(equality)]) ).

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

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

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

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

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

cnf(42,plain,
    meet(X,X) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[30,21,theory(equality)]),21,theory(equality)]) ).

cnf(43,plain,
    join(X,meet(Y,join(X,X))) = X,
    inference('REWRITE',[status(thm)],[wal_absorbtion_2,42,theory(equality)]) ).

cnf(48,plain,
    join(meet(X,join(X,X)),meet(join(X,X),X)) = join(X,X),
    inference('REWRITE',[status(thm)],[28,42,theory(equality)]) ).

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

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

cnf(55,plain,
    meet(meet(X,join(Y,X)),X) = X,
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,43,theory(equality)]) ).

cnf(58,plain,
    meet(join(X,X),X) = X,
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_4,42,theory(equality)]) ).

cnf(59,plain,
    X = join(X,X),
    inference('REWRITE',[status(thm)],[48,49,58,theory(equality)]) ).

cnf(60,plain,
    meet(join(meet(X,Y),X),X) = join(meet(X,Y),X),
    inference('REWRITE',[status(thm)],[39,59,theory(equality)]) ).

cnf(63,plain,
    join(X,meet(Y,X)) = X,
    inference('REWRITE',[status(thm)],[43,59,theory(equality)]) ).

cnf(64,plain,
    meet(X,Y) = meet(X,meet(X,Y)),
    inference('REWRITE',[status(thm)],[51,63,theory(equality)]) ).

cnf(65,plain,
    X = meet(join(X,Y),X),
    inference('REWRITE',[status(thm)],[38,63,theory(equality)]) ).

cnf(68,plain,
    meet(X,Y) = meet(Y,meet(X,Y)),
    inference('PARAMODULATE',[status(thm)],[65,wal_absorbtion_3,theory(equality)]) ).

cnf(71,plain,
    join(X,meet(X,join(join(X,Y),X))) = X,
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,65,theory(equality)]) ).

cnf(73,plain,
    join(meet(X,Y),X) = meet(X,join(meet(X,Y),X)),
    inference('PARAMODULATE',[status(thm)],[65,22,theory(equality)]) ).

cnf(83,plain,
    join(X,meet(meet(X,join(Y,X)),join(meet(X,join(Y,X)),X))) = meet(X,join(Y,X)),
    inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,55,theory(equality)]) ).

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

cnf(98,plain,
    join(meet(X,join(join(X,Y),X)),X) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,71,theory(equality)]),42,64,theory(equality)]) ).

cnf(99,plain,
    X = meet(X,join(join(X,Y),X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_3,71,theory(equality)]),98,55,64,theory(equality)]) ).

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

cnf(106,plain,
    meet(X,Y) = meet(join(X,meet(X,Y)),meet(X,Y)),
    inference('PARAMODULATE',[status(thm)],[100,wal_absorbtion_1,theory(equality)]) ).

cnf(107,plain,
    meet(X,join(Y,X)) = join(X,meet(X,join(Y,X))),
    inference('REWRITE',[status(thm)],[93,106,theory(equality)]) ).

cnf(108,plain,
    meet(X,join(meet(join(X,Y),join(Z,X)),X)) = X,
    inference('REWRITE',[status(thm)],[16,107,theory(equality)]) ).

cnf(119,plain,
    join(meet(X,join(Y,X)),X) = X,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[108,63,theory(equality)]),73,theory(equality)]) ).

cnf(120,plain,
    X = meet(X,join(Y,X)),
    inference('REWRITE',[status(thm)],[83,59,55,119,theory(equality)]) ).

cnf(121,plain,
    join(meet(X,Y),X) = X,
    inference('REWRITE',[status(thm)],[73,120,theory(equality)]) ).

cnf(132,plain,
    meet(meet(X,Y),X) = meet(X,Y),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[wal_absorbtion_1,121,theory(equality)]),59,theory(equality)]) ).

cnf(138,plain,
    join(X,meet(X,Y)) = X,
    inference('PARAMODULATE',[status(thm)],[63,132,theory(equality)]) ).

cnf(192,plain,
    meet(meet(X,Y),meet(Y,X)) = meet(Y,X),
    inference('PARAMODULATE',[status(thm)],[15,138,theory(equality)]) ).

cnf(202,plain,
    meet(X,Y) = meet(Y,X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[132,192,theory(equality)]),192,theory(equality)]) ).

cnf(203,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_normal_axioms_2,202,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LAT089-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 30 01:43:04 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T01:43:04
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-30T01:43:04
% 0.37/0.58  
% 0.37/0.58  
% 0.37/0.58  #||
% 0.37/0.58  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.58  % SZS output start Refutation
% See solution above
% 0.37/0.59  ||#
% 0.37/0.59  
% 0.37/0.59  ; Summary of computation:
% 0.37/0.59  ;      1005 formulas have been input or derived (from 47 formulas).
% 0.37/0.59  ;       203 (20%) were retained.  Of these,
% 0.37/0.59  ;           99 (49%) were simplified or subsumed later,
% 0.37/0.59  ;          104 (51%) are still being kept.
% 0.37/0.59  ; 
% 0.37/0.59  ; Run time in seconds excluding printing time:
% 0.37/0.59  ;     0.001   1%   Read assertion file          (1 call)
% 0.37/0.59  ;     0.001   1%   Assert                       (6 calls)
% 0.37/0.59  ;     0.027  23%   Process new row              (866 calls)
% 0.37/0.59  ;     0.002   2%   Resolution                   (92 calls)
% 0.37/0.59  ;     0.016  14%   Paramodulation               (46 calls)
% 0.37/0.59  ;     0.019  16%   Forward simplification       (838 calls)
% 0.37/0.59  ;     0.014  12%   Backward simplification      (203 calls)
% 0.37/0.59  ;     0.008   7%   Ordering                     (1,629 calls)
% 0.37/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.37/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.37/0.59  ;     0.028  24%   Other
% 0.37/0.59  ;     0.116        Total
% 0.37/0.59  ;     0.121        Real time
% 0.37/0.59  ; 
% 0.37/0.59  ; Term-hash-array has 597 terms in all.
% 0.37/0.59  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.37/0.59  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.37/0.59  ; Path-index has 335 entries (340 at peak, 609 added, 274 deleted).
% 0.37/0.59  ; Path-index has 1,015 nodes (1,025 at peak, 1,300 added, 285 deleted).
% 0.37/0.59  ; Trie-index has 335 entries (340 at peak, 609 added, 274 deleted).
% 0.37/0.59  ; Trie-index has 1,015 nodes (1,125 at peak, 2,569 added, 1,554 deleted).
% 0.37/0.59  ; Retrieved 5,822 generalization terms in 4,253 calls.
% 0.37/0.59  ; Retrieved 919 instance terms in 202 calls.
% 0.37/0.59  ; Retrieved 2,078 unifiable terms in 274 calls.
% 0.37/0.59  ; 
% 0.37/0.59  ; The agenda of rows to process has 42 entries:
% 0.37/0.59  ;     6 with value 21              5 with value 26               2 with value 32
% 0.37/0.59  ;     8 with value 24             10 with value 29               4 with value 33
% 0.37/0.59  ;     4 with value 25              1 with value 30               2 with value 40
% 0.37/0.59  ; The agenda of rows to give has 74 entries:
% 0.37/0.59  ;     1 with value (4 16)          6 with value (4 25)           2 with value (4 30)
% 0.37/0.59  ;    10 with value (4 21)         15 with value (4 26)           2 with value (4 34)
% 0.37/0.59  ;     2 with value (4 22)          6 with value (4 27)           4 with value (4 38)
% 0.37/0.59  ;     2 with value (4 23)          2 with value (4 28)          12 with value (4 39)
% 0.37/0.59  ;     2 with value (4 24)          2 with value (4 29)           6 with value (4 42)
% 0.37/0.59  Evaluation took:
% 0.37/0.59    0.121 seconds of real time
% 0.37/0.59    0.108217 seconds of user run time
% 0.37/0.59    0.012921 seconds of system run time
% 0.37/0.59    0 calls to %EVAL
% 0.37/0.59    0 page faults and
% 0.37/0.59    9,344,352 bytes consed.
% 0.37/0.59  :PROOF-FOUND
% 0.37/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T01:43:04
% 0.37/0.59  :PROOF-FOUND
% 0.37/0.59  * 
%------------------------------------------------------------------------------