↑ Up

SNARK---20120808r022.THM-Ref.s

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

% Computer : n032.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 : Thu Jul 14 17:59:51 EDT 2022

% Result   : Theorem 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   26
% Syntax   : Number of clauses     :   48 (  39 unt;   9 nHn;  48 RR)
%            Number of literals    :   72 (  71 equ;   6 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;  10 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    e10 != e14,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).

cnf(11,axiom,
    e20 != e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(12,axiom,
    e20 != e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(15,axiom,
    e21 != e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(16,axiom,
    e21 != e23,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(17,axiom,
    e21 != e24,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).

cnf(46,axiom,
    op1(e10,e10) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(48,axiom,
    op1(e10,e12) = e12,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(52,axiom,
    op1(e11,e11) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(53,axiom,
    op1(e11,e12) = e13,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(58,axiom,
    op1(e12,e12) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(63,axiom,
    op1(e13,e12) = e14,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).

cnf(77,axiom,
    op2(e21,e21) = e22,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(83,axiom,
    op2(e22,e22) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(89,axiom,
    op2(e23,e23) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(95,axiom,
    op2(e24,e24) = e21,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).

cnf(96,negated_conjecture,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22
    | h(e10) = e23
    | h(e10) = e24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(97,negated_conjecture,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23
    | h(e11) = e24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(106,negated_conjecture,
    h(op1(e10,e10)) = op2(h(e10),h(e10)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(107,plain,
    h(e10) = op2(h(e10),h(e10)),
    inference('REWRITE',[status(thm)],[106,46,theory(equality)]) ).

cnf(110,negated_conjecture,
    h(op1(e10,e12)) = op2(h(e10),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(111,plain,
    h(e12) = op2(h(e10),h(e12)),
    inference('REWRITE',[status(thm)],[110,48,theory(equality)]) ).

cnf(118,negated_conjecture,
    h(op1(e11,e11)) = op2(h(e11),h(e11)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(119,plain,
    h(e10) = op2(h(e11),h(e11)),
    inference('REWRITE',[status(thm)],[118,52,theory(equality)]) ).

cnf(120,negated_conjecture,
    h(op1(e11,e12)) = op2(h(e11),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(121,plain,
    h(e13) = op2(h(e11),h(e12)),
    inference('REWRITE',[status(thm)],[120,53,theory(equality)]) ).

cnf(130,negated_conjecture,
    h(op1(e12,e12)) = op2(h(e12),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(131,plain,
    h(e10) = op2(h(e12),h(e12)),
    inference('REWRITE',[status(thm)],[130,58,theory(equality)]) ).

cnf(140,negated_conjecture,
    h(op1(e13,e12)) = op2(h(e13),h(e12)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(141,plain,
    h(e14) = op2(h(e13),h(e12)),
    inference('REWRITE',[status(thm)],[140,63,theory(equality)]) ).

cnf(211,negated_conjecture,
    j(h(e10)) = e10,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(215,negated_conjecture,
    j(h(e14)) = e14,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

cnf(217,plain,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22
    | h(e10) = e23 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,96,theory(equality)]),17,95,theory(equality)]) ).

cnf(219,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23
    | h(e10) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[119,97,theory(equality)]),95,theory(equality)]) ).

cnf(301,plain,
    ( h(e10) = e20
    | h(e10) = e21
    | h(e10) = e22 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,217,theory(equality)]),16,89,theory(equality)]) ).

cnf(303,plain,
    ( h(e10) = e20
    | h(e10) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,301,theory(equality)]),15,83,theory(equality)]) ).

cnf(305,plain,
    h(e10) = e20,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[107,303,theory(equality)]),15,77,theory(equality)]) ).

cnf(307,plain,
    h(e12) = op2(e20,h(e12)),
    inference('REWRITE',[status(thm)],[111,305,theory(equality)]) ).

cnf(311,plain,
    e20 = op2(h(e11),h(e11)),
    inference('REWRITE',[status(thm)],[119,305,theory(equality)]) ).

cnf(313,plain,
    e20 = op2(h(e12),h(e12)),
    inference('REWRITE',[status(thm)],[131,305,theory(equality)]) ).

cnf(318,plain,
    j(e20) = e10,
    inference('REWRITE',[status(thm)],[211,305,theory(equality)]) ).

cnf(339,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22
    | h(e11) = e23 ),
    inference('REWRITE',[status(thm)],[219,11,305,theory(equality)]) ).

cnf(344,plain,
    ( h(e11) = e20
    | h(e11) = e21
    | h(e11) = e22 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,339,theory(equality)]),11,89,theory(equality)]) ).

cnf(346,plain,
    ( h(e11) = e20
    | h(e11) = e21 ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,344,theory(equality)]),11,83,theory(equality)]) ).

cnf(348,plain,
    h(e11) = e20,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[311,346,theory(equality)]),12,77,theory(equality)]) ).

cnf(349,plain,
    h(e13) = h(e12),
    inference('REWRITE',[status(thm)],[121,307,348,theory(equality)]) ).

cnf(351,plain,
    h(e14) = e20,
    inference('REWRITE',[status(thm)],[141,313,349,theory(equality)]) ).

cnf(352,plain,
    $false,
    inference('REWRITE',[status(thm)],[215,4,318,351,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : ALG088+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.11  % Command  : run-snark %s %d
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 600
% 0.11/0.30  % DateTime : Wed Jun  8 01:22:51 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.15/0.39  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.40  * 
% 0.15/0.40  * 
% 0.15/0.40  #<PACKAGE "SNARK-USER">
% 0.15/0.40  * 
% 0.15/0.40  SNARK-TPTP-OPTIONS
% 0.15/0.40  * 
% 0.15/0.40  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40   (USE-FACTORING :POS)
% 0.15/0.40   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40   (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40  * 
% 0.15/0.40  "."
% 0.15/0.40  * 
% 0.15/0.40  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T01:22:51
% 0.15/0.40  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-08T01:22:51
% 0.15/0.48  
% 0.15/0.48  
% 0.15/0.48  #||
% 0.15/0.48  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.48  % SZS output start Refutation
% See solution above
% 0.15/0.49  ||#
% 0.15/0.49  
% 0.15/0.49  ; Summary of computation:
% 0.15/0.49  ;       635 formulas have been input or derived (from 198 formulas).
% 0.15/0.49  ;       352 (55%) were retained.  Of these,
% 0.15/0.49  ;          186 (53%) were simplified or subsumed later,
% 0.15/0.49  ;          166 (47%) are still being kept.
% 0.15/0.49  ; 
% 0.15/0.49  ; Run time in seconds excluding printing time:
% 0.15/0.49  ;     0.008  10%   Read assertion file          (1 call)
% 0.15/0.49  ;     0.006   7%   Assert                       (6 calls)
% 0.15/0.49  ;     0.020  24%   Process new row              (547 calls)
% 0.15/0.49  ;     0.003   4%   Resolution                   (394 calls)
% 0.15/0.49  ;     0.005   6%   Paramodulation               (197 calls)
% 0.15/0.49  ;     0.001   1%   Factoring                    (16 calls)
% 0.15/0.49  ;     0.000   0%   Condensing                   (124 calls)
% 0.15/0.49  ;     0.002   2%   Forward subsumption          (124 calls)
% 0.15/0.49  ;     0.003   4%   Backward subsumption         (116 calls)
% 0.15/0.49  ;     0.000   0%   Clause clause subsumption    (72 calls)
% 0.15/0.49  ;     0.008  10%   Forward simplification       (484 calls)
% 0.15/0.49  ;     0.002   2%   Backward simplification      (302 calls)
% 0.15/0.49  ;     0.004   5%   Ordering                     (1,817 calls)
% 0.15/0.49  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.15/0.49  ;     0.000   0%   Purity testing               (1 call)
% 0.15/0.49  ;     0.021  25%   Other
% 0.15/0.49  ;     0.083        Total
% 0.15/0.49  ;     0.085        Real time
% 0.15/0.49  ; 
% 0.15/0.49  ; Term-hash-array has 447 terms in all.
% 0.15/0.49  ; Feature-vector-row-index has 33 entries (91 at peak, 116 added, 83 deleted).
% 0.15/0.49  ; Feature-vector-row-index has 404 nodes (852 at peak, 1,084 added, 680 deleted).
% 0.15/0.49  ;  Retrieved 18 possibly forward subsuming rows in 124 calls.
% 0.15/0.49  ;  Retrieved 54 possibly backward subsumed rows in 116 calls.
% 0.15/0.49  ; Path-index has 290 entries (405 at peak, 495 added, 205 deleted).
% 0.15/0.49  ; Path-index has 140 nodes (170 at peak, 170 added, 30 deleted).
% 0.15/0.49  ; Trie-index has 290 entries (405 at peak, 495 added, 205 deleted).
% 0.15/0.49  ; Trie-index has 485 nodes (689 at peak, 829 added, 344 deleted).
% 0.15/0.49  ; Retrieved 145 generalization terms in 1,658 calls.
% 0.15/0.49  ; Retrieved 185 instance terms in 185 calls.
% 0.15/0.49  ; Retrieved 168 unifiable terms in 1,213 calls.
% 0.15/0.49  ; 
% 0.15/0.49  ; The agenda of backward simplifiable rows to process has 25 entries:
% 0.15/0.49  ;    25 with value 0
% 0.15/0.49  ; The agenda of rows to process has 9 entries:
% 0.15/0.49  ;     2 with value 17              1 with value 18               6 with value 20
% 0.15/0.49  ; The agenda of input rows to give has 2 entries:
% 0.15/0.49  ;     1 with value 6               1 with value 7
% 0.15/0.49  ; The agenda of rows to give has 30 entries:
% 0.15/0.49  ;     1 with value (4 10)          4 with value (4 31)          16 with value (4 35)
% 0.15/0.49  ;     1 with value (4 25)          8 with value (4 34)
% 0.15/0.49  Evaluation took:
% 0.15/0.49    0.086 seconds of real time
% 0.15/0.49    0.077073 seconds of user run time
% 0.15/0.49    0.008923 seconds of system run time
% 0.15/0.49    0 calls to %EVAL
% 0.15/0.49    0 page faults and
% 0.15/0.49    9,131,208 bytes consed.
% 0.15/0.49  :PROOF-FOUND
% 0.15/0.49  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-08T01:22:51
% 0.15/0.49  :PROOF-FOUND
% 0.15/0.49  * 
%------------------------------------------------------------------------------