TSTP Solution File: SET015-4 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET015-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:05:46 EDT 2022
% Result : Unsatisfiable 2.39s 2.57s
% Output : Refutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 31 ( 11 unt; 13 nHn; 26 RR)
% Number of literals : 55 ( 9 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(extensionality1,axiom,
( little_set(f1(X,Y))
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality1) ).
cnf(extensionality2,axiom,
( member(f1(X,Y),X)
| member(f1(X,Y),Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).
cnf(extensionality3,axiom,
( ~ member(f1(X,Y),X)
| ~ member(f1(X,Y),Y)
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality3) ).
cnf(intersection1,axiom,
( ~ member(X,intersection(Y,Z))
| member(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection1) ).
cnf(intersection2,axiom,
( ~ member(X,intersection(Y,Z))
| member(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection2) ).
cnf(intersection3,axiom,
( member(X,intersection(Y,Z))
| ~ member(X,Y)
| ~ member(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection3) ).
cnf(complement1,axiom,
( ~ member(X,complement(Y))
| ~ member(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement1) ).
cnf(complement2,axiom,
( member(X,complement(Y))
| ~ little_set(X)
| member(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement2) ).
cnf(union,axiom,
union(X,Y) = complement(intersection(complement(X),complement(Y))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
cnf(a_union_b_is_c,hypothesis,
union(as,bs) = cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_union_b_is_c) ).
cnf(14,plain,
complement(intersection(complement(as),complement(bs))) = cs,
inference('REWRITE',[status(thm)],[a_union_b_is_c,union,theory(equality)]) ).
cnf(b_union_a_is_d,hypothesis,
union(bs,as) = ds,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_union_a_is_d) ).
cnf(16,plain,
complement(intersection(complement(bs),complement(as))) = ds,
inference('REWRITE',[status(thm)],[b_union_a_is_d,union,theory(equality)]) ).
cnf(prove_c_equals_d,negated_conjecture,
cs != ds,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_equals_d) ).
cnf(18,plain,
little_set(f1(cs,ds)),
inference('UR-RESOLVE',[status(thm)],[extensionality1,prove_c_equals_d]) ).
cnf(23,plain,
( ~ member(X,cs)
| ~ member(X,intersection(complement(as),complement(bs))) ),
inference('PARAMODULATE',[status(thm)],[complement1,14,theory(equality)]) ).
cnf(24,plain,
( ~ member(X,ds)
| ~ member(X,intersection(complement(bs),complement(as))) ),
inference('PARAMODULATE',[status(thm)],[complement1,16,theory(equality)]) ).
cnf(36,plain,
( member(f1(cs,ds),complement(X))
| member(f1(cs,ds),X) ),
inference('HYPERRESOLVE',[status(thm)],[complement2,18]) ).
cnf(251,plain,
( member(f1(cs,ds),ds)
| member(f1(cs,ds),cs) ),
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[complement1,36,extensionality2]),prove_c_equals_d]) ).
cnf(256,plain,
( member(f1(cs,ds),cs)
| member(f1(cs,ds),intersection(complement(as),complement(bs))) ),
inference('PARAMODULATE',[status(thm)],[36,14,theory(equality)]) ).
cnf(257,plain,
( member(f1(cs,ds),ds)
| member(f1(cs,ds),intersection(complement(bs),complement(as))) ),
inference('PARAMODULATE',[status(thm)],[36,16,theory(equality)]) ).
cnf(2621,plain,
( member(f1(cs,ds),cs)
| member(f1(cs,ds),complement(bs)) ),
inference('HYPERRESOLVE',[status(thm)],[intersection2,256]) ).
cnf(2622,plain,
( member(f1(cs,ds),cs)
| member(f1(cs,ds),complement(as)) ),
inference('HYPERRESOLVE',[status(thm)],[intersection1,256]) ).
cnf(2635,plain,
( member(f1(cs,ds),cs)
| member(f1(cs,ds),intersection(complement(bs),complement(as))) ),
inference('HYPERRESOLVE',[status(thm)],[intersection3,2622,2621]) ).
cnf(2640,plain,
( member(f1(cs,ds),ds)
| member(f1(cs,ds),complement(as)) ),
inference('HYPERRESOLVE',[status(thm)],[intersection2,257]) ).
cnf(2641,plain,
( member(f1(cs,ds),ds)
| member(f1(cs,ds),complement(bs)) ),
inference('HYPERRESOLVE',[status(thm)],[intersection1,257]) ).
cnf(2648,plain,
( member(f1(cs,ds),ds)
| member(f1(cs,ds),intersection(complement(as),complement(bs))) ),
inference('HYPERRESOLVE',[status(thm)],[intersection3,2641,2640]) ).
cnf(3159,plain,
member(f1(cs,ds),cs),
inference('HYPERRESOLVE',[status(thm)],[24,2635,251]) ).
cnf(3160,plain,
~ member(f1(cs,ds),ds),
inference('UR-RESOLVE',[status(thm)],[extensionality3,3159,prove_c_equals_d]) ).
cnf(3172,plain,
member(f1(cs,ds),intersection(complement(as),complement(bs))),
inference('REWRITE',[status(thm)],[2648,3160]) ).
cnf(3178,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[23,3159]),3172]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET015-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Sun Jul 10 22:54:13 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 *
% 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.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-10T22:54:13
% 0.20/0.47 ; 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-10T22:54:13
% 2.39/2.57
% 2.39/2.57
% 2.39/2.57 #||
% 2.39/2.57 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.39/2.57 % SZS output start Refutation
% See solution above
% 2.39/2.57 ||#
% 2.39/2.57
% 2.39/2.57 ; Summary of computation:
% 2.39/2.57 ; 10828 formulas have been input or derived (from 250 formulas).
% 2.39/2.57 ; 3178 (29%) were retained. Of these,
% 2.39/2.57 ; 2484 (78%) were simplified or subsumed later,
% 2.39/2.57 ; 694 (22%) are still being kept.
% 2.39/2.57 ;
% 2.39/2.57 ; Run time in seconds excluding printing time:
% 2.39/2.57 ; 0.002 0% Read assertion file (1 call)
% 2.39/2.57 ; 0.001 0% Assert (15 calls)
% 2.39/2.57 ; 0.282 13% Process new row (10,315 calls)
% 2.39/2.57 ; 0.143 7% Resolution (498 calls)
% 2.39/2.57 ; 0.019 1% Paramodulation (249 calls)
% 2.39/2.57 ; 0.001 0% Factoring (164 calls)
% 2.39/2.57 ; 0.035 2% Condensing (6,724 calls)
% 2.39/2.57 ; 0.589 28% Forward subsumption (6,724 calls)
% 2.39/2.57 ; 0.198 9% Backward subsumption (2,521 calls)
% 2.39/2.57 ; 0.454 22% Clause clause subsumption (271,228 calls)
% 2.39/2.57 ; 0.186 9% Forward simplification (10,067 calls)
% 2.39/2.57 ; 0.110 5% Backward simplification (3,176 calls)
% 2.39/2.57 ; 0.009 0% Ordering (16,829 calls)
% 2.39/2.57 ; 0.000 0% Sortal reasoning (32 calls)
% 2.39/2.57 ; 0.000 0% Purity testing (1 call)
% 2.39/2.57 ; 0.067 3% Other
% 2.39/2.57 ; 2.096 Total
% 2.39/2.57 ; 2.107 Real time
% 2.39/2.57 ;
% 2.39/2.57 ; Term-hash-array has 4,640 terms in all.
% 2.39/2.57 ; Feature-vector-row-index has 660 entries (1,342 at peak, 2,521 added, 1,861 deleted).
% 2.39/2.57 ; Feature-vector-row-index has 1,304 nodes (1,360 at peak, 2,952 added, 1,648 deleted).
% 2.39/2.57 ; Retrieved 245,683 possibly forward subsuming rows in 6,724 calls.
% 2.39/2.57 ; Retrieved 74,981 possibly backward subsumed rows in 2,521 calls.
% 2.39/2.57 ; Path-index has 1,093 entries (2,690 at peak, 4,664 added, 3,571 deleted).
% 2.39/2.57 ; Path-index has 762 nodes (762 at peak, 1,034 added, 272 deleted).
% 2.39/2.57 ; Trie-index has 1,093 entries (2,690 at peak, 4,664 added, 3,571 deleted).
% 2.39/2.57 ; Trie-index has 2,425 nodes (6,325 at peak, 10,769 added, 8,344 deleted).
% 2.39/2.57 ; Retrieved 25,170 generalization terms in 51,955 calls.
% 2.39/2.57 ; Retrieved 1,205 instance terms in 654 calls.
% 2.39/2.57 ; Retrieved 105,546 unifiable terms in 3,375 calls.
% 2.39/2.57 ;
% 2.39/2.57 ; The agenda of rows to process has 14 entries:
% 2.39/2.57 ; 2 with value 20 2 with value 27 4 with value 29
% 2.39/2.57 ; 6 with value 25
% 2.39/2.57 ; The agenda of rows to give has 586 entries:
% 2.39/2.57 ; 2 with value (4 12) 24 with value (4 27) 8 with value (4 35)
% 2.39/2.57 ; 1 with value (4 14) 118 with value (4 28) 24 with value (4 36)
% 2.39/2.57 ; 2 with value (4 15) 19 with value (4 29) 32 with value (4 37)
% 2.39/2.57 ; 1 with value (4 17) 50 with value (4 30) 24 with value (4 38)
% 2.39/2.57 ; 6 with value (4 21) 36 with value (4 31) 32 with value (4 39)
% 2.39/2.57 ; 26 with value (4 24) 27 with value (4 32) 8 with value (4 40)
% 2.39/2.57 ; 26 with value (4 25) 36 with value (4 33) 16 with value (4 41)
% 2.39/2.57 ; 32 with value (4 26) 4 with value (4 34) 32 with value (4 43)
% 2.39/2.57 Evaluation took:
% 2.39/2.57 2.108 seconds of real time
% 2.39/2.57 1.710319 seconds of user run time
% 2.39/2.57 0.389171 seconds of system run time
% 2.39/2.57 [Run times include 0.136 seconds GC run time.]
% 2.39/2.57 0 calls to %EVAL
% 2.39/2.57 0 page faults and
% 2.39/2.57 234,521,056 bytes consed.
% 2.39/2.57 :PROOF-FOUND
% 2.39/2.57 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T22:54:15
% 2.39/2.57 :PROOF-FOUND
% 2.39/2.57 *
%------------------------------------------------------------------------------