↑ Up

SNARK---20120808r022.UNS-Ref.s

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

% Computer : n007.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 : Mon Jul 18 05:19:52 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   30
% Syntax   : Number of clauses     :   43 (  20 unt;  10 nHn;  43 RR)
%            Number of literals    :  104 (   0 equ;  53 neg)
%            Maximal clause size   :   15 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   8 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
    hollywood(skc15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

cnf(clause2,negated_conjecture,
    event(skc14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

cnf(clause3,negated_conjecture,
    street(skc13),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    old(skc12),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

cnf(clause5,negated_conjecture,
    hollywood(skc11),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

cnf(clause6,negated_conjecture,
    event(skc10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

cnf(clause7,negated_conjecture,
    chevy(skc9),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

cnf(clause8,negated_conjecture,
    lonely(skc8),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

cnf(clause9,negated_conjecture,
    ( ssSkC0
    | chevy(skc12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause9) ).

cnf(clause10,negated_conjecture,
    ( ssSkC0
    | car(skc12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause10) ).

cnf(clause11,negated_conjecture,
    ( ssSkC0
    | white(skc12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause11) ).

cnf(clause12,negated_conjecture,
    ( ssSkC0
    | dirty(skc12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause12) ).

cnf(clause13,negated_conjecture,
    ( ssSkC0
    | lonely(skc13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause13) ).

cnf(clause14,negated_conjecture,
    ( ssSkC0
    | way(skc13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause14) ).

cnf(clause15,negated_conjecture,
    ( ssSkC0
    | city(skc15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause15) ).

cnf(clause16,negated_conjecture,
    ( ~ ssSkC0
    | street(skc8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause16) ).

cnf(clause17,negated_conjecture,
    ( ~ ssSkC0
    | way(skc8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause17) ).

cnf(clause18,negated_conjecture,
    ( ~ ssSkC0
    | old(skc9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause18) ).

cnf(clause19,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause19) ).

cnf(clause20,negated_conjecture,
    ( ~ ssSkC0
    | white(skc9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause20) ).

cnf(clause21,negated_conjecture,
    ( ~ ssSkC0
    | car(skc9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause21) ).

cnf(clause22,negated_conjecture,
    ( ~ ssSkC0
    | city(skc11) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause22) ).

cnf(clause23,negated_conjecture,
    ( ssSkC0
    | barrel(skc14,skc12) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause23) ).

cnf(clause24,negated_conjecture,
    ( ssSkC0
    | down(skc14,skc13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause24) ).

cnf(clause25,negated_conjecture,
    ( ssSkC0
    | in(skc14,skc15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause25) ).

cnf(clause26,negated_conjecture,
    ( ~ ssSkC0
    | barrel(skc10,skc9) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause26) ).

cnf(clause27,negated_conjecture,
    ( ~ ssSkC0
    | down(skc10,skc8) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause27) ).

cnf(clause28,negated_conjecture,
    ( ~ ssSkC0
    | in(skc10,skc11) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause28) ).

cnf(clause29,negated_conjecture,
    ( ~ street(X)
    | ~ way(X)
    | ~ lonely(X)
    | ~ old(Y)
    | ~ dirty(Y)
    | ~ white(Y)
    | ~ car(Y)
    | ~ chevy(Y)
    | ~ event(Z)
    | ~ barrel(Z,Y)
    | ~ down(Z,X)
    | ~ in(Z,U)
    | ~ city(U)
    | ~ hollywood(U)
    | ssSkC0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause29) ).

cnf(clause30,negated_conjecture,
    ( ~ chevy(X)
    | ~ car(X)
    | ~ white(X)
    | ~ dirty(X)
    | ~ old(X)
    | ~ lonely(Y)
    | ~ way(Y)
    | ~ street(Y)
    | ~ event(Z)
    | ~ barrel(Z,X)
    | ~ down(Z,Y)
    | ~ in(Z,U)
    | ~ city(U)
    | ~ hollywood(U)
    | ~ ssSkC0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause30) ).

cnf(31,plain,
    ssSkC0,
    inference('HYPERRESOLVE',[status(thm)],[clause29,clause3,clause14,clause13,clause4,clause12,clause11,clause10,clause9,clause2,clause23,clause24,clause25,clause15,clause1]) ).

cnf(32,plain,
    street(skc8),
    inference('REWRITE',[status(thm)],[clause16,31]) ).

cnf(33,plain,
    way(skc8),
    inference('REWRITE',[status(thm)],[clause17,31]) ).

cnf(34,plain,
    old(skc9),
    inference('REWRITE',[status(thm)],[clause18,31]) ).

cnf(35,plain,
    dirty(skc9),
    inference('REWRITE',[status(thm)],[clause19,31]) ).

cnf(36,plain,
    white(skc9),
    inference('REWRITE',[status(thm)],[clause20,31]) ).

cnf(37,plain,
    car(skc9),
    inference('REWRITE',[status(thm)],[clause21,31]) ).

cnf(38,plain,
    city(skc11),
    inference('REWRITE',[status(thm)],[clause22,31]) ).

cnf(39,plain,
    barrel(skc10,skc9),
    inference('REWRITE',[status(thm)],[clause26,31]) ).

cnf(40,plain,
    down(skc10,skc8),
    inference('REWRITE',[status(thm)],[clause27,31]) ).

cnf(41,plain,
    in(skc10,skc11),
    inference('REWRITE',[status(thm)],[clause28,31]) ).

cnf(42,plain,
    ( ~ chevy(X)
    | ~ car(X)
    | ~ white(X)
    | ~ dirty(X)
    | ~ old(X)
    | ~ lonely(Y)
    | ~ way(Y)
    | ~ street(Y)
    | ~ event(Z)
    | ~ barrel(Z,X)
    | ~ down(Z,Y)
    | ~ in(Z,U)
    | ~ city(U)
    | ~ hollywood(U) ),
    inference('REWRITE',[status(thm)],[clause30,31]) ).

cnf(43,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[42,clause7,37,36,35,34,clause8,33,32,clause6,39,40,41,38,clause5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NLP001-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n007.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 : Fri Jul  1 12:20:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T12:20:24
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-01T12:20:24
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.51  ||#
% 0.20/0.51  
% 0.20/0.51  ; Summary of computation:
% 0.20/0.51  ;        58 formulas have been input or derived (from 41 formulas).
% 0.20/0.51  ;        43 (74%) were retained.  Of these,
% 0.20/0.51  ;           22 (51%) were simplified or subsumed later,
% 0.20/0.51  ;           21 (49%) are still being kept.
% 0.20/0.51  ; 
% 0.20/0.51  ; Run time in seconds excluding printing time:
% 0.20/0.51  ;     0.005  14%   Read assertion file          (1 call)
% 0.20/0.51  ;     0.001   3%   Assert                       (30 calls)
% 0.20/0.51  ;     0.001   3%   Process new row              (43 calls)
% 0.20/0.51  ;     0.002   6%   Resolution                   (80 calls)
% 0.20/0.51  ;     0.000   0%   Paramodulation               (40 calls)
% 0.20/0.51  ;     0.000   0%   Factoring                    (10 calls)
% 0.20/0.51  ;     0.000   0%   Condensing                   (23 calls)
% 0.20/0.51  ;     0.000   0%   Forward subsumption          (23 calls)
% 0.20/0.51  ;     0.000   0%   Backward subsumption         (23 calls)
% 0.20/0.51  ;     0.001   3%   Forward simplification       (43 calls)
% 0.20/0.51  ;     0.001   3%   Backward simplification      (43 calls)
% 0.20/0.51  ;     0.000   0%   Ordering                     (20 calls)
% 0.20/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.51  ;     0.025  69%   Other
% 0.20/0.51  ;     0.036        Total
% 0.20/0.51  ;     0.040        Real time
% 0.20/0.51  ; 
% 0.20/0.51  ; Term-hash-array has 52 terms in all.
% 0.20/0.51  ; Feature-vector-row-index has 1 entry (22 at peak, 23 added, 22 deleted).
% 0.20/0.51  ; Feature-vector-row-index has 12 nodes (75 at peak, 86 added, 74 deleted).
% 0.20/0.51  ;  Retrieved 1 possibly forward subsuming row in 23 calls.
% 0.20/0.51  ;  Retrieved 1 possibly backward subsumed row in 23 calls.
% 0.20/0.51  ; Path-index has 41 entries (61 at peak, 85 added, 44 deleted).
% 0.20/0.51  ; Path-index has 68 nodes (81 at peak, 111 added, 43 deleted).
% 0.20/0.51  ; Trie-index has 41 entries (61 at peak, 85 added, 44 deleted).
% 0.20/0.51  ; Trie-index has 62 nodes (75 at peak, 113 added, 51 deleted).
% 0.20/0.51  ; Retrieved 0 generalization terms in 34 calls.
% 0.20/0.51  ; Retrieved 19 instance terms in 19 calls.
% 0.20/0.51  ; Retrieved 302 unifiable terms in 297 calls.
% 0.20/0.51  ; 
% 0.20/0.51  ; The agenda of rows to process has 14 entries:
% 0.20/0.51  ;    11 with value 4               3 with value 5
% 0.20/0.51  ; The agenda of rows to give has 1 entry:
% 0.20/0.51  ;     1 with value (4 2)
% 0.20/0.51  Evaluation took:
% 0.20/0.51    0.04 seconds of real time
% 0.20/0.51    0.034144 seconds of user run time
% 0.20/0.51    0.005942 seconds of system run time
% 0.20/0.51    0 calls to %EVAL
% 0.20/0.51    0 page faults and
% 0.20/0.51    3,983,400 bytes consed.
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-01T12:20:24
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  * 
%------------------------------------------------------------------------------