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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWV007-1 : TPTP v8.1.0. Released v1.0.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  : 600s
% DateTime : Wed Jul 20 21:31:29 EDT 2022

% Result   : Unsatisfiable 0.40s 0.60s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   13 (   8 unt;   1 nHn;  11 RR)
%            Number of literals    :   22 (   3 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(less_than_successor,axiom,
    less_than(X,successor(X)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',less_than_successor) ).

cnf(transitivity_of_less_than,axiom,
    ( less_than(X,Y)
    | ~ less_than(X,Z)
    | ~ less_than(Z,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',transitivity_of_less_than) ).

cnf(all_related,axiom,
    ( less_than(X,Y)
    | less_than(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',all_related) ).

cnf(anti_symmetry_of_less_than,axiom,
    ( ~ less_than(X,Y)
    | ~ less_than(Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',anti_symmetry_of_less_than) ).

cnf(equal_and_less_than_transitivity2,axiom,
    ( less_than(X,Y)
    | Z != Y
    | ~ less_than(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV001-0.ax',equal_and_less_than_transitivity2) ).

cnf(clause_4,negated_conjecture,
    ~ less_than(n,m),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_5,negated_conjecture,
    less_than(i,m),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

cnf(clause_8,negated_conjecture,
    less_than(a(m),a(k)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

cnf(clause_11,negated_conjecture,
    ( less_than(X,i)
    | ~ less_than(X,successor(n))
    | ~ less_than(a(X),a(k)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).

cnf(24,plain,
    ~ less_than(m,i),
    inference('UR-RESOLVE',[status(thm)],[anti_symmetry_of_less_than,clause_5]) ).

cnf(42,plain,
    ~ less_than(successor(n),m),
    inference('UR-RESOLVE',[status(thm)],[transitivity_of_less_than,clause_4,less_than_successor]) ).

cnf(79,plain,
    successor(n) != m,
    inference('UR-RESOLVE',[status(thm)],[equal_and_less_than_transitivity2,clause_4,less_than_successor]) ).

cnf(86,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause_11,all_related,clause_8]),24,79,42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jun 15 09:58:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.50  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.51  * 
% 0.21/0.51  * 
% 0.21/0.52  #<PACKAGE "SNARK-USER">
% 0.21/0.52  * 
% 0.21/0.52  SNARK-TPTP-OPTIONS
% 0.21/0.52  * 
% 0.21/0.52  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.52   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.52   (USE-FACTORING :POS)
% 0.21/0.52   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.52   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.52   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.52   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.52   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.52   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.52   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.52   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.52   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.52   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.52  * 
% 0.21/0.52  "."
% 0.21/0.52  * 
% 0.21/0.52  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T09:58:30
% 0.21/0.52  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-15T09:58:30
% 0.40/0.60  
% 0.40/0.60  
% 0.40/0.60  #||
% 0.40/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.60  % SZS output start Refutation
% See solution above
% 0.40/0.60  ||#
% 0.40/0.60  
% 0.40/0.60  ; Summary of computation:
% 0.40/0.60  ;       341 formulas have been input or derived (from 23 formulas).
% 0.40/0.60  ;        86 (25%) were retained.  Of these,
% 0.40/0.60  ;           86 (100%) are still being kept.
% 0.40/0.60  ; 
% 0.40/0.60  ; Run time in seconds excluding printing time:
% 0.40/0.60  ;     0.006   8%   Read assertion file          (1 call)
% 0.40/0.60  ;     0.002   3%   Assert                       (23 calls)
% 0.40/0.60  ;     0.006   8%   Process new row              (303 calls)
% 0.40/0.60  ;     0.008  11%   Resolution                   (44 calls)
% 0.40/0.60  ;     0.001   1%   Paramodulation               (22 calls)
% 0.40/0.60  ;     0.000   0%   Factoring                    (1 call)
% 0.40/0.60  ;     0.007   9%   Condensing                   (79 calls)
% 0.40/0.60  ;     0.002   3%   Forward subsumption          (79 calls)
% 0.40/0.60  ;     0.000   0%   Backward subsumption         (31 calls)
% 0.40/0.60  ;     0.004   5%   Clause clause subsumption    (78 calls)
% 0.40/0.60  ;     0.005   7%   Forward simplification       (303 calls)
% 0.40/0.60  ;     0.000   0%   Backward simplification      (86 calls)
% 0.40/0.60  ;     0.001   1%   Ordering                     (224 calls)
% 0.40/0.60  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.40/0.60  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.60  ;     0.034  45%   Other
% 0.40/0.60  ;     0.076        Total
% 0.40/0.60  ;     0.079        Real time
% 0.40/0.60  ; 
% 0.40/0.60  ; Term-hash-array has 142 terms in all.
% 0.40/0.60  ; Feature-vector-row-index has 31 entries (31 at peak, 31 added, 0 deleted).
% 0.40/0.60  ; Feature-vector-row-index has 127 nodes (127 at peak, 127 added, 0 deleted).
% 0.40/0.60  ;  Retrieved 101 possibly forward subsuming rows in 79 calls.
% 0.40/0.60  ;  Retrieved 2 possibly backward subsumed rows in 31 calls.
% 0.40/0.60  ; Path-index has 147 entries (147 at peak, 147 added, 0 deleted).
% 0.40/0.60  ; Path-index has 143 nodes (143 at peak, 143 added, 0 deleted).
% 0.40/0.60  ; Trie-index has 147 entries (147 at peak, 147 added, 0 deleted).
% 0.40/0.60  ; Trie-index has 243 nodes (243 at peak, 243 added, 0 deleted).
% 0.40/0.60  ; Retrieved 579 generalization terms in 838 calls.
% 0.40/0.60  ; Retrieved 74 instance terms in 54 calls.
% 0.40/0.60  ; Retrieved 2,336 unifiable terms in 273 calls.
% 0.40/0.60  ; 
% 0.40/0.60  ; The agenda of rows to process has 4 entries:
% 0.40/0.60  ;     1 with value 19              3 with value 31
% 0.40/0.60  ; The agenda of input rows to give has 1 entry:
% 0.40/0.60  ;     1 with value 21
% 0.40/0.60  ; The agenda of rows to give has 62 entries:
% 0.40/0.60  ;     8 with value (4 5)           6 with value (4 13)           1 with value (4 22)
% 0.40/0.60  ;    24 with value (4 7)           2 with value (4 15)           1 with value (4 31)
% 0.40/0.60  ;     5 with value (4 8)           2 with value (4 17)           1 with value (4 35)
% 0.40/0.60  ;     6 with value (4 9)           2 with value (4 19)           1 with value (4 37)
% 0.40/0.60  ;     2 with value (4 10)          1 with value (4 21)
% 0.40/0.60  Evaluation took:
% 0.40/0.60    0.08 seconds of real time
% 0.40/0.60    0.066382 seconds of user run time
% 0.40/0.60    0.013306 seconds of system run time
% 0.40/0.60    0 calls to %EVAL
% 0.40/0.60    0 page faults and
% 0.40/0.60    3,668,216 bytes consed.
% 0.40/0.60  :PROOF-FOUND
% 0.40/0.60  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T09:58:30
% 0.40/0.60  :PROOF-FOUND
% 0.40/0.60  * 
%------------------------------------------------------------------------------