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

View Problem - Process Solution

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

% Computer : n025.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:58:01 EDT 2022

% Result   : Unsatisfiable 0.47s 0.64s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   26
% Syntax   : Number of clauses     :   51 (  27 unt;   0 nHn;  36 RR)
%            Number of literals    :   95 (   0 equ;  47 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   22 (  21 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   70 (  27 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

cnf(axiom_7,axiom,
    n0(d,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_7) ).

cnf(axiom_13,axiom,
    r0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).

cnf(axiom_14,axiom,
    p0(b,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

cnf(axiom_17,axiom,
    q0(X,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

cnf(axiom_19,axiom,
    m0(X,d,Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).

cnf(axiom_28,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).

cnf(rule_001,axiom,
    ( k1(X)
    | ~ n0(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

cnf(rule_085,axiom,
    ( p1(X,X,X)
    | ~ p0(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).

cnf(rule_107,axiom,
    ( q1(e,X,X)
    | ~ m0(X,d,X)
    | ~ m0(e,d,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_107) ).

cnf(155,plain,
    q1(e,X,X),
    inference('REWRITE',[status(thm)],[rule_107,axiom_19]) ).

cnf(rule_110,axiom,
    ( q1(X,X,X)
    | ~ m0(Y,Z,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_110) ).

cnf(rule_124,axiom,
    ( r1(X)
    | ~ q0(X,Y)
    | ~ s0(d)
    | ~ q1(d,Y,d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).

cnf(177,plain,
    ( r1(X)
    | ~ q0(X,Y)
    | ~ q1(d,Y,d) ),
    inference('REWRITE',[status(thm)],[rule_124,axiom_1]) ).

cnf(rule_129,axiom,
    ( k2(X,X)
    | ~ q1(Y,X,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).

cnf(rule_136,axiom,
    ( m2(b)
    | ~ k1(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_136) ).

cnf(rule_154,axiom,
    ( p2(X,X,X)
    | ~ q1(X,X,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_154) ).

cnf(rule_181,axiom,
    ( q2(X,X,X)
    | ~ p1(X,X,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_181) ).

cnf(rule_187,axiom,
    ( q2(X,Y,X)
    | ~ r1(Y)
    | ~ m0(Z,U,X)
    | ~ k0(Y)
    | ~ q2(Y,Y,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_187) ).

cnf(rule_238,axiom,
    ( m3(X,X,X)
    | ~ p2(X,X,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_238) ).

cnf(rule_240,axiom,
    ( n3(X)
    | ~ p2(Y,Z,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).

cnf(rule_255,axiom,
    ( q3(X,Y)
    | ~ q2(Z,X,Y)
    | ~ n0(Z,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).

cnf(rule_269,axiom,
    ( r3(a,a,e)
    | ~ k2(a,a)
    | ~ q2(X,e,X)
    | ~ m2(b)
    | ~ m3(a,X,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_269) ).

cnf(rule_286,axiom,
    ( p4(X,X,X)
    | ~ q3(Y,Z)
    | ~ n3(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_286) ).

cnf(rule_288,axiom,
    ( p4(X,Y,Y)
    | ~ r3(Y,Y,X)
    | ~ p4(Z,Z,U) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_288) ).

cnf(rule_303,axiom,
    ( m5(X,Y)
    | ~ r0(X)
    | ~ p4(X,Z,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_303) ).

cnf(prove_this,negated_conjecture,
    ~ m5(e,a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(386,plain,
    k1(b),
    inference('HYPERRESOLVE',[status(thm)],[rule_001,axiom_7]) ).

cnf(387,plain,
    m2(b),
    inference('REWRITE',[status(thm)],[rule_136,386]) ).

cnf(389,plain,
    ( r3(a,a,e)
    | ~ k2(a,a)
    | ~ q2(X,e,X)
    | ~ m3(a,X,X) ),
    inference('REWRITE',[status(thm)],[rule_269,387]) ).

cnf(422,plain,
    p1(X,X,X),
    inference('HYPERRESOLVE',[status(thm)],[rule_085,axiom_14]) ).

cnf(424,plain,
    q2(X,X,X),
    inference('REWRITE',[status(thm)],[rule_181,422]) ).

cnf(425,plain,
    ( q2(X,Y,X)
    | ~ r1(Y)
    | ~ m0(Z,U,X)
    | ~ k0(Y) ),
    inference('REWRITE',[status(thm)],[rule_187,424]) ).

cnf(434,plain,
    k2(X,X),
    inference('HYPERRESOLVE',[status(thm)],[rule_129,155]) ).

cnf(436,plain,
    ( r3(a,a,e)
    | ~ q2(X,e,X)
    | ~ m3(a,X,X) ),
    inference('REWRITE',[status(thm)],[389,434]) ).

cnf(449,plain,
    q1(X,X,X),
    inference('HYPERRESOLVE',[status(thm)],[rule_110,axiom_19]) ).

cnf(451,plain,
    p2(X,X,X),
    inference('REWRITE',[status(thm)],[rule_154,449]) ).

cnf(452,plain,
    m3(X,X,X),
    inference('REWRITE',[status(thm)],[rule_238,451]) ).

cnf(454,plain,
    n3(X),
    inference('HYPERRESOLVE',[status(thm)],[rule_240,451]) ).

cnf(457,plain,
    ( p4(X,X,X)
    | ~ q3(Y,Z) ),
    inference('REWRITE',[status(thm)],[rule_286,454]) ).

cnf(480,plain,
    ~ p4(e,X,a),
    inference('UR-RESOLVE',[status(thm)],[rule_303,prove_this,axiom_13]) ).

cnf(496,plain,
    q3(e,e),
    inference('HYPERRESOLVE',[status(thm)],[rule_255,424,axiom_30]) ).

cnf(581,plain,
    p4(X,X,X),
    inference('HYPERRESOLVE',[status(thm)],[457,496]) ).

cnf(643,plain,
    r1(X),
    inference('HYPERRESOLVE',[status(thm)],[177,449,axiom_17]) ).

cnf(644,plain,
    ( q2(X,Y,X)
    | ~ m0(Z,U,X)
    | ~ k0(Y) ),
    inference('REWRITE',[status(thm)],[425,643]) ).

cnf(658,plain,
    q2(X,e,X),
    inference('HYPERRESOLVE',[status(thm)],[644,axiom_19,axiom_28]) ).

cnf(659,plain,
    ( r3(a,a,e)
    | ~ m3(a,X,X) ),
    inference('REWRITE',[status(thm)],[436,658]) ).

cnf(660,plain,
    r3(a,a,e),
    inference('HYPERRESOLVE',[status(thm)],[659,452]) ).

cnf(745,plain,
    ~ p4(X,X,Y),
    inference('UR-RESOLVE',[status(thm)],[rule_288,660,480]) ).

cnf(746,plain,
    $false,
    inference('REWRITE',[status(thm)],[581,745]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : SYN144-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n025.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 : Mon Jul 11 15:17:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.45  #<PACKAGE "SNARK-USER">
% 0.18/0.45  * 
% 0.18/0.45  SNARK-TPTP-OPTIONS
% 0.18/0.45  * 
% 0.18/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.45   (USE-FACTORING :POS)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.45  * 
% 0.18/0.45  "."
% 0.18/0.45  * 
% 0.18/0.45  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T15:17:32
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-07-11T15:17:32
% 0.37/0.54  WARNING:
% 0.37/0.54     |q5| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 0.37/0.54  WARNING:
% 0.37/0.54     |r5| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 0.47/0.64  
% 0.47/0.64  
% 0.47/0.64  #||
% 0.47/0.64  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.64  % SZS output start Refutation
% See solution above
% 0.47/0.65  ||#
% 0.47/0.65  
% 0.47/0.65  ; Summary of computation:
% 0.47/0.65  ;      2010 formulas have been input or derived (from 410 formulas).
% 0.47/0.65  ;       746 (37%) were retained.  Of these,
% 0.47/0.65  ;          373 (50%) were simplified or subsumed later,
% 0.47/0.65  ;          373 (50%) are still being kept.
% 0.47/0.65  ; 
% 0.47/0.65  ; Run time in seconds excluding printing time:
% 0.47/0.65  ;     0.062  33%   Read assertion file          (1 call)
% 0.47/0.65  ;     0.008   4%   Assert                       (369 calls)
% 0.47/0.65  ;     0.031  17%   Process new row              (1,628 calls)
% 0.47/0.65  ;     0.024  13%   Resolution                   (818 calls)
% 0.47/0.65  ;     0.000   0%   Paramodulation               (409 calls)
% 0.47/0.65  ;     0.004   2%   Condensing                   (360 calls)
% 0.47/0.65  ;     0.004   2%   Forward subsumption          (360 calls)
% 0.47/0.65  ;     0.007   4%   Backward subsumption         (346 calls)
% 0.47/0.65  ;     0.000   0%   Clause clause subsumption    (170 calls)
% 0.47/0.65  ;     0.008   4%   Forward simplification       (1,566 calls)
% 0.47/0.65  ;     0.010   5%   Backward simplification      (699 calls)
% 0.47/0.65  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.47/0.65  ;     0.001   1%   Purity testing               (1 call)
% 0.47/0.65  ;     0.028  15%   Other
% 0.47/0.65  ;     0.187        Total
% 0.47/0.65  ;     0.197        Real time
% 0.47/0.65  ; 
% 0.47/0.65  ; Term-hash-array has 762 terms in all.
% 0.47/0.65  ; Feature-vector-row-index has 113 entries (277 at peak, 346 added, 233 deleted).
% 0.47/0.65  ; Feature-vector-row-index has 400 nodes (944 at peak, 1,196 added, 796 deleted).
% 0.47/0.65  ;  Retrieved 150 possibly forward subsuming rows in 360 calls.
% 0.47/0.65  ;  Retrieved 161 possibly backward subsumed rows in 346 calls.
% 0.47/0.65  ; Path-index has 504 entries (532 at peak, 870 added, 366 deleted).
% 0.47/0.65  ; Path-index has 487 nodes (490 at peak, 639 added, 152 deleted).
% 0.47/0.65  ; Trie-index has 504 entries (532 at peak, 870 added, 366 deleted).
% 0.47/0.65  ; Trie-index has 711 nodes (715 at peak, 1,119 added, 408 deleted).
% 0.47/0.65  ; Retrieved 1,154 generalization terms in 1,652 calls.
% 0.47/0.65  ; Retrieved 747 instance terms in 352 calls.
% 0.47/0.65  ; Retrieved 16,461 unifiable terms in 3,786 calls.
% 0.47/0.65  ; 
% 0.47/0.65  ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.47/0.65  ;     2 with value 0
% 0.47/0.65  ; The agenda of rows to give has 115 entries:
% 0.47/0.65  ;    20 with value (4 6)          82 with value (4 7)           13 with value (4 8)
% 0.47/0.65  Evaluation took:
% 0.47/0.65    0.197 seconds of real time
% 0.47/0.65    0.177275 seconds of user run time
% 0.47/0.65    0.019896 seconds of system run time
% 0.47/0.65    [Run times include 0.007 seconds GC run time.]
% 0.47/0.65    0 calls to %EVAL
% 0.47/0.65    0 page faults and
% 0.47/0.65    13,337,576 bytes consed.
% 0.47/0.65  :PROOF-FOUND
% 0.47/0.65  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T15:17:32
% 0.47/0.65  :PROOF-FOUND
% 0.47/0.65  * 
%------------------------------------------------------------------------------