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

View Problem - Process Solution

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

% Computer : n028.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:03 EDT 2022

% Result   : Unsatisfiable 0.19s 0.59s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   3 RR)
%            Number of literals    :   20 (  19 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    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (   4 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/sandbox/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/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).

cnf(converse_cancellativity_11,axiom,
    join(composition(converse(X),complement(composition(X,Y))),complement(Y)) = complement(Y),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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,
    join(zero,sk1) != sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).

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

cnf(65,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(77,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(79,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)]),77,17,theory(equality)]) ).

cnf(84,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)]),79,65,theory(equality)]) ).

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

cnf(102,plain,
    join(top,X) = join(top,complement(Y)),
    inference('REWRITE',[status(thm)],[25,100,theory(equality)]) ).

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

cnf(143,plain,
    X = join(zero,X),
    inference('REWRITE',[status(thm)],[84,17,123,theory(equality)]) ).

cnf(148,plain,
    $false,
    inference('REWRITE',[status(thm)],[goals_14,143,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : REL001-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Fri Jul  8 09:05:09 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.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-07-08T09:05:09
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-07-08T09:05:09
% 0.19/0.48  
% 0.19/0.48  ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.19/0.48  ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.19/0.48  ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.19/0.48  ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.19/0.48  ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.19/0.48  ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.19/0.48  ; Declaring join to be commutative.
% 0.19/0.59  ; Declaring join to be associative-commutative.
% 0.19/0.59  
% 0.19/0.59  #||
% 0.19/0.59  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.59  % SZS output start Refutation
% See solution above
% 0.19/0.59  ||#
% 0.19/0.59  
% 0.19/0.59  ; Summary of computation:
% 0.19/0.59  ;       308 formulas have been input or derived (from 23 formulas).
% 0.19/0.59  ;       148 (48%) were retained.  Of these,
% 0.19/0.59  ;           62 (42%) were simplified or subsumed later,
% 0.19/0.59  ;           86 (58%) are still being kept.
% 0.19/0.59  ; 
% 0.19/0.59  ; Run time in seconds excluding printing time:
% 0.19/0.59  ;     0.003   3%   Read assertion file          (1 call)
% 0.19/0.59  ;     0.001   1%   Assert                       (14 calls)
% 0.19/0.59  ;     0.014  12%   Process new row              (280 calls)
% 0.19/0.59  ;     0.000   0%   Resolution                   (44 calls)
% 0.19/0.59  ;     0.009   8%   Paramodulation               (22 calls)
% 0.19/0.59  ;     0.002   2%   Embedding                    (62 calls)
% 0.19/0.59  ;     0.027  23%   Forward simplification       (218 calls)
% 0.19/0.59  ;     0.009   8%   Backward simplification      (86 calls)
% 0.19/0.59  ;     0.003   3%   Ordering                     (749 calls)
% 0.19/0.59  ;     0.027  23%   Ordering ac                  (355 calls)
% 0.19/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.59  ;     0.023  19%   Other
% 0.19/0.59  ;     0.118        Total
% 0.19/0.59  ;     0.120        Real time
% 0.19/0.59  ; 
% 0.19/0.59  ; Term-hash-array has 466 terms in all.
% 0.19/0.59  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.19/0.59  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.19/0.59  ; Path-index has 324 entries (386 at peak, 516 added, 192 deleted).
% 0.19/0.59  ; Path-index has 595 nodes (595 at peak, 638 added, 43 deleted).
% 0.19/0.59  ; Trie-index has 324 entries (386 at peak, 516 added, 192 deleted).
% 0.19/0.59  ; Trie-index has 311 nodes (311 at peak, 324 added, 13 deleted).
% 0.19/0.59  ; Retrieved 14,602 generalization terms in 1,754 calls.
% 0.19/0.59  ; Retrieved 402 instance terms in 109 calls.
% 0.19/0.59  ; Retrieved 1,293 unifiable terms in 121 calls.
% 0.19/0.59  ; 
% 0.19/0.59  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.19/0.59  ;     3 with value 0
% 0.19/0.59  ; The agenda of rows to process has 16 entries:
% 0.19/0.59  ;     4 with value 11              1 with value 15               1 with value 18
% 0.19/0.59  ;     1 with value 12              1 with value 16               1 with value 19
% 0.19/0.59  ;     4 with value 13              1 with value 17               1 with value 20
% 0.19/0.59  ;     1 with value 14
% 0.19/0.59  ; The agenda of rows to give has 69 entries:
% 0.19/0.59  ;     1 with value (4 8)           2 with value (4 19)           2 with value (4 26)
% 0.19/0.59  ;     2 with value (4 9)          15 with value (4 20)           4 with value (4 28)
% 0.19/0.59  ;     1 with value (4 11)          2 with value (4 21)           2 with value (4 29)
% 0.19/0.59  ;     1 with value (4 13)         12 with value (4 22)           2 with value (4 31)
% 0.19/0.59  ;     1 with value (4 14)          1 with value (4 23)           2 with value (4 32)
% 0.19/0.59  ;     6 with value (4 15)          2 with value (4 24)           2 with value (4 36)
% 0.19/0.59  ;     2 with value (4 16)          3 with value (4 25)           2 with value (4 37)
% 0.19/0.59  ;     2 with value (4 17)
% 0.19/0.59  Evaluation took:
% 0.19/0.59    0.12 seconds of real time
% 0.19/0.59    0.111272 seconds of user run time
% 0.19/0.59    0.008805 seconds of system run time
% 0.19/0.59    0 calls to %EVAL
% 0.19/0.59    0 page faults and
% 0.19/0.59    6,932,624 bytes consed.
% 0.19/0.59  :PROOF-FOUND
% 0.19/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-08T09:05:10
% 0.19/0.59  :PROOF-FOUND
% 0.19/0.59  * 
%------------------------------------------------------------------------------