↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWX207+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n018.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  : 300s
% DateTime : Tue May  5 07:07:13 PM UTC 2026

% Result   : Theorem 0.52s 0.71s
% Output   : Refutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   16 (  12 unt;   0 nHn;  11 RR)
%            Number of literals    :   20 (  19 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   17 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(16,axiom,
    pB != pE,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).

cnf(17,axiom,
    proj1C(c2(X,Y)) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_017) ).

cnf(19,axiom,
    append(nil,X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).

cnf(22,axiom,
    linP(bP(X)) = append(cons(b,nil),append(linP(X),cons(b,nil))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_022) ).

cnf(24,axiom,
    linP(pB) = cons(b,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_024) ).

cnf(25,axiom,
    linP(pE) = nil,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_025) ).

cnf(26,axiom,
    linC(c2(X,Y)) = append(linP(X),linP(Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).

cnf(27,negated_conjecture,
    ( linC(X) != linC(Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_027) ).

cnf(28,plain,
    linP(bP(X)) = append(linP(pB),append(linP(X),linP(pB))),
    inference('REWRITE',[status(thm)],[22,24,theory(equality)]) ).

cnf(48,plain,
    ( append(linP(X),linP(Y)) != linC(Z)
    | c2(X,Y) = Z ),
    inference('PARAMODULATE',[status(thm)],[27,26,theory(equality)]) ).

cnf(53,plain,
    linP(bP(pE)) = append(linP(pB),linP(pB)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[28,25,theory(equality)]),19,theory(equality)]) ).

cnf(103,plain,
    linP(bP(pB)) = append(linP(pB),linP(bP(pE))),
    inference('PARAMODULATE',[status(thm)],[28,53,theory(equality)]) ).

cnf(256,plain,
    ( linP(X) != linC(Y)
    | c2(pE,X) = Y ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[48,25,theory(equality)]),19,theory(equality)]) ).

cnf(264,plain,
    ( linP(X) != append(linP(Y),linP(Z))
    | c2(pE,X) = c2(Y,Z) ),
    inference('PARAMODULATE',[status(thm)],[256,26,theory(equality)]) ).

cnf(528,plain,
    c2(pE,bP(pB)) = c2(pB,bP(pE)),
    inference('HYPERRESOLVE',[status(thm)],[264,103]) ).

cnf(540,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,528,theory(equality)]),16,17,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX207+1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.16/0.34  % Computer : n018.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.35  % WCLimit  : 300
% 0.16/0.35  % DateTime : Tue May  5 11:35:31 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.29/0.48  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.29/0.49  * 
% 0.29/0.49  * 
% 0.29/0.49  #<PACKAGE "SNARK-USER">
% 0.29/0.49  * 
% 0.29/0.49  SNARK-TPTP-OPTIONS
% 0.29/0.49  * 
% 0.29/0.50  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.29/0.50   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.29/0.50   (USE-FACTORING :POS)
% 0.29/0.50   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.29/0.50   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.29/0.50   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.29/0.50   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.29/0.50   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.29/0.50   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.29/0.50   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.29/0.50   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.29/0.50   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.29/0.50   (DECLARE-TPTP-SYMBOLS2))
% 0.29/0.50  * 
% 0.29/0.50  "."
% 0.29/0.50  * 
% 0.29/0.50  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2026-05-05T11:35:32
% 0.29/0.50  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2026-05-05T11:35:32
% 0.29/0.51  
% 0.52/0.71  ; Recognized left identity assertion (= (|append| |nil| ?X) ?X).
% 0.52/0.71  
% 0.52/0.71  #||
% 0.52/0.71  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.52/0.71  % SZS output start Refutation
% See solution above
% 0.52/0.72  ||#
% 0.52/0.72  
% 0.52/0.72  ; Summary of computation:
% 0.52/0.72  ;      1564 formulas have been input or derived (from 262 formulas).
% 0.52/0.72  ;       540 (35%) were retained.  Of these,
% 0.52/0.72  ;           89 (16%) were simplified or subsumed later,
% 0.52/0.72  ;          451 (84%) are still being kept.
% 0.52/0.72  ; 
% 0.52/0.72  ; Run time in seconds excluding printing time:
% 0.52/0.72  ;     0.004   2%   Read assertion file          (1 call)
% 0.52/0.72  ;     0.001   0%   Assert                       (27 calls)
% 0.52/0.72  ;     0.042  20%   Process new row              (1,411 calls)
% 0.52/0.72  ;     0.022  10%   Resolution                   (522 calls)
% 0.52/0.72  ;     0.023  11%   Paramodulation               (261 calls)
% 0.52/0.72  ;     0.000   0%   Condensing                   (62 calls)
% 0.52/0.72  ;     0.002   1%   Forward subsumption          (62 calls)
% 0.52/0.72  ;     0.001   0%   Backward subsumption         (49 calls)
% 0.52/0.72  ;     0.000   0%   Clause clause subsumption    (42 calls)
% 0.52/0.72  ;     0.047  22%   Forward simplification       (1,384 calls)
% 0.52/0.72  ;     0.014   7%   Backward simplification      (540 calls)
% 0.52/0.72  ;     0.027  13%   Ordering                     (6,176 calls)
% 0.52/0.72  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.52/0.72  ;     0.000   0%   Purity testing               (1 call)
% 0.52/0.72  ;     0.031  14%   Other
% 0.52/0.72  ;     0.214        Total
% 0.52/0.72  ;     0.226        Real time
% 0.52/0.72  ; 
% 0.52/0.72  ; Term-hash-array has 1,311 terms in all.
% 0.52/0.72  ; Feature-vector-row-index has 45 entries (45 at peak, 49 added, 4 deleted).
% 0.52/0.72  ; Feature-vector-row-index has 393 nodes (393 at peak, 409 added, 16 deleted).
% 0.52/0.72  ;  Retrieved 38 possibly forward subsuming rows in 62 calls.
% 0.52/0.72  ;  Retrieved 6 possibly backward subsumed rows in 49 calls.
% 0.52/0.72  ; Path-index has 1,148 entries (1,148 at peak, 1,357 added, 209 deleted).
% 0.52/0.72  ; Path-index has 1,947 nodes (1,947 at peak, 2,085 added, 138 deleted).
% 0.52/0.72  ; Trie-index has 1,148 entries (1,148 at peak, 1,357 added, 209 deleted).
% 0.52/0.72  ; Trie-index has 4,071 nodes (4,071 at peak, 4,997 added, 926 deleted).
% 0.52/0.72  ; Retrieved 4,415 generalization terms in 8,592 calls.
% 0.52/0.72  ; Retrieved 836 instance terms in 650 calls.
% 0.52/0.72  ; Retrieved 14,574 unifiable terms in 2,441 calls.
% 0.52/0.72  ; 
% 0.52/0.72  ; The agenda of rows to process has 3 entries:
% 0.52/0.72  ;     2 with value 17              1 with value 21
% 0.52/0.72  ; The agenda of rows to give has 212 entries:
% 0.52/0.72  ;     1 with value (4 16)         41 with value (4 25)           9 with value (4 30)
% 0.52/0.72  ;     1 with value (4 20)         21 with value (4 26)          12 with value (4 31)
% 0.52/0.72  ;     2 with value (4 22)         11 with value (4 27)           6 with value (4 32)
% 0.52/0.72  ;    48 with value (4 23)         19 with value (4 28)           2 with value (4 33)
% 0.52/0.72  ;    30 with value (4 24)          9 with value (4 29)
% 0.52/0.72  Evaluation took:
% 0.52/0.72    0.226 seconds of real time
% 0.52/0.72    0.20006 seconds of user run time
% 0.52/0.72    0.025755 seconds of system run time
% 0.52/0.72    [Run times include 0.01 seconds GC run time.]
% 0.52/0.72    0 calls to %EVAL
% 0.52/0.72    0 page faults and
% 0.52/0.72    12,784,464 bytes consed.
% 0.52/0.72  :PROOF-FOUND
% 0.52/0.72  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2026-05-05T11:35:32
% 0.52/0.72  :PROOF-FOUND
% 0.52/0.72  * 
%------------------------------------------------------------------------------