TSTP Solution File: SET115-7 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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:33 EDT 2022
% Result : Unsatisfiable 0.70s 0.87s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 9 unt; 2 nHn; 4 RR)
% Number of literals : 13 ( 12 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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(existence_of_1st_and_2nd_4,axiom,
( ordered_pair(first(X),second(X)) = X
| first(X) = X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_1st_and_2nd_4) ).
cnf(prove_unique_1st_and_2nd_in_pair_of_non_sets3_1,negated_conjecture,
ordered_pair(first(x),second(x)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_and_2nd_in_pair_of_non_sets3_1) ).
cnf(prove_unique_1st_in_pair_of_non_sets,negated_conjecture,
first(x) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_unique_1st_in_pair_of_non_sets) ).
cnf(172,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(176,plain,
( complement(intersection(complement(singleton(singleton(first(X)))),complement(singleton(complement(intersection(complement(singleton(first(X))),complement(singleton(singleton(second(X)))))))))) = X
| first(X) = X ),
inference('REWRITE',[status(thm)],[existence_of_1st_and_2nd_4,172,theory(equality)]) ).
cnf(178,plain,
complement(intersection(complement(singleton(singleton(first(x)))),complement(singleton(complement(intersection(complement(singleton(first(x))),complement(singleton(singleton(second(x)))))))))) != x,
inference('REWRITE',[status(thm)],[prove_unique_1st_and_2nd_in_pair_of_non_sets3_1,172,theory(equality)]) ).
cnf(791,plain,
$false,
inference('UR-RESOLVE',[status(thm)],[176,178,prove_unique_1st_in_pair_of_non_sets]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET115-7 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 07:52:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.46 *
% 0.21/0.46 *
% 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/sandbox2/benchmark/theBenchmark.p 2022-07-10T07:52:56
% 0.21/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-10T07:52:56
% 0.21/0.52
% 0.21/0.52 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.70/0.87 ; Declaring unordered_pair to be commutative.
% 0.70/0.87
% 0.70/0.87 #||
% 0.70/0.87 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.70/0.87 % SZS output start Refutation
% See solution above
% 0.70/0.87 ||#
% 0.70/0.87
% 0.70/0.87 ; Summary of computation:
% 0.70/0.87 ; 1831 formulas have been input or derived (from 123 formulas).
% 0.70/0.87 ; 791 (43%) were retained. Of these,
% 0.70/0.87 ; 78 (10%) were simplified or subsumed later,
% 0.70/0.87 ; 713 (90%) are still being kept.
% 0.70/0.87 ;
% 0.70/0.87 ; Run time in seconds excluding printing time:
% 0.70/0.87 ; 0.029 7% Read assertion file (1 call)
% 0.70/0.87 ; 0.004 1% Assert (161 calls)
% 0.70/0.87 ; 0.084 21% Process new row (1,636 calls)
% 0.70/0.87 ; 0.031 8% Resolution (244 calls)
% 0.70/0.87 ; 0.020 5% Paramodulation (122 calls)
% 0.70/0.87 ; 0.000 0% Factoring (15 calls)
% 0.70/0.87 ; 0.018 5% Condensing (808 calls)
% 0.70/0.87 ; 0.078 20% Forward subsumption (808 calls)
% 0.70/0.87 ; 0.013 3% Backward subsumption (600 calls)
% 0.70/0.87 ; 0.008 2% Clause clause subsumption (2,628 calls)
% 0.70/0.87 ; 0.059 15% Forward simplification (1,635 calls)
% 0.70/0.87 ; 0.009 2% Backward simplification (774 calls)
% 0.70/0.87 ; 0.007 2% Ordering (2,322 calls)
% 0.70/0.87 ; 0.000 0% Sortal reasoning (32 calls)
% 0.70/0.87 ; 0.001 0% Purity testing (1 call)
% 0.70/0.87 ; 0.032 8% Other
% 0.70/0.87 ; 0.393 Total
% 0.70/0.87 ; 0.394 Real time
% 0.70/0.87 ;
% 0.70/0.87 ; Term-hash-array has 1,877 terms in all.
% 0.70/0.87 ; Feature-vector-row-index has 556 entries (556 at peak, 600 added, 44 deleted).
% 0.70/0.87 ; Feature-vector-row-index has 4,191 nodes (4,191 at peak, 4,443 added, 252 deleted).
% 0.70/0.87 ; Retrieved 3,994 possibly forward subsuming rows in 808 calls.
% 0.70/0.87 ; Retrieved 253 possibly backward subsumed rows in 600 calls.
% 0.70/0.87 ; Path-index has 1,797 entries (1,797 at peak, 1,937 added, 140 deleted).
% 0.70/0.87 ; Path-index has 7,030 nodes (7,030 at peak, 7,220 added, 190 deleted).
% 0.70/0.87 ; Trie-index has 1,797 entries (1,797 at peak, 1,937 added, 140 deleted).
% 0.70/0.87 ; Trie-index has 8,930 nodes (8,930 at peak, 9,343 added, 413 deleted).
% 0.70/0.87 ; Retrieved 4,154 generalization terms in 9,925 calls.
% 0.70/0.87 ; Retrieved 316 instance terms in 173 calls.
% 0.70/0.87 ; Retrieved 24,995 unifiable terms in 1,421 calls.
% 0.70/0.87 ;
% 0.70/0.87 ; The agenda of rows to process has 42 entries:
% 0.70/0.87 ; 3 with value 7 1 with value 34 1 with value 57
% 0.70/0.87 ; 3 with value 11 1 with value 39 3 with value 59
% 0.70/0.87 ; 2 with value 17 2 with value 40 2 with value 62
% 0.70/0.87 ; 1 with value 18 1 with value 42 1 with value 64
% 0.70/0.87 ; 1 with value 19 3 with value 43 1 with value 66
% 0.70/0.87 ; 5 with value 20 1 with value 45 2 with value 71
% 0.70/0.87 ; 2 with value 27 1 with value 49 1 with value 104
% 0.70/0.87 ; 2 with value 30 1 with value 53 1 with value 127
% 0.70/0.87 ; The agenda of input rows to give has 28 entries:
% 0.70/0.87 ; 3 with value 39 2 with value 53 1 with value 74
% 0.70/0.87 ; 1 with value 40 1 with value 56 2 with value 94
% 0.70/0.87 ; 2 with value 41 1 with value 57 1 with value 123
% 0.70/0.87 ; 1 with value 43 2 with value 62 2 with value 139
% 0.70/0.87 ; 4 with value 46 1 with value 64 2 with value 212
% 0.70/0.87 ; 1 with value 48 1 with value 66
% 0.70/0.87 ; The agenda of rows to give has 563 entries:
% 0.70/0.87 ; 2 with value (4 4) 14 with value (4 28) 3 with value (4 52)
% 0.70/0.87 ; 2 with value (4 5) 5 with value (4 29) 1 with value (4 53)
% 0.70/0.87 ; 13 with value (4 7) 13 with value (4 30) 4 with value (4 54)
% 0.70/0.87 ; 11 with value (4 8) 19 with value (4 31) 2 with value (4 55)
% 0.70/0.87 ; 11 with value (4 9) 8 with value (4 32) 4 with value (4 57)
% 0.70/0.87 ; 8 with value (4 10) 10 with value (4 33) 4 with value (4 58)
% 0.70/0.87 ; 6 with value (4 11) 9 with value (4 34) 4 with value (4 59)
% 0.70/0.87 ; 9 with value (4 12) 10 with value (4 35) 1 with value (4 60)
% 0.70/0.87 ; 13 with value (4 13) 12 with value (4 36) 2 with value (4 62)
% 0.70/0.87 ; 15 with value (4 14) 6 with value (4 37) 1 with value (4 63)
% 0.70/0.87 ; 21 with value (4 15) 4 with value (4 38) 4 with value (4 65)
% 0.70/0.87 ; 16 with value (4 16) 5 with value (4 39) 1 with value (4 66)
% 0.70/0.87 ; 20 with value (4 17) 16 with value (4 40) 2 with value (4 67)
% 0.70/0.87 ; 23 with value (4 18) 9 with value (4 41) 4 with value (4 68)
% 0.70/0.87 ; 27 with value (4 19) 6 with value (4 42) 1 with value (4 70)
% 0.70/0.87 ; 19 with value (4 20) 12 with value (4 43) 4 with value (4 71)
% 0.70/0.87 ; 19 with value (4 21) 4 with value (4 44) 2 with value (4 78)
% 0.70/0.87 ; 13 with value (4 22) 4 with value (4 45) 3 with value (4 87)
% 0.70/0.87 ; 21 with value (4 23) 8 with value (4 46) 2 with value (4 106)
% 0.70/0.87 ; 16 with value (4 24) 2 with value (4 48) 1 with value (4 113)
% 0.70/0.87 ; 15 with value (4 25) 2 with value (4 49) 2 with value (4 129)
% 0.70/0.87 ; 11 with value (4 26) 2 with value (4 50) 2 with value (4 144)
% 0.70/0.87 ; 16 with value (4 27) 2 with value (4 51)
% 0.70/0.87 Evaluation took:
% 0.70/0.87 0.395 seconds of real time
% 0.70/0.87 0.3601 seconds of user run time
% 0.70/0.87 0.035202 seconds of system run time
% 0.70/0.87 [Run times include 0.022 seconds GC run time.]
% 0.70/0.87 0 calls to %EVAL
% 0.70/0.87 0 page faults and
% 0.70/0.87 29,860,328 bytes consed.
% 0.70/0.87 :PROOF-FOUND
% 0.70/0.87 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T07:52:57
% 0.70/0.87 :PROOF-FOUND
% 0.70/0.87 *
%------------------------------------------------------------------------------