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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SYN075-1 : TPTP v8.1.0. Released v1.0.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:57:23 EDT 2022

% Result   : Unsatisfiable 0.20s 0.52s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (   5 unt;   5 nHn;   9 RR)
%            Number of literals    :   30 (  18 equ;  13 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
    ( ~ big_f(X,Y)
    | X = a ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

cnf(clause_3,axiom,
    ( X != a
    | Y != b
    | big_f(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

cnf(clause_4,negated_conjecture,
    ( ~ big_f(X,f(Y))
    | X != g(Y)
    | f(Y) = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

cnf(clause_6,negated_conjecture,
    ( X != g(Y)
    | big_f(X,f(Y))
    | f(Y) = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

cnf(clause_9,negated_conjecture,
    ( f(X) != X
    | big_f(h(X,Y),f(X))
    | h(X,Y) = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

cnf(clause_10,negated_conjecture,
    ( f(X) != X
    | h(X,Y) != Y
    | ~ big_f(h(X,Y),f(X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_10) ).

cnf(10,plain,
    big_f(a,b),
    inference('HYPERRESOLVE',[status(thm)],[clause_3,theory(equality),theory(equality)]) ).

cnf(11,plain,
    ( big_f(g(X),f(X))
    | f(X) = X ),
    inference('HYPERRESOLVE',[status(thm)],[clause_6,theory(equality)]) ).

cnf(13,plain,
    f(X) = X,
    inference('HYPERRESOLVE',[status(thm)],[clause_4,11,theory(equality)]) ).

cnf(14,plain,
    ( big_f(h(X,Y),X)
    | h(X,Y) = Y ),
    inference('REWRITE',[status(thm)],[clause_9,13,theory(equality)]) ).

cnf(15,plain,
    ( h(X,Y) != Y
    | ~ big_f(h(X,Y),X) ),
    inference('REWRITE',[status(thm)],[clause_10,13,theory(equality)]) ).

cnf(17,plain,
    ( h(X,Y) = Y
    | h(X,Y) = a ),
    inference('HYPERRESOLVE',[status(thm)],[clause_1,14]) ).

cnf(22,plain,
    h(X,a) = a,
    inference('HYPERRESOLVE',[status(thm)],[15,17,14]) ).

cnf(30,plain,
    ~ big_f(a,X),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[15,22]),22,theory(equality)]) ).

cnf(31,plain,
    $false,
    inference('REWRITE',[status(thm)],[10,30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN075-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n020.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 : Tue Jul 12 04:05:42 EDT 2022
% 0.14/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.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-12T04:05:43
% 0.20/0.48  ; 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-12T04:05:43
% 0.20/0.52  
% 0.20/0.52  
% 0.20/0.52  #||
% 0.20/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52  % SZS output start Refutation
% See solution above
% 0.20/0.52  ||#
% 0.20/0.52  
% 0.20/0.52  ; Summary of computation:
% 0.20/0.52  ;       112 formulas have been input or derived (from 20 formulas).
% 0.20/0.52  ;        31 (28%) were retained.  Of these,
% 0.20/0.52  ;           16 (52%) were simplified or subsumed later,
% 0.20/0.52  ;           15 (48%) are still being kept.
% 0.20/0.52  ; 
% 0.20/0.52  ; Run time in seconds excluding printing time:
% 0.20/0.52  ;     0.002   5%   Read assertion file          (1 call)
% 0.20/0.52  ;     0.001   3%   Assert                       (10 calls)
% 0.20/0.52  ;     0.003   8%   Process new row              (90 calls)
% 0.20/0.52  ;     0.000   0%   Resolution                   (38 calls)
% 0.20/0.52  ;     0.000   0%   Paramodulation               (19 calls)
% 0.20/0.52  ;     0.000   0%   Factoring                    (6 calls)
% 0.20/0.52  ;     0.000   0%   Condensing                   (48 calls)
% 0.20/0.52  ;     0.001   3%   Forward subsumption          (48 calls)
% 0.20/0.52  ;     0.002   5%   Backward subsumption         (25 calls)
% 0.20/0.52  ;     0.000   0%   Clause clause subsumption    (39 calls)
% 0.20/0.52  ;     0.001   3%   Forward simplification       (87 calls)
% 0.20/0.52  ;     0.001   3%   Backward simplification      (31 calls)
% 0.20/0.52  ;     0.002   5%   Ordering                     (138 calls)
% 0.20/0.52  ;     0.001   3%   Sortal reasoning             (32 calls)
% 0.20/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.52  ;     0.024  63%   Other
% 0.20/0.52  ;     0.038        Total
% 0.20/0.52  ;     0.041        Real time
% 0.20/0.52  ; 
% 0.20/0.52  ; Term-hash-array has 38 terms in all.
% 0.20/0.52  ; Feature-vector-row-index has 11 entries (15 at peak, 25 added, 14 deleted).
% 0.20/0.52  ; Feature-vector-row-index has 37 nodes (56 at peak, 110 added, 73 deleted).
% 0.20/0.52  ;  Retrieved 53 possibly forward subsuming rows in 48 calls.
% 0.20/0.52  ;  Retrieved 0 possibly backward subsumed rows in 25 calls.
% 0.20/0.52  ; Path-index has 25 entries (28 at peak, 44 added, 19 deleted).
% 0.20/0.52  ; Path-index has 46 nodes (46 at peak, 57 added, 11 deleted).
% 0.20/0.52  ; Trie-index has 25 entries (28 at peak, 44 added, 19 deleted).
% 0.20/0.52  ; Trie-index has 39 nodes (45 at peak, 72 added, 33 deleted).
% 0.20/0.52  ; Retrieved 32 generalization terms in 121 calls.
% 0.20/0.52  ; Retrieved 8 instance terms in 5 calls.
% 0.20/0.52  ; Retrieved 476 unifiable terms in 136 calls.
% 0.20/0.52  ; 
% 0.20/0.52  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.20/0.52  ;     3 with value 0
% 0.20/0.52  ; The agenda of rows to process has 9 entries:
% 0.20/0.52  ;     2 with value 10              1 with value 16               1 with value 19
% 0.20/0.52  ;     5 with value 11
% 0.20/0.52  ; The agenda of rows to give has 5 entries:
% 0.20/0.52  ;     1 with value (4 7)           1 with value (4 16)           1 with value (4 25)
% 0.20/0.52  ;     1 with value (4 13)          1 with value (4 22)
% 0.20/0.52  Evaluation took:
% 0.20/0.52    0.041 seconds of real time
% 0.20/0.52    0.036314 seconds of user run time
% 0.20/0.52    0.004633 seconds of system run time
% 0.20/0.52    0 calls to %EVAL
% 0.20/0.52    0 page faults and
% 0.20/0.52    2,636,672 bytes consed.
% 0.20/0.52  :PROOF-FOUND
% 0.20/0.52  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-12T04:05:43
% 0.20/0.53  :PROOF-FOUND
% 0.20/0.53  * 
%------------------------------------------------------------------------------