TSTP Solution File: PLA031-1.001 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n017.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 17:32:06 EDT 2022

% Result   : Unsatisfiable 0.85s 1.05s
% Output   : Refutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   21
% Syntax   : Number of clauses     :   34 (  24 unt;   0 nHn;  34 RR)
%            Number of literals    :   50 (   0 equ;  23 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-6 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   56 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(load7,axiom,
    ( ~ s(X,Y,Z,U,V,Y)
    | s(X,truck2,Z,U,V,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',load7) ).

cnf(load8,axiom,
    ( s(X,Y,Z,U,V,Y)
    | ~ s(X,truck2,Z,U,V,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',load8) ).

cnf(board1,axiom,
    ( ~ s(X,Y,Z,U,Z,V)
    | ~ neq(U,truck1)
    | s(X,Y,truck1,U,Z,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',board1) ).

cnf(board2,axiom,
    ( s(X,Y,Z,U,Z,V)
    | ~ s(X,Y,truck1,U,Z,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',board2) ).

cnf(board3,axiom,
    ( ~ s(X,Y,Z,U,V,Z)
    | ~ neq(U,truck2)
    | s(X,Y,truck2,U,V,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',board3) ).

cnf(board4,axiom,
    ( s(X,Y,Z,U,V,Z)
    | ~ s(X,Y,truck2,U,V,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',board4) ).

cnf(drive1,axiom,
    ( ~ s(X,Y,truck1,Z,U,V)
    | ~ link(U,W)
    | s(X,Y,truck1,Z,W,V) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive1) ).

cnf(drive2,axiom,
    ( ~ s(X,Y,truck2,Z,U,V)
    | ~ link(V,W)
    | s(X,Y,truck2,Z,U,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive2) ).

cnf(walk1,axiom,
    ( ~ s(X,Y,Z,U,V,W)
    | ~ path(Z,X1)
    | s(X,Y,X1,U,V,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk1) ).

cnf(walk2,axiom,
    ( ~ s(X,Y,Z,U,V,W)
    | ~ path(U,X1)
    | s(X,Y,Z,X1,V,W) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk2) ).

cnf(neq25,axiom,
    neq(s1,truck1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',neq25) ).

cnf(neq26,axiom,
    neq(s1,truck2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',neq26) ).

cnf(map6,axiom,
    path(p2_0,s2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map6) ).

cnf(map7,axiom,
    path(s0,p2_0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map7) ).

cnf(map10,axiom,
    path(p2_1,s2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map10) ).

cnf(map11,axiom,
    path(s1,p2_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map11) ).

cnf(map14,axiom,
    link(s1,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map14) ).

cnf(map15,axiom,
    link(s0,s2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map15) ).

cnf(map18,axiom,
    link(s2,s1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',map18) ).

cnf(init,axiom,
    s(s2,s2,s0,s1,s0,s2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',init) ).

cnf(goal,negated_conjecture,
    ~ s(s2,s1,s2,s2,s2,s0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(109,plain,
    s(s2,truck2,s0,s1,s0,s2),
    inference('HYPERRESOLVE',[status(thm)],[load7,init]) ).

cnf(115,plain,
    ~ s(s2,s1,p2_0,s2,s2,s0),
    inference('UR-RESOLVE',[status(thm)],[walk1,map6,goal]) ).

cnf(133,plain,
    s(s2,truck2,truck1,s1,s0,s2),
    inference('HYPERRESOLVE',[status(thm)],[board1,109,neq25]) ).

cnf(157,plain,
    ~ s(s2,s1,s0,s2,s2,s0),
    inference('UR-RESOLVE',[status(thm)],[walk1,115,map7]) ).

cnf(202,plain,
    s(s2,truck2,truck1,s1,s2,s2),
    inference('HYPERRESOLVE',[status(thm)],[drive1,133,map15]) ).

cnf(253,plain,
    ~ s(s2,s1,truck2,s2,s2,s0),
    inference('UR-RESOLVE',[status(thm)],[board4,157]) ).

cnf(342,plain,
    s(s2,truck2,s2,s1,s2,s2),
    inference('HYPERRESOLVE',[status(thm)],[board2,202]) ).

cnf(444,plain,
    ~ s(s2,s1,truck2,s2,s2,s1),
    inference('UR-RESOLVE',[status(thm)],[drive2,253,map14]) ).

cnf(621,plain,
    s(s2,truck2,truck2,s1,s2,s2),
    inference('HYPERRESOLVE',[status(thm)],[board3,342,neq26]) ).

cnf(815,plain,
    ~ s(s2,s1,truck2,p2_1,s2,s1),
    inference('UR-RESOLVE',[status(thm)],[walk2,444,map10]) ).

cnf(1157,plain,
    s(s2,truck2,truck2,s1,s2,s1),
    inference('HYPERRESOLVE',[status(thm)],[drive2,621,map18]) ).

cnf(1498,plain,
    ~ s(s2,s1,truck2,s1,s2,s1),
    inference('UR-RESOLVE',[status(thm)],[walk2,815,map11]) ).

cnf(2127,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[load8,1157]),1498]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PLA031-1.001 : TPTP v8.1.0. Released v3.5.0.
% 0.13/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n017.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 : Tue May 31 22:40:11 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.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 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-05-31T22:40:11
% 0.20/0.49  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-05-31T22:40:11
% 0.85/1.05  
% 0.85/1.05  
% 0.85/1.05  #||
% 0.85/1.05  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.85/1.05  % SZS output start Refutation
% See solution above
% 0.85/1.06  ||#
% 0.85/1.06  
% 0.85/1.06  ; Summary of computation:
% 0.85/1.06  ;     10974 formulas have been input or derived (from 1158 formulas).
% 0.85/1.06  ;      2127 (19%) were retained.  Of these,
% 0.85/1.06  ;         2127 (100%) are still being kept.
% 0.85/1.06  ; 
% 0.85/1.06  ; Run time in seconds excluding printing time:
% 0.85/1.06  ;     0.011   2%   Read assertion file          (1 call)
% 0.85/1.06  ;     0.001   0%   Assert                       (106 calls)
% 0.85/1.06  ;     0.122  21%   Process new row              (10,959 calls)
% 0.85/1.06  ;     0.302  53%   Resolution                   (2,314 calls)
% 0.85/1.06  ;     0.009   2%   Paramodulation               (1,157 calls)
% 0.85/1.06  ;     0.000   0%   Condensing                   (22 calls)
% 0.85/1.06  ;     0.000   0%   Forward subsumption          (22 calls)
% 0.85/1.06  ;     0.001   0%   Backward subsumption         (22 calls)
% 0.85/1.06  ;     0.000   0%   Clause clause subsumption    (86 calls)
% 0.85/1.06  ;     0.054   9%   Forward simplification       (10,959 calls)
% 0.85/1.06  ;     0.007   1%   Backward simplification      (2,127 calls)
% 0.85/1.06  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.85/1.06  ;     0.000   0%   Purity testing               (1 call)
% 0.85/1.06  ;     0.062  11%   Other
% 0.85/1.06  ;     0.569        Total
% 0.85/1.06  ;     0.571        Real time
% 0.85/1.06  ; 
% 0.85/1.06  ; Term-hash-array has 2,138 terms in all.
% 0.85/1.06  ; Feature-vector-row-index has 22 entries (22 at peak, 22 added, 0 deleted).
% 0.85/1.06  ; Feature-vector-row-index has 24 nodes (24 at peak, 24 added, 0 deleted).
% 0.85/1.06  ;  Retrieved 61 possibly forward subsuming rows in 22 calls.
% 0.85/1.06  ;  Retrieved 25 possibly backward subsumed rows in 22 calls.
% 0.85/1.06  ; Path-index has 2,146 entries (2,146 at peak, 2,146 added, 0 deleted).
% 0.85/1.06  ; Path-index has 102 nodes (102 at peak, 102 added, 0 deleted).
% 0.85/1.06  ; Trie-index has 2,146 entries (2,146 at peak, 2,146 added, 0 deleted).
% 0.85/1.06  ; Trie-index has 4,803 nodes (4,803 at peak, 4,803 added, 0 deleted).
% 0.85/1.06  ; Retrieved 8,833 generalization terms in 10,933 calls.
% 0.85/1.06  ; Retrieved 2,104 instance terms in 2,104 calls.
% 0.85/1.06  ; Retrieved 145,516 unifiable terms in 21,028 calls.
% 0.85/1.06  ; 
% 0.85/1.06  ; The agenda of rows to process has 12 entries:
% 0.85/1.06  ;    12 with value 15
% 0.85/1.06  ; The agenda of rows to give has 969 entries:
% 0.85/1.06  ;     1 with value (4 11)        388 with value (4 14)         580 with value (4 15)
% 0.85/1.06  Evaluation took:
% 0.85/1.06    0.572 seconds of real time
% 0.85/1.06    0.519935 seconds of user run time
% 0.85/1.06    0.051686 seconds of system run time
% 0.85/1.06    [Run times include 0.021 seconds GC run time.]
% 0.85/1.06    0 calls to %EVAL
% 0.85/1.06    0 page faults and
% 0.85/1.06    30,635,752 bytes consed.
% 0.85/1.06  :PROOF-FOUND
% 0.85/1.06  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T22:40:12
% 0.85/1.06  :PROOF-FOUND
% 0.85/1.06  * 
%------------------------------------------------------------------------------