TSTP Solution File: SET025-7 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET025-7 : TPTP v8.1.0. Bugfixed v2.1.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:06:04 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 5 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(union,axiom,
complement(intersection(complement(X),complement(Y))) = union(X,Y),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(unordered_pairs_and_singletons,axiom,
unordered_pair(X,Y) = union(singleton(X),singleton(Y)),
file('/export/starexec/sandbox/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_ordered_pair_is_set_1,negated_conjecture,
~ member(ordered_pair(x,y),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ordered_pair_is_set_1) ).
cnf(152,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(172,plain,
~ member(complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(singleton(y))))))))),universal_class),
inference('REWRITE',[status(thm)],[prove_ordered_pair_is_set_1,152,theory(equality)]) ).
cnf(175,plain,
member(complement(intersection(complement(singleton(X)),complement(singleton(Y)))),universal_class),
inference('REWRITE',[status(thm)],[unordered_pairs_in_universal,148,theory(equality)]) ).
cnf(176,plain,
$false,
inference('REWRITE',[status(thm)],[172,175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET025-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 04:07:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 *
% 0.20/0.46 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T04:07:27
% 0.20/0.46 ; 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-10T04:07:27
% 0.20/0.50
% 0.20/0.50 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.20/0.56 ; Declaring unordered_pair to be commutative.
% 0.20/0.56
% 0.20/0.56 #||
% 0.20/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.56 % SZS output start Refutation
% See solution above
% 0.20/0.56 ||#
% 0.20/0.56
% 0.20/0.56 ; Summary of computation:
% 0.20/0.56 ; 195 formulas have been input or derived (from 1 formulas).
% 0.20/0.56 ; 176 (90%) were retained. Of these,
% 0.20/0.56 ; 50 (28%) were simplified or subsumed later,
% 0.20/0.56 ; 126 (72%) are still being kept.
% 0.20/0.56 ;
% 0.20/0.56 ; Run time in seconds excluding printing time:
% 0.20/0.56 ; 0.025 27% Read assertion file (1 call)
% 0.20/0.56 ; 0.005 5% Assert (145 calls)
% 0.20/0.56 ; 0.015 16% Process new row (172 calls)
% 0.20/0.56 ; 0.004 4% Condensing (124 calls)
% 0.20/0.56 ; 0.006 6% Forward subsumption (124 calls)
% 0.20/0.56 ; 0.005 5% Backward subsumption (117 calls)
% 0.20/0.56 ; 0.001 1% Clause clause subsumption (68 calls)
% 0.20/0.56 ; 0.007 7% Forward simplification (172 calls)
% 0.20/0.56 ; 0.003 3% Backward simplification (163 calls)
% 0.20/0.56 ; 0.002 2% Ordering (22 calls)
% 0.20/0.56 ; 0.001 1% Sortal reasoning (32 calls)
% 0.20/0.56 ; 0.001 1% Purity testing (1 call)
% 0.20/0.56 ; 0.019 20% Other
% 0.20/0.56 ; 0.094 Total
% 0.20/0.56 ; 0.095 Real time
% 0.20/0.56 ;
% 0.20/0.56 ; Term-hash-array has 508 terms in all.
% 0.20/0.56 ; Feature-vector-row-index has 87 entries (96 at peak, 117 added, 30 deleted).
% 0.20/0.56 ; Feature-vector-row-index has 583 nodes (583 at peak, 727 added, 144 deleted).
% 0.20/0.56 ; Retrieved 67 possibly forward subsuming rows in 124 calls.
% 0.20/0.56 ; Retrieved 10 possibly backward subsumed rows in 117 calls.
% 0.20/0.56 ; Path-index has 435 entries (451 at peak, 547 added, 112 deleted).
% 0.20/0.56 ; Path-index has 2,048 nodes (2,074 at peak, 2,202 added, 154 deleted).
% 0.20/0.56 ; Trie-index has 435 entries (451 at peak, 547 added, 112 deleted).
% 0.20/0.56 ; Trie-index has 1,798 nodes (1,864 at peak, 2,102 added, 304 deleted).
% 0.20/0.56 ; Retrieved 158 generalization terms in 760 calls.
% 0.20/0.56 ; Retrieved 114 instance terms in 45 calls.
% 0.20/0.56 ;
% 0.20/0.56 ; The agenda of backward simplifiable rows to process has 10 entries:
% 0.20/0.56 ; 10 with value 0
% 0.20/0.56 ; The agenda of input rows to give has 125 entries:
% 0.20/0.56 ; 2 with value 3 4 with value 16 5 with value 35
% 0.20/0.56 ; 6 with value 4 2 with value 17 1 with value 36
% 0.20/0.56 ; 4 with value 6 6 with value 18 1 with value 39
% 0.20/0.56 ; 4 with value 7 2 with value 19 1 with value 40
% 0.20/0.56 ; 6 with value 8 3 with value 20 1 with value 43
% 0.20/0.56 ; 4 with value 9 2 with value 22 1 with value 56
% 0.20/0.56 ; 12 with value 10 1 with value 23 1 with value 64
% 0.20/0.56 ; 8 with value 11 1 with value 27 1 with value 66
% 0.20/0.56 ; 14 with value 12 2 with value 30 1 with value 74
% 0.20/0.56 ; 5 with value 13 1 with value 31 2 with value 94
% 0.20/0.56 ; 8 with value 14 1 with value 32 2 with value 139
% 0.20/0.56 ; 7 with value 15 1 with value 33 2 with value 212
% 0.20/0.56 Evaluation took:
% 0.20/0.56 0.096 seconds of real time
% 0.20/0.56 0.083803 seconds of user run time
% 0.20/0.56 0.012615 seconds of system run time
% 0.20/0.56 0 calls to %EVAL
% 0.20/0.56 0 page faults and
% 0.20/0.56 5,638,112 bytes consed.
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T04:07:27
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 *
%------------------------------------------------------------------------------