↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : REL015-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n027.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:19 EDT 2022

% Result   : Unsatisfiable 1.10s 1.27s
% Output   : Refutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (  33 unt;   0 nHn;   4 RR)
%            Number of literals    :   33 (  32 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   :   53 (   6 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(composition_identity_6,axiom,
    composition(X,one) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).

cnf(composition_distributivity_7,axiom,
    composition(join(X,Y),Z) = join(composition(X,Z),composition(Y,Z)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).

cnf(7,plain,
    join(composition(X,Y),join(composition(Z,Y),U)) = join(composition(join(X,Z),Y),U),
    inference('EMBED',[status(thm)],[composition_distributivity_7]) ).

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

cnf(converse_multiplicativity_10,axiom,
    converse(composition(X,Y)) = composition(converse(Y),converse(X)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).

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,
    composition(top,top) != top,
    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(34,plain,
    converse(composition(converse(X),Y)) = composition(converse(Y),X),
    inference('PARAMODULATE',[status(thm)],[converse_multiplicativity_10,converse_idempotence_8,theory(equality)]) ).

cnf(47,plain,
    join(composition(join(X,Y),Z),complement(composition(X,Z))) = join(top,composition(Y,Z)),
    inference('PARAMODULATE',[status(thm)],[15,7,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(129,plain,
    join(composition(join(X,Y),Z),complement(composition(X,Z))) = top,
    inference('REWRITE',[status(thm)],[47,123,theory(equality)]) ).

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

cnf(218,plain,
    X = composition(converse(one),X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[34,composition_identity_6,theory(equality)]),converse_idempotence_8,theory(equality)]) ).

cnf(242,plain,
    one = converse(one),
    inference('PARAMODULATE',[status(thm)],[composition_identity_6,218,theory(equality)]) ).

cnf(243,plain,
    X = composition(one,X),
    inference('REWRITE',[status(thm)],[218,242,theory(equality)]) ).

cnf(503,plain,
    join(composition(top,X),complement(composition(Y,X))) = top,
    inference('PARAMODULATE',[status(thm)],[129,def_top_12,theory(equality)]) ).

cnf(669,plain,
    join(composition(top,X),complement(X)) = top,
    inference('PARAMODULATE',[status(thm)],[503,243,theory(equality)]) ).

cnf(686,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[669,17,theory(equality)]),goals_14,143,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : REL015-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n027.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 : Fri Jul  8 10:52:30 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-07-08T10:52:30
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-07-08T10:52:30
% 0.20/0.47  
% 0.20/0.47  ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.20/0.47  ; Recognized associativity assertion (= (|join| ?X (|join| ?Y ?Z)) (|join| (|join| ?X ?Y) ?Z)).
% 0.20/0.47  ; Recognized associativity assertion (= (|composition| ?X (|composition| ?Y ?Z)) (|composition| (|composition| ?X ?Y) ?Z)).
% 0.20/0.47  ; Recognized right identity assertion (= (|composition| ?X |one|) ?X).
% 0.20/0.47  ; Recognized possible right inverse assertion (= |top| (|join| ?X (|complement| ?X))).
% 0.20/0.47  ; Recognized possible right inverse assertion (= |zero| (|meet| ?X (|complement| ?X))).
% 0.20/0.47  ; Declaring join to be commutative.
% 1.10/1.27  ; Declaring join to be associative-commutative.
% 1.10/1.27  
% 1.10/1.27  #||
% 1.10/1.27  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.10/1.27  % SZS output start Refutation
% See solution above
% 1.10/1.27  ||#
% 1.10/1.27  
% 1.10/1.27  ; Summary of computation:
% 1.10/1.27  ;      3000 formulas have been input or derived (from 73 formulas).
% 1.10/1.27  ;       686 (23%) were retained.  Of these,
% 1.10/1.27  ;          136 (20%) were simplified or subsumed later,
% 1.10/1.27  ;          550 (80%) are still being kept.
% 1.10/1.27  ; 
% 1.10/1.27  ; Run time in seconds excluding printing time:
% 1.10/1.27  ;     0.003   0%   Read assertion file          (1 call)
% 1.10/1.27  ;     0.000   0%   Assert                       (14 calls)
% 1.10/1.27  ;     0.074   9%   Process new row              (2,946 calls)
% 1.10/1.27  ;     0.004   0%   Resolution                   (144 calls)
% 1.10/1.27  ;     0.060   7%   Paramodulation               (72 calls)
% 1.10/1.27  ;     0.003   0%   Embedding                    (283 calls)
% 1.10/1.27  ;     0.300  37%   Forward simplification       (2,332 calls)
% 1.10/1.27  ;     0.023   3%   Backward simplification      (409 calls)
% 1.10/1.27  ;     0.019   2%   Ordering                     (7,083 calls)
% 1.10/1.27  ;     0.290  36%   Ordering ac                  (4,483 calls)
% 1.10/1.27  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.10/1.27  ;     0.000   0%   Purity testing               (1 call)
% 1.10/1.27  ;     0.032   4%   Other
% 1.10/1.27  ;     0.808        Total
% 1.10/1.27  ;     0.810        Real time
% 1.10/1.27  ; 
% 1.10/1.27  ; Term-hash-array has 2,110 terms in all.
% 1.10/1.27  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.10/1.27  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.10/1.27  ; Path-index has 1,782 entries (1,782 at peak, 2,183 added, 401 deleted).
% 1.10/1.27  ; Path-index has 1,904 nodes (1,904 at peak, 2,014 added, 110 deleted).
% 1.10/1.27  ; Trie-index has 1,782 entries (1,782 at peak, 2,183 added, 401 deleted).
% 1.10/1.27  ; Trie-index has 1,270 nodes (1,307 at peak, 1,509 added, 239 deleted).
% 1.10/1.27  ; Retrieved 617,725 generalization terms in 20,154 calls.
% 1.10/1.27  ; Retrieved 1,487 instance terms in 503 calls.
% 1.10/1.27  ; Retrieved 10,915 unifiable terms in 425 calls.
% 1.10/1.27  ; 
% 1.10/1.27  ; The agenda of rows to process has 10 entries:
% 1.10/1.27  ;     1 with value 16              1 with value 19               1 with value 21
% 1.10/1.27  ;     2 with value 18              5 with value 20
% 1.10/1.27  ; The agenda of rows to give has 492 entries:
% 1.10/1.27  ;     1 with value (4 14)         55 with value (4 23)          10 with value (4 31)
% 1.10/1.27  ;     1 with value (4 16)         52 with value (4 24)           9 with value (4 32)
% 1.10/1.27  ;    18 with value (4 17)         29 with value (4 25)           4 with value (4 33)
% 1.10/1.27  ;    15 with value (4 18)         20 with value (4 26)           2 with value (4 34)
% 1.10/1.27  ;    15 with value (4 19)         21 with value (4 27)           2 with value (4 36)
% 1.10/1.27  ;    35 with value (4 20)         45 with value (4 28)           4 with value (4 37)
% 1.10/1.27  ;    42 with value (4 21)          7 with value (4 29)           2 with value (4 39)
% 1.10/1.27  ;    79 with value (4 22)         24 with value (4 30)
% 1.10/1.27  Evaluation took:
% 1.10/1.27    0.811 seconds of real time
% 1.10/1.27    0.771211 seconds of user run time
% 1.10/1.27    0.038843 seconds of system run time
% 1.10/1.27    [Run times include 0.016 seconds GC run time.]
% 1.10/1.27    0 calls to %EVAL
% 1.10/1.27    0 page faults and
% 1.10/1.27    40,943,208 bytes consed.
% 1.10/1.27  :PROOF-FOUND
% 1.10/1.27  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-08T10:52:31
% 1.10/1.27  :PROOF-FOUND
% 1.10/1.27  * 
%------------------------------------------------------------------------------