TSTP Solution File: SET853-2 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n003.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 : Tue Jul 19 05:12:51 EDT 2022

% Result   : Unsatisfiable 0.38s 0.54s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   24 (  10 unt;  12 nHn;  22 RR)
%            Number of literals    :   56 (  13 equ;  19 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :   26 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    c_in(v_xa,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_lessequals(v_xa,c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_conjecture_3,negated_conjecture,
    v_xa != c_Zorn_Osucc(v_S,v_x,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( c_lessequals(c_Zorn_Osucc(v_S,X,t_a),v_x,tc_set(tc_set(t_a)))
    | X = v_x
    | ~ c_lessequals(X,v_x,tc_set(tc_set(t_a)))
    | ~ c_in(X,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_Set_Osubset__antisym_0,axiom,
    ( ~ c_lessequals(X,Y,tc_set(Z))
    | ~ c_lessequals(Y,X,tc_set(Z))
    | Y = X ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_Set_Osubset__refl_0,axiom,
    c_lessequals(X,X,tc_set(Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).

cnf(cls_Zorn_OTFin__linear__lemma1_0,axiom,
    ( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | c_in(c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | c_lessequals(U,X,tc_set(tc_set(Z)))
    | c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_0) ).

cnf(cls_Zorn_OTFin__linear__lemma1_1,axiom,
    ( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | c_lessequals(U,X,tc_set(tc_set(Z)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),X,tc_set(tc_set(Z)))
    | c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_1) ).

cnf(cls_Zorn_OTFin__linear__lemma1_2,axiom,
    ( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | c_Zorn_OTFin__linear__lemma1__1(Y,X,Z) != X
    | c_lessequals(U,X,tc_set(tc_set(Z)))
    | c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_2) ).

cnf(cls_Zorn_OTFin__linear__lemma1_3,axiom,
    ( ~ c_in(X,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | ~ c_in(U,c_Zorn_OTFin(Y,Z),tc_set(tc_set(Z)))
    | ~ c_lessequals(c_Zorn_Osucc(Y,c_Zorn_OTFin__linear__lemma1__1(Y,X,Z),Z),X,tc_set(tc_set(Z)))
    | c_lessequals(U,X,tc_set(tc_set(Z)))
    | c_lessequals(c_Zorn_Osucc(Y,X,Z),U,tc_set(tc_set(Z))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__linear__lemma1_3) ).

cnf(cls_Zorn_Osucc__trans_0,axiom,
    ( ~ c_lessequals(X,Y,tc_set(tc_set(Z)))
    | c_lessequals(X,c_Zorn_Osucc(U,Y,Z),tc_set(tc_set(Z))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).

cnf(14,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_xa,tc_set(tc_set(t_a))),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_Osubset__antisym_0,cls_conjecture_2,cls_conjecture_3]) ).

cnf(16,plain,
    ~ c_lessequals(c_Zorn_Osucc(v_S,v_xa,t_a),v_x,tc_set(tc_set(t_a))),
    inference('UR-RESOLVE',[status(thm)],[cls_Zorn_Osucc__trans_0,cls_conjecture_4]) ).

cnf(18,plain,
    ( c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),v_x,tc_set(tc_set(t_a))) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_1,cls_conjecture_0,cls_conjecture_1]),14]) ).

cnf(20,plain,
    ( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_0,cls_conjecture_0,cls_conjecture_1]),14]) ).

cnf(30,plain,
    ( c_in(c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
    | v_xa = v_x ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_5,20,cls_conjecture_1]),16]) ).

cnf(32,plain,
    ( v_xa = v_x
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_lessequals(c_Zorn_Osucc(v_S,c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a),t_a),v_x,tc_set(tc_set(t_a)))
    | c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
    inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_5,30,18]) ).

cnf(60,plain,
    ( v_xa = v_x
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a)))
    | c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_3,32,cls_conjecture_0,cls_conjecture_1]),14]) ).

cnf(61,plain,
    ( v_xa = v_x
    | c_Zorn_OTFin__linear__lemma1__1(v_S,v_x,t_a) = v_x ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_5,60,cls_conjecture_1]),16]) ).

cnf(62,plain,
    ( v_xa = v_x
    | c_lessequals(v_xa,v_x,tc_set(tc_set(t_a))) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_Zorn_OTFin__linear__lemma1_2,61,cls_conjecture_0,cls_conjecture_1]),14]) ).

cnf(64,plain,
    v_xa = v_x,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[cls_conjecture_5,62,cls_conjecture_1]),16]) ).

cnf(66,plain,
    $false,
    inference('REWRITE',[status(thm)],[cls_conjecture_4,cls_Set_Osubset__refl_0,64,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET853-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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 : Sat Jul  9 17:57:44 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-09T17:57:44
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n003.cluster.edu at 2022-07-09T17:57:44
% 0.38/0.54  
% 0.38/0.54  
% 0.38/0.54  #||
% 0.38/0.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.54  % SZS output start Refutation
% See solution above
% 0.38/0.54  ||#
% 0.38/0.54  
% 0.38/0.54  ; Summary of computation:
% 0.38/0.54  ;       159 formulas have been input or derived (from 50 formulas).
% 0.38/0.54  ;        66 (42%) were retained.  Of these,
% 0.38/0.54  ;           47 (71%) were simplified or subsumed later,
% 0.38/0.54  ;           19 (29%) are still being kept.
% 0.38/0.54  ; 
% 0.38/0.54  ; Run time in seconds excluding printing time:
% 0.38/0.54  ;     0.004   6%   Read assertion file          (1 call)
% 0.38/0.54  ;     0.001   1%   Assert                       (13 calls)
% 0.38/0.54  ;     0.012  17%   Process new row              (96 calls)
% 0.38/0.54  ;     0.009  13%   Resolution                   (98 calls)
% 0.38/0.54  ;     0.002   3%   Paramodulation               (49 calls)
% 0.38/0.54  ;     0.000   0%   Factoring                    (23 calls)
% 0.38/0.54  ;     0.001   1%   Condensing                   (47 calls)
% 0.38/0.54  ;     0.007  10%   Forward subsumption          (47 calls)
% 0.38/0.54  ;     0.002   3%   Backward subsumption         (42 calls)
% 0.38/0.54  ;     0.001   1%   Clause clause subsumption    (79 calls)
% 0.38/0.54  ;     0.004   6%   Forward simplification       (91 calls)
% 0.38/0.54  ;     0.004   6%   Backward simplification      (66 calls)
% 0.38/0.54  ;     0.000   0%   Ordering                     (183 calls)
% 0.38/0.54  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.38/0.54  ;     0.000   0%   Purity testing               (1 call)
% 0.38/0.54  ;     0.023  33%   Other
% 0.38/0.54  ;     0.070        Total
% 0.38/0.54  ;     0.075        Real time
% 0.38/0.54  ; 
% 0.38/0.54  ; Term-hash-array has 176 terms in all.
% 0.38/0.54  ; Feature-vector-row-index has 7 entries (40 at peak, 42 added, 35 deleted).
% 0.38/0.54  ; Feature-vector-row-index has 91 nodes (632 at peak, 668 added, 577 deleted).
% 0.38/0.54  ;  Retrieved 80 possibly forward subsuming rows in 47 calls.
% 0.38/0.54  ;  Retrieved 9 possibly backward subsumed rows in 42 calls.
% 0.38/0.54  ; Path-index has 84 entries (179 at peak, 183 added, 99 deleted).
% 0.38/0.54  ; Path-index has 238 nodes (333 at peak, 343 added, 105 deleted).
% 0.38/0.54  ; Trie-index has 84 entries (179 at peak, 183 added, 99 deleted).
% 0.38/0.54  ; Trie-index has 238 nodes (698 at peak, 713 added, 475 deleted).
% 0.38/0.54  ; Retrieved 226 generalization terms in 218 calls.
% 0.38/0.54  ; Retrieved 38 instance terms in 23 calls.
% 0.38/0.54  ; Retrieved 1,572 unifiable terms in 784 calls.
% 0.38/0.54  ; 
% 0.38/0.54  ; The agenda of backward simplifiable rows to process has 29 entries:
% 0.38/0.54  ;    29 with value 0
% 0.38/0.54  ; The agenda of rows to process has 2 entries:
% 0.38/0.54  ;     1 with value 23              1 with value 25
% 0.38/0.54  ; The agenda of input rows to give has 1 entry:
% 0.38/0.54  ;     1 with value 8
% 0.38/0.54  ; The agenda of rows to give has 2 entries:
% 0.38/0.54  ;     1 with value (4 11)          1 with value (4 42)
% 0.38/0.54  Evaluation took:
% 0.38/0.54    0.075 seconds of real time
% 0.38/0.54    0.063988 seconds of user run time
% 0.38/0.54    0.010857 seconds of system run time
% 0.38/0.54    0 calls to %EVAL
% 0.38/0.54    0 page faults and
% 0.38/0.54    6,044,024 bytes consed.
% 0.38/0.54  :PROOF-FOUND
% 0.38/0.54  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T17:57:44
% 0.38/0.54  :PROOF-FOUND
% 0.38/0.54  * 
%------------------------------------------------------------------------------