TSTP Solution File: SET592+3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET592+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:10:38 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 3 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ subset(X,empty_set)
| X = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_empty_set_is_empty_set) ).
cnf(2,axiom,
( ~ subset(X,Y)
| ~ subset(X,Z)
| subset(X,intersection(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
cnf(17,negated_conjecture,
subset('SKOLEMAAAW4','SKOLEMAAAW5'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
cnf(18,negated_conjecture,
subset('SKOLEMAAAW4','SKOLEMAAAW6'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
cnf(19,negated_conjecture,
intersection('SKOLEMAAAW5','SKOLEMAAAW6') = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
cnf(20,negated_conjecture,
'SKOLEMAAAW4' != empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
cnf(21,plain,
~ subset('SKOLEMAAAW4',empty_set),
inference('UR-RESOLVE',[status(thm)],[1,20]) ).
cnf(33,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[2,18,17]),21,19,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET592+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 09:53:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T09:53:35
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-10T09:53:35
% 0.20/0.51
% 0.20/0.51 ; Recognized commutativity assertion (= (|intersection| ?X ?Y) (|intersection| ?Y ?X)).
% 0.20/0.53 ; Declaring intersection to be commutative.
% 0.20/0.53
% 0.20/0.53 #||
% 0.20/0.53 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.53 % SZS output start Refutation
% See solution above
% 0.20/0.53 ||#
% 0.20/0.53
% 0.20/0.53 ; Summary of computation:
% 0.20/0.53 ; 86 formulas have been input or derived (from 18 formulas).
% 0.20/0.53 ; 33 (38%) were retained. Of these,
% 0.20/0.53 ; 33 (100%) are still being kept.
% 0.20/0.53 ;
% 0.20/0.53 ; Run time in seconds excluding printing time:
% 0.20/0.53 ; 0.003 8% Read assertion file (1 call)
% 0.20/0.53 ; 0.001 3% Assert (11 calls)
% 0.20/0.53 ; 0.003 8% Process new row (59 calls)
% 0.20/0.53 ; 0.003 8% Resolution (34 calls)
% 0.20/0.53 ; 0.000 0% Paramodulation (17 calls)
% 0.20/0.53 ; 0.000 0% Factoring (2 calls)
% 0.20/0.53 ; 0.001 3% Condensing (29 calls)
% 0.20/0.53 ; 0.000 0% Forward subsumption (29 calls)
% 0.20/0.53 ; 0.000 0% Backward subsumption (22 calls)
% 0.20/0.53 ; 0.001 3% Clause clause subsumption (11 calls)
% 0.20/0.53 ; 0.001 3% Forward simplification (59 calls)
% 0.20/0.53 ; 0.000 0% Backward simplification (33 calls)
% 0.20/0.53 ; 0.000 0% Ordering (29 calls)
% 0.20/0.53 ; 0.001 3% Sortal reasoning (32 calls)
% 0.20/0.53 ; 0.000 0% Purity testing (1 call)
% 0.20/0.53 ; 0.022 61% Other
% 0.20/0.53 ; 0.036 Total
% 0.20/0.53 ; 0.037 Real time
% 0.20/0.53 ;
% 0.20/0.53 ; Term-hash-array has 54 terms in all.
% 0.20/0.53 ; Feature-vector-row-index has 22 entries (22 at peak, 22 added, 0 deleted).
% 0.20/0.53 ; Feature-vector-row-index has 65 nodes (65 at peak, 65 added, 0 deleted).
% 0.20/0.53 ; Retrieved 12 possibly forward subsuming rows in 29 calls.
% 0.20/0.53 ; Retrieved 2 possibly backward subsumed rows in 22 calls.
% 0.20/0.53 ; Path-index has 58 entries (58 at peak, 58 added, 0 deleted).
% 0.20/0.53 ; Path-index has 86 nodes (86 at peak, 86 added, 0 deleted).
% 0.20/0.53 ; Trie-index has 58 entries (58 at peak, 58 added, 0 deleted).
% 0.20/0.53 ; Trie-index has 96 nodes (96 at peak, 96 added, 0 deleted).
% 0.20/0.53 ; Retrieved 33 generalization terms in 87 calls.
% 0.20/0.53 ; Retrieved 15 instance terms in 10 calls.
% 0.20/0.53 ; Retrieved 553 unifiable terms in 123 calls.
% 0.20/0.53 ;
% 0.20/0.53 ; The agenda of rows to process has 24 entries:
% 0.20/0.53 ; 17 with value 8 6 with value 15 1 with value 22
% 0.20/0.53 ; The agenda of input rows to give has 3 entries:
% 0.20/0.53 ; 1 with value 15 2 with value 18
% 0.20/0.53 ; The agenda of rows to give has 12 entries:
% 0.20/0.53 ; 1 with value (4 4) 2 with value (4 10) 1 with value (4 17)
% 0.20/0.53 ; 2 with value (4 5) 3 with value (4 12) 1 with value (4 19)
% 0.20/0.53 ; 1 with value (4 8) 1 with value (4 16)
% 0.20/0.53 Evaluation took:
% 0.20/0.53 0.038 seconds of real time
% 0.20/0.53 0.032837 seconds of user run time
% 0.20/0.53 0.004994 seconds of system run time
% 0.20/0.53 0 calls to %EVAL
% 0.20/0.53 0 page faults and
% 0.20/0.53 1,977,272 bytes consed.
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T09:53:35
% 0.20/0.53 :PROOF-FOUND
% 0.20/0.53 *
%------------------------------------------------------------------------------