TSTP Solution File: SET598+3 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET598+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n019.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:42 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 8 unt; 5 nHn; 23 RR)
% Number of literals : 53 ( 10 equ; 28 neg)
% Maximal clause size : 4 ( 2 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 : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
subset(intersection(X,Y),X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_is_subset) ).
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(9,axiom,
( X = Y
| ~ subset(X,Y)
| ~ subset(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
cnf(14,negated_conjecture,
( 'SKOLEMAAAV3' != intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV4') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(15,negated_conjecture,
( 'SKOLEMAAAV3' != intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV5') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(16,negated_conjecture,
( 'SKOLEMAAAV3' != intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV6','SKOLEMAAAV3') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(17,negated_conjecture,
( 'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| subset('SKOLEMAAAV3','SKOLEMAAAV4') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(18,negated_conjecture,
( 'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| subset('SKOLEMAAAV3','SKOLEMAAAV5') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(19,negated_conjecture,
( 'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| ~ subset(X,'SKOLEMAAAV4')
| ~ subset(X,'SKOLEMAAAV5')
| subset(X,'SKOLEMAAAV3') ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th57) ).
cnf(27,plain,
( 'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| subset('SKOLEMAAAV3',intersection('SKOLEMAAAV4','SKOLEMAAAV5')) ),
inference('HYPERRESOLVE',[status(thm)],[2,18,17]) ).
cnf(47,plain,
( 'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5')
| subset(intersection('SKOLEMAAAV4','SKOLEMAAAV5'),'SKOLEMAAAV3') ),
inference('HYPERRESOLVE',[status(thm)],[19,1,1]) ).
cnf(84,plain,
'SKOLEMAAAV3' = intersection('SKOLEMAAAV4','SKOLEMAAAV5'),
inference('HYPERRESOLVE',[status(thm)],[9,47,27]) ).
cnf(85,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV4') ),
inference('REWRITE',[status(thm)],[14,84,theory(equality)]) ).
cnf(86,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV5') ),
inference('REWRITE',[status(thm)],[15,84,theory(equality)]) ).
cnf(87,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV4')
| ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV6','SKOLEMAAAV3') ),
inference('REWRITE',[status(thm)],[16,84,theory(equality)]) ).
cnf(91,plain,
subset('SKOLEMAAAV3','SKOLEMAAAV4'),
inference('PARAMODULATE',[status(thm)],[1,84,theory(equality)]) ).
cnf(92,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV4') ),
inference('REWRITE',[status(thm)],[85,91]) ).
cnf(93,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| subset('SKOLEMAAAV6','SKOLEMAAAV5') ),
inference('REWRITE',[status(thm)],[86,91]) ).
cnf(94,plain,
( ~ subset('SKOLEMAAAV3','SKOLEMAAAV5')
| ~ subset('SKOLEMAAAV6','SKOLEMAAAV3') ),
inference('REWRITE',[status(thm)],[87,91]) ).
cnf(95,plain,
subset('SKOLEMAAAV3','SKOLEMAAAV5'),
inference('PARAMODULATE',[status(thm)],[1,84,theory(equality)]) ).
cnf(96,plain,
subset('SKOLEMAAAV6','SKOLEMAAAV4'),
inference('REWRITE',[status(thm)],[92,95]) ).
cnf(97,plain,
subset('SKOLEMAAAV6','SKOLEMAAAV5'),
inference('REWRITE',[status(thm)],[93,95]) ).
cnf(98,plain,
~ subset('SKOLEMAAAV6','SKOLEMAAAV3'),
inference('REWRITE',[status(thm)],[94,95]) ).
cnf(111,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[2,97,96]),98,84,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET598+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 08:47:23 EDT 2022
% 0.14/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-11T08:47:23
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-07-11T08:47:23
% 0.20/0.49
% 0.20/0.49 ; Recognized commutativity assertion (= (|intersection| ?X ?Y) (|intersection| ?Y ?X)).
% 0.20/0.56 ; Declaring intersection to be commutative.
% 0.20/0.56
% 0.20/0.56 #||
% 0.20/0.56 % SZS status Theorem 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 ; 399 formulas have been input or derived (from 35 formulas).
% 0.20/0.56 ; 111 (28%) were retained. Of these,
% 0.20/0.56 ; 61 (55%) were simplified or subsumed later,
% 0.20/0.56 ; 50 (45%) are still being kept.
% 0.20/0.56 ;
% 0.20/0.56 ; Run time in seconds excluding printing time:
% 0.20/0.56 ; 0.003 4% Read assertion file (1 call)
% 0.20/0.56 ; 0.001 1% Assert (9 calls)
% 0.20/0.56 ; 0.013 16% Process new row (334 calls)
% 0.20/0.56 ; 0.009 11% Resolution (68 calls)
% 0.20/0.56 ; 0.001 1% Paramodulation (34 calls)
% 0.20/0.56 ; 0.000 0% Factoring (9 calls)
% 0.20/0.56 ; 0.003 4% Condensing (171 calls)
% 0.20/0.56 ; 0.012 14% Forward subsumption (171 calls)
% 0.20/0.56 ; 0.001 1% Backward subsumption (94 calls)
% 0.20/0.56 ; 0.002 2% Clause clause subsumption (310 calls)
% 0.20/0.56 ; 0.005 6% Forward simplification (286 calls)
% 0.20/0.56 ; 0.005 6% Backward simplification (111 calls)
% 0.20/0.56 ; 0.002 2% Ordering (431 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.026 31% Other
% 0.20/0.56 ; 0.083 Total
% 0.20/0.56 ; 0.086 Real time
% 0.20/0.56 ;
% 0.20/0.56 ; Term-hash-array has 189 terms in all.
% 0.20/0.56 ; Feature-vector-row-index has 36 entries (72 at peak, 94 added, 58 deleted).
% 0.20/0.56 ; Feature-vector-row-index has 137 nodes (469 at peak, 605 added, 468 deleted).
% 0.20/0.56 ; Retrieved 377 possibly forward subsuming rows in 171 calls.
% 0.20/0.56 ; Retrieved 28 possibly backward subsumed rows in 94 calls.
% 0.20/0.56 ; Path-index has 109 entries (156 at peak, 213 added, 104 deleted).
% 0.20/0.56 ; Path-index has 118 nodes (126 at peak, 170 added, 52 deleted).
% 0.20/0.56 ; Trie-index has 109 entries (156 at peak, 213 added, 104 deleted).
% 0.20/0.56 ; Trie-index has 203 nodes (305 at peak, 395 added, 192 deleted).
% 0.20/0.56 ; Retrieved 622 generalization terms in 526 calls.
% 0.20/0.56 ; Retrieved 34 instance terms in 16 calls.
% 0.20/0.56 ; Retrieved 2,187 unifiable terms in 360 calls.
% 0.20/0.56 ;
% 0.20/0.56 ; The agenda of rows to process has 16 entries:
% 0.20/0.56 ; 11 with value 8 1 with value 15 3 with value 19
% 0.20/0.56 ; 1 with value 12
% 0.20/0.56 ; The agenda of input rows to give has 1 entry:
% 0.20/0.56 ; 1 with value 4
% 0.20/0.56 ; The agenda of rows to give has 29 entries:
% 0.20/0.56 ; 2 with value (4 7) 2 with value (4 14) 3 with value (4 22)
% 0.20/0.56 ; 1 with value (4 8) 1 with value (4 15) 3 with value (4 26)
% 0.20/0.56 ; 2 with value (4 10) 1 with value (4 16) 3 with value (4 28)
% 0.20/0.56 ; 2 with value (4 11) 1 with value (4 18) 3 with value (4 29)
% 0.20/0.56 ; 1 with value (4 12) 4 with value (4 19)
% 0.20/0.56 Evaluation took:
% 0.20/0.56 0.086 seconds of real time
% 0.20/0.56 0.071104 seconds of user run time
% 0.20/0.56 0.015314 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,912,544 bytes consed.
% 0.20/0.56 :PROOF-FOUND
% 0.20/0.56 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T08:47:23
% 0.20/0.57 :PROOF-FOUND
% 0.20/0.57 *
%------------------------------------------------------------------------------