TSTP Solution File: SET093-7 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET093-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n004.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:13 EDT 2022
% Result : Unsatisfiable 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 3
% Syntax : Number of clauses : 4 ( 4 unt; 0 nHn; 3 RR)
% Number of literals : 4 ( 1 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 1 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(singletons_are_sets,axiom,
member(singleton(X),universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singletons_are_sets) ).
cnf(prove_corollary_2_to_singletons_are_sets_1,negated_conjecture,
singleton(member_of(x)) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_1) ).
cnf(prove_corollary_2_to_singletons_are_sets_2,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_2_to_singletons_are_sets_2) ).
cnf(144,plain,
$false,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[singletons_are_sets,prove_corollary_2_to_singletons_are_sets_1,theory(equality)]),prove_corollary_2_to_singletons_are_sets_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET093-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.10/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n004.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 : Mon Jul 11 02:01:07 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.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T02:01:07
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n004.cluster.edu at 2022-07-11T02:01:07
% 0.20/0.52
% 0.20/0.52 ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.20/0.55 ; Declaring unordered_pair to be commutative.
% 0.20/0.55
% 0.20/0.55 #||
% 0.20/0.55 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.55 % SZS output start Refutation
% See solution above
% 0.20/0.55 ||#
% 0.20/0.55
% 0.20/0.55 ; Summary of computation:
% 0.20/0.55 ; 175 formulas have been input or derived (from 28 formulas).
% 0.20/0.55 ; 144 (82%) were retained. Of these,
% 0.20/0.55 ; 12 ( 8%) were simplified or subsumed later,
% 0.20/0.55 ; 132 (92%) are still being kept.
% 0.20/0.55 ;
% 0.20/0.55 ; Run time in seconds excluding printing time:
% 0.20/0.55 ; 0.024 32% Read assertion file (1 call)
% 0.20/0.55 ; 0.004 5% Assert (138 calls)
% 0.20/0.56 ; 0.010 13% Process new row (152 calls)
% 0.20/0.56 ; 0.002 3% Resolution (54 calls)
% 0.20/0.56 ; 0.000 0% Paramodulation (27 calls)
% 0.20/0.56 ; 0.001 1% Condensing (96 calls)
% 0.20/0.56 ; 0.002 3% Forward subsumption (96 calls)
% 0.20/0.56 ; 0.002 3% Backward subsumption (89 calls)
% 0.20/0.56 ; 0.002 3% Clause clause subsumption (39 calls)
% 0.20/0.56 ; 0.006 8% Forward simplification (152 calls)
% 0.20/0.56 ; 0.000 0% Backward simplification (132 calls)
% 0.20/0.56 ; 0.000 0% Ordering (53 calls)
% 0.20/0.56 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.56 ; 0.000 0% Purity testing (1 call)
% 0.20/0.56 ; 0.022 29% Other
% 0.20/0.56 ; 0.075 Total
% 0.20/0.56 ; 0.077 Real time
% 0.20/0.56 ;
% 0.20/0.56 ; Term-hash-array has 296 terms in all.
% 0.20/0.56 ; Feature-vector-row-index has 89 entries (89 at peak, 89 added, 0 deleted).
% 0.20/0.56 ; Feature-vector-row-index has 361 nodes (361 at peak, 361 added, 0 deleted).
% 0.20/0.56 ; Retrieved 40 possibly forward subsuming rows in 96 calls.
% 0.20/0.56 ; Retrieved 5 possibly backward subsumed rows in 89 calls.
% 0.20/0.56 ; Path-index has 305 entries (305 at peak, 305 added, 0 deleted).
% 0.20/0.56 ; Path-index has 1,014 nodes (1,014 at peak, 1,014 added, 0 deleted).
% 0.20/0.56 ; Trie-index has 305 entries (305 at peak, 305 added, 0 deleted).
% 0.20/0.56 ; Trie-index has 852 nodes (852 at peak, 852 added, 0 deleted).
% 0.20/0.56 ; Retrieved 52 generalization terms in 307 calls.
% 0.20/0.56 ; Retrieved 58 instance terms in 42 calls.
% 0.20/0.56 ; Retrieved 502 unifiable terms in 120 calls.
% 0.20/0.56 ;
% 0.20/0.56 ; The agenda of rows to process has 5 entries:
% 0.20/0.56 ; 4 with value 9 1 with value 10
% 0.20/0.56 ; The agenda of input rows to give has 102 entries:
% 0.20/0.56 ; 4 with value 9 5 with value 16 1 with value 27
% 0.20/0.56 ; 12 with value 10 3 with value 17 2 with value 30
% 0.20/0.56 ; 11 with value 11 4 with value 18 1 with value 31
% 0.20/0.56 ; 14 with value 12 1 with value 19 1 with value 34
% 0.20/0.56 ; 10 with value 13 5 with value 20 2 with value 35
% 0.20/0.56 ; 8 with value 14 3 with value 21 1 with value 50
% 0.20/0.56 ; 10 with value 15 4 with value 22
% 0.20/0.56 ; The agenda of rows to give has 2 entries:
% 0.20/0.56 ; 1 with value (4 4) 1 with value (4 5)
% 0.20/0.56 Evaluation took:
% 0.20/0.56 0.078 seconds of real time
% 0.20/0.56 0.071823 seconds of user run time
% 0.20/0.56 0.005579 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 3,598,672 bytes consed.
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T02:01:07
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 *
%------------------------------------------------------------------------------