TSTP Solution File: SET085-7 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET085-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n026.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:07:06 EDT 2022

% Result   : Unsatisfiable 0.42s 0.59s
% Output   : Refutation 0.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :    8 (   6 unt;   1 nHn;   8 RR)
%            Number of literals    :   11 (   5 equ;   4 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
    ( ~ member(X,unordered_pair(Y,Z))
    | X = Y
    | X = Z ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).

cnf(set_in_its_singleton,axiom,
    ( ~ member(X,universal_class)
    | member(X,singleton(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',set_in_its_singleton) ).

cnf(prove_singleton_in_unordered_pair3_1,negated_conjecture,
    unordered_pair(y,z) = singleton(x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_1) ).

cnf(prove_singleton_in_unordered_pair3_2,negated_conjecture,
    member(x,universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_2) ).

cnf(prove_singleton_in_unordered_pair3_3,negated_conjecture,
    x != y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_3) ).

cnf(prove_singleton_in_unordered_pair3_4,negated_conjecture,
    x != z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair3_4) ).

cnf(165,plain,
    member(x,singleton(x)),
    inference('HYPERRESOLVE',[status(thm)],[set_in_its_singleton,prove_singleton_in_unordered_pair3_2]) ).

cnf(303,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[unordered_pair_member,prove_singleton_in_unordered_pair3_3,prove_singleton_in_unordered_pair3_4]),165,prove_singleton_in_unordered_pair3_1,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET085-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Sun Jul 10 06:43:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 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/sandbox2/benchmark/theBenchmark.p 2022-07-10T06:43:41
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-10T06:43:41
% 0.20/0.51  
% 0.20/0.51  ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.42/0.59  ; Declaring unordered_pair to be commutative.
% 0.42/0.59  
% 0.42/0.59  #||
% 0.42/0.59  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.42/0.59  % SZS output start Refutation
% See solution above
% 0.42/0.59  ||#
% 0.42/0.59  
% 0.42/0.59  ; Summary of computation:
% 0.42/0.59  ;       603 formulas have been input or derived (from 84 formulas).
% 0.42/0.59  ;       303 (50%) were retained.  Of these,
% 0.42/0.59  ;           14 ( 5%) were simplified or subsumed later,
% 0.42/0.59  ;          289 (95%) are still being kept.
% 0.42/0.59  ; 
% 0.42/0.59  ; Run time in seconds excluding printing time:
% 0.42/0.59  ;     0.023  20%   Read assertion file          (1 call)
% 0.42/0.59  ;     0.003   3%   Assert                       (132 calls)
% 0.42/0.59  ;     0.025  22%   Process new row              (521 calls)
% 0.42/0.59  ;     0.009   8%   Resolution                   (166 calls)
% 0.42/0.59  ;     0.000   0%   Paramodulation               (83 calls)
% 0.42/0.59  ;     0.000   0%   Factoring                    (6 calls)
% 0.42/0.59  ;     0.004   3%   Condensing                   (205 calls)
% 0.42/0.59  ;     0.008   7%   Forward subsumption          (205 calls)
% 0.42/0.59  ;     0.002   2%   Backward subsumption         (175 calls)
% 0.42/0.59  ;     0.002   2%   Clause clause subsumption    (144 calls)
% 0.42/0.59  ;     0.006   5%   Forward simplification       (520 calls)
% 0.42/0.59  ;     0.005   4%   Backward simplification      (291 calls)
% 0.42/0.59  ;     0.003   3%   Ordering                     (271 calls)
% 0.42/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.42/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.42/0.59  ;     0.026  22%   Other
% 0.42/0.59  ;     0.116        Total
% 0.42/0.59  ;     0.117        Real time
% 0.42/0.59  ; 
% 0.42/0.59  ; Term-hash-array has 582 terms in all.
% 0.42/0.59  ; Feature-vector-row-index has 175 entries (175 at peak, 175 added, 0 deleted).
% 0.42/0.59  ; Feature-vector-row-index has 874 nodes (874 at peak, 874 added, 0 deleted).
% 0.42/0.59  ;  Retrieved 168 possibly forward subsuming rows in 205 calls.
% 0.42/0.59  ;  Retrieved 24 possibly backward subsumed rows in 175 calls.
% 0.42/0.59  ; Path-index has 590 entries (590 at peak, 593 added, 3 deleted).
% 0.42/0.59  ; Path-index has 1,541 nodes (1,541 at peak, 1,544 added, 3 deleted).
% 0.42/0.59  ; Trie-index has 590 entries (590 at peak, 593 added, 3 deleted).
% 0.42/0.59  ; Trie-index has 1,622 nodes (1,622 at peak, 1,629 added, 7 deleted).
% 0.42/0.59  ; Retrieved 379 generalization terms in 1,057 calls.
% 0.42/0.59  ; Retrieved 135 instance terms in 115 calls.
% 0.42/0.59  ; Retrieved 5,456 unifiable terms in 672 calls.
% 0.42/0.59  ; 
% 0.42/0.59  ; The agenda of rows to process has 13 entries:
% 0.42/0.59  ;     8 with value 8               2 with value 15               1 with value 28
% 0.42/0.59  ;     1 with value 14              1 with value 26
% 0.42/0.59  ; The agenda of input rows to give has 40 entries:
% 0.42/0.59  ;     8 with value 15              4 with value 20               1 with value 31
% 0.42/0.59  ;     5 with value 16              3 with value 21               1 with value 34
% 0.42/0.59  ;     3 with value 17              4 with value 22               2 with value 35
% 0.42/0.59  ;     4 with value 18              1 with value 27               1 with value 50
% 0.42/0.59  ;     1 with value 19              2 with value 30
% 0.42/0.59  ; The agenda of rows to give has 166 entries:
% 0.42/0.59  ;     2 with value (4 4)           8 with value (4 12)           9 with value (4 18)
% 0.42/0.59  ;     2 with value (4 5)           9 with value (4 13)           9 with value (4 19)
% 0.42/0.59  ;    22 with value (4 7)          12 with value (4 14)          11 with value (4 20)
% 0.42/0.59  ;    18 with value (4 8)          12 with value (4 15)           4 with value (4 22)
% 0.42/0.59  ;     7 with value (4 9)           9 with value (4 16)           3 with value (4 24)
% 0.42/0.59  ;    11 with value (4 10)          9 with value (4 17)           2 with value (4 30)
% 0.42/0.59  ;     7 with value (4 11)
% 0.42/0.59  Evaluation took:
% 0.42/0.59    0.118 seconds of real time
% 0.42/0.59    0.107122 seconds of user run time
% 0.42/0.59    0.010942 seconds of system run time
% 0.42/0.59    0 calls to %EVAL
% 0.42/0.59    0 page faults and
% 0.42/0.59    5,863,328 bytes consed.
% 0.42/0.59  :PROOF-FOUND
% 0.42/0.59  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T06:43:41
% 0.42/0.59  :PROOF-FOUND
% 0.42/0.59  * 
%------------------------------------------------------------------------------