TSTP Solution File: SET103-7 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET103-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:24 EDT 2022
% Result : Unsatisfiable 0.41s 0.61s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 11 unt; 1 nHn; 6 RR)
% Number of literals : 13 ( 10 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 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(singleton_is_null_class,axiom,
( member(X,universal_class)
| singleton(X) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
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(prove_property_1_of_ordered_pair_1,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_1_of_ordered_pair_1) ).
cnf(154,plain,
complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(null_class)))))))) != ordered_pair(x,y),
inference('REWRITE',[status(thm)],[prove_property_1_of_ordered_pair_1,148,theory(equality)]) ).
cnf(prove_property_1_of_ordered_pair_2,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_1_of_ordered_pair_2) ).
cnf(158,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(181,plain,
complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(null_class)))))))) != complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(singleton(y))))))))),
inference('REWRITE',[status(thm)],[154,158,theory(equality)]) ).
cnf(220,plain,
singleton(y) = null_class,
inference('HYPERRESOLVE',[status(thm)],[prove_property_1_of_ordered_pair_2,singleton_is_null_class]) ).
cnf(221,plain,
$false,
inference('REWRITE',[status(thm)],[181,220,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET103-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.14 % Command : run-snark %s %d
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 09:18:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.49 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.50 *
% 0.21/0.50 *
% 0.21/0.50 #<PACKAGE "SNARK-USER">
% 0.21/0.50 *
% 0.21/0.50 SNARK-TPTP-OPTIONS
% 0.21/0.50 *
% 0.21/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50 (USE-FACTORING :POS)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50 *
% 0.21/0.50 "."
% 0.21/0.50 *
% 0.21/0.50 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T09:18:52
% 0.21/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-07-11T09:18:52
% 0.21/0.55
% 0.38/0.55 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.41/0.61 ; Declaring unordered_pair to be commutative.
% 0.41/0.61
% 0.41/0.61 #||
% 0.41/0.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.61 % SZS output start Refutation
% See solution above
% 0.41/0.61 ||#
% 0.41/0.61
% 0.41/0.61 ; Summary of computation:
% 0.41/0.61 ; 273 formulas have been input or derived (from 39 formulas).
% 0.41/0.61 ; 221 (81%) were retained. Of these,
% 0.41/0.61 ; 58 (26%) were simplified or subsumed later,
% 0.41/0.61 ; 163 (74%) are still being kept.
% 0.41/0.61 ;
% 0.41/0.61 ; Run time in seconds excluding printing time:
% 0.41/0.61 ; 0.028 27% Read assertion file (1 call)
% 0.41/0.61 ; 0.005 5% Assert (149 calls)
% 0.41/0.61 ; 0.023 22% Process new row (240 calls)
% 0.41/0.61 ; 0.003 3% Resolution (76 calls)
% 0.41/0.61 ; 0.001 1% Paramodulation (38 calls)
% 0.41/0.61 ; 0.000 0% Factoring (2 calls)
% 0.41/0.61 ; 0.003 3% Condensing (137 calls)
% 0.41/0.61 ; 0.006 6% Forward subsumption (137 calls)
% 0.41/0.61 ; 0.001 1% Backward subsumption (130 calls)
% 0.41/0.61 ; 0.000 0% Clause clause subsumption (89 calls)
% 0.41/0.61 ; 0.007 7% Forward simplification (239 calls)
% 0.41/0.61 ; 0.005 5% Backward simplification (206 calls)
% 0.41/0.61 ; 0.002 2% Ordering (72 calls)
% 0.41/0.61 ; 0.001 1% Sortal reasoning (32 calls)
% 0.41/0.61 ; 0.001 1% Purity testing (1 call)
% 0.41/0.61 ; 0.017 17% Other
% 0.41/0.61 ; 0.103 Total
% 0.41/0.61 ; 0.104 Real time
% 0.41/0.61 ;
% 0.41/0.61 ; Term-hash-array has 574 terms in all.
% 0.41/0.61 ; Feature-vector-row-index has 100 entries (100 at peak, 130 added, 30 deleted).
% 0.41/0.61 ; Feature-vector-row-index has 688 nodes (688 at peak, 832 added, 144 deleted).
% 0.41/0.61 ; Retrieved 76 possibly forward subsuming rows in 137 calls.
% 0.41/0.61 ; Retrieved 23 possibly backward subsumed rows in 130 calls.
% 0.41/0.61 ; Path-index has 494 entries (513 at peak, 627 added, 133 deleted).
% 0.41/0.61 ; Path-index has 2,140 nodes (2,170 at peak, 2,327 added, 187 deleted).
% 0.41/0.61 ; Trie-index has 494 entries (513 at peak, 627 added, 133 deleted).
% 0.41/0.61 ; Trie-index has 1,932 nodes (2,016 at peak, 2,332 added, 400 deleted).
% 0.41/0.61 ; Retrieved 260 generalization terms in 1,021 calls.
% 0.41/0.61 ; Retrieved 189 instance terms in 75 calls.
% 0.41/0.61 ; Retrieved 1,324 unifiable terms in 189 calls.
% 0.41/0.61 ;
% 0.41/0.61 ; The agenda of rows to process has 4 entries:
% 0.41/0.61 ; 3 with value 13 1 with value 17
% 0.41/0.61 ; The agenda of input rows to give has 100 entries:
% 0.41/0.61 ; 1 with value 10 3 with value 23 1 with value 40
% 0.41/0.61 ; 8 with value 11 1 with value 27 1 with value 43
% 0.41/0.61 ; 14 with value 12 1 with value 28 3 with value 46
% 0.41/0.61 ; 5 with value 13 3 with value 30 1 with value 56
% 0.41/0.61 ; 8 with value 14 1 with value 31 1 with value 57
% 0.41/0.61 ; 7 with value 15 1 with value 32 1 with value 64
% 0.41/0.61 ; 5 with value 16 1 with value 33 1 with value 66
% 0.41/0.61 ; 2 with value 17 5 with value 35 1 with value 74
% 0.41/0.61 ; 6 with value 18 1 with value 36 2 with value 94
% 0.41/0.61 ; 3 with value 19 1 with value 37 2 with value 139
% 0.41/0.61 ; 4 with value 20 1 with value 39 2 with value 212
% 0.41/0.61 ; 2 with value 22
% 0.41/0.61 ; The agenda of rows to give has 25 entries:
% 0.41/0.61 ; 1 with value (4 4) 3 with value (4 8) 2 with value (4 13)
% 0.41/0.61 ; 1 with value (4 5) 4 with value (4 9) 1 with value (4 14)
% 0.41/0.61 ; 10 with value (4 7) 2 with value (4 10) 1 with value (4 15)
% 0.41/0.61 Evaluation took:
% 0.41/0.61 0.105 seconds of real time
% 0.41/0.61 0.09356 seconds of user run time
% 0.41/0.61 0.01143 seconds of system run time
% 0.41/0.61 0 calls to %EVAL
% 0.41/0.61 0 page faults and
% 0.41/0.61 6,538,696 bytes consed.
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T09:18:52
% 0.41/0.61 :PROOF-FOUND
% 0.41/0.61 *
%------------------------------------------------------------------------------