TSTP Solution File: PUZ039-10 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n021.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:48 EDT 2022

% Result   : Unsatisfiable 0.87s 1.03s
% Output   : Refutation 0.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;   9 RR)
%            Number of literals    :   16 (  15 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;   2 con; 0-12 aty)
%            Number of variables   :   87 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
    ifeq(X,X,Y,Z) = Y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(s2_down,axiom,
    ifeq(state(X,Y,Z,U,V,W,X1,s2(Y1,Z1),U1,V1,e1(s(Y1),Z1),W1),true,state(X,Y,Z,U,V,W,X1,s2(s(Y1),Z1),U1,V1,e1(Y1,Z1),W1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s2_down) ).

cnf(s4_right,axiom,
    ifeq(state(X,Y,Z,U,V,W,X1,Y1,Z1,s4(U1,V1),e1(U1,s(V1)),W1),true,state(X,Y,Z,U,V,W,X1,Y1,Z1,s4(U1,s(V1)),e1(U1,V1),W1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',s4_right) ).

cnf(v3_down,axiom,
    ifeq(state(X,Y,Z,v3(U,V),W,X1,Y1,Z1,U1,V1,e1(s(s(U)),V),W1),true,state(X,Y,Z,v3(s(U),V),W,X1,Y1,Z1,U1,V1,e1(U,V),W1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',v3_down) ).

cnf(v4_left,axiom,
    ifeq(state(X,Y,Z,U,v4(V,s(W)),X1,Y1,Z1,U1,V1,e1(V,W),e2(s(V),W)),true,state(X,Y,Z,U,v4(V,W),X1,Y1,Z1,U1,V1,e1(V,s(W)),e2(s(V),s(W))),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',v4_left) ).

cnf(h_left,axiom,
    ifeq(state(X,Y,Z,U,V,h(W,s(X1)),Y1,Z1,U1,V1,e1(W,X1),W1),true,state(X,Y,Z,U,V,h(W,X1),Y1,Z1,U1,V1,e1(W,s(s(X1))),W1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',h_left) ).

cnf(swap_blanks,axiom,
    ifeq(state(X,Y,Z,U,V,W,X1,Y1,Z1,U1,e1(V1,W1),e2(X2,Y2)),true,state(X,Y,Z,U,V,W,X1,Y1,Z1,U1,e1(X2,Y2),e2(V1,W1)),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',swap_blanks) ).

cnf(initial_state,hypothesis,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_state) ).

cnf(goal_state,negated_conjecture,
    state(X,Y,Z,U,v4(s(s(o)),s(s(o))),V,W,X1,Y1,Z1,U1,V1) != true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_state) ).

cnf(46,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[v3_down,initial_state,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(51,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),s(s(s(o)))),e2(s(s(o)),o)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[swap_blanks,46,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(65,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(s(o)))),s(s(o))),e2(s(s(o)),o)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[s4_right,51,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(111,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(s(o))),s(s(o))),e2(s(s(o)),o)) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[s2_down,65,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(169,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(o)),o),e2(s(s(s(o))),s(s(o)))) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[swap_blanks,111,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(263,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),o),s1(s(s(s(o))),s(o)),s2(s(s(s(s(o)))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(s(o)))),e1(s(s(o)),s(s(o))),e2(s(s(s(o))),s(s(o)))) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[h_left,169,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(477,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[v4_left,263,theory(equality)]),goal_state,ifeq_axiom,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ039-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun May 29 00:27:12 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T00:27:12
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n021.cluster.edu at 2022-05-29T00:27:12
% 0.87/1.03  
% 0.87/1.03  
% 0.87/1.03  #||
% 0.87/1.03  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.87/1.03  % SZS output start Refutation
% See solution above
% 0.87/1.04  ||#
% 0.87/1.04  
% 0.87/1.04  ; Summary of computation:
% 0.87/1.04  ;      1726 formulas have been input or derived (from 259 formulas).
% 0.87/1.04  ;       477 (28%) were retained.  Of these,
% 0.87/1.04  ;          121 (25%) were simplified or subsumed later,
% 0.87/1.04  ;          356 (75%) are still being kept.
% 0.87/1.04  ; 
% 0.87/1.04  ; Run time in seconds excluding printing time:
% 0.87/1.04  ;     0.022   4%   Read assertion file          (1 call)
% 0.87/1.04  ;     0.002   0%   Assert                       (44 calls)
% 0.87/1.04  ;     0.147  27%   Process new row              (1,725 calls)
% 0.87/1.04  ;     0.020   4%   Resolution                   (516 calls)
% 0.87/1.04  ;     0.155  28%   Paramodulation               (258 calls)
% 0.87/1.04  ;     0.106  19%   Forward simplification       (1,725 calls)
% 0.87/1.04  ;     0.035   6%   Backward simplification      (477 calls)
% 0.87/1.04  ;     0.013   2%   Ordering                     (14,590 calls)
% 0.87/1.04  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.87/1.04  ;     0.000   0%   Purity testing               (1 call)
% 0.87/1.04  ;     0.048   9%   Other
% 0.87/1.04  ;     0.548        Total
% 0.87/1.04  ;     0.559        Real time
% 0.87/1.04  ; 
% 0.87/1.04  ; Term-hash-array has 1,169 terms in all.
% 0.87/1.04  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.87/1.04  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.87/1.04  ; Path-index has 929 entries (929 at peak, 1,171 added, 242 deleted).
% 0.87/1.04  ; Path-index has 1,308 nodes (1,358 at peak, 7,358 added, 6,050 deleted).
% 0.87/1.04  ; Trie-index has 929 entries (929 at peak, 1,171 added, 242 deleted).
% 0.87/1.04  ; Trie-index has 18,228 nodes (18,353 at peak, 38,083 added, 19,855 deleted).
% 0.87/1.04  ; Retrieved 2,336 generalization terms in 4,529 calls.
% 0.87/1.04  ; Retrieved 490 instance terms in 476 calls.
% 0.87/1.04  ; Retrieved 8,310 unifiable terms in 5,075 calls.
% 0.87/1.04  ; 
% 0.87/1.04  ; The agenda of rows to process has 1 entry:
% 0.87/1.04  ;     1 with value 104
% 0.87/1.04  ; The agenda of rows to give has 97 entries:
% 0.87/1.04  ;    90 with value (4 97)          6 with value (4 98)           1 with value (4 100)
% 0.87/1.04  Evaluation took:
% 0.87/1.04    0.559 seconds of real time
% 0.87/1.04    0.51139 seconds of user run time
% 0.87/1.04    0.048086 seconds of system run time
% 0.87/1.04    [Run times include 0.024 seconds GC run time.]
% 0.87/1.04    0 calls to %EVAL
% 0.87/1.04    0 page faults and
% 0.87/1.04    37,827,016 bytes consed.
% 0.87/1.04  :PROOF-FOUND
% 0.87/1.04  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-29T00:27:13
% 0.87/1.04  :PROOF-FOUND
% 0.87/1.04  * 
%------------------------------------------------------------------------------