↑ Up

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

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

% Computer : n023.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 : Wed Jul 20 21:33:10 EDT 2022

% Result   : Theorem 0.20s 0.55s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   18 (  10 unt;   3 nHn;  16 RR)
%            Number of literals    :   30 (   0 equ;  13 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ less_than(X,Y)
    | ~ less_than(Y,Z)
    | less_than(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',transitivity) ).

cnf(2,axiom,
    ( less_than(X,Y)
    | less_than(Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',totality) ).

cnf(4,axiom,
    ( ~ strictly_less_than(X,Y)
    | less_than(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

cnf(6,axiom,
    ( strictly_less_than(X,Y)
    | ~ less_than(X,Y)
    | less_than(Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

cnf(26,axiom,
    ( ~ pair_in_list(X,Y,Z)
    | ~ less_than(U,Z)
    | pair_in_list(update_slb(X,U),Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l35_li3637) ).

cnf(27,axiom,
    ( ~ pair_in_list(X,Y,Z)
    | ~ strictly_less_than(Z,U)
    | pair_in_list(update_slb(X,U),Y,U) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l35_li3839) ).

cnf(28,negated_conjecture,
    pair_in_list('SKOLEMAAAW1','SKOLEMAAAW2','SKOLEMAAAW3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l35_co) ).

cnf(29,negated_conjecture,
    strictly_less_than('SKOLEMAAAW2','SKOLEMAAAW3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l35_co) ).

cnf(30,negated_conjecture,
    ( ~ pair_in_list(update_slb('SKOLEMAAAW1','SKOLEMAAAW4'),X,Y)
    | ~ strictly_less_than(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l35_co) ).

cnf(31,plain,
    less_than('SKOLEMAAAW2','SKOLEMAAAW3'),
    inference('HYPERRESOLVE',[status(thm)],[4,29]) ).

cnf(36,plain,
    ( less_than(X,Y)
    | strictly_less_than(Y,X) ),
    inference('HYPERRESOLVE',[status(thm)],[6,2]) ).

cnf(37,plain,
    ~ pair_in_list(update_slb('SKOLEMAAAW1','SKOLEMAAAW4'),'SKOLEMAAAW2','SKOLEMAAAW3'),
    inference('UR-RESOLVE',[status(thm)],[30,29]) ).

cnf(58,plain,
    ~ less_than('SKOLEMAAAW4','SKOLEMAAAW3'),
    inference('UR-RESOLVE',[status(thm)],[26,37,28]) ).

cnf(60,plain,
    strictly_less_than('SKOLEMAAAW3','SKOLEMAAAW4'),
    inference('UR-RESOLVE',[status(thm)],[36,58]) ).

cnf(62,plain,
    ~ less_than('SKOLEMAAAW4','SKOLEMAAAW2'),
    inference('UR-RESOLVE',[status(thm)],[1,58,31]) ).

cnf(67,plain,
    pair_in_list(update_slb('SKOLEMAAAW1','SKOLEMAAAW4'),'SKOLEMAAAW2','SKOLEMAAAW4'),
    inference('HYPERRESOLVE',[status(thm)],[27,60,28]) ).

cnf(70,plain,
    strictly_less_than('SKOLEMAAAW2','SKOLEMAAAW4'),
    inference('UR-RESOLVE',[status(thm)],[36,62]) ).

cnf(75,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[30,70]),67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 18:36:05 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48  * 
% 0.20/0.48  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T18:36:05
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n023.cluster.edu at 2022-06-15T18:36:05
% 0.20/0.55  
% 0.20/0.55  
% 0.20/0.55  #||
% 0.20/0.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55  % SZS output start Refutation
% See solution above
% 0.20/0.55  ||#
% 0.20/0.55  
% 0.20/0.55  ; Summary of computation:
% 0.20/0.55  ;       414 formulas have been input or derived (from 48 formulas).
% 0.20/0.55  ;        75 (18%) were retained.  Of these,
% 0.20/0.55  ;            1 ( 1%) were simplified or subsumed later,
% 0.20/0.55  ;           74 (99%) are still being kept.
% 0.20/0.55  ; 
% 0.20/0.55  ; Run time in seconds excluding printing time:
% 0.20/0.55  ;     0.007  12%   Read assertion file          (1 call)
% 0.20/0.55  ;     0.000   0%   Assert                       (21 calls)
% 0.20/0.55  ;     0.007  12%   Process new row              (358 calls)
% 0.20/0.55  ;     0.007  12%   Resolution                   (94 calls)
% 0.20/0.55  ;     0.001   2%   Paramodulation               (47 calls)
% 0.20/0.55  ;     0.000   0%   Factoring                    (2 calls)
% 0.20/0.55  ;     0.003   5%   Condensing                   (44 calls)
% 0.20/0.55  ;     0.003   5%   Forward subsumption          (44 calls)
% 0.20/0.55  ;     0.000   0%   Backward subsumption         (28 calls)
% 0.20/0.55  ;     0.001   2%   Clause clause subsumption    (26 calls)
% 0.20/0.55  ;     0.005   8%   Forward simplification       (355 calls)
% 0.20/0.55  ;     0.000   0%   Backward simplification      (75 calls)
% 0.20/0.55  ;     0.001   2%   Ordering                     (104 calls)
% 0.20/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.55  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.55  ;     0.025  42%   Other
% 0.20/0.55  ;     0.060        Total
% 0.20/0.55  ;     0.064        Real time
% 0.20/0.55  ; 
% 0.20/0.55  ; Term-hash-array has 139 terms in all.
% 0.20/0.55  ; Feature-vector-row-index has 27 entries (27 at peak, 28 added, 1 deleted).
% 0.20/0.55  ; Feature-vector-row-index has 115 nodes (115 at peak, 117 added, 2 deleted).
% 0.20/0.55  ;  Retrieved 31 possibly forward subsuming rows in 44 calls.
% 0.20/0.55  ;  Retrieved 4 possibly backward subsumed rows in 28 calls.
% 0.20/0.55  ; Path-index has 145 entries (145 at peak, 145 added, 0 deleted).
% 0.20/0.55  ; Path-index has 258 nodes (258 at peak, 258 added, 0 deleted).
% 0.20/0.55  ; Trie-index has 145 entries (145 at peak, 145 added, 0 deleted).
% 0.20/0.55  ; Trie-index has 319 nodes (319 at peak, 319 added, 0 deleted).
% 0.20/0.55  ; Retrieved 851 generalization terms in 924 calls.
% 0.20/0.55  ; Retrieved 59 instance terms in 46 calls.
% 0.20/0.55  ; Retrieved 1,598 unifiable terms in 386 calls.
% 0.20/0.55  ; 
% 0.20/0.55  ; The agenda of rows to process has 1 entry:
% 0.20/0.55  ;     1 with value 24
% 0.20/0.55  ; The agenda of rows to give has 27 entries:
% 0.20/0.55  ;     2 with value (4 8)           6 with value (4 12)           1 with value (4 21)
% 0.20/0.55  ;     2 with value (4 9)           3 with value (4 13)           3 with value (4 23)
% 0.20/0.55  ;     2 with value (4 10)          1 with value (4 14)           2 with value (4 24)
% 0.20/0.55  ;     1 with value (4 11)          3 with value (4 20)           1 with value (4 25)
% 0.20/0.55  Evaluation took:
% 0.20/0.55    0.064 seconds of real time
% 0.20/0.55    0.052659 seconds of user run time
% 0.20/0.55    0.01084 seconds of system run time
% 0.20/0.55    0 calls to %EVAL
% 0.20/0.55    0 page faults and
% 0.20/0.55    3,746,480 bytes consed.
% 0.20/0.55  :PROOF-FOUND
% 0.20/0.55  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T18:36:05
% 0.20/0.55  :PROOF-FOUND
% 0.20/0.55  * 
%------------------------------------------------------------------------------