TSTP Solution File: SWV459+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWV459+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n016.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:34:27 EDT 2022

% Result   : Theorem 2.84s 3.05s
% Output   : Refutation 2.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   34 (  23 unt;   5 nHn;  31 RR)
%            Number of literals    :   71 (  30 equ;  39 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  12 con; 0-2 aty)
%            Number of variables   :   27 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(54,axiom,
    ( elem(X,cons(Y,Z))
    | X != Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_46) ).

cnf(85,axiom,
    ( leq(X,Y)
    | leq(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_60) ).

cnf(86,axiom,
    ( ~ leq(X,Y)
    | ~ leq(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).

cnf(87,axiom,
    ( leq(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).

cnf(91,axiom,
    ( ~ leq(X,s(Y))
    | X = s(Y)
    | leq(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_64) ).

cnf(109,negated_conjecture,
    ( ~ leq(host(X),'SKOLEMAABD8'(X,Y))
    | leq(host(X),host(Z))
    | ~ elem(m_Down(Y),queue(host(X)))
    | index(status,host(X)) != elec_1
    | ~ setIn(Z,alive)
    | index(ldr,host(Z)) != host(Z)
    | index(status,host(Z)) != norm ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(110,negated_conjecture,
    ( leq(s(zero),'SKOLEMAABD8'(X,Y))
    | leq(host(X),host(Z))
    | ~ elem(m_Down(Y),queue(host(X)))
    | index(status,host(X)) != elec_1
    | ~ setIn(Z,alive)
    | index(ldr,host(Z)) != host(Z)
    | index(status,host(Z)) != norm ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(111,negated_conjecture,
    ( ~ setIn('SKOLEMAABD8'(X,Y),index(down,host(X)))
    | leq(host(X),host(Z))
    | ~ elem(m_Down(Y),queue(host(X)))
    | index(status,host(X)) != elec_1
    | ~ setIn(Z,alive)
    | index(ldr,host(Z)) != host(Z)
    | index(status,host(Z)) != norm ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(112,negated_conjecture,
    ( 'SKOLEMAABD8'(X,Y) != host(Y)
    | leq(host(X),host(Z))
    | ~ elem(m_Down(Y),queue(host(X)))
    | index(status,host(X)) != elec_1
    | ~ setIn(Z,alive)
    | index(ldr,host(Z)) != host(Z)
    | index(status,host(Z)) != norm ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(113,negated_conjecture,
    queue(host('SKOLEMAABD6')) = cons(m_Down('SKOLEMAABD7'),'SKOLEMAABD4'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(118,negated_conjecture,
    ( leq(host('SKOLEMAABD6'),X)
    | ~ leq(s(zero),X)
    | setIn(X,index(down,host('SKOLEMAABD6')))
    | X = host('SKOLEMAABD7') ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(119,negated_conjecture,
    index(status,host('SKOLEMAABD6')) = elec_1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(121,negated_conjecture,
    host('SKOLEMAABD6') != host('SKOLEMAABD9'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(124,negated_conjecture,
    host('SKOLEMAABD6') = host('SKOLEMAABD11'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(125,negated_conjecture,
    ~ leq(s(host('SKOLEMAABD6')),host('SKOLEMAABD9')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(126,plain,
    ~ leq(s(host('SKOLEMAABD11')),host('SKOLEMAABD9')),
    inference('REWRITE',[status(thm)],[125,124,theory(equality)]) ).

cnf(129,negated_conjecture,
    setIn('SKOLEMAABD9',alive),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(130,negated_conjecture,
    index(ldr,host('SKOLEMAABD9')) = host('SKOLEMAABD9'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(131,negated_conjecture,
    index(status,host('SKOLEMAABD9')) = norm,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

cnf(132,plain,
    queue(host('SKOLEMAABD11')) = cons(m_Down('SKOLEMAABD7'),'SKOLEMAABD4'),
    inference('REWRITE',[status(thm)],[113,124,theory(equality)]) ).

cnf(134,plain,
    ( leq(host('SKOLEMAABD11'),X)
    | ~ leq(s(zero),X)
    | setIn(X,index(down,host('SKOLEMAABD11')))
    | X = host('SKOLEMAABD7') ),
    inference('REWRITE',[status(thm)],[118,124,theory(equality)]) ).

cnf(135,plain,
    index(status,host('SKOLEMAABD11')) = elec_1,
    inference('REWRITE',[status(thm)],[119,124,theory(equality)]) ).

cnf(137,plain,
    host('SKOLEMAABD11') != host('SKOLEMAABD9'),
    inference('REWRITE',[status(thm)],[121,124,theory(equality)]) ).

cnf(149,plain,
    leq(host('SKOLEMAABD9'),s(host('SKOLEMAABD11'))),
    inference('HYPERRESOLVE',[status(thm)],[126,85]) ).

cnf(150,plain,
    s(host('SKOLEMAABD11')) != host('SKOLEMAABD9'),
    inference('UR-RESOLVE',[status(thm)],[87,126]) ).

cnf(289,plain,
    elem(X,cons(X,Y)),
    inference('HYPERRESOLVE',[status(thm)],[54,theory(equality)]) ).

cnf(907,plain,
    elem(m_Down('SKOLEMAABD7'),queue(host('SKOLEMAABD11'))),
    inference('PARAMODULATE',[status(thm)],[289,132,theory(equality)]) ).

cnf(1195,plain,
    leq(host('SKOLEMAABD9'),host('SKOLEMAABD11')),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[91,149]),150]) ).

cnf(1198,plain,
    ~ leq(host('SKOLEMAABD11'),host('SKOLEMAABD9')),
    inference('UR-RESOLVE',[status(thm)],[86,1195,137]) ).

cnf(5909,plain,
    'SKOLEMAABD8'('SKOLEMAABD11','SKOLEMAABD7') != host('SKOLEMAABD7'),
    inference('UR-RESOLVE',[status(thm)],[112,907,1198,135,129,130,131]) ).

cnf(5910,plain,
    leq(s(zero),'SKOLEMAABD8'('SKOLEMAABD11','SKOLEMAABD7')),
    inference('UR-RESOLVE',[status(thm)],[110,907,1198,135,129,130,131]) ).

cnf(5911,plain,
    ~ leq(host('SKOLEMAABD11'),'SKOLEMAABD8'('SKOLEMAABD11','SKOLEMAABD7')),
    inference('UR-RESOLVE',[status(thm)],[109,907,1198,135,129,130,131]) ).

cnf(5913,plain,
    ~ setIn('SKOLEMAABD8'('SKOLEMAABD11','SKOLEMAABD7'),index(down,host('SKOLEMAABD11'))),
    inference('UR-RESOLVE',[status(thm)],[111,907,1198,135,129,130,131]) ).

cnf(15341,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[134,5910]),5909,5913,5911]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV459+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n016.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 23:50:46 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T23:50:47
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-06-14T23:50:47
% 2.84/3.05  
% 2.84/3.05  
% 2.84/3.05  #||
% 2.84/3.05  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.84/3.05  % SZS output start Refutation
% See solution above
% 2.84/3.05  ||#
% 2.84/3.05  
% 2.84/3.05  ; Summary of computation:
% 2.84/3.05  ;     28536 formulas have been input or derived (from 803 formulas).
% 2.84/3.05  ;     15341 (54%) were retained.  Of these,
% 2.84/3.05  ;           26 ( 0%) were simplified or subsumed later,
% 2.84/3.05  ;        15315 (100%) are still being kept.
% 2.84/3.05  ; 
% 2.84/3.05  ; Run time in seconds excluding printing time:
% 2.84/3.05  ;     0.034   1%   Read assertion file          (1 call)
% 2.84/3.05  ;     0.008   0%   Assert                       (67 calls)
% 2.84/3.05  ;     1.098  43%   Process new row              (24,775 calls)
% 2.84/3.05  ;     0.600  23%   Resolution                   (1,604 calls)
% 2.84/3.05  ;     0.026   1%   Paramodulation               (802 calls)
% 2.84/3.05  ;     0.000   0%   Factoring                    (11 calls)
% 2.84/3.05  ;     0.003   0%   Condensing                   (614 calls)
% 2.84/3.05  ;     0.017   1%   Forward subsumption          (614 calls)
% 2.84/3.05  ;     0.010   0%   Backward subsumption         (344 calls)
% 2.84/3.05  ;     0.009   0%   Clause clause subsumption    (1,218 calls)
% 2.84/3.05  ;     0.511  20%   Forward simplification       (24,771 calls)
% 2.84/3.05  ;     0.111   4%   Backward simplification      (15,340 calls)
% 2.84/3.05  ;     0.004   0%   Ordering                     (2,982 calls)
% 2.84/3.05  ;     0.000   0%   Sortal reasoning             (32 calls)
% 2.84/3.05  ;     0.001   0%   Purity testing               (1 call)
% 2.84/3.05  ;     0.138   5%   Other
% 2.84/3.05  ;     2.570        Total
% 2.84/3.05  ;     2.576        Real time
% 2.84/3.06  ; 
% 2.84/3.06  ; Term-hash-array has 25,763 terms in all.
% 2.84/3.06  ; Feature-vector-row-index has 331 entries (331 at peak, 344 added, 13 deleted).
% 2.84/3.06  ; Feature-vector-row-index has 1,708 nodes (1,708 at peak, 1,823 added, 115 deleted).
% 2.84/3.06  ;  Retrieved 1,871 possibly forward subsuming rows in 614 calls.
% 2.84/3.06  ;  Retrieved 100 possibly backward subsumed rows in 344 calls.
% 2.84/3.06  ; Path-index has 25,744 entries (25,744 at peak, 25,798 added, 54 deleted).
% 2.84/3.06  ; Path-index has 12,823 nodes (12,823 at peak, 12,867 added, 44 deleted).
% 2.84/3.06  ; Trie-index has 25,744 entries (25,744 at peak, 25,798 added, 54 deleted).
% 2.84/3.06  ; Trie-index has 76,846 nodes (76,846 at peak, 76,952 added, 106 deleted).
% 2.84/3.06  ; Retrieved 47,668 generalization terms in 103,689 calls.
% 2.84/3.06  ; Retrieved 15,035 instance terms in 14,995 calls.
% 2.84/3.06  ; Retrieved 677,600 unifiable terms in 27,840 calls.
% 2.84/3.06  ; 
% 2.84/3.06  ; The agenda of rows to give has 14514 entries:
% 2.84/3.06  ;    27 with value (4 12)        536 with value (4 22)           7 with value (4 33)
% 2.84/3.06  ;   220 with value (4 13)        510 with value (4 23)           4 with value (4 34)
% 2.84/3.06  ;   375 with value (4 14)         63 with value (4 24)           7 with value (4 35)
% 2.84/3.06  ;   825 with value (4 15)         26 with value (4 25)           8 with value (4 36)
% 2.84/3.06  ;  2429 with value (4 16)          2 with value (4 26)           2 with value (4 37)
% 2.84/3.06  ;  1103 with value (4 17)          2 with value (4 28)           1 with value (4 38)
% 2.84/3.06  ;  2046 with value (4 18)          7 with value (4 29)           1 with value (4 40)
% 2.84/3.06  ;  2915 with value (4 19)          3 with value (4 30)           2 with value (4 43)
% 2.84/3.06  ;  2721 with value (4 20)         10 with value (4 31)           3 with value (4 48)
% 2.84/3.06  ;   657 with value (4 21)          1 with value (4 32)           1 with value (4 51)
% 2.84/3.06  Evaluation took:
% 2.84/3.06    2.58 seconds of real time
% 2.84/3.06    2.366837 seconds of user run time
% 2.84/3.06    0.211138 seconds of system run time
% 2.84/3.06    [Run times include 0.423 seconds GC run time.]
% 2.84/3.06    0 calls to %EVAL
% 2.84/3.06    0 page faults and
% 2.84/3.06    183,632,640 bytes consed.
% 2.84/3.06  :PROOF-FOUND
% 2.84/3.06  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T23:50:49
% 2.84/3.06  :PROOF-FOUND
% 2.84/3.06  * 
%------------------------------------------------------------------------------