↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET104-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n019.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:26 EDT 2022

% Result   : Unsatisfiable 1.07s 1.25s
% Output   : Refutation 1.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   19 (  15 unt;   3 nHn;   9 RR)
%            Number of literals    :   24 (  14 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   21 (   2 sgn)

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

cnf(class_elements_are_sets,axiom,
    subclass(X,universal_class),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(ordered_pair,axiom,
    unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

cnf(union,axiom,
    complement(intersection(complement(X),complement(Y))) = union(X,Y),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).

cnf(unordered_pair_equals_singleton1,axiom,
    ( member(X,universal_class)
    | unordered_pair(X,Y) = singleton(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).

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

cnf(unordered_pairs_and_singletons,axiom,
    unordered_pair(X,Y) = union(singleton(X),singleton(Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pairs_and_singletons) ).

cnf(148,plain,
    unordered_pair(X,Y) = complement(intersection(complement(singleton(X)),complement(singleton(Y)))),
    inference('REWRITE',[status(thm)],[unordered_pairs_and_singletons,union,theory(equality)]) ).

cnf(prove_property_2_of_ordered_pair_2,negated_conjecture,
    unordered_pair(null_class,singleton(singleton(y))) != ordered_pair(x,y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_2_of_ordered_pair_2) ).

cnf(154,plain,
    complement(intersection(complement(singleton(null_class)),complement(singleton(singleton(singleton(y)))))) != ordered_pair(x,y),
    inference('REWRITE',[status(thm)],[prove_property_2_of_ordered_pair_2,148,theory(equality)]) ).

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

cnf(158,plain,
    complement(intersection(complement(singleton(singleton(X))),complement(singleton(complement(intersection(complement(singleton(X)),complement(singleton(singleton(Y))))))))) = ordered_pair(X,Y),
    inference('REWRITE',[status(thm)],[ordered_pair,148,theory(equality)]) ).

cnf(181,plain,
    complement(intersection(complement(singleton(null_class)),complement(singleton(singleton(singleton(y)))))) != complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(singleton(y))))))))),
    inference('REWRITE',[status(thm)],[154,158,theory(equality)]) ).

cnf(188,plain,
    ( member(X,universal_class)
    | complement(intersection(complement(singleton(X)),complement(singleton(Y)))) = singleton(Y) ),
    inference('REWRITE',[status(thm)],[unordered_pair_equals_singleton1,148,theory(equality)]) ).

cnf(220,plain,
    singleton(x) = null_class,
    inference('HYPERRESOLVE',[status(thm)],[prove_property_2_of_ordered_pair_3,singleton_is_null_class]) ).

cnf(221,plain,
    complement(intersection(complement(singleton(null_class)),complement(singleton(singleton(singleton(y)))))) != complement(intersection(complement(singleton(null_class)),complement(singleton(complement(intersection(complement(null_class),complement(singleton(singleton(y))))))))),
    inference('REWRITE',[status(thm)],[181,220,theory(equality)]) ).

cnf(244,plain,
    ~ member(x,X),
    inference('UR-RESOLVE',[status(thm)],[subclass_members,class_elements_are_sets,prove_property_2_of_ordered_pair_3]) ).

cnf(1269,plain,
    complement(intersection(complement(null_class),complement(singleton(X)))) = singleton(X),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[244,188]),220,theory(equality)]) ).

cnf(1270,plain,
    $false,
    inference('REWRITE',[status(thm)],[221,1269,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET104-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n019.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 : Sat Jul  9 18:00:23 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-09T18:00:23
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-07-09T18:00:23
% 0.20/0.52  
% 0.20/0.52  ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 1.07/1.25  ; Declaring unordered_pair to be commutative.
% 1.07/1.25  
% 1.07/1.25  #||
% 1.07/1.25  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.07/1.25  % SZS output start Refutation
% See solution above
% 1.10/1.25  ||#
% 1.10/1.25  
% 1.10/1.25  ; Summary of computation:
% 1.10/1.25  ;      2479 formulas have been input or derived (from 144 formulas).
% 1.10/1.25  ;      1270 (51%) were retained.  Of these,
% 1.10/1.25  ;          107 ( 8%) were simplified or subsumed later,
% 1.10/1.25  ;         1163 (92%) are still being kept.
% 1.10/1.25  ; 
% 1.10/1.25  ; Run time in seconds excluding printing time:
% 1.10/1.25  ;     0.027   3%   Read assertion file          (1 call)
% 1.10/1.25  ;     0.005   1%   Assert                       (149 calls)
% 1.10/1.25  ;     0.163  21%   Process new row              (2,272 calls)
% 1.10/1.25  ;     0.075  10%   Resolution                   (286 calls)
% 1.10/1.26  ;     0.052   7%   Paramodulation               (143 calls)
% 1.10/1.26  ;     0.000   0%   Factoring                    (14 calls)
% 1.10/1.26  ;     0.023   3%   Condensing                   (1,239 calls)
% 1.10/1.26  ;     0.200  26%   Forward subsumption          (1,239 calls)
% 1.10/1.26  ;     0.051   7%   Backward subsumption         (986 calls)
% 1.10/1.26  ;     0.018   2%   Clause clause subsumption    (5,862 calls)
% 1.10/1.26  ;     0.111  14%   Forward simplification       (2,269 calls)
% 1.10/1.26  ;     0.014   2%   Backward simplification      (1,255 calls)
% 1.10/1.26  ;     0.009   1%   Ordering                     (4,336 calls)
% 1.10/1.26  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.10/1.26  ;     0.000   0%   Purity testing               (1 call)
% 1.10/1.26  ;     0.031   4%   Other
% 1.10/1.26  ;     0.779        Total
% 1.10/1.26  ;     0.781        Real time
% 1.10/1.26  ; 
% 1.10/1.26  ; Term-hash-array has 3,958 terms in all.
% 1.10/1.26  ; Feature-vector-row-index has 921 entries (937 at peak, 986 added, 65 deleted).
% 1.10/1.26  ; Feature-vector-row-index has 8,786 nodes (8,929 at peak, 9,333 added, 547 deleted).
% 1.10/1.26  ;  Retrieved 8,874 possibly forward subsuming rows in 1,239 calls.
% 1.10/1.26  ;  Retrieved 351 possibly backward subsumed rows in 986 calls.
% 1.10/1.26  ; Path-index has 3,853 entries (3,872 at peak, 4,100 added, 247 deleted).
% 1.10/1.26  ; Path-index has 9,488 nodes (9,523 at peak, 9,844 added, 356 deleted).
% 1.10/1.26  ; Trie-index has 3,853 entries (3,872 at peak, 4,100 added, 247 deleted).
% 1.10/1.26  ; Trie-index has 17,082 nodes (17,209 at peak, 18,036 added, 954 deleted).
% 1.10/1.26  ; Retrieved 9,668 generalization terms in 27,575 calls.
% 1.10/1.26  ; Retrieved 398 instance terms in 268 calls.
% 1.10/1.26  ; Retrieved 46,758 unifiable terms in 2,034 calls.
% 1.10/1.26  ; 
% 1.10/1.26  ; The agenda of backward simplifiable rows to process has 2 entries:
% 1.10/1.26  ;     2 with value 0
% 1.10/1.26  ; The agenda of rows to process has 11 entries:
% 1.10/1.26  ;     1 with value 18              1 with value 31               7 with value 33
% 1.10/1.26  ;     2 with value 21
% 1.10/1.26  ; The agenda of rows to give has 1022 entries:
% 1.10/1.26  ;     2 with value (4 6)          12 with value (4 44)           2 with value (4 83)
% 1.10/1.26  ;    15 with value (4 7)           8 with value (4 45)           4 with value (4 84)
% 1.10/1.26  ;    13 with value (4 8)          19 with value (4 46)           7 with value (4 87)
% 1.10/1.26  ;    15 with value (4 9)           8 with value (4 47)           4 with value (4 90)
% 1.10/1.26  ;    13 with value (4 10)         19 with value (4 48)           3 with value (4 93)
% 1.10/1.26  ;     9 with value (4 11)         14 with value (4 49)           2 with value (4 96)
% 1.10/1.26  ;    11 with value (4 12)         15 with value (4 50)           3 with value (4 99)
% 1.10/1.26  ;    12 with value (4 13)         17 with value (4 51)           2 with value (4 100)
% 1.10/1.26  ;    15 with value (4 14)         16 with value (4 52)           1 with value (4 103)
% 1.10/1.26  ;    19 with value (4 15)          9 with value (4 53)           1 with value (4 105)
% 1.10/1.26  ;    14 with value (4 16)         13 with value (4 54)           2 with value (4 106)
% 1.10/1.26  ;    22 with value (4 17)          9 with value (4 55)           3 with value (4 109)
% 1.10/1.26  ;    21 with value (4 18)          8 with value (4 56)           1 with value (4 110)
% 1.10/1.26  ;    27 with value (4 19)         16 with value (4 57)           1 with value (4 111)
% 1.10/1.26  ;    19 with value (4 20)         12 with value (4 58)           1 with value (4 113)
% 1.10/1.26  ;    18 with value (4 21)         17 with value (4 59)           1 with value (4 125)
% 1.10/1.26  ;    14 with value (4 22)          2 with value (4 60)           2 with value (4 129)
% 1.10/1.26  ;    24 with value (4 23)          7 with value (4 61)           3 with value (4 139)
% 1.10/1.26  ;    23 with value (4 24)          9 with value (4 62)           1 with value (4 141)
% 1.10/1.26  ;    17 with value (4 25)          7 with value (4 63)           1 with value (4 142)
% 1.10/1.26  ;    10 with value (4 26)          5 with value (4 64)           3 with value (4 144)
% 1.10/1.26  ;    17 with value (4 27)         12 with value (4 65)           1 with value (4 149)
% 1.10/1.26  ;    13 with value (4 28)         10 with value (4 66)           1 with value (4 150)
% 1.10/1.26  ;    10 with value (4 29)          8 with value (4 67)           1 with value (4 152)
% 1.10/1.26  ;    15 with value (4 30)          9 with value (4 68)           1 with value (4 168)
% 1.10/1.26  ;    23 with value (4 31)         12 with value (4 69)           1 with value (4 173)
% 1.10/1.26  ;    10 with value (4 32)         10 with value (4 70)           1 with value (4 183)
% 1.10/1.26  ;    12 with value (4 33)         13 with value (4 71)           2 with value (4 187)
% 1.10/1.26  ;    12 with value (4 34)         10 with value (4 72)           1 with value (4 198)
% 1.10/1.26  ;    13 with value (4 35)          2 with value (4 73)           1 with value (4 208)
% 1.10/1.26  ;    12 with value (4 36)          5 with value (4 74)           2 with value (4 209)
% 1.10/1.26  ;     6 with value (4 37)          5 with value (4 75)           1 with value (4 210)
% 1.10/1.26  ;    12 with value (4 38)          2 with value (4 76)           2 with value (4 214)
% 1.10/1.26  ;    17 with value (4 39)          6 with value (4 77)           1 with value (4 216)
% 1.10/1.26  ;    32 with value (4 40)          9 with value (4 78)           1 with value (4 238)
% 1.10/1.26  ;    19 with value (4 41)          1 with value (4 79)           1 with value (4 239)
% 1.10/1.26  ;    17 with value (4 42)          4 with value (4 80)           1 with value (4 349)
% 1.10/1.26  ;    20 with value (4 43)          2 with value (4 81)
% 1.10/1.26  Evaluation took:
% 1.10/1.26    0.782 seconds of real time
% 1.10/1.26    0.736109 seconds of user run time
% 1.10/1.26    0.045956 seconds of system run time
% 1.10/1.26    [Run times include 0.076 seconds GC run time.]
% 1.10/1.26    0 calls to %EVAL
% 1.10/1.26    0 page faults and
% 1.10/1.26    69,522,112 bytes consed.
% 1.10/1.26  :PROOF-FOUND
% 1.10/1.26  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-09T18:00:24
% 1.10/1.26  :PROOF-FOUND
% 1.10/1.26  * 
%------------------------------------------------------------------------------