TSTP Solution File: SET101-7 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET101-7 : TPTP v8.1.0. Bugfixed v2.1.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:22 EDT 2022
% Result : Unsatisfiable 0.49s 0.65s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 5 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 : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair2,axiom,
( ~ member(X,universal_class)
| member(X,unordered_pair(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
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(singletons_are_sets,axiom,
member(singleton(X),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletons_are_sets) ).
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_singleton_member_of_ordered_pair_1,negated_conjecture,
~ member(singleton(x),ordered_pair(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_singleton_member_of_ordered_pair_1) ).
cnf(153,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(174,plain,
~ member(singleton(x),complement(intersection(complement(singleton(singleton(x))),complement(singleton(complement(intersection(complement(singleton(x)),complement(singleton(singleton(y)))))))))),
inference('REWRITE',[status(thm)],[prove_singleton_member_of_ordered_pair_1,153,theory(equality)]) ).
cnf(176,plain,
( ~ member(X,universal_class)
| member(X,complement(intersection(complement(singleton(X)),complement(singleton(Y))))) ),
inference('REWRITE',[status(thm)],[unordered_pair2,148,theory(equality)]) ).
cnf(483,plain,
member(singleton(X),complement(intersection(complement(singleton(singleton(X))),complement(singleton(Y))))),
inference('HYPERRESOLVE',[status(thm)],[176,singletons_are_sets]) ).
cnf(484,plain,
$false,
inference('REWRITE',[status(thm)],[174,483]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET101-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 17:07:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 0.20/0.47 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47 (USE-FACTORING :POS)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47 *
% 0.20/0.47 "."
% 0.20/0.47 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T17:07:56
% 0.20/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-09T17:07:56
% 0.20/0.51
% 0.20/0.51 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.49/0.65 ; Declaring unordered_pair to be commutative.
% 0.49/0.65
% 0.49/0.65 #||
% 0.49/0.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.65 % SZS output start Refutation
% See solution above
% 0.49/0.65 ||#
% 0.49/0.65
% 0.49/0.65 ; Summary of computation:
% 0.49/0.65 ; 960 formulas have been input or derived (from 96 formulas).
% 0.49/0.65 ; 484 (50%) were retained. Of these,
% 0.49/0.65 ; 58 (12%) were simplified or subsumed later,
% 0.49/0.65 ; 426 (88%) are still being kept.
% 0.49/0.65 ;
% 0.49/0.65 ; Run time in seconds excluding printing time:
% 0.49/0.65 ; 0.026 15% Read assertion file (1 call)
% 0.49/0.65 ; 0.004 2% Assert (146 calls)
% 0.49/0.65 ; 0.036 21% Process new row (852 calls)
% 0.49/0.65 ; 0.016 9% Resolution (190 calls)
% 0.49/0.65 ; 0.002 1% Paramodulation (95 calls)
% 0.49/0.65 ; 0.000 0% Factoring (10 calls)
% 0.49/0.65 ; 0.009 5% Condensing (432 calls)
% 0.49/0.65 ; 0.021 12% Forward subsumption (432 calls)
% 0.49/0.65 ; 0.009 5% Backward subsumption (335 calls)
% 0.49/0.65 ; 0.002 1% Clause clause subsumption (425 calls)
% 0.49/0.65 ; 0.015 9% Forward simplification (851 calls)
% 0.49/0.65 ; 0.005 3% Backward simplification (471 calls)
% 0.49/0.65 ; 0.003 2% Ordering (854 calls)
% 0.49/0.65 ; 0.000 0% Sortal reasoning (32 calls)
% 0.49/0.65 ; 0.000 0% Purity testing (1 call)
% 0.49/0.65 ; 0.024 14% Other
% 0.49/0.65 ; 0.172 Total
% 0.49/0.65 ; 0.174 Real time
% 0.49/0.65 ;
% 0.49/0.65 ; Term-hash-array has 1,134 terms in all.
% 0.49/0.65 ; Feature-vector-row-index has 305 entries (305 at peak, 335 added, 30 deleted).
% 0.49/0.65 ; Feature-vector-row-index has 1,916 nodes (1,916 at peak, 2,060 added, 144 deleted).
% 0.49/0.65 ; Retrieved 568 possibly forward subsuming rows in 432 calls.
% 0.49/0.65 ; Retrieved 81 possibly backward subsumed rows in 335 calls.
% 0.49/0.65 ; Path-index has 1,055 entries (1,071 at peak, 1,177 added, 122 deleted).
% 0.49/0.65 ; Path-index has 3,625 nodes (3,652 at peak, 3,790 added, 165 deleted).
% 0.49/0.65 ; Trie-index has 1,055 entries (1,071 at peak, 1,177 added, 122 deleted).
% 0.49/0.65 ; Trie-index has 3,899 nodes (3,970 at peak, 4,235 added, 336 deleted).
% 0.49/0.65 ; Retrieved 801 generalization terms in 2,834 calls.
% 0.49/0.65 ; Retrieved 258 instance terms in 135 calls.
% 0.49/0.65 ; Retrieved 10,768 unifiable terms in 882 calls.
% 0.49/0.65 ;
% 0.49/0.65 ; The agenda of rows to process has 8 entries:
% 0.49/0.65 ; 1 with value 22 3 with value 25 1 with value 34
% 0.49/0.65 ; 1 with value 23 2 with value 32
% 0.49/0.65 ; The agenda of input rows to give has 40 entries:
% 0.49/0.65 ; 1 with value 19 1 with value 32 1 with value 56
% 0.49/0.65 ; 4 with value 20 1 with value 33 1 with value 57
% 0.49/0.65 ; 2 with value 22 5 with value 35 1 with value 64
% 0.49/0.65 ; 3 with value 23 1 with value 36 1 with value 66
% 0.49/0.65 ; 1 with value 27 1 with value 39 1 with value 74
% 0.49/0.65 ; 1 with value 28 1 with value 40 2 with value 94
% 0.49/0.65 ; 2 with value 30 1 with value 43 2 with value 139
% 0.49/0.65 ; 1 with value 31 3 with value 46 2 with value 212
% 0.49/0.65 ; The agenda of rows to give has 291 entries:
% 0.49/0.65 ; 2 with value (4 4) 17 with value (4 17) 3 with value (4 28)
% 0.49/0.65 ; 2 with value (4 5) 22 with value (4 18) 4 with value (4 29)
% 0.49/0.65 ; 13 with value (4 7) 22 with value (4 19) 7 with value (4 30)
% 0.49/0.65 ; 10 with value (4 8) 19 with value (4 20) 4 with value (4 31)
% 0.49/0.65 ; 10 with value (4 9) 17 with value (4 21) 2 with value (4 32)
% 0.49/0.65 ; 8 with value (4 10) 8 with value (4 22) 1 with value (4 34)
% 0.49/0.65 ; 6 with value (4 11) 14 with value (4 23) 1 with value (4 35)
% 0.49/0.65 ; 8 with value (4 12) 11 with value (4 24) 1 with value (4 41)
% 0.49/0.65 ; 12 with value (4 13) 7 with value (4 25) 1 with value (4 43)
% 0.49/0.65 ; 15 with value (4 14) 4 with value (4 26) 1 with value (4 48)
% 0.49/0.65 ; 21 with value (4 15) 3 with value (4 27) 1 with value (4 51)
% 0.49/0.65 ; 14 with value (4 16)
% 0.49/0.65 Evaluation took:
% 0.49/0.65 0.175 seconds of real time
% 0.49/0.65 0.16375 seconds of user run time
% 0.49/0.65 0.010776 seconds of system run time
% 0.49/0.65 0 calls to %EVAL
% 0.49/0.65 0 page faults and
% 0.49/0.65 11,734,136 bytes consed.
% 0.49/0.65 :PROOF-FOUND
% 0.49/0.65 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T17:07:56
% 0.49/0.65 :PROOF-FOUND
% 0.49/0.65 *
%------------------------------------------------------------------------------