TSTP Solution File: SET013-4 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET013-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n029.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:05:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(extensionality1,axiom,
    ( little_set(f1(X,Y))
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality1) ).

cnf(extensionality2,axiom,
    ( member(f1(X,Y),X)
    | member(f1(X,Y),Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).

cnf(extensionality3,axiom,
    ( ~ member(f1(X,Y),X)
    | ~ member(f1(X,Y),Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality3) ).

cnf(intersection1,axiom,
    ( ~ member(X,intersection(Y,Z))
    | member(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).

cnf(intersection2,axiom,
    ( ~ member(X,intersection(Y,Z))
    | member(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).

cnf(intersection3,axiom,
    ( member(X,intersection(Y,Z))
    | ~ member(X,Y)
    | ~ member(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).

cnf(universal_set,axiom,
    ( member(X,universal_set)
    | ~ little_set(X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',universal_set) ).

cnf(intersection_of_a_and_b_is_c,hypothesis,
    intersection(as,bs) = cs,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_a_and_b_is_c) ).

cnf(intersection_of_b_and_a_is_d,hypothesis,
    intersection(bs,as) = ds,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_b_and_a_is_d) ).

cnf(prove_c_equals_d,negated_conjecture,
    cs != ds,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).

cnf(13,plain,
    little_set(f1(cs,ds)),
    inference('UR-RESOLVE',[status(thm)],[extensionality1,prove_c_equals_d]) ).

cnf(17,plain,
    ( ~ member(X,cs)
    | member(X,as) ),
    inference('PARAMODULATE',[status(thm)],[intersection1,intersection_of_a_and_b_is_c,theory(equality)]) ).

cnf(18,plain,
    ( ~ member(X,ds)
    | member(X,bs) ),
    inference('PARAMODULATE',[status(thm)],[intersection1,intersection_of_b_and_a_is_d,theory(equality)]) ).

cnf(20,plain,
    ( ~ member(X,cs)
    | member(X,bs) ),
    inference('PARAMODULATE',[status(thm)],[intersection2,intersection_of_a_and_b_is_c,theory(equality)]) ).

cnf(21,plain,
    ( ~ member(X,ds)
    | member(X,as) ),
    inference('PARAMODULATE',[status(thm)],[intersection2,intersection_of_b_and_a_is_d,theory(equality)]) ).

cnf(30,plain,
    member(f1(cs,ds),universal_set),
    inference('HYPERRESOLVE',[status(thm)],[universal_set,13]) ).

cnf(43,plain,
    ( member(f1(cs,ds),cs)
    | member(f1(cs,ds),intersection(universal_set,ds)) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[intersection3,30,extensionality2]),prove_c_equals_d]) ).

cnf(2936,plain,
    ( member(f1(cs,ds),cs)
    | member(f1(cs,ds),ds) ),
    inference('HYPERRESOLVE',[status(thm)],[intersection2,43]) ).

cnf(2942,plain,
    ( member(f1(cs,ds),cs)
    | member(f1(cs,ds),as) ),
    inference('HYPERRESOLVE',[status(thm)],[21,2936]) ).

cnf(2943,plain,
    ( member(f1(cs,ds),cs)
    | member(f1(cs,ds),bs) ),
    inference('HYPERRESOLVE',[status(thm)],[18,2936]) ).

cnf(10094,plain,
    member(f1(cs,ds),as),
    inference('HYPERRESOLVE',[status(thm)],[17,2942]) ).

cnf(10143,plain,
    member(f1(cs,ds),bs),
    inference('HYPERRESOLVE',[status(thm)],[20,2943]) ).

cnf(10145,plain,
    member(f1(cs,ds),ds),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[intersection3,10143,10094]),intersection_of_b_and_a_is_d,theory(equality)]) ).

cnf(10148,plain,
    member(f1(cs,ds),cs),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[intersection3,10143,10094]),intersection_of_a_and_b_is_c,theory(equality)]) ).

cnf(10155,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[extensionality3,10145,prove_c_equals_d]),10148]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SET013-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n029.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.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 05:45:31 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T05:45:31
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-07-10T05:45:31
% 10.07/10.30  
% 10.07/10.30  
% 10.07/10.30  #||
% 10.07/10.30  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.07/10.30  % SZS output start Refutation
% See solution above
% 10.07/10.30  ||#
% 10.07/10.30  
% 10.07/10.30  ; Summary of computation:
% 10.07/10.30  ;     12263 formulas have been input or derived (from 216 formulas).
% 10.07/10.30  ;     10155 (83%) were retained.  Of these,
% 10.07/10.30  ;           57 ( 1%) were simplified or subsumed later,
% 10.07/10.30  ;        10098 (99%) are still being kept.
% 10.07/10.30  ; 
% 10.07/10.30  ; Run time in seconds excluding printing time:
% 10.07/10.30  ;     0.002   0%   Read assertion file          (1 call)
% 10.07/10.30  ;     0.000   0%   Assert                       (12 calls)
% 10.07/10.30  ;     0.835   8%   Process new row              (12,123 calls)
% 10.07/10.30  ;     0.280   3%   Resolution                   (430 calls)
% 10.07/10.30  ;     0.040   0%   Paramodulation               (215 calls)
% 10.07/10.30  ;     0.002   0%   Factoring                    (184 calls)
% 10.07/10.30  ;     0.024   0%   Condensing                   (11,254 calls)
% 10.07/10.30  ;     3.785  38%   Forward subsumption          (11,254 calls)
% 10.07/10.30  ;     1.385  14%   Backward subsumption         (10,096 calls)
% 10.07/10.30  ;     3.008  31%   Clause clause subsumption    (2,107,888 calls)
% 10.07/10.30  ;     0.345   4%   Forward simplification       (12,015 calls)
% 10.07/10.30  ;     0.016   0%   Backward simplification      (10,155 calls)
% 10.07/10.30  ;     0.043   0%   Ordering                     (50,727 calls)
% 10.07/10.30  ;     0.000   0%   Sortal reasoning             (32 calls)
% 10.07/10.30  ;     0.000   0%   Purity testing               (1 call)
% 10.07/10.30  ;     0.071   1%   Other
% 10.07/10.30  ;     9.836        Total
% 10.07/10.30  ;     9.838        Real time
% 10.07/10.30  ; 
% 10.07/10.30  ; Term-hash-array has 14,535 terms in all.
% 10.07/10.30  ; Feature-vector-row-index has 10,049 entries (10,090 at peak, 10,096 added, 47 deleted).
% 10.07/10.30  ; Feature-vector-row-index has 5,753 nodes (5,831 at peak, 5,850 added, 97 deleted).
% 10.07/10.30  ;  Retrieved 1,532,758 possibly forward subsuming rows in 11,254 calls.
% 10.07/10.30  ;  Retrieved 593,228 possibly backward subsumed rows in 10,096 calls.
% 10.07/10.30  ; Path-index has 14,480 entries (14,513 at peak, 14,541 added, 61 deleted).
% 10.07/10.30  ; Path-index has 420 nodes (420 at peak, 430 added, 10 deleted).
% 10.07/10.30  ; Trie-index has 14,480 entries (14,513 at peak, 14,541 added, 61 deleted).
% 10.07/10.30  ; Trie-index has 22,452 nodes (22,503 at peak, 22,560 added, 108 deleted).
% 10.07/10.30  ; Retrieved 3,744 generalization terms in 64,583 calls.
% 10.07/10.30  ; Retrieved 60 instance terms in 58 calls.
% 10.07/10.30  ; Retrieved 361,785 unifiable terms in 2,214 calls.
% 10.07/10.30  ; 
% 10.07/10.30  ; The agenda of rows to process has 31 entries:
% 10.07/10.30  ;    16 with value 17              2 with value 21               1 with value 28
% 10.07/10.30  ;    12 with value 20
% 10.07/10.30  ; The agenda of rows to give has 9892 entries:
% 10.07/10.30  ;     1 with value (4 14)       2130 with value (4 23)           4 with value (4 28)
% 10.07/10.30  ;     3 with value (4 16)         10 with value (4 24)           8 with value (4 29)
% 10.07/10.30  ;     2 with value (4 19)       2356 with value (4 25)          32 with value (4 31)
% 10.07/10.30  ;   466 with value (4 20)       1736 with value (4 26)          48 with value (4 33)
% 10.07/10.30  ;   381 with value (4 21)       2032 with value (4 27)          16 with value (4 35)
% 10.07/10.30  ;   667 with value (4 22)
% 10.07/10.30  Evaluation took:
% 10.07/10.30    9.84 seconds of real time
% 10.07/10.30    7.377232 seconds of user run time
% 10.07/10.30    2.4618 seconds of system run time
% 10.07/10.30    [Run times include 0.751 seconds GC run time.]
% 10.07/10.30    0 calls to %EVAL
% 10.07/10.30    0 page faults and
% 10.07/10.30    1,154,586,160 bytes consed.
% 10.07/10.30  :PROOF-FOUND
% 10.07/10.30  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T05:45:41
% 10.07/10.30  :PROOF-FOUND
% 10.07/10.30  * 
%------------------------------------------------------------------------------