TSTP Solution File: SET017-6 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n008.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:51 EDT 2022

% Result   : Unsatisfiable 1.11s 1.28s
% Output   : Refutation 1.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   21 (  15 unt;   1 nHn;  17 RR)
%            Number of literals    :   29 (   8 equ;  11 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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   23 (   9 sgn)

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

cnf(equal_implies_subclass1,axiom,
    ( X != Y
    | subclass(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',equal_implies_subclass1) ).

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

cnf(unordered_pair3,axiom,
    ( ~ member(X,universal_class)
    | member(X,unordered_pair(Y,X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).

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

cnf(cartesian_product1,axiom,
    ( ~ member(ordered_pair(X,Y),cross_product(Z,U))
    | member(X,Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).

cnf(cartesian_product2,axiom,
    ( ~ member(ordered_pair(X,Y),cross_product(Z,U))
    | member(Y,U) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).

cnf(prove_left_cancellation_1,negated_conjecture,
    unordered_pair(x,y) = unordered_pair(x,z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_left_cancellation_1) ).

cnf(prove_left_cancellation_2,negated_conjecture,
    member(ordered_pair(y,z),cross_product(universal_class,universal_class)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_left_cancellation_2) ).

cnf(prove_left_cancellation_3,negated_conjecture,
    y != z,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_left_cancellation_3) ).

cnf(155,plain,
    member(y,universal_class),
    inference('HYPERRESOLVE',[status(thm)],[cartesian_product1,prove_left_cancellation_2]) ).

cnf(156,plain,
    member(z,universal_class),
    inference('HYPERRESOLVE',[status(thm)],[cartesian_product2,prove_left_cancellation_2]) ).

cnf(172,plain,
    ~ member(y,singleton(z)),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[unordered_pair_member,prove_left_cancellation_3,prove_left_cancellation_3]),singleton_set,theory(equality)]) ).

cnf(265,plain,
    member(y,unordered_pair(X,y)),
    inference('HYPERRESOLVE',[status(thm)],[unordered_pair3,155]) ).

cnf(287,plain,
    member(z,unordered_pair(X,z)),
    inference('HYPERRESOLVE',[status(thm)],[unordered_pair3,156]) ).

cnf(965,plain,
    ~ subclass(unordered_pair(X,y),singleton(z)),
    inference('UR-RESOLVE',[status(thm)],[subclass_members,265,172]) ).

cnf(1195,plain,
    member(z,unordered_pair(x,y)),
    inference('PARAMODULATE',[status(thm)],[287,prove_left_cancellation_1,theory(equality)]) ).

cnf(4089,plain,
    z = x,
    inference('UR-RESOLVE',[status(thm)],[unordered_pair_member,1195,prove_left_cancellation_3]) ).

cnf(4090,plain,
    unordered_pair(x,y) = singleton(x),
    inference('REWRITE',[status(thm)],[prove_left_cancellation_1,singleton_set,4089,theory(equality)]) ).

cnf(4316,plain,
    ~ subclass(unordered_pair(X,y),singleton(x)),
    inference('REWRITE',[status(thm)],[965,4089,theory(equality)]) ).

cnf(5367,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[equal_implies_subclass1,4090]),4316]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET017-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n008.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 07:57:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 0.21/0.47  #<PACKAGE "SNARK-USER">
% 0.21/0.47  * 
% 0.21/0.47  SNARK-TPTP-OPTIONS
% 0.21/0.47  * 
% 0.21/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.47   (USE-FACTORING :POS)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.47  * 
% 0.21/0.47  "."
% 0.21/0.47  * 
% 0.21/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T07:57:53
% 0.21/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n008.cluster.edu at 2022-07-11T07:57:53
% 1.11/1.28  
% 1.11/1.28  
% 1.11/1.28  #||
% 1.11/1.28  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.11/1.28  % SZS output start Refutation
% See solution above
% 1.11/1.28  ||#
% 1.11/1.28  
% 1.11/1.28  ; Summary of computation:
% 1.11/1.28  ;      9774 formulas have been input or derived (from 187 formulas).
% 1.11/1.28  ;      5367 (55%) were retained.  Of these,
% 1.11/1.28  ;         1293 (24%) were simplified or subsumed later,
% 1.11/1.28  ;         4074 (76%) are still being kept.
% 1.11/1.28  ; 
% 1.11/1.28  ; Run time in seconds excluding printing time:
% 1.11/1.28  ;     0.017   2%   Read assertion file          (1 call)
% 1.11/1.28  ;     0.002   0%   Assert                       (94 calls)
% 1.11/1.28  ;     0.257  32%   Process new row              (9,442 calls)
% 1.11/1.28  ;     0.242  30%   Resolution                   (372 calls)
% 1.11/1.28  ;     0.004   0%   Paramodulation               (186 calls)
% 1.11/1.28  ;     0.000   0%   Factoring                    (3 calls)
% 1.11/1.28  ;     0.005   1%   Condensing                   (450 calls)
% 1.11/1.28  ;     0.015   2%   Forward subsumption          (450 calls)
% 1.11/1.28  ;     0.021   3%   Backward subsumption         (436 calls)
% 1.11/1.28  ;     0.001   0%   Clause clause subsumption    (302 calls)
% 1.11/1.28  ;     0.098  12%   Forward simplification       (9,182 calls)
% 1.11/1.28  ;     0.084  10%   Backward simplification      (5,355 calls)
% 1.11/1.28  ;     0.003   0%   Ordering                     (851 calls)
% 1.11/1.28  ;     0.001   0%   Sortal reasoning             (32 calls)
% 1.11/1.28  ;     0.000   0%   Purity testing               (1 call)
% 1.11/1.28  ;     0.056   7%   Other
% 1.11/1.28  ;     0.806        Total
% 1.11/1.28  ;     0.807        Real time
% 1.11/1.28  ; 
% 1.11/1.28  ; Term-hash-array has 8,411 terms in all.
% 1.11/1.28  ; Feature-vector-row-index has 390 entries (391 at peak, 436 added, 46 deleted).
% 1.11/1.28  ; Feature-vector-row-index has 2,087 nodes (2,271 at peak, 2,332 added, 245 deleted).
% 1.11/1.28  ;  Retrieved 310 possibly forward subsuming rows in 450 calls.
% 1.11/1.28  ;  Retrieved 179 possibly backward subsumed rows in 436 calls.
% 1.11/1.28  ; Path-index has 6,571 entries (6,576 at peak, 8,470 added, 1,899 deleted).
% 1.11/1.28  ; Path-index has 4,298 nodes (4,301 at peak, 4,493 added, 195 deleted).
% 1.11/1.28  ; Trie-index has 6,571 entries (6,576 at peak, 8,470 added, 1,899 deleted).
% 1.11/1.28  ; Trie-index has 18,954 nodes (18,962 at peak, 24,221 added, 5,267 deleted).
% 1.11/1.28  ; Retrieved 6,261 generalization terms in 23,744 calls.
% 1.11/1.28  ; Retrieved 4,937 instance terms in 4,918 calls.
% 1.11/1.28  ; Retrieved 366,396 unifiable terms in 6,689 calls.
% 1.11/1.28  ; 
% 1.11/1.28  ; The agenda of rows to process has 9 entries:
% 1.11/1.28  ;     5 with value 9               3 with value 10               1 with value 15
% 1.11/1.28  ; The agenda of input rows to give has 1 entry:
% 1.11/1.28  ;     1 with value 9
% 1.11/1.28  ; The agenda of rows to give has 3907 entries:
% 1.11/1.28  ;     1 with value (4 5)         423 with value (4 19)           1 with value (4 32)
% 1.11/1.28  ;     2 with value (4 7)         214 with value (4 20)           2 with value (4 33)
% 1.11/1.28  ;     5 with value (4 8)          57 with value (4 21)           2 with value (4 34)
% 1.11/1.28  ;     6 with value (4 9)           6 with value (4 22)           2 with value (4 37)
% 1.11/1.28  ;     8 with value (4 10)          9 with value (4 23)           1 with value (4 43)
% 1.11/1.28  ;    83 with value (4 11)         15 with value (4 24)           1 with value (4 44)
% 1.11/1.28  ;   102 with value (4 12)          4 with value (4 25)           1 with value (4 45)
% 1.11/1.28  ;   146 with value (4 13)          8 with value (4 26)           3 with value (4 46)
% 1.11/1.28  ;   222 with value (4 14)          1 with value (4 27)           1 with value (4 49)
% 1.11/1.28  ;   303 with value (4 15)          7 with value (4 28)           1 with value (4 51)
% 1.11/1.28  ;   648 with value (4 16)         10 with value (4 29)           1 with value (4 53)
% 1.11/1.28  ;   709 with value (4 17)          3 with value (4 30)           1 with value (4 59)
% 1.11/1.28  ;   896 with value (4 18)          1 with value (4 31)           1 with value (4 63)
% 1.11/1.28  Evaluation took:
% 1.11/1.28    0.808 seconds of real time
% 1.11/1.28    0.73913 seconds of user run time
% 1.11/1.28    0.068361 seconds of system run time
% 1.11/1.28    [Run times include 0.063 seconds GC run time.]
% 1.11/1.28    0 calls to %EVAL
% 1.11/1.28    0 page faults and
% 1.11/1.28    61,263,280 bytes consed.
% 1.11/1.28  :PROOF-FOUND
% 1.11/1.28  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T07:57:54
% 1.11/1.28  :PROOF-FOUND
% 1.11/1.28  * 
%------------------------------------------------------------------------------