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

View Problem - Process Solution

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

% Computer : n007.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 : Mon Jul 18 19:59:09 EDT 2022

% Result   : Unsatisfiable 16.56s 16.76s
% Output   : Refutation 16.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   45 (  45 unt;   0 nHn;  15 RR)
%            Number of literals    :   45 (  44 equ;   2 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    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   54 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
    X = join(complement(join(complement(X),complement(Y))),complement(join(complement(X),Y))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).

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

cnf(maddux4_definiton_of_meet_4,axiom,
    meet(X,Y) = complement(join(complement(X),complement(Y))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).

cnf(converse_idempotence_8,axiom,
    converse(converse(X)) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).

cnf(converse_additivity_9,axiom,
    converse(join(X,Y)) = join(converse(X),converse(Y)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).

cnf(10,plain,
    join(converse(X),join(converse(Y),Z)) = join(converse(join(X,Y)),Z),
    inference('EMBED',[status(thm)],[converse_additivity_9]) ).

cnf(converse_cancellativity_11,axiom,
    join(composition(converse(X),complement(composition(X,Y))),complement(Y)) = complement(Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).

cnf(13,plain,
    join(composition(converse(X),complement(composition(X,Y))),join(complement(Y),Z)) = join(complement(Y),Z),
    inference('EMBED',[status(thm)],[converse_cancellativity_11]) ).

cnf(def_top_12,axiom,
    top = join(X,complement(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).

cnf(15,plain,
    join(X,join(complement(X),Y)) = join(top,Y),
    inference('EMBED',[status(thm)],[def_top_12]) ).

cnf(def_zero_13,axiom,
    zero = meet(X,complement(X)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).

cnf(17,plain,
    zero = complement(top),
    inference('REWRITE',[status(thm)],[def_zero_13,maddux4_definiton_of_meet_4,theory(equality)]) ).

cnf(goals_14,negated_conjecture,
    meet(converse(sk1),sk2) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).

cnf(19,plain,
    complement(join(complement(converse(sk1)),complement(sk2))) = zero,
    inference('REWRITE',[status(thm)],[goals_14,maddux4_definiton_of_meet_4,theory(equality)]) ).

cnf(goals_15,negated_conjecture,
    meet(sk1,converse(sk2)) != zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).

cnf(21,plain,
    complement(join(complement(sk1),complement(converse(sk2)))) != zero,
    inference('REWRITE',[status(thm)],[goals_15,maddux4_definiton_of_meet_4,theory(equality)]) ).

cnf(28,plain,
    join(top,X) = join(top,complement(join(Y,complement(join(X,Y))))),
    inference('PARAMODULATE',[status(thm)],[15,15,theory(equality)]) ).

cnf(30,plain,
    converse(join(converse(X),Y)) = join(X,converse(Y)),
    inference('PARAMODULATE',[status(thm)],[converse_additivity_9,converse_idempotence_8,theory(equality)]) ).

cnf(32,plain,
    join(converse(join(X,Y)),complement(converse(X))) = join(top,converse(Y)),
    inference('PARAMODULATE',[status(thm)],[15,10,theory(equality)]) ).

cnf(72,plain,
    join(complement(X),complement(composition(converse(Y),complement(composition(Y,X))))) = join(top,complement(X)),
    inference('PARAMODULATE',[status(thm)],[15,13,theory(equality)]) ).

cnf(78,plain,
    sk2 = join(zero,complement(join(complement(sk2),converse(sk1)))),
    inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,19,theory(equality)]) ).

cnf(88,plain,
    complement(X) = join(zero,complement(join(complement(complement(X)),X))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,def_top_12,theory(equality)]),17,theory(equality)]) ).

cnf(94,plain,
    X = complement(complement(X)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,def_top_12,theory(equality)]),88,17,theory(equality)]) ).

cnf(97,plain,
    X = join(complement(join(complement(X),complement(join(X,Y)))),complement(join(top,Y))),
    inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,15,theory(equality)]) ).

cnf(101,plain,
    X = join(complement(join(top,complement(X))),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,converse_cancellativity_11,theory(equality)]),94,72,theory(equality)]) ).

cnf(117,plain,
    join(top,complement(X)) = join(top,complement(join(complement(Y),X))),
    inference('PARAMODULATE',[status(thm)],[15,2,theory(equality)]) ).

cnf(119,plain,
    join(top,X) = join(top,complement(Y)),
    inference('REWRITE',[status(thm)],[28,117,theory(equality)]) ).

cnf(136,plain,
    complement(X) = join(complement(join(complement(Y),X)),complement(join(X,Y))),
    inference('PARAMODULATE',[status(thm)],[maddux3_a_kind_of_de_Morgan_3,94,theory(equality)]) ).

cnf(140,plain,
    top = join(top,X),
    inference('PARAMODULATE',[status(thm)],[def_top_12,119,theory(equality)]) ).

cnf(150,plain,
    join(converse(join(X,Y)),complement(converse(X))) = top,
    inference('REWRITE',[status(thm)],[32,140,theory(equality)]) ).

cnf(160,plain,
    X = join(zero,X),
    inference('REWRITE',[status(thm)],[101,17,140,theory(equality)]) ).

cnf(165,plain,
    sk2 = complement(join(complement(sk2),converse(sk1))),
    inference('REWRITE',[status(thm)],[78,160,theory(equality)]) ).

cnf(167,plain,
    X = complement(join(complement(X),complement(join(X,Y)))),
    inference('REWRITE',[status(thm)],[97,160,17,140,theory(equality)]) ).

cnf(176,plain,
    join(complement(sk2),converse(sk1)) = complement(sk2),
    inference('PARAMODULATE',[status(thm)],[94,165,theory(equality)]) ).

cnf(187,plain,
    converse(top) = join(X,converse(top)),
    inference('PARAMODULATE',[status(thm)],[30,140,theory(equality)]) ).

cnf(215,plain,
    top = converse(top),
    inference('PARAMODULATE',[status(thm)],[def_top_12,187,theory(equality)]) ).

cnf(277,plain,
    converse(join(converse(complement(sk1)),complement(sk2))) = top,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[150,176,theory(equality)]),30,converse_idempotence_8,theory(equality)]) ).

cnf(384,plain,
    join(complement(X),complement(join(X,Y))) = complement(X),
    inference('PARAMODULATE',[status(thm)],[94,167,theory(equality)]) ).

cnf(423,plain,
    join(X,complement(join(complement(X),Y))) = X,
    inference('PARAMODULATE',[status(thm)],[384,94,theory(equality)]) ).

cnf(1217,plain,
    top = join(converse(complement(sk1)),complement(sk2)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[converse_idempotence_8,277,theory(equality)]),215,theory(equality)]) ).

cnf(3218,plain,
    join(complement(X),Y) = join(Y,complement(join(X,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[136,136,theory(equality)]),423,94,theory(equality)]) ).

cnf(3461,plain,
    converse(join(converse(sk2),complement(sk1))) = converse(complement(sk1)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3218,1217,theory(equality)]),160,17,30,94,theory(equality)]) ).

cnf(3637,plain,
    complement(sk1) = join(converse(sk2),complement(sk1)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[converse_idempotence_8,3461,theory(equality)]),converse_idempotence_8,theory(equality)]) ).

cnf(3643,plain,
    join(complement(sk1),complement(converse(sk2))) = top,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3218,3637,theory(equality)]),94,theory(equality)]) ).

cnf(3645,plain,
    $false,
    inference('REWRITE',[status(thm)],[21,17,3643,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : REL006-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jul  8 09:42:00 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.22/0.48  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49  * 
% 0.22/0.49  * 
% 0.22/0.49  #<PACKAGE "SNARK-USER">
% 0.22/0.49  * 
% 0.22/0.49  SNARK-TPTP-OPTIONS
% 0.22/0.49  * 
% 0.22/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.49   (USE-FACTORING :POS)
% 0.22/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.49  * 
% 0.22/0.49  "."
% 0.22/0.49  * 
% 0.22/0.49  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T09:42:00
% 0.22/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-08T09:42:00
% 0.22/0.51  
% 0.22/0.51  ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.22/0.51  ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.22/0.51  ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.22/0.51  ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.22/0.51  ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.22/0.51  ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.22/0.51  ; Declaring join to be commutative.
% 16.56/16.76  ; Declaring join to be associative-commutative.
% 16.56/16.76  
% 16.56/16.76  #||
% 16.56/16.76  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.56/16.76  % SZS output start Refutation
% See solution above
% 16.56/16.76  ||#
% 16.56/16.76  
% 16.56/16.76  ; Summary of computation:
% 16.56/16.76  ;     16233 formulas have been input or derived (from 156 formulas).
% 16.56/16.76  ;      3645 (22%) were retained.  Of these,
% 16.56/16.76  ;         1060 (29%) were simplified or subsumed later,
% 16.56/16.76  ;         2585 (71%) are still being kept.
% 16.56/16.76  ; 
% 16.56/16.76  ; Run time in seconds excluding printing time:
% 16.56/16.76  ;     0.003   0%   Read assertion file          (1 call)
% 16.56/16.76  ;     0.001   0%   Assert                       (15 calls)
% 16.56/16.76  ;     0.577   4%   Process new row              (15,866 calls)
% 16.56/16.76  ;     0.016   0%   Resolution                   (310 calls)
% 16.56/16.76  ;     0.315   2%   Paramodulation               (155 calls)
% 16.56/16.76  ;     0.008   0%   Embedding                    (1,322 calls)
% 16.56/16.76  ;     8.201  50%   Forward simplification       (13,954 calls)
% 16.56/16.76  ;     0.234   1%   Backward simplification      (2,349 calls)
% 16.56/16.76  ;     0.302   2%   Ordering                     (62,187 calls)
% 16.56/16.76  ;     6.512  40%   Ordering ac                  (23,724 calls)
% 16.56/16.76  ;     0.001   0%   Sortal reasoning             (32 calls)
% 16.56/16.76  ;     0.000   0%   Purity testing               (1 call)
% 16.56/16.76  ;     0.092   1%   Other
% 16.56/16.76  ;    16.262        Total
% 16.56/16.76  ;    16.264        Real time
% 16.56/16.76  ; 
% 16.56/16.76  ; Term-hash-array has 11,071 terms in all.
% 16.56/16.76  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 16.56/16.76  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 16.56/16.76  ; Path-index has 7,920 entries (8,757 at peak, 11,241 added, 3,321 deleted).
% 16.56/16.76  ; Path-index has 6,529 nodes (6,692 at peak, 7,414 added, 885 deleted).
% 16.56/16.76  ; Trie-index has 7,920 entries (8,757 at peak, 11,241 added, 3,321 deleted).
% 16.56/16.76  ; Trie-index has 9,099 nodes (9,139 at peak, 10,102 added, 1,003 deleted).
% 16.56/16.76  ; Retrieved 25,574,153 generalization terms in 133,216 calls.
% 16.56/16.76  ; Retrieved 18,200 instance terms in 3,614 calls.
% 16.56/16.76  ; Retrieved 95,647 unifiable terms in 1,005 calls.
% 16.56/16.76  ; 
% 16.56/16.76  ; The agenda of rows to process has 3 entries:
% 16.56/16.76  ;     3 with value 24
% 16.56/16.76  ; The agenda of rows to give has 2474 entries:
% 16.56/16.76  ;     1 with value (4 17)        145 with value (4 29)           9 with value (4 40)
% 16.56/16.76  ;     2 with value (4 19)        273 with value (4 30)          14 with value (4 41)
% 16.56/16.76  ;    52 with value (4 20)        233 with value (4 31)           5 with value (4 42)
% 16.56/16.76  ;    77 with value (4 21)         98 with value (4 32)           3 with value (4 43)
% 16.56/16.76  ;    99 with value (4 22)         63 with value (4 33)           6 with value (4 44)
% 16.56/16.76  ;   139 with value (4 23)         60 with value (4 34)           8 with value (4 45)
% 16.56/16.76  ;   123 with value (4 24)         52 with value (4 35)           1 with value (4 46)
% 16.56/16.76  ;   212 with value (4 25)         21 with value (4 36)           2 with value (4 47)
% 16.56/16.76  ;   232 with value (4 26)         26 with value (4 37)           2 with value (4 48)
% 16.56/16.76  ;   233 with value (4 27)         20 with value (4 38)           2 with value (4 49)
% 16.56/16.76  ;   232 with value (4 28)         29 with value (4 39)
% 16.56/16.76  Evaluation took:
% 16.56/16.76    16.265 seconds of real time
% 16.56/16.76    16.013727 seconds of user run time
% 16.56/16.76    0.251988 seconds of system run time
% 16.56/16.76    [Run times include 0.318 seconds GC run time.]
% 16.56/16.76    0 calls to %EVAL
% 16.56/16.76    0 page faults and
% 16.56/16.76    422,472,072 bytes consed.
% 16.56/16.76  :PROOF-FOUND
% 16.56/16.76  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-08T09:42:16
% 16.56/16.76  :PROOF-FOUND
% 16.56/16.76  * 
%------------------------------------------------------------------------------