TSTP Solution File: SEU344+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SEU344+1 : TPTP v8.1.0. Released v3.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 : Tue Jul 19 14:21:29 EDT 2022

% Result   : Theorem 9.08s 9.28s
% Output   : Refutation 9.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   20 (  11 unt;   4 nHn;  17 RR)
%            Number of literals    :   38 (   8 equ;  17 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   17 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    ( empty_carrier(X)
    | ~ join_semilatt_str(X)
    | ~ element(Y,the_carrier(X))
    | ~ element(Z,the_carrier(X))
    | ~ below(X,Y,Z)
    | join(X,Y,Z) = Z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).

cnf(8,axiom,
    ( empty_carrier(X)
    | ~ join_semilatt_str(X)
    | ~ element(Y,the_carrier(X))
    | ~ element(Z,the_carrier(X))
    | below(X,Y,Z)
    | join(X,Y,Z) != Z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).

cnf(13,axiom,
    latt_str(boole_lattice(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).

cnf(20,axiom,
    ( ~ latt_str(X)
    | join_semilatt_str(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).

cnf(35,axiom,
    ~ empty_carrier(boole_lattice(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_lattice3) ).

cnf(68,axiom,
    ( ~ subset(X,Y)
    | set_union2(X,Y) = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).

cnf(70,axiom,
    ( ~ element(X,the_carrier(boole_lattice(Y)))
    | ~ element(Z,the_carrier(boole_lattice(Y)))
    | join(boole_lattice(Y),X,Z) = set_union2(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).

cnf(74,negated_conjecture,
    element('SKOLEMAAAV17',the_carrier(boole_lattice('SKOLEMAAAV16'))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

cnf(75,negated_conjecture,
    element('SKOLEMAAAV18',the_carrier(boole_lattice('SKOLEMAAAV16'))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

cnf(76,negated_conjecture,
    ( ~ below(boole_lattice('SKOLEMAAAV16'),'SKOLEMAAAV17','SKOLEMAAAV18')
    | ~ subset('SKOLEMAAAV17','SKOLEMAAAV18') ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

cnf(77,negated_conjecture,
    ( below(boole_lattice('SKOLEMAAAV16'),'SKOLEMAAAV17','SKOLEMAAAV18')
    | subset('SKOLEMAAAV17','SKOLEMAAAV18') ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).

cnf(85,axiom,
    subset(X,set_union2(X,Y)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).

cnf(96,plain,
    join_semilatt_str(boole_lattice(X)),
    inference('HYPERRESOLVE',[status(thm)],[20,13]) ).

cnf(170,plain,
    join(boole_lattice('SKOLEMAAAV16'),'SKOLEMAAAV17','SKOLEMAAAV18') = set_union2('SKOLEMAAAV17','SKOLEMAAAV18'),
    inference('HYPERRESOLVE',[status(thm)],[70,74,75]) ).

cnf(251,plain,
    ( subset('SKOLEMAAAV17','SKOLEMAAAV18')
    | set_union2('SKOLEMAAAV17','SKOLEMAAAV18') = 'SKOLEMAAAV18' ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[7,96,74,75,77]),170,35,theory(equality)]) ).

cnf(21840,plain,
    ( below(boole_lattice('SKOLEMAAAV16'),'SKOLEMAAAV17','SKOLEMAAAV18')
    | set_union2('SKOLEMAAAV17','SKOLEMAAAV18') != 'SKOLEMAAAV18' ),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,170,theory(equality)]),75,74,96,35]) ).

cnf(21842,plain,
    set_union2('SKOLEMAAAV17','SKOLEMAAAV18') = 'SKOLEMAAAV18',
    inference('HYPERRESOLVE',[status(thm)],[68,251]) ).

cnf(21847,plain,
    below(boole_lattice('SKOLEMAAAV16'),'SKOLEMAAAV17','SKOLEMAAAV18'),
    inference('REWRITE',[status(thm)],[21840,21842,theory(equality)]) ).

cnf(21848,plain,
    ~ subset('SKOLEMAAAV17','SKOLEMAAAV18'),
    inference('REWRITE',[status(thm)],[76,21847]) ).

cnf(21857,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[85,21842,theory(equality)]),21848]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU344+1 : TPTP v8.1.0. Released v3.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 Jun 20 11:32:29 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.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (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-06-20T11:32:30
% 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-06-20T11:32:30
% 0.21/0.51  
% 0.21/0.51  ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.21/0.51  ; Recognized commutativity assertion (= (|set_union2| ?X ?Y) (|set_union2| ?Y ?X)).
% 0.21/0.51  ; Recognized commutativity assertion (= (|set_intersection2| ?X ?Y) (|set_intersection2| ?Y ?X)).
% 0.21/0.51  ; Recognized right identity assertion (= (|set_union2| ?X |empty_set|) ?X).
% 0.21/0.51  ; Declaring unordered_pair to be commutative.
% 0.21/0.51  ; Declaring set_union2 to be commutative.
% 9.08/9.28  ; Declaring set_intersection2 to be commutative.
% 9.08/9.28  
% 9.08/9.28  #||
% 9.08/9.28  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.08/9.28  % SZS output start Refutation
% See solution above
% 9.08/9.28  ||#
% 9.08/9.28  
% 9.08/9.28  ; Summary of computation:
% 9.08/9.28  ;     23211 formulas have been input or derived (from 391 formulas).
% 9.08/9.28  ;     21857 (94%) were retained.  Of these,
% 9.08/9.28  ;           94 ( 0%) were simplified or subsumed later,
% 9.08/9.28  ;        21763 (100%) are still being kept.
% 9.08/9.28  ; 
% 9.08/9.28  ; Run time in seconds excluding printing time:
% 9.08/9.28  ;     0.016   0%   Read assertion file          (1 call)
% 9.08/9.28  ;     0.002   0%   Assert                       (81 calls)
% 9.08/9.28  ;     1.630  19%   Process new row              (22,900 calls)
% 9.08/9.28  ;     6.281  71%   Resolution                   (780 calls)
% 9.08/9.28  ;     0.018   0%   Paramodulation               (390 calls)
% 9.08/9.28  ;     0.000   0%   Factoring                    (8 calls)
% 9.08/9.28  ;     0.002   0%   Condensing                   (108 calls)
% 9.08/9.28  ;     0.013   0%   Forward subsumption          (108 calls)
% 9.08/9.28  ;     0.002   0%   Backward subsumption         (102 calls)
% 9.08/9.28  ;     0.001   0%   Clause clause subsumption    (14 calls)
% 9.08/9.28  ;     0.238   3%   Forward simplification       (22,890 calls)
% 9.08/9.28  ;     0.477   5%   Backward simplification      (21,857 calls)
% 9.08/9.28  ;     0.000   0%   Ordering                     (458 calls)
% 9.08/9.28  ;     0.000   0%   Sortal reasoning             (32 calls)
% 9.08/9.28  ;     0.000   0%   Purity testing               (1 call)
% 9.08/9.28  ;     0.117   1%   Other
% 9.08/9.28  ;     8.797        Total
% 9.08/9.28  ;     8.801        Real time
% 9.08/9.28  ; 
% 9.08/9.28  ; Term-hash-array has 43,440 terms in all.
% 9.08/9.28  ; Feature-vector-row-index has 95 entries (99 at peak, 102 added, 7 deleted).
% 9.08/9.28  ; Feature-vector-row-index has 524 nodes (563 at peak, 590 added, 66 deleted).
% 9.08/9.28  ;  Retrieved 13 possibly forward subsuming rows in 108 calls.
% 9.08/9.28  ;  Retrieved 7 possibly backward subsumed rows in 102 calls.
% 9.08/9.28  ; Path-index has 43,322 entries (43,394 at peak, 43,461 added, 139 deleted).
% 9.08/9.28  ; Path-index has 5,323 nodes (5,348 at peak, 5,445 added, 122 deleted).
% 9.08/9.28  ; Trie-index has 43,322 entries (43,394 at peak, 43,461 added, 139 deleted).
% 9.08/9.28  ; Trie-index has 111,072 nodes (111,581 at peak, 111,901 added, 829 deleted).
% 9.08/9.28  ; Retrieved 12,218 generalization terms in 38,861 calls.
% 9.08/9.28  ; Retrieved 21,780 instance terms in 21,754 calls.
% 9.08/9.28  ; Retrieved 9,029,085 unifiable terms in 1,419,335 calls.
% 9.08/9.28  ; 
% 9.08/9.28  ; The agenda of rows to process has 11 entries:
% 9.08/9.28  ;     1 with value 8               8 with value 10               2 with value 11
% 9.08/9.28  ; The agenda of rows to give has 21383 entries:
% 9.08/9.28  ;     1 with value (4 10)       3153 with value (4 18)           5 with value (4 27)
% 9.08/9.28  ;     2 with value (4 11)       4468 with value (4 19)          12 with value (4 30)
% 9.08/9.28  ;     3 with value (4 12)       5431 with value (4 20)          10 with value (4 32)
% 9.08/9.28  ;   164 with value (4 13)       3722 with value (4 21)           6 with value (4 33)
% 9.08/9.28  ;   280 with value (4 14)        244 with value (4 22)           1 with value (4 36)
% 9.08/9.28  ;   591 with value (4 15)         45 with value (4 23)           4 with value (4 37)
% 9.08/9.28  ;  1128 with value (4 16)         14 with value (4 24)           6 with value (4 42)
% 9.08/9.28  ;  2045 with value (4 17)         42 with value (4 25)           6 with value (4 54)
% 9.08/9.28  Evaluation took:
% 9.08/9.28    8.803 seconds of real time
% 9.08/9.28    8.492627 seconds of user run time
% 9.08/9.28    0.3079 seconds of system run time
% 9.08/9.28    [Run times include 1.271 seconds GC run time.]
% 9.08/9.28    0 calls to %EVAL
% 9.08/9.28    0 page faults and
% 9.08/9.28    734,464,784 bytes consed.
% 9.08/9.28  :PROOF-FOUND
% 9.08/9.28  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-20T11:32:38
% 9.08/9.29  :PROOF-FOUND
% 9.08/9.29  * 
%------------------------------------------------------------------------------