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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n006.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:21:08 EDT 2022

% Result   : Unsatisfiable 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   36
% Syntax   : Number of clauses     :   55 (  20 unt;  16 nHn;  55 RR)
%            Number of literals    :  137 (   0 equ;  68 neg)
%            Maximal clause size   :   18 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   19 (  18 usr;   2 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;  10 con; 0-0 aty)
%            Number of variables   :   15 (   0 sgn)

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

cnf(clause2,negated_conjecture,
    actual_world(skc10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(clause3,negated_conjecture,
    ( ssSkC0
    | city(skc15,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ( ssSkC0
    | chevy(skc15,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(clause5,negated_conjecture,
    ( ssSkC0
    | white(skc15,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause6,negated_conjecture,
    ( ssSkC0
    | dirty(skc15,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause7,negated_conjecture,
    ( ssSkC0
    | old(skc15,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause7) ).

cnf(clause8,negated_conjecture,
    ( ssSkC0
    | placename(skc15,skc19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

cnf(clause9,negated_conjecture,
    ( ssSkC0
    | hollywood_placename(skc15,skc19) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).

cnf(clause10,negated_conjecture,
    ( ssSkC0
    | event(skc15,skc16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).

cnf(clause11,negated_conjecture,
    ( ssSkC0
    | present(skc15,skc16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).

cnf(clause12,negated_conjecture,
    ( ssSkC0
    | barrel(skc15,skc16) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause12) ).

cnf(clause13,negated_conjecture,
    ( ssSkC0
    | lonely(skc15,skc17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause13) ).

cnf(clause14,negated_conjecture,
    ( ssSkC0
    | street(skc15,skc17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause14) ).

cnf(clause15,negated_conjecture,
    ( ~ ssSkC0
    | event(skc10,skc11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause15) ).

cnf(clause16,negated_conjecture,
    ( ~ ssSkC0
    | present(skc10,skc11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause16) ).

cnf(clause17,negated_conjecture,
    ( ~ ssSkC0
    | barrel(skc10,skc11) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause17) ).

cnf(clause18,negated_conjecture,
    ( ~ ssSkC0
    | lonely(skc10,skc14) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause18) ).

cnf(clause19,negated_conjecture,
    ( ~ ssSkC0
    | street(skc10,skc14) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause19) ).

cnf(clause20,negated_conjecture,
    ( ~ ssSkC0
    | old(skc10,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause20) ).

cnf(clause21,negated_conjecture,
    ( ~ ssSkC0
    | dirty(skc10,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause21) ).

cnf(clause22,negated_conjecture,
    ( ~ ssSkC0
    | white(skc10,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause22) ).

cnf(clause23,negated_conjecture,
    ( ~ ssSkC0
    | chevy(skc10,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause23) ).

cnf(clause24,negated_conjecture,
    ( ~ ssSkC0
    | city(skc10,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause24) ).

cnf(clause25,negated_conjecture,
    ( ~ ssSkC0
    | hollywood_placename(skc10,skc13) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause25) ).

cnf(clause26,negated_conjecture,
    ( ~ ssSkC0
    | placename(skc10,skc13) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause26) ).

cnf(clause27,negated_conjecture,
    ( ssSkC0
    | agent(skc15,skc16,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause27) ).

cnf(clause28,negated_conjecture,
    ( ssSkC0
    | in(skc15,skc16,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause28) ).

cnf(clause29,negated_conjecture,
    ( ssSkC0
    | of(skc15,skc19,skc18) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause29) ).

cnf(clause30,negated_conjecture,
    ( ssSkC0
    | down(skc15,skc16,skc17) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause30) ).

cnf(clause31,negated_conjecture,
    ( ~ ssSkC0
    | down(skc10,skc11,skc14) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause31) ).

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

cnf(clause33,negated_conjecture,
    ( ~ ssSkC0
    | agent(skc10,skc11,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause33) ).

cnf(clause34,negated_conjecture,
    ( ~ ssSkC0
    | of(skc10,skc13,skc12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause34) ).

cnf(clause35,negated_conjecture,
    ( ~ event(X,Y)
    | ~ present(X,Y)
    | ~ barrel(X,Y)
    | ~ down(X,Y,Z)
    | ~ lonely(X,Z)
    | ~ street(X,Z)
    | ~ in(X,Y,U)
    | ~ agent(X,Y,U)
    | ~ old(X,U)
    | ~ dirty(X,U)
    | ~ white(X,U)
    | ~ chevy(X,U)
    | ~ city(X,U)
    | ~ of(X,V,U)
    | ~ hollywood_placename(X,V)
    | ~ placename(X,V)
    | ~ actual_world(X)
    | ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause35) ).

cnf(clause36,negated_conjecture,
    ( ~ city(X,Y)
    | ~ chevy(X,Y)
    | ~ white(X,Y)
    | ~ dirty(X,Y)
    | ~ old(X,Y)
    | ~ agent(X,Z,Y)
    | ~ in(X,Z,Y)
    | ~ placename(X,U)
    | ~ hollywood_placename(X,U)
    | ~ of(X,U,Y)
    | ~ event(X,Z)
    | ~ present(X,Z)
    | ~ barrel(X,Z)
    | ~ down(X,Z,V)
    | ~ lonely(X,V)
    | ~ street(X,V)
    | ~ actual_world(X)
    | ~ ssSkC0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause36) ).

cnf(37,plain,
    ssSkC0,
    inference('HYPERRESOLVE',[status(thm)],[clause35,clause10,clause11,clause12,clause30,clause13,clause14,clause28,clause27,clause7,clause6,clause5,clause4,clause3,clause29,clause9,clause8,clause1]) ).

cnf(38,plain,
    event(skc10,skc11),
    inference('REWRITE',[status(thm)],[clause15,37]) ).

cnf(39,plain,
    present(skc10,skc11),
    inference('REWRITE',[status(thm)],[clause16,37]) ).

cnf(40,plain,
    barrel(skc10,skc11),
    inference('REWRITE',[status(thm)],[clause17,37]) ).

cnf(41,plain,
    lonely(skc10,skc14),
    inference('REWRITE',[status(thm)],[clause18,37]) ).

cnf(42,plain,
    street(skc10,skc14),
    inference('REWRITE',[status(thm)],[clause19,37]) ).

cnf(43,plain,
    old(skc10,skc12),
    inference('REWRITE',[status(thm)],[clause20,37]) ).

cnf(44,plain,
    dirty(skc10,skc12),
    inference('REWRITE',[status(thm)],[clause21,37]) ).

cnf(45,plain,
    white(skc10,skc12),
    inference('REWRITE',[status(thm)],[clause22,37]) ).

cnf(46,plain,
    chevy(skc10,skc12),
    inference('REWRITE',[status(thm)],[clause23,37]) ).

cnf(47,plain,
    city(skc10,skc12),
    inference('REWRITE',[status(thm)],[clause24,37]) ).

cnf(48,plain,
    hollywood_placename(skc10,skc13),
    inference('REWRITE',[status(thm)],[clause25,37]) ).

cnf(49,plain,
    placename(skc10,skc13),
    inference('REWRITE',[status(thm)],[clause26,37]) ).

cnf(50,plain,
    down(skc10,skc11,skc14),
    inference('REWRITE',[status(thm)],[clause31,37]) ).

cnf(51,plain,
    in(skc10,skc11,skc12),
    inference('REWRITE',[status(thm)],[clause32,37]) ).

cnf(52,plain,
    agent(skc10,skc11,skc12),
    inference('REWRITE',[status(thm)],[clause33,37]) ).

cnf(53,plain,
    of(skc10,skc13,skc12),
    inference('REWRITE',[status(thm)],[clause34,37]) ).

cnf(54,plain,
    ( ~ city(X,Y)
    | ~ chevy(X,Y)
    | ~ white(X,Y)
    | ~ dirty(X,Y)
    | ~ old(X,Y)
    | ~ agent(X,Z,Y)
    | ~ in(X,Z,Y)
    | ~ placename(X,U)
    | ~ hollywood_placename(X,U)
    | ~ of(X,U,Y)
    | ~ event(X,Z)
    | ~ present(X,Z)
    | ~ barrel(X,Z)
    | ~ down(X,Z,V)
    | ~ lonely(X,V)
    | ~ street(X,V)
    | ~ actual_world(X) ),
    inference('REWRITE',[status(thm)],[clause36,37]) ).

cnf(55,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[54,47,46,45,44,43,52,51,49,48,53,38,39,40,50,41,42,clause2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NLP122-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 30 21:06:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 0.18/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46   (USE-FACTORING :POS)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46  * 
% 0.18/0.46  "."
% 0.18/0.46  * 
% 0.18/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T21:06:38
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n006.cluster.edu at 2022-06-30T21:06:38
% 0.18/0.50  
% 0.18/0.50  
% 0.18/0.50  #||
% 0.18/0.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.50  % SZS output start Refutation
% See solution above
% 0.18/0.50  ||#
% 0.18/0.50  
% 0.18/0.50  ; Summary of computation:
% 0.18/0.50  ;        73 formulas have been input or derived (from 53 formulas).
% 0.18/0.50  ;        55 (75%) were retained.  Of these,
% 0.18/0.50  ;           34 (62%) were simplified or subsumed later,
% 0.18/0.50  ;           21 (38%) are still being kept.
% 0.18/0.50  ; 
% 0.18/0.50  ; Run time in seconds excluding printing time:
% 0.18/0.50  ;     0.005  12%   Read assertion file          (1 call)
% 0.18/0.50  ;     0.002   5%   Assert                       (36 calls)
% 0.18/0.50  ;     0.001   2%   Process new row              (55 calls)
% 0.18/0.50  ;     0.001   2%   Resolution                   (104 calls)
% 0.18/0.50  ;     0.001   2%   Paramodulation               (52 calls)
% 0.18/0.50  ;     0.000   0%   Factoring                    (16 calls)
% 0.18/0.50  ;     0.000   0%   Condensing                   (35 calls)
% 0.18/0.50  ;     0.000   0%   Forward subsumption          (35 calls)
% 0.18/0.50  ;     0.000   0%   Backward subsumption         (35 calls)
% 0.18/0.50  ;     0.003   8%   Forward simplification       (55 calls)
% 0.18/0.50  ;     0.002   5%   Backward simplification      (55 calls)
% 0.18/0.50  ;     0.000   0%   Ordering                     (32 calls)
% 0.18/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.18/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.18/0.50  ;     0.025  62%   Other
% 0.18/0.50  ;     0.040        Total
% 0.18/0.50  ;     0.045        Real time
% 0.18/0.50  ; 
% 0.18/0.50  ; Term-hash-array has 67 terms in all.
% 0.18/0.50  ; Feature-vector-row-index has 1 entry (34 at peak, 35 added, 34 deleted).
% 0.18/0.50  ; Feature-vector-row-index has 15 nodes (135 at peak, 149 added, 134 deleted).
% 0.18/0.50  ;  Retrieved 0 possibly forward subsuming rows in 35 calls.
% 0.18/0.50  ;  Retrieved 0 possibly backward subsumed rows in 35 calls.
% 0.18/0.50  ; Path-index has 42 entries (78 at peak, 115 added, 73 deleted).
% 0.18/0.50  ; Path-index has 136 nodes (176 at peak, 253 added, 117 deleted).
% 0.18/0.50  ; Trie-index has 42 entries (78 at peak, 115 added, 73 deleted).
% 0.18/0.50  ; Trie-index has 100 nodes (140 at peak, 233 added, 133 deleted).
% 0.18/0.50  ; Retrieved 0 generalization terms in 20 calls.
% 0.18/0.50  ; Retrieved 19 instance terms in 19 calls.
% 0.18/0.50  ; Retrieved 390 unifiable terms in 413 calls.
% 0.18/0.50  ; 
% 0.18/0.50  ; The agenda of rows to process has 17 entries:
% 0.18/0.50  ;     1 with value 4              12 with value 5                4 with value 6
% 0.18/0.50  ; The agenda of rows to give has 1 entry:
% 0.18/0.50  ;     1 with value (4 2)
% 0.18/0.50  Evaluation took:
% 0.18/0.50    0.045 seconds of real time
% 0.18/0.50    0.043176 seconds of user run time
% 0.18/0.50    0.002046 seconds of system run time
% 0.18/0.50    0 calls to %EVAL
% 0.18/0.50    0 page faults and
% 0.18/0.50    5,302,824 bytes consed.
% 0.18/0.50  :PROOF-FOUND
% 0.18/0.50  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-30T21:06:38
% 0.18/0.50  :PROOF-FOUND
% 0.18/0.50  * 
%------------------------------------------------------------------------------