↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SYN142-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n005.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:59 EDT 2022

% Result   : Unsatisfiable 0.47s 0.69s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   32
% Syntax   : Number of clauses     :   60 (  32 unt;   0 nHn;  40 RR)
%            Number of literals    :  111 (   0 equ;  54 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   24 (  23 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   85 (  33 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
    s0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).

cnf(axiom_9,axiom,
    r0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_9) ).

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

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

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

cnf(axiom_20,axiom,
    l0(a),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

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

cnf(axiom_31,axiom,
    m0(b,b,e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_31) ).

cnf(axiom_32,axiom,
    k0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).

cnf(axiom_37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).

cnf(rule_002,axiom,
    ( l1(X,X)
    | ~ n0(Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).

cnf(rule_003,axiom,
    ( l1(X,Y)
    | ~ p0(Z,X)
    | ~ r0(U)
    | ~ m0(Y,X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_003) ).

cnf(rule_050,axiom,
    ( n1(X,Y,X)
    | ~ s0(b)
    | ~ l0(X)
    | ~ p0(b,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).

cnf(92,plain,
    ( n1(X,Y,X)
    | ~ l0(X) ),
    inference('REWRITE',[status(thm)],[rule_050,axiom_14,axiom_5]) ).

cnf(rule_054,axiom,
    ( n1(X,Y,Y)
    | ~ l0(Z)
    | ~ l1(Z,X)
    | ~ n1(X,Y,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_054) ).

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

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

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

cnf(rule_125,axiom,
    ( s1(X)
    | ~ p0(X,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).

cnf(rule_126,axiom,
    ( s1(X)
    | ~ q0(X,Y)
    | ~ s1(Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).

cnf(rule_131,axiom,
    ( l2(X,Y)
    | ~ s1(X)
    | ~ n0(e,Y)
    | ~ l2(Y,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_131) ).

cnf(rule_133,axiom,
    ( l2(X,X)
    | ~ p0(Y,Y)
    | ~ s1(Z)
    | ~ m0(U,Z,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_133) ).

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

cnf(rule_177,axiom,
    ( q2(X,Y,Y)
    | ~ k0(Y)
    | ~ p1(X,X,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_177) ).

cnf(rule_182,axiom,
    ( q2(X,Y,X)
    | ~ p1(X,X,Z)
    | ~ n1(Y,X,Z)
    | ~ q2(Y,Z,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_182) ).

cnf(rule_189,axiom,
    ( s2(X)
    | ~ q2(b,X,b)
    | ~ s1(b) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).

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

cnf(rule_248,axiom,
    ( p3(X,X,X)
    | ~ p2(Y,X,X)
    | ~ n3(X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_248) ).

cnf(rule_273,axiom,
    ( s3(X,Y)
    | ~ q2(Z,X,Z)
    | ~ s2(X)
    | ~ m0(Z,U,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).

cnf(rule_279,axiom,
    ( m4(X,Y)
    | ~ l2(Z,Y)
    | ~ s3(a,X) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_279) ).

cnf(rule_299,axiom,
    ( s4(X)
    | ~ p3(Y,Z,U)
    | ~ l1(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_299) ).

cnf(rule_305,axiom,
    ( m5(X,X)
    | ~ s4(X)
    | ~ m4(e,e) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_305) ).

cnf(prove_this,negated_conjecture,
    ~ m5(d,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(395,plain,
    s1(b),
    inference('HYPERRESOLVE',[status(thm)],[rule_125,axiom_14]) ).

cnf(396,plain,
    ( s2(X)
    | ~ q2(b,X,b) ),
    inference('REWRITE',[status(thm)],[rule_189,395]) ).

cnf(401,plain,
    l1(a,a),
    inference('HYPERRESOLVE',[status(thm)],[rule_002,axiom_37]) ).

cnf(408,plain,
    n1(a,X,a),
    inference('HYPERRESOLVE',[status(thm)],[92,axiom_20]) ).

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

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

cnf(424,plain,
    ( q2(X,Y,Y)
    | ~ k0(Y) ),
    inference('REWRITE',[status(thm)],[rule_177,423]) ).

cnf(428,plain,
    q2(X,b,b),
    inference('HYPERRESOLVE',[status(thm)],[424,axiom_32]) ).

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

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

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

cnf(457,plain,
    ( p3(X,X,X)
    | ~ p2(Y,X,X) ),
    inference('REWRITE',[status(thm)],[rule_248,455]) ).

cnf(464,plain,
    p3(X,X,X),
    inference('HYPERRESOLVE',[status(thm)],[457,452]) ).

cnf(507,plain,
    l1(d,X),
    inference('HYPERRESOLVE',[status(thm)],[rule_003,axiom_14,axiom_9,axiom_19]) ).

cnf(533,plain,
    s1(X),
    inference('HYPERRESOLVE',[status(thm)],[rule_126,395,axiom_17]) ).

cnf(536,plain,
    ( l2(X,X)
    | ~ p0(Y,Y)
    | ~ m0(Z,U,X) ),
    inference('REWRITE',[status(thm)],[rule_133,533]) ).

cnf(537,plain,
    ( l2(X,Y)
    | ~ n0(e,Y)
    | ~ l2(Y,Y) ),
    inference('REWRITE',[status(thm)],[rule_131,533]) ).

cnf(548,plain,
    l2(X,X),
    inference('HYPERRESOLVE',[status(thm)],[536,axiom_14,axiom_19]) ).

cnf(550,plain,
    ( l2(X,Y)
    | ~ n0(e,Y) ),
    inference('REWRITE',[status(thm)],[537,548]) ).

cnf(556,plain,
    l2(X,e),
    inference('HYPERRESOLVE',[status(thm)],[550,axiom_30]) ).

cnf(617,plain,
    n1(a,X,X),
    inference('HYPERRESOLVE',[status(thm)],[rule_054,408,axiom_20,401]) ).

cnf(682,plain,
    s4(d),
    inference('HYPERRESOLVE',[status(thm)],[rule_299,464,507]) ).

cnf(691,plain,
    ~ m4(e,e),
    inference('UR-RESOLVE',[status(thm)],[rule_305,682,prove_this]) ).

cnf(814,plain,
    q2(b,a,b),
    inference('HYPERRESOLVE',[status(thm)],[rule_182,617,422,428]) ).

cnf(837,plain,
    ~ s3(a,e),
    inference('UR-RESOLVE',[status(thm)],[rule_279,691,556]) ).

cnf(905,plain,
    s2(a),
    inference('HYPERRESOLVE',[status(thm)],[396,814]) ).

cnf(908,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[rule_273,905,814,axiom_31]),837]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SYN142-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.12  % Command  : run-snark %s %d
% 0.11/0.33  % Computer : n005.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul 11 13:10:37 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-11T13:10:37
% 0.18/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-07-11T13:10:37
% 0.18/0.54  WARNING:
% 0.18/0.54     |q5| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 0.18/0.54  WARNING:
% 0.18/0.54     |r5| is a 2-ary relation that occurs only positively; disabling rows that contain it.
% 0.47/0.69  
% 0.47/0.69  
% 0.47/0.69  #||
% 0.47/0.69  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.69  % SZS output start Refutation
% See solution above
% 0.47/0.70  ||#
% 0.47/0.70  
% 0.47/0.70  ; Summary of computation:
% 0.47/0.70  ;      4300 formulas have been input or derived (from 597 formulas).
% 0.47/0.70  ;       908 (21%) were retained.  Of these,
% 0.47/0.70  ;          411 (45%) were simplified or subsumed later,
% 0.47/0.70  ;          497 (55%) are still being kept.
% 0.47/0.70  ; 
% 0.47/0.70  ; Run time in seconds excluding printing time:
% 0.47/0.70  ;     0.062  26%   Read assertion file          (1 call)
% 0.47/0.70  ;     0.009   4%   Assert                       (369 calls)
% 0.47/0.70  ;     0.039  16%   Process new row              (3,180 calls)
% 0.47/0.70  ;     0.046  19%   Resolution                   (1,192 calls)
% 0.47/0.70  ;     0.003   1%   Paramodulation               (596 calls)
% 0.47/0.70  ;     0.001   0%   Condensing                   (364 calls)
% 0.47/0.70  ;     0.004   2%   Forward subsumption          (364 calls)
% 0.47/0.70  ;     0.007   3%   Backward subsumption         (350 calls)
% 0.47/0.70  ;     0.000   0%   Clause clause subsumption    (170 calls)
% 0.47/0.70  ;     0.024  10%   Forward simplification       (3,103 calls)
% 0.47/0.70  ;     0.012   5%   Backward simplification      (861 calls)
% 0.47/0.70  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.47/0.70  ;     0.002   1%   Purity testing               (1 call)
% 0.47/0.70  ;     0.032  13%   Other
% 0.47/0.70  ;     0.241        Total
% 0.47/0.70  ;     0.244        Real time
% 0.47/0.70  ; 
% 0.47/0.70  ; Term-hash-array has 902 terms in all.
% 0.47/0.70  ; Feature-vector-row-index has 101 entries (277 at peak, 350 added, 249 deleted).
% 0.47/0.70  ; Feature-vector-row-index has 310 nodes (944 at peak, 1,214 added, 904 deleted).
% 0.47/0.70  ;  Retrieved 150 possibly forward subsuming rows in 364 calls.
% 0.47/0.70  ;  Retrieved 161 possibly backward subsumed rows in 350 calls.
% 0.47/0.70  ; Path-index has 609 entries (609 at peak, 1,024 added, 415 deleted).
% 0.47/0.70  ; Path-index has 515 nodes (515 at peak, 682 added, 167 deleted).
% 0.47/0.70  ; Trie-index has 609 entries (609 at peak, 1,024 added, 415 deleted).
% 0.47/0.70  ; Trie-index has 870 nodes (870 at peak, 1,346 added, 476 deleted).
% 0.47/0.70  ; Retrieved 2,701 generalization terms in 3,194 calls.
% 0.47/0.70  ; Retrieved 958 instance terms in 510 calls.
% 0.47/0.70  ; Retrieved 30,396 unifiable terms in 7,149 calls.
% 0.47/0.70  ; 
% 0.47/0.70  ; The agenda of rows to process has 33 entries:
% 0.47/0.70  ;    19 with value 9              14 with value 10
% 0.47/0.70  ; The agenda of rows to give has 78 entries:
% 0.47/0.70  ;    42 with value (4 8)          36 with value (4 9)
% 0.47/0.70  Evaluation took:
% 0.47/0.70    0.244 seconds of real time
% 0.47/0.70    0.211927 seconds of user run time
% 0.47/0.70    0.032362 seconds of system run time
% 0.47/0.70    [Run times include 0.009 seconds GC run time.]
% 0.47/0.70    0 calls to %EVAL
% 0.47/0.70    0 page faults and
% 0.47/0.70    16,633,064 bytes consed.
% 0.47/0.70  :PROOF-FOUND
% 0.47/0.70  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T13:10:37
% 0.47/0.70  :PROOF-FOUND
% 0.47/0.70  * 
%------------------------------------------------------------------------------