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

View Problem - Process Solution

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

% Computer : n024.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:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(singleton_1,axiom,
    member(X,singleton_set(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_1) ).

cnf(singleton_2,axiom,
    ( ~ member(X,singleton_set(Y))
    | X = Y ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_2) ).

cnf(unordered_pair_1,axiom,
    member(X,unordered_pair(X,Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_1) ).

cnf(unordered_pair_3,axiom,
    ( ~ member(X,unordered_pair(Y,Z))
    | X = Y
    | X = Z ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_3) ).

cnf(ordered_pair,axiom,
    ordered_pair(X,Y) = unordered_pair(singleton_set(X),unordered_pair(X,Y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair) ).

cnf(equal_ordered_pairs,hypothesis,
    ordered_pair(m1,r1) = ordered_pair(m2,r2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_ordered_pairs) ).

cnf(prove_first_components_equal,negated_conjecture,
    m1 != m2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_first_components_equal) ).

cnf(9,plain,
    ~ member(m1,singleton_set(m2)),
    inference('UR-RESOLVE',[status(thm)],[singleton_2,prove_first_components_equal]) ).

cnf(11,plain,
    member(singleton_set(X),ordered_pair(X,Y)),
    inference('PARAMODULATE',[status(thm)],[unordered_pair_1,ordered_pair,theory(equality)]) ).

cnf(16,plain,
    ( ~ member(X,ordered_pair(Y,Z))
    | X = singleton_set(Y)
    | X = unordered_pair(Y,Z) ),
    inference('PARAMODULATE',[status(thm)],[unordered_pair_3,ordered_pair,theory(equality)]) ).

cnf(17,plain,
    member(singleton_set(m2),ordered_pair(m1,r1)),
    inference('PARAMODULATE',[status(thm)],[11,equal_ordered_pairs,theory(equality)]) ).

cnf(28,plain,
    ( singleton_set(m2) = singleton_set(m1)
    | singleton_set(m2) = unordered_pair(m1,r1) ),
    inference('HYPERRESOLVE',[status(thm)],[16,17]) ).

cnf(31,plain,
    singleton_set(m2) = singleton_set(m1),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[unordered_pair_1,28,theory(equality)]),9]) ).

cnf(32,plain,
    $false,
    inference('REWRITE',[status(thm)],[9,singleton_1,31,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jul 10 16:46:58 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.48  * 
% 0.21/0.48  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T16:46:58
% 0.21/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-07-10T16:46:58
% 0.21/0.52  
% 0.21/0.52  
% 0.21/0.52  #||
% 0.21/0.52  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.52  % SZS output start Refutation
% See solution above
% 0.21/0.52  ||#
% 0.21/0.52  
% 0.21/0.52  ; Summary of computation:
% 0.21/0.52  ;        71 formulas have been input or derived (from 23 formulas).
% 0.21/0.52  ;        32 (45%) were retained.  Of these,
% 0.21/0.52  ;            9 (28%) were simplified or subsumed later,
% 0.21/0.52  ;           23 (72%) are still being kept.
% 0.21/0.52  ; 
% 0.21/0.52  ; Run time in seconds excluding printing time:
% 0.21/0.52  ;     0.002   6%   Read assertion file          (1 call)
% 0.21/0.52  ;     0.000   0%   Assert                       (8 calls)
% 0.21/0.52  ;     0.004  12%   Process new row              (55 calls)
% 0.21/0.52  ;     0.001   3%   Resolution                   (44 calls)
% 0.21/0.52  ;     0.001   3%   Paramodulation               (22 calls)
% 0.21/0.52  ;     0.000   0%   Factoring                    (1 call)
% 0.21/0.52  ;     0.000   0%   Condensing                   (8 calls)
% 0.21/0.52  ;     0.002   6%   Forward subsumption          (8 calls)
% 0.21/0.52  ;     0.000   0%   Backward subsumption         (8 calls)
% 0.21/0.52  ;     0.000   0%   Clause clause subsumption    (2 calls)
% 0.21/0.52  ;     0.000   0%   Forward simplification       (55 calls)
% 0.21/0.52  ;     0.002   6%   Backward simplification      (32 calls)
% 0.21/0.52  ;     0.000   0%   Ordering                     (56 calls)
% 0.21/0.52  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.21/0.52  ;     0.000   0%   Purity testing               (1 call)
% 0.21/0.52  ;     0.022  65%   Other
% 0.21/0.52  ;     0.034        Total
% 0.21/0.52  ;     0.036        Real time
% 0.21/0.52  ; 
% 0.21/0.52  ; Term-hash-array has 72 terms in all.
% 0.21/0.52  ; Feature-vector-row-index has 5 entries (8 at peak, 8 added, 3 deleted).
% 0.21/0.52  ; Feature-vector-row-index has 34 nodes (72 at peak, 72 added, 38 deleted).
% 0.21/0.52  ;  Retrieved 2 possibly forward subsuming rows in 8 calls.
% 0.21/0.52  ;  Retrieved 0 possibly backward subsumed rows in 8 calls.
% 0.21/0.52  ; Path-index has 57 entries (76 at peak, 76 added, 19 deleted).
% 0.21/0.52  ; Path-index has 195 nodes (237 at peak, 237 added, 42 deleted).
% 0.21/0.52  ; Trie-index has 57 entries (76 at peak, 76 added, 19 deleted).
% 0.21/0.52  ; Trie-index has 188 nodes (275 at peak, 275 added, 87 deleted).
% 0.21/0.52  ; Retrieved 31 generalization terms in 131 calls.
% 0.21/0.52  ; Retrieved 24 instance terms in 23 calls.
% 0.21/0.52  ; Retrieved 116 unifiable terms in 154 calls.
% 0.21/0.52  ; 
% 0.21/0.52  ; The agenda of backward simplifiable rows to process has 8 entries:
% 0.21/0.52  ;     8 with value 0
% 0.21/0.52  ; The agenda of rows to process has 6 entries:
% 0.21/0.52  ;     1 with value 17              1 with value 19               1 with value 25
% 0.21/0.52  ;     1 with value 18              2 with value 23
% 0.21/0.52  ; The agenda of rows to give has 5 entries:
% 0.21/0.52  ;     1 with value (4 11)          1 with value (4 21)           1 with value (4 28)
% 0.21/0.52  ;     1 with value (4 20)          1 with value (4 27)
% 0.21/0.52  Evaluation took:
% 0.21/0.52    0.036 seconds of real time
% 0.21/0.52    0.03194 seconds of user run time
% 0.21/0.52    0.004156 seconds of system run time
% 0.21/0.52    0 calls to %EVAL
% 0.21/0.52    0 page faults and
% 0.21/0.52    2,382,384 bytes consed.
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T16:46:58
% 0.21/0.52  :PROOF-FOUND
% 0.21/0.52  * 
%------------------------------------------------------------------------------