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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SYN193-10 : TPTP v8.1.0. Released v7.3.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:21 EDT 2022

% Result   : Unsatisfiable 0.69s 0.84s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   32 (  32 unt;   0 nHn;  10 RR)
%            Number of literals    :   32 (  31 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   4 con; 0-4 aty)
%            Number of variables   :   46 (  24 sgn)

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

cnf(axiom_7,axiom,
    n0(d,b) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

cnf(axiom_11,axiom,
    n0(e,b) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).

cnf(axiom_14,axiom,
    p0(b,X) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).

cnf(axiom_19,axiom,
    m0(X,d,Y) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).

cnf(axiom_28,axiom,
    k0(e) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_28) ).

cnf(axiom_31,axiom,
    m0(b,b,e) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_31) ).

cnf(rule_001,axiom,
    ifeq(n0(X,Y),true,k1(Y),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_001) ).

cnf(rule_040,axiom,
    ifeq(m0(X,Y,e),true,ifeq(k1(X),true,n1(X,e,e),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_040) ).

cnf(rule_085,axiom,
    ifeq(p0(X,Y),true,p1(Y,Y,Y),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_085) ).

cnf(rule_110,axiom,
    ifeq(m0(X,Y,Z),true,q1(Z,Z,Z),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_110) ).

cnf(rule_154,axiom,
    ifeq(q1(X,X,X),true,p2(X,X,X),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_154) ).

cnf(rule_177,axiom,
    ifeq(p1(X,X,X),true,ifeq(k0(Y),true,q2(X,Y,Y),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_177) ).

cnf(rule_182,axiom,
    ifeq(q2(X,Y,Z),true,ifeq(p1(Z,Z,Y),true,ifeq(n1(X,Z,Y),true,q2(Z,X,Z),true),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_182) ).

cnf(rule_240,axiom,
    ifeq(p2(X,Y,Z),true,n3(Z),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_240) ).

cnf(rule_255,axiom,
    ifeq(q2(X,Y,Z),true,ifeq(n0(X,Y),true,q3(Y,Z),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_255) ).

cnf(rule_298,axiom,
    ifeq(q3(X,Y),true,ifeq(n3(Z),true,ifeq(p0(U,Z),true,r4(Z),true),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_298) ).

cnf(prove_this,negated_conjecture,
    r4(b) != true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(410,plain,
    k1(b) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_001,axiom_7,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(460,plain,
    p1(X,X,X) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_085,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(476,plain,
    ifeq(k0(X),true,q2(Y,X,X),true) = true,
    inference('REWRITE',[status(thm)],[rule_177,ifeq_axiom,460,theory(equality)]) ).

cnf(483,plain,
    q2(X,e,e) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[476,axiom_28,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(513,plain,
    q1(X,X,X) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_110,axiom_19,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(515,plain,
    p2(X,X,X) = true,
    inference('REWRITE',[status(thm)],[rule_154,ifeq_axiom,513,theory(equality)]) ).

cnf(538,plain,
    n3(X) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_240,515,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(543,plain,
    ifeq(q3(X,Y),true,ifeq(p0(Z,U),true,r4(U),true),true) = true,
    inference('REWRITE',[status(thm)],[rule_298,ifeq_axiom,538,theory(equality)]) ).

cnf(590,plain,
    ifeq(q3(X,Y),true,r4(Z),true) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[543,axiom_14,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(637,plain,
    n1(b,e,e) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_040,axiom_31,theory(equality)]),ifeq_axiom,410,theory(equality)]) ).

cnf(980,plain,
    q2(e,b,e) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_182,637,theory(equality)]),ifeq_axiom,460,483,theory(equality)]) ).

cnf(1027,plain,
    q3(b,e) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[rule_255,980,theory(equality)]),ifeq_axiom,axiom_11,theory(equality)]) ).

cnf(1089,plain,
    r4(X) = true,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[590,1027,theory(equality)]),ifeq_axiom,theory(equality)]) ).

cnf(1100,plain,
    $false,
    inference('REWRITE',[status(thm)],[prove_this,1089,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN193-10 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n025.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jul 11 16:40:17 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 0.21/0.47  #<PACKAGE "SNARK-USER">
% 0.21/0.47  * 
% 0.21/0.47  SNARK-TPTP-OPTIONS
% 0.21/0.47  * 
% 0.21/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47   (USE-FACTORING :POS)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47   (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-07-11T16:40:17
% 0.21/0.48  ; 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-11T16:40:17
% 0.69/0.84  
% 0.69/0.84  
% 0.69/0.84  #||
% 0.69/0.84  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.69/0.84  % SZS output start Refutation
% See solution above
% 0.69/0.86  ||#
% 0.69/0.86  
% 0.69/0.86  ; Summary of computation:
% 0.69/0.86  ;      2528 formulas have been input or derived (from 428 formulas).
% 0.69/0.86  ;      1100 (44%) were retained.  Of these,
% 0.69/0.86  ;          504 (46%) were simplified or subsumed later,
% 0.69/0.86  ;          596 (54%) are still being kept.
% 0.69/0.86  ; 
% 0.69/0.86  ; Run time in seconds excluding printing time:
% 0.69/0.86  ;     0.076  21%   Read assertion file          (1 call)
% 0.69/0.86  ;     0.009   2%   Assert                       (363 calls)
% 0.69/0.86  ;     0.095  26%   Process new row              (2,297 calls)
% 0.69/0.86  ;     0.012   3%   Resolution                   (854 calls)
% 0.69/0.86  ;     0.027   7%   Paramodulation               (427 calls)
% 0.69/0.86  ;     0.037  10%   Forward simplification       (2,256 calls)
% 0.69/0.86  ;     0.063  17%   Backward simplification      (1,049 calls)
% 0.69/0.86  ;     0.008   2%   Ordering                     (4,763 calls)
% 0.69/0.86  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.69/0.86  ;     0.000   0%   Purity testing               (1 call)
% 0.69/0.86  ;     0.039  11%   Other
% 0.69/0.86  ;     0.366        Total
% 0.69/0.86  ;     0.386        Real time
% 0.69/0.86  ; 
% 0.69/0.86  ; Term-hash-array has 3,519 terms in all.
% 0.69/0.86  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 0.69/0.86  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 0.69/0.86  ; Path-index has 2,129 entries (2,270 at peak, 3,765 added, 1,636 deleted).
% 0.69/0.86  ; Path-index has 3,995 nodes (4,150 at peak, 5,464 added, 1,469 deleted).
% 0.69/0.86  ; Trie-index has 2,129 entries (2,270 at peak, 3,765 added, 1,636 deleted).
% 0.69/0.86  ; Trie-index has 11,303 nodes (12,366 at peak, 20,852 added, 9,549 deleted).
% 0.69/0.86  ; Retrieved 4,914 generalization terms in 8,130 calls.
% 0.69/0.86  ; Retrieved 1,670 instance terms in 1,048 calls.
% 0.69/0.86  ; Retrieved 3,853 unifiable terms in 3,301 calls.
% 0.69/0.86  ; 
% 0.69/0.86  ; The agenda of input rows to give has 7 entries:
% 0.69/0.86  ;     1 with value 6               2 with value 11               1 with value 24
% 0.69/0.86  ;     1 with value 7               2 with value 12
% 0.69/0.86  ; The agenda of rows to give has 333 entries:
% 0.69/0.86  ;     1 with value (4 10)          2 with value (4 20)          22 with value (4 26)
% 0.69/0.86  ;     7 with value (4 14)          7 with value (4 21)           4 with value (4 27)
% 0.69/0.86  ;    38 with value (4 15)         26 with value (4 22)           3 with value (4 28)
% 0.69/0.86  ;    53 with value (4 16)         22 with value (4 23)           4 with value (4 29)
% 0.69/0.86  ;    58 with value (4 17)         26 with value (4 24)           4 with value (4 30)
% 0.69/0.86  ;    29 with value (4 18)         16 with value (4 25)           1 with value (4 33)
% 0.69/0.86  ;    10 with value (4 19)
% 0.69/0.86  Evaluation took:
% 0.69/0.86    0.387 seconds of real time
% 0.69/0.86    0.352027 seconds of user run time
% 0.69/0.86    0.034995 seconds of system run time
% 0.69/0.86    [Run times include 0.031 seconds GC run time.]
% 0.69/0.86    0 calls to %EVAL
% 0.69/0.86    0 page faults and
% 0.69/0.86    26,238,296 bytes consed.
% 0.69/0.86  :PROOF-FOUND
% 0.69/0.86  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T16:40:18
% 0.69/0.86  :PROOF-FOUND
% 0.69/0.86  * 
%------------------------------------------------------------------------------