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

View Problem - Process Solution

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

% Computer : n020.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 : Thu Jul 21 11:59:20 EDT 2022

% Result   : Unsatisfiable 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   29 (   8 unt;  13 nHn;  11 RR)
%            Number of literals    :   57 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   28 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
    ( ~ f(y(X))
    | g(y(X))
    | ~ f(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause1) ).

cnf(clause2,negated_conjecture,
    ( f(y(X))
    | f(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause2) ).

cnf(clause3,negated_conjecture,
    ( ~ g(y(X))
    | f(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ( ~ f(y(X))
    | h(y(X))
    | ~ g(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause4) ).

cnf(clause5,negated_conjecture,
    ( f(y(X))
    | g(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause5) ).

cnf(clause6,negated_conjecture,
    ( ~ h(y(X))
    | g(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause6) ).

cnf(clause9,negated_conjecture,
    ( ~ f(y(X))
    | g(y(X))
    | h(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause9) ).

cnf(clause10,negated_conjecture,
    ( ~ h(y(X))
    | h(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause10) ).

cnf(clause11,negated_conjecture,
    ( ~ f(z(X))
    | ~ g(z(X))
    | ~ h(z(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause11) ).

cnf(12,plain,
    ( f(y(y(X)))
    | f(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause3,clause5]) ).

cnf(13,plain,
    ( f(X)
    | g(y(X))
    | h(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause9,clause2]) ).

cnf(14,plain,
    ( f(X)
    | g(y(y(X))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause1,12,clause2]) ).

cnf(15,plain,
    ( f(y(X))
    | g(y(y(X)))
    | h(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause10,13]) ).

cnf(17,plain,
    ( f(y(y(X)))
    | g(y(y(y(X))))
    | g(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause6,15]) ).

cnf(20,plain,
    ( f(y(y(X)))
    | g(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause3,17]) ).

cnf(21,plain,
    ( f(y(y(y(X))))
    | f(X) ),
    inference('HYPERRESOLVE',[status(thm)],[clause3,20]) ).

cnf(22,plain,
    ( f(X)
    | h(y(y(y(X)))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause4,21,14]) ).

cnf(24,plain,
    ( f(X)
    | h(y(y(X))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause10,22]) ).

cnf(29,plain,
    ( f(X)
    | g(y(X)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause6,24]) ).

cnf(33,plain,
    f(X),
    inference('HYPERRESOLVE',[status(thm)],[clause3,29]) ).

cnf(34,plain,
    ( h(y(X))
    | ~ g(X) ),
    inference('REWRITE',[status(thm)],[clause4,33]) ).

cnf(36,plain,
    ( ~ g(z(X))
    | ~ h(z(X)) ),
    inference('REWRITE',[status(thm)],[clause11,33]) ).

cnf(37,plain,
    g(y(X)),
    inference('REWRITE',[status(thm)],[clause1,33]) ).

cnf(39,plain,
    h(y(y(X))),
    inference('HYPERRESOLVE',[status(thm)],[34,37]) ).

cnf(40,plain,
    h(y(X)),
    inference('HYPERRESOLVE',[status(thm)],[clause10,39]) ).

cnf(41,plain,
    g(X),
    inference('REWRITE',[status(thm)],[clause6,40]) ).

cnf(42,plain,
    ~ h(z(X)),
    inference('REWRITE',[status(thm)],[36,41]) ).

cnf(43,plain,
    h(X),
    inference('REWRITE',[status(thm)],[clause10,40]) ).

cnf(44,plain,
    $false,
    inference('REWRITE',[status(thm)],[42,43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN328-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n020.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 : Mon Jul 11 23:43:12 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-11T23:43:12
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-11T23:43:12
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  #||
% 0.20/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox/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  ;       117 formulas have been input or derived (from 31 formulas).
% 0.20/0.51  ;        44 (38%) were retained.  Of these,
% 0.20/0.51  ;           40 (91%) were simplified or subsumed later,
% 0.20/0.51  ;            4 ( 9%) are still being kept.
% 0.20/0.51  ; 
% 0.20/0.51  ; Run time in seconds excluding printing time:
% 0.20/0.51  ;     0.002   5%   Read assertion file          (1 call)
% 0.20/0.51  ;     0.001   2%   Assert                       (11 calls)
% 0.20/0.51  ;     0.004  10%   Process new row              (111 calls)
% 0.20/0.51  ;     0.005  12%   Resolution                   (60 calls)
% 0.20/0.51  ;     0.000   0%   Paramodulation               (30 calls)
% 0.20/0.51  ;     0.001   2%   Factoring                    (16 calls)
% 0.20/0.51  ;     0.001   2%   Condensing                   (90 calls)
% 0.20/0.51  ;     0.000   0%   Forward subsumption          (90 calls)
% 0.20/0.51  ;     0.001   2%   Backward subsumption         (36 calls)
% 0.20/0.51  ;     0.000   0%   Clause clause subsumption    (213 calls)
% 0.20/0.51  ;     0.002   5%   Forward simplification       (98 calls)
% 0.20/0.51  ;     0.000   0%   Backward simplification      (44 calls)
% 0.20/0.51  ;     0.000   0%   Ordering                     (57 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.023  58%   Other
% 0.20/0.51  ;     0.040        Total
% 0.20/0.51  ;     0.042        Real time
% 0.20/0.51  ; 
% 0.20/0.51  ; Term-hash-array has 27 terms in all.
% 0.20/0.51  ; Feature-vector-row-index has 0 entries (27 at peak, 36 added, 36 deleted).
% 0.20/0.51  ; Feature-vector-row-index has 1 node (83 at peak, 93 added, 92 deleted).
% 0.20/0.51  ;  Retrieved 328 possibly forward subsuming rows in 90 calls.
% 0.20/0.51  ;  Retrieved 53 possibly backward subsumed rows in 36 calls.
% 0.20/0.51  ; Path-index has 3 entries (27 at peak, 36 added, 33 deleted).
% 0.20/0.51  ; Path-index has 31 nodes (55 at peak, 64 added, 33 deleted).
% 0.20/0.51  ; Trie-index has 3 entries (27 at peak, 36 added, 33 deleted).
% 0.20/0.51  ; Trie-index has 7 nodes (55 at peak, 71 added, 64 deleted).
% 0.20/0.51  ; Retrieved 1 generalization term in 5 calls.
% 0.20/0.51  ; Retrieved 15 instance terms in 7 calls.
% 0.20/0.51  ; Retrieved 312 unifiable terms in 155 calls.
% 0.20/0.51  ; 
% 0.20/0.51  ; The agenda of rows to process has 4 entries:
% 0.20/0.51  ;     3 with value 7               1 with value 11
% 0.20/0.51  ; The agenda of input rows to give has 2 entries:
% 0.20/0.51  ;     2 with value 3
% 0.20/0.51  ; The agenda of rows to give has 1 entry:
% 0.20/0.51  ;     1 with value (4 12)
% 0.20/0.51  Evaluation took:
% 0.20/0.51    0.043 seconds of real time
% 0.20/0.51    0.034607 seconds of user run time
% 0.20/0.51    0.008389 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,660,352 bytes consed.
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T23:43:13
% 0.20/0.51  :PROOF-FOUND
% 0.20/0.51  * 
%------------------------------------------------------------------------------