TSTP Solution File: SET005-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n018.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:33 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(member_of_intersection_is_member_of_set1,axiom,
    ( ~ intersection(X,Y,Z)
    | ~ member(U,Z)
    | member(U,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set1) ).

cnf(member_of_intersection_is_member_of_set2,axiom,
    ( ~ intersection(X,Y,Z)
    | ~ member(U,Z)
    | member(U,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_intersection_is_member_of_set2) ).

cnf(member_of_both_is_member_of_intersection,axiom,
    ( ~ intersection(X,Y,Z)
    | ~ member(U,Y)
    | ~ member(U,X)
    | member(U,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',member_of_both_is_member_of_intersection) ).

cnf(intersection_axiom1,axiom,
    ( member(h(X,Y,Z),Z)
    | intersection(X,Y,Z)
    | member(h(X,Y,Z),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom1) ).

cnf(intersection_axiom2,axiom,
    ( member(h(X,Y,Z),Z)
    | intersection(X,Y,Z)
    | member(h(X,Y,Z),Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom2) ).

cnf(intersection_axiom3,axiom,
    ( ~ member(h(X,Y,Z),Z)
    | ~ member(h(X,Y,Z),Y)
    | ~ member(h(X,Y,Z),X)
    | intersection(X,Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET001-2.ax',intersection_axiom3) ).

cnf(a_intersection_b,axiom,
    intersection(a,b,aIb),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_b) ).

cnf(b_intersection_c,axiom,
    intersection(b,c,bIc),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_intersection_c) ).

cnf(a_intersection_bIc,axiom,
    intersection(a,bIc,aIbIc),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_intersection_bIc) ).

cnf(prove_aIb_intersection_c_is_aIbIc,negated_conjecture,
    ~ intersection(aIb,c,aIbIc),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_aIb_intersection_c_is_aIbIc) ).

cnf(18,plain,
    ( member(h(aIb,c,aIbIc),aIbIc)
    | member(h(aIb,c,aIbIc),aIb) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_aIb_intersection_c_is_aIbIc,intersection_axiom1]) ).

cnf(20,plain,
    ( member(h(aIb,c,aIbIc),aIbIc)
    | member(h(aIb,c,aIbIc),c) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_aIb_intersection_c_is_aIbIc,intersection_axiom2]) ).

cnf(22,plain,
    ( member(h(aIb,c,aIbIc),aIb)
    | member(h(aIb,c,aIbIc),bIc) ),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set2,18,a_intersection_bIc]) ).

cnf(23,plain,
    ( member(h(aIb,c,aIbIc),aIb)
    | member(h(aIb,c,aIbIc),a) ),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set1,18,a_intersection_bIc]) ).

cnf(41,plain,
    ( member(h(aIb,c,aIbIc),aIb)
    | member(h(aIb,c,aIbIc),b) ),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set1,22,b_intersection_c]) ).

cnf(54,plain,
    member(h(aIb,c,aIbIc),a),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set1,23,a_intersection_b]) ).

cnf(127,plain,
    member(h(aIb,c,aIbIc),aIb),
    inference('HYPERRESOLVE',[status(thm)],[member_of_both_is_member_of_intersection,41,a_intersection_b,54]) ).

cnf(128,plain,
    member(h(aIb,c,aIbIc),b),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set2,127,a_intersection_b]) ).

cnf(148,plain,
    ( member(h(aIb,c,aIbIc),aIbIc)
    | member(h(aIb,c,aIbIc),bIc) ),
    inference('HYPERRESOLVE',[status(thm)],[member_of_both_is_member_of_intersection,128,b_intersection_c,20]) ).

cnf(2879,plain,
    member(h(aIb,c,aIbIc),aIbIc),
    inference('HYPERRESOLVE',[status(thm)],[member_of_both_is_member_of_intersection,148,a_intersection_bIc,54]) ).

cnf(2880,plain,
    member(h(aIb,c,aIbIc),bIc),
    inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set2,2879,a_intersection_bIc]) ).

cnf(2881,plain,
    ~ member(h(aIb,c,aIbIc),c),
    inference('UR-RESOLVE',[status(thm)],[intersection_axiom3,2879,127,prove_aIb_intersection_c_is_aIbIc]) ).

cnf(3169,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[member_of_intersection_is_member_of_set2,2880,b_intersection_c]),2881]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n018.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 12:40:57 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p 2022-07-10T12:40:58
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-07-10T12:40:58
% 4.58/4.74  
% 4.58/4.74  
% 4.58/4.74  #||
% 4.58/4.74  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.58/4.74  % SZS output start Refutation
% See solution above
% 4.58/4.74  ||#
% 4.58/4.74  
% 4.58/4.74  ; Summary of computation:
% 4.58/4.74  ;     15942 formulas have been input or derived (from 194 formulas).
% 4.58/4.74  ;      3169 (20%) were retained.  Of these,
% 4.58/4.74  ;         1577 (50%) were simplified or subsumed later,
% 4.58/4.74  ;         1592 (50%) are still being kept.
% 4.58/4.74  ; 
% 4.58/4.74  ; Run time in seconds excluding printing time:
% 4.58/4.74  ;     0.004   0%   Read assertion file          (1 call)
% 4.58/4.74  ;     0.000   0%   Assert                       (16 calls)
% 4.58/4.74  ;     0.271   6%   Process new row              (14,481 calls)
% 4.58/4.74  ;     0.380   9%   Resolution                   (386 calls)
% 4.58/4.74  ;     0.002   0%   Paramodulation               (193 calls)
% 4.58/4.74  ;     0.001   0%   Factoring                    (147 calls)
% 4.58/4.74  ;     0.086   2%   Condensing                   (11,831 calls)
% 4.58/4.74  ;     2.404  56%   Forward subsumption          (11,831 calls)
% 4.58/4.74  ;     0.157   4%   Backward subsumption         (3,126 calls)
% 4.58/4.74  ;     0.430  10%   Clause clause subsumption    (184,307 calls)
% 4.58/4.74  ;     0.300   7%   Forward simplification       (12,864 calls)
% 4.58/4.74  ;     0.053   1%   Backward simplification      (3,169 calls)
% 4.58/4.74  ;     0.101   2%   Ordering                     (49,177 calls)
% 4.58/4.74  ;     0.000   0%   Sortal reasoning             (32 calls)
% 4.58/4.74  ;     0.000   0%   Purity testing               (1 call)
% 4.58/4.74  ;     0.084   2%   Other
% 4.58/4.74  ;     4.273        Total
% 4.58/4.74  ;     4.275        Real time
% 4.58/4.74  ; 
% 4.58/4.74  ; Term-hash-array has 717 terms in all.
% 4.58/4.74  ; Feature-vector-row-index has 1,549 entries (2,283 at peak, 3,126 added, 1,577 deleted).
% 4.58/4.74  ; Feature-vector-row-index has 3,271 nodes (6,313 at peak, 9,018 added, 5,747 deleted).
% 4.58/4.74  ;  Retrieved 490,823 possibly forward subsuming rows in 11,831 calls.
% 4.58/4.74  ;  Retrieved 24,331 possibly backward subsumed rows in 3,126 calls.
% 4.58/4.74  ; Path-index has 599 entries (646 at peak, 831 added, 232 deleted).
% 4.58/4.74  ; Path-index has 138 nodes (138 at peak, 186 added, 48 deleted).
% 4.58/4.74  ; Trie-index has 599 entries (646 at peak, 831 added, 232 deleted).
% 4.58/4.74  ; Trie-index has 614 nodes (640 at peak, 905 added, 291 deleted).
% 4.58/4.74  ; Retrieved 10,381 generalization terms in 55,159 calls.
% 4.58/4.74  ; Retrieved 53 instance terms in 42 calls.
% 4.58/4.74  ; Retrieved 95,210 unifiable terms in 5,402 calls.
% 4.58/4.74  ; 
% 4.58/4.74  ; The agenda of rows to process has 153 entries:
% 4.58/4.74  ;     6 with value 17             20 with value 32              20 with value 40
% 4.58/4.74  ;     6 with value 24             48 with value 33              24 with value 41
% 4.58/4.74  ;    29 with value 25
% 4.58/4.74  ; The agenda of rows to give has 1495 entries:
% 4.58/4.74  ;     5 with value (4 16)         62 with value (4 30)          62 with value (4 39)
% 4.58/4.74  ;    20 with value (4 22)         58 with value (4 31)          24 with value (4 40)
% 4.58/4.74  ;    44 with value (4 23)        192 with value (4 32)           2 with value (4 43)
% 4.58/4.74  ;    56 with value (4 24)         64 with value (4 33)          14 with value (4 44)
% 4.58/4.74  ;    16 with value (4 25)         27 with value (4 36)          76 with value (4 45)
% 4.58/4.74  ;     4 with value (4 27)        251 with value (4 37)         112 with value (4 46)
% 4.58/4.74  ;    43 with value (4 28)        234 with value (4 38)          40 with value (4 47)
% 4.58/4.74  ;    89 with value (4 29)
% 4.58/4.74  Evaluation took:
% 4.58/4.74    4.276 seconds of real time
% 4.58/4.74    3.883903 seconds of user run time
% 4.58/4.74    0.392137 seconds of system run time
% 4.58/4.74    [Run times include 0.196 seconds GC run time.]
% 4.58/4.74    0 calls to %EVAL
% 4.58/4.74    0 page faults and
% 4.58/4.74    509,501,144 bytes consed.
% 4.58/4.74  :PROOF-FOUND
% 4.58/4.74  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T12:41:02
% 4.58/4.74  :PROOF-FOUND
% 4.58/4.74  * 
%------------------------------------------------------------------------------