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

View Problem - Process Solution

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

% Computer : n011.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:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
    join(X,meet(X,Y)) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).

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

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

cnf(invertability3,axiom,
    complement(complement(X)) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',invertability3) ).

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

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

cnf(81,plain,
    join(complement(X),complement(join(X,Y))) = complement(X),
    inference('PARAMODULATE',[status(thm)],[absorption2,compatibility1,theory(equality)]) ).

cnf(82,plain,
    join(complement(X),join(complement(join(X,Y)),Z)) = join(complement(X),Z),
    inference('EMBED',[status(thm)],[81]) ).

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

cnf(85,plain,
    join(X,complement(join(complement(join(X,Y)),X))) = join(X,Y),
    inference('REWRITE',[status(thm)],[orthomodular_law,83,theory(equality)]) ).

cnf(87,plain,
    join(complement(join(complement(join(a,b)),a)),join(complement(b),meet(a,b))) != n1,
    inference('REWRITE',[status(thm)],[prove_weak_orthomodular_law,83,theory(equality)]) ).

cnf(88,plain,
    complement(join(complement(X),complement(Y))) = meet(X,Y),
    inference('PARAMODULATE',[status(thm)],[invertability3,compatibility2,theory(equality)]) ).

cnf(129,plain,
    join(complement(join(complement(join(a,b)),a)),join(complement(b),complement(join(complement(a),complement(b))))) != n1,
    inference('REWRITE',[status(thm)],[87,88,theory(equality)]) ).

cnf(161,plain,
    join(complement(join(X,Y)),complement(join(complement(join(X,Y)),X))) = complement(X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[85,81,theory(equality)]),invertability3,theory(equality)]) ).

cnf(162,plain,
    join(complement(join(X,Y)),join(complement(join(complement(join(X,Y)),X)),Z)) = join(complement(X),Z),
    inference('EMBED',[status(thm)],[161]) ).

cnf(317,plain,
    join(complement(X),complement(Y)) = join(complement(Y),complement(join(complement(join(X,Y)),X))),
    inference('PARAMODULATE',[status(thm)],[82,162,theory(equality)]) ).

cnf(319,plain,
    $false,
    inference('REWRITE',[status(thm)],[129,317,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LAT044-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun 30 00:03:47 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  * 
% 0.20/0.45  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T00:03:47
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n011.cluster.edu at 2022-06-30T00:03:47
% 0.20/0.47  
% 0.20/0.47  ; Recognized commutativity assertion (= (|meet| ?X ?Y) (|meet| ?Y ?X)).
% 0.20/0.47  ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.20/0.47  ; Recognized associativity assertion (= (|meet| (|meet| ?X ?Y) ?Z) (|meet| ?X (|meet| ?Y ?Z))).
% 0.20/0.48  ; Recognized associativity assertion (= (|join| (|join| ?X ?Y) ?Z) (|join| ?X (|join| ?Y ?Z))).
% 0.20/0.48  ; Recognized possible left inverse assertion (= (|join| (|complement| ?X) ?X) |n1|).
% 0.20/0.48  ; Recognized possible left inverse assertion (= (|meet| (|complement| ?X) ?X) |n0|).
% 0.20/0.48  ; Declaring meet to be commutative.
% 0.20/0.48  ; Declaring meet to be associative-commutative.
% 0.20/0.48  ; Declaring join to be commutative.
% 1.46/1.62  ; Declaring join to be associative-commutative.
% 1.46/1.62  
% 1.46/1.62  #||
% 1.46/1.62  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.46/1.62  % SZS output start Refutation
% See solution above
% 1.46/1.62  ||#
% 1.46/1.62  
% 1.46/1.62  ; Summary of computation:
% 1.46/1.62  ;      3210 formulas have been input or derived (from 35 formulas).
% 1.46/1.62  ;       319 (10%) were retained.  Of these,
% 1.46/1.62  ;          162 (51%) were simplified or subsumed later,
% 1.46/1.62  ;          157 (49%) are still being kept.
% 1.46/1.62  ; 
% 1.46/1.62  ; Run time in seconds excluding printing time:
% 1.46/1.62  ;     0.003   0%   Read assertion file          (1 call)
% 1.46/1.62  ;     0.001   0%   Assert                       (15 calls)
% 1.46/1.62  ;     0.043   4%   Process new row              (2,968 calls)
% 1.46/1.62  ;     0.001   0%   Resolution                   (68 calls)
% 1.46/1.62  ;     0.071   6%   Paramodulation               (34 calls)
% 1.46/1.62  ;     0.057   5%   Embedding                    (157 calls)
% 1.46/1.62  ;     0.752  65%   Forward simplification       (2,764 calls)
% 1.46/1.62  ;     0.186  16%   Backward simplification      (171 calls)
% 1.46/1.62  ;     0.004   0%   Ordering                     (993 calls)
% 1.46/1.62  ;     0.010   1%   Ordering ac                  (500 calls)
% 1.46/1.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.46/1.62  ;     0.000   0%   Purity testing               (1 call)
% 1.46/1.62  ;     0.030   3%   Other
% 1.46/1.62  ;     1.158        Total
% 1.46/1.62  ;     1.160        Real time
% 1.46/1.62  ; 
% 1.46/1.62  ; Term-hash-array has 1,131 terms in all.
% 1.46/1.62  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.46/1.62  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.46/1.62  ; Path-index has 581 entries (586 at peak, 1,184 added, 603 deleted).
% 1.46/1.62  ; Path-index has 138 nodes (171 at peak, 266 added, 128 deleted).
% 1.46/1.62  ; Trie-index has 581 entries (586 at peak, 1,184 added, 603 deleted).
% 1.46/1.62  ; Trie-index has 36 nodes (41 at peak, 62 added, 26 deleted).
% 1.46/1.62  ; Retrieved 554,696 generalization terms in 27,046 calls.
% 1.46/1.62  ; Retrieved 6,954 instance terms in 170 calls.
% 1.46/1.62  ; Retrieved 3,076 unifiable terms in 182 calls.
% 1.46/1.62  ; 
% 1.46/1.62  ; The agenda of rows to process has 151 entries:
% 1.46/1.62  ;     6 with value 25              3 with value 36               2 with value 48
% 1.46/1.62  ;     2 with value 26              9 with value 37               4 with value 50
% 1.46/1.62  ;     9 with value 27             10 with value 38               1 with value 51
% 1.46/1.62  ;     4 with value 28              6 with value 39               1 with value 52
% 1.46/1.62  ;     6 with value 29              6 with value 40               2 with value 54
% 1.46/1.62  ;    10 with value 30              5 with value 41               1 with value 56
% 1.46/1.62  ;    13 with value 31              3 with value 42               2 with value 58
% 1.46/1.62  ;     6 with value 32              2 with value 43               2 with value 60
% 1.46/1.62  ;     7 with value 33              2 with value 44               1 with value 62
% 1.46/1.62  ;     6 with value 34              2 with value 45               2 with value 68
% 1.46/1.62  ;    12 with value 35              3 with value 46               1 with value 70
% 1.46/1.62  ; The agenda of rows to give has 134 entries:
% 1.46/1.62  ;     2 with value (4 23)          4 with value (4 34)           2 with value (4 45)
% 1.46/1.62  ;     2 with value (4 24)          6 with value (4 35)           2 with value (4 46)
% 1.46/1.62  ;     4 with value (4 25)          2 with value (4 36)           2 with value (4 47)
% 1.46/1.62  ;     2 with value (4 26)          8 with value (4 37)           2 with value (4 50)
% 1.46/1.62  ;     2 with value (4 27)          6 with value (4 38)           2 with value (4 51)
% 1.46/1.62  ;     4 with value (4 28)         16 with value (4 39)           2 with value (4 53)
% 1.46/1.62  ;     2 with value (4 29)          2 with value (4 40)           2 with value (4 54)
% 1.46/1.62  ;    14 with value (4 30)          4 with value (4 41)           2 with value (4 60)
% 1.46/1.62  ;     8 with value (4 31)          4 with value (4 42)           2 with value (4 64)
% 1.46/1.62  ;     8 with value (4 32)          4 with value (4 43)           2 with value (4 68)
% 1.46/1.62  ;     8 with value (4 33)          2 with value (4 44)
% 1.46/1.62  Evaluation took:
% 1.46/1.62    1.16 seconds of real time
% 1.46/1.62    1.139742 seconds of user run time
% 1.46/1.62    0.02018 seconds of system run time
% 1.46/1.62    [Run times include 0.032 seconds GC run time.]
% 1.46/1.62    0 calls to %EVAL
% 1.46/1.62    0 page faults and
% 1.46/1.62    124,424,904 bytes consed.
% 1.46/1.62  :PROOF-FOUND
% 1.46/1.62  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T00:03:49
% 1.46/1.62  :PROOF-FOUND
% 1.46/1.62  * 
%------------------------------------------------------------------------------