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

View Problem - Process Solution

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

% Computer : n028.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 18:26:49 EDT 2022

% Result   : Unsatisfiable 0.42s 0.60s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   28 (  27 unt;   0 nHn;   9 RR)
%            Number of literals    :   30 (  14 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   41 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(initial_state,axiom,
    state(nextto(on(small,on(medium,on(large,pin(n1)))),nextto(pin(n2),pin(n3)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state) ).

cnf(final_state,negated_conjecture,
    ~ state(nextto(pin(n1),nextto(pin(n2),on(small,on(medium,on(large,pin(n3))))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',final_state) ).

cnf(a_move,axiom,
    ( nextto(on(X,Y),Z) = nextto(Y,on(X,Z))
    | ~ fits(X,Z)
    | ~ fits(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_move) ).

cnf(fits_1,axiom,
    fits(small,pin(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_1) ).

cnf(fits_2,axiom,
    fits(medium,pin(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_2) ).

cnf(fits_3,axiom,
    fits(large,pin(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_3) ).

cnf(fits_4,axiom,
    fits(small,on(medium,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_4) ).

cnf(fits_5,axiom,
    fits(medium,on(large,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_5) ).

cnf(fits_6,axiom,
    fits(small,on(large,X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fits_6) ).

cnf(10,plain,
    nextto(on(small,pin(X)),pin(Y)) = nextto(pin(X),on(small,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_1,fits_1]) ).

cnf(12,plain,
    nextto(on(medium,pin(X)),pin(Y)) = nextto(pin(X),on(medium,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_2,fits_2]) ).

cnf(13,plain,
    nextto(on(medium,pin(X)),nextto(pin(Y),Z)) = nextto(pin(X),nextto(on(medium,pin(Y)),Z)),
    inference('EMBED',[status(thm)],[12]) ).

cnf(14,plain,
    nextto(on(large,pin(X)),pin(Y)) = nextto(pin(X),on(large,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_3,fits_3]) ).

cnf(15,plain,
    nextto(on(large,pin(X)),nextto(pin(Y),Z)) = nextto(pin(X),nextto(on(large,pin(Y)),Z)),
    inference('EMBED',[status(thm)],[14]) ).

cnf(16,plain,
    nextto(on(small,on(medium,X)),pin(Y)) = nextto(on(medium,X),on(small,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_1,fits_4]) ).

cnf(17,plain,
    nextto(on(small,on(medium,X)),nextto(pin(Y),Z)) = nextto(on(medium,X),nextto(on(small,pin(Y)),Z)),
    inference('EMBED',[status(thm)],[16]) ).

cnf(18,plain,
    ~ state(nextto(on(medium,on(large,pin(n3))),nextto(pin(n2),on(small,pin(n1))))),
    inference('REWRITE',[status(thm)],[final_state,10,16,theory(equality)]) ).

cnf(19,plain,
    state(nextto(on(medium,on(large,pin(n1))),nextto(pin(n3),on(small,pin(n2))))),
    inference('REWRITE',[status(thm)],[initial_state,10,16,theory(equality)]) ).

cnf(20,plain,
    nextto(on(small,on(large,X)),pin(Y)) = nextto(on(large,X),on(small,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_1,fits_6]) ).

cnf(21,plain,
    nextto(on(small,on(large,X)),nextto(pin(Y),Z)) = nextto(on(large,X),nextto(on(small,pin(Y)),Z)),
    inference('EMBED',[status(thm)],[20]) ).

cnf(22,plain,
    nextto(on(medium,on(large,X)),pin(Y)) = nextto(on(large,X),on(medium,pin(Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_2,fits_5]) ).

cnf(24,plain,
    state(nextto(on(small,pin(n2)),nextto(on(large,pin(n1)),on(medium,pin(n3))))),
    inference('REWRITE',[status(thm)],[19,22,theory(equality)]) ).

cnf(25,plain,
    ~ state(nextto(on(small,pin(n1)),nextto(on(large,pin(n3)),on(medium,pin(n2))))),
    inference('REWRITE',[status(thm)],[18,22,theory(equality)]) ).

cnf(28,plain,
    nextto(on(small,on(large,X)),on(medium,Y)) = nextto(on(large,X),on(small,on(medium,Y))),
    inference('HYPERRESOLVE',[status(thm)],[a_move,fits_4,fits_6]) ).

cnf(76,plain,
    nextto(on(medium,X),nextto(on(small,pin(Y)),on(large,pin(Z)))) = nextto(pin(Z),nextto(on(large,pin(Y)),on(small,on(medium,X)))),
    inference('PARAMODULATE',[status(thm)],[15,17,theory(equality)]) ).

cnf(92,plain,
    ~ state(nextto(on(medium,pin(n2)),nextto(on(small,pin(n3)),on(large,pin(n1))))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,21,theory(equality)]),76,28,theory(equality)]) ).

cnf(105,plain,
    nextto(on(large,X),nextto(on(small,pin(Y)),on(medium,pin(Z)))) = nextto(pin(Z),nextto(on(medium,pin(Y)),on(small,on(large,X)))),
    inference('PARAMODULATE',[status(thm)],[13,21,theory(equality)]) ).

cnf(129,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,21,theory(equality)]),24,105,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PUZ056-1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n028.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 : Sun May 29 03:42:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.45  * 
% 0.19/0.45  #<PACKAGE "SNARK-USER">
% 0.19/0.45  * 
% 0.19/0.45  SNARK-TPTP-OPTIONS
% 0.19/0.45  * 
% 0.19/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.45   (USE-FACTORING :POS)
% 0.19/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.45  * 
% 0.19/0.45  "."
% 0.19/0.45  * 
% 0.19/0.45  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T03:42:03
% 0.19/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-05-29T03:42:03
% 0.19/0.47  
% 0.19/0.47  ; Recognized commutativity assertion (= (|nextto| ?X ?Y) (|nextto| ?Y ?X)).
% 0.19/0.47  ; Recognized associativity assertion (= (|nextto| ?X (|nextto| ?Y ?Z)) (|nextto| (|nextto| ?X ?Y) ?Z)).
% 0.19/0.47  ; Declaring nextto to be commutative.
% 0.42/0.60  ; Declaring nextto to be associative-commutative.
% 0.42/0.60  
% 0.42/0.60  #||
% 0.42/0.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.60  % SZS output start Refutation
% See solution above
% 0.42/0.60  ||#
% 0.42/0.60  
% 0.42/0.60  ; Summary of computation:
% 0.42/0.60  ;       248 formulas have been input or derived (from 23 formulas).
% 0.42/0.60  ;       129 (52%) were retained.  Of these,
% 0.42/0.60  ;            4 ( 3%) were simplified or subsumed later,
% 0.42/0.60  ;          125 (97%) are still being kept.
% 0.42/0.60  ; 
% 0.42/0.60  ; Run time in seconds excluding printing time:
% 0.42/0.60  ;     0.002   1%   Read assertion file          (1 call)
% 0.42/0.60  ;     0.000   0%   Assert                       (11 calls)
% 0.42/0.60  ;     0.018  12%   Process new row              (245 calls)
% 0.42/0.60  ;     0.001   1%   Resolution                   (44 calls)
% 0.42/0.60  ;     0.011   8%   Paramodulation               (22 calls)
% 0.42/0.60  ;     0.000   0%   Embedding                    (57 calls)
% 0.42/0.60  ;     0.000   0%   Condensing                   (1 call)
% 0.42/0.60  ;     0.001   1%   Forward subsumption          (1 call)
% 0.42/0.60  ;     0.000   0%   Backward subsumption         (1 call)
% 0.42/0.60  ;     0.031  21%   Forward simplification       (188 calls)
% 0.42/0.60  ;     0.014  10%   Backward simplification      (72 calls)
% 0.42/0.60  ;     0.003   2%   Ordering                     (1,344 calls)
% 0.42/0.60  ;     0.038  26%   Ordering ac                  (1,274 calls)
% 0.42/0.60  ;     0.001   1%   Sortal reasoning             (32 calls)
% 0.42/0.60  ;     0.000   0%   Purity testing               (1 call)
% 0.42/0.60  ;     0.025  17%   Other
% 0.42/0.60  ;     0.145        Total
% 0.42/0.60  ;     0.147        Real time
% 0.42/0.60  ; 
% 0.42/0.60  ; Term-hash-array has 407 terms in all.
% 0.42/0.60  ; Feature-vector-row-index has 1 entry (1 at peak, 1 added, 0 deleted).
% 0.42/0.60  ; Feature-vector-row-index has 8 nodes (8 at peak, 8 added, 0 deleted).
% 0.42/0.60  ;  Retrieved 0 possibly forward subsuming rows in 1 call.
% 0.42/0.60  ;  Retrieved 0 possibly backward subsumed rows in 1 call.
% 0.42/0.60  ; Path-index has 401 entries (401 at peak, 433 added, 32 deleted).
% 0.42/0.60  ; Path-index has 126 nodes (130 at peak, 180 added, 54 deleted).
% 0.42/0.60  ; Trie-index has 401 entries (401 at peak, 433 added, 32 deleted).
% 0.42/0.60  ; Trie-index has 71 nodes (71 at peak, 106 added, 35 deleted).
% 0.42/0.60  ; Retrieved 6,475 generalization terms in 299 calls.
% 0.42/0.60  ; Retrieved 1,148 instance terms in 153 calls.
% 0.42/0.60  ; Retrieved 1,855 unifiable terms in 205 calls.
% 0.42/0.60  ; 
% 0.42/0.60  ; The agenda of rows to process has 1 entry:
% 0.42/0.60  ;     1 with value 23
% 0.42/0.60  ; The agenda of rows to give has 104 entries:
% 0.42/0.60  ;     2 with value (4 22)         18 with value (4 31)          12 with value (4 37)
% 0.42/0.60  ;     8 with value (4 24)          4 with value (4 32)          12 with value (4 39)
% 0.42/0.60  ;     6 with value (4 27)         16 with value (4 33)          12 with value (4 41)
% 0.42/0.60  ;     8 with value (4 29)          6 with value (4 35)
% 0.42/0.60  Evaluation took:
% 0.42/0.60    0.148 seconds of real time
% 0.42/0.60    0.12984 seconds of user run time
% 0.42/0.60    0.017942 seconds of system run time
% 0.42/0.60    0 calls to %EVAL
% 0.42/0.60    0 page faults and
% 0.42/0.60    9,480,040 bytes consed.
% 0.42/0.60  :PROOF-FOUND
% 0.42/0.60  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T03:42:03
% 0.42/0.60  :PROOF-FOUND
% 0.42/0.60  * 
%------------------------------------------------------------------------------