TSTP Solution File: SET517-6 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET517-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n009.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:06 EDT 2022
% Result : Unsatisfiable 1.23s 1.42s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 21 unt; 4 nHn; 23 RR)
% Number of literals : 46 ( 18 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ subclass(X,Y)
| ~ member(Z,X)
| member(Z,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(equal_implies_subclass1,axiom,
( X != Y
| subclass(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',equal_implies_subclass1) ).
cnf(unordered_pair_member,axiom,
( ~ member(X,unordered_pair(Y,Z))
| X = Y
| X = Z ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(unordered_pair3,axiom,
( ~ member(X,universal_class)
| member(X,unordered_pair(Y,X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(singleton_set,axiom,
unordered_pair(X,X) = singleton(X),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(intersection3,axiom,
( ~ member(X,Y)
| ~ member(X,Z)
| member(X,intersection(Y,Z)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(complement1,axiom,
( ~ member(X,complement(Y))
| ~ member(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( X = null_class
| member(regular(X),X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(regularity2,axiom,
( X = null_class
| intersection(X,regular(X)) = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(prove_not_singleton_of_set_1,negated_conjecture,
singleton(member_of(x)) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_not_singleton_of_set_1) ).
cnf(prove_not_singleton_of_set_2,negated_conjecture,
member_of(x) = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_not_singleton_of_set_2) ).
cnf(129,plain,
singleton(x) = x,
inference('REWRITE',[status(thm)],[prove_not_singleton_of_set_1,prove_not_singleton_of_set_2,theory(equality)]) ).
cnf(133,plain,
member(singleton(X),universal_class),
inference('PARAMODULATE',[status(thm)],[unordered_pairs_in_universal,singleton_set,theory(equality)]) ).
cnf(154,plain,
( X = null_class
| member(regular(X),universal_class) ),
inference('HYPERRESOLVE',[status(thm)],[subclass_members,class_elements_are_sets,regularity1]) ).
cnf(205,plain,
( ~ member(X,singleton(Y))
| X = Y ),
inference('PARAMODULATE',[status(thm)],[unordered_pair_member,singleton_set,theory(equality)]) ).
cnf(319,plain,
member(x,universal_class),
inference('PARAMODULATE',[status(thm)],[133,129,theory(equality)]) ).
cnf(345,plain,
~ member(x,complement(universal_class)),
inference('UR-RESOLVE',[status(thm)],[complement1,319]) ).
cnf(346,plain,
member(x,unordered_pair(X,x)),
inference('HYPERRESOLVE',[status(thm)],[unordered_pair3,319]) ).
cnf(1855,plain,
member(x,x),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[346,singleton_set,theory(equality)]),129,theory(equality)]) ).
cnf(1931,plain,
~ subclass(x,complement(universal_class)),
inference('UR-RESOLVE',[status(thm)],[subclass_members,1855,345]) ).
cnf(1934,plain,
member(x,intersection(x,x)),
inference('HYPERRESOLVE',[status(thm)],[intersection3,1855,1855]) ).
cnf(3097,plain,
complement(universal_class) = null_class,
inference('HYPERRESOLVE',[status(thm)],[complement1,154,regularity1]) ).
cnf(3102,plain,
~ member(x,null_class),
inference('REWRITE',[status(thm)],[345,3097,theory(equality)]) ).
cnf(3185,plain,
~ subclass(x,null_class),
inference('REWRITE',[status(thm)],[1931,3097,theory(equality)]) ).
cnf(3824,plain,
x != null_class,
inference('UR-RESOLVE',[status(thm)],[equal_implies_subclass1,3185]) ).
cnf(5365,plain,
intersection(x,regular(x)) = null_class,
inference('UR-RESOLVE',[status(thm)],[regularity2,3824]) ).
cnf(5812,plain,
( ~ member(X,x)
| X = x ),
inference('PARAMODULATE',[status(thm)],[205,129,theory(equality)]) ).
cnf(5817,plain,
regular(x) = x,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[5812,regularity1]),3824]) ).
cnf(5818,plain,
intersection(x,x) = null_class,
inference('REWRITE',[status(thm)],[5365,5817,theory(equality)]) ).
cnf(5819,plain,
$false,
inference('REWRITE',[status(thm)],[1934,3102,5818,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET517-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : run-snark %s %d
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jul 9 19:17:22 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.45 #<PACKAGE "SNARK-USER">
% 0.19/0.45 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T19:17:22
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n009.cluster.edu at 2022-07-09T19:17:22
% 1.23/1.42
% 1.23/1.42
% 1.23/1.42 #||
% 1.23/1.42 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.23/1.42 % SZS output start Refutation
% See solution above
% 1.23/1.42 ||#
% 1.23/1.42
% 1.23/1.42 ; Summary of computation:
% 1.23/1.42 ; 11598 formulas have been input or derived (from 266 formulas).
% 1.23/1.42 ; 5819 (50%) were retained. Of these,
% 1.23/1.42 ; 400 ( 7%) were simplified or subsumed later,
% 1.23/1.42 ; 5419 (93%) are still being kept.
% 1.23/1.42 ;
% 1.23/1.42 ; Run time in seconds excluding printing time:
% 1.23/1.42 ; 0.021 2% Read assertion file (1 call)
% 1.23/1.42 ; 0.003 0% Assert (114 calls)
% 1.23/1.42 ; 0.321 33% Process new row (11,209 calls)
% 1.23/1.42 ; 0.269 28% Resolution (530 calls)
% 1.23/1.42 ; 0.008 1% Paramodulation (265 calls)
% 1.23/1.42 ; 0.001 0% Factoring (5 calls)
% 1.23/1.42 ; 0.003 0% Condensing (786 calls)
% 1.23/1.42 ; 0.084 9% Forward subsumption (786 calls)
% 1.23/1.42 ; 0.027 3% Backward subsumption (749 calls)
% 1.23/1.42 ; 0.002 0% Clause clause subsumption (1,500 calls)
% 1.23/1.42 ; 0.105 11% Forward simplification (11,206 calls)
% 1.23/1.42 ; 0.055 6% Backward simplification (5,804 calls)
% 1.23/1.42 ; 0.003 0% Ordering (1,902 calls)
% 1.23/1.42 ; 0.000 0% Sortal reasoning (32 calls)
% 1.23/1.42 ; 0.001 0% Purity testing (1 call)
% 1.23/1.42 ; 0.061 6% Other
% 1.23/1.42 ; 0.964 Total
% 1.23/1.42 ; 0.967 Real time
% 1.23/1.42 ;
% 1.23/1.42 ; Term-hash-array has 8,965 terms in all.
% 1.23/1.42 ; Feature-vector-row-index has 727 entries (734 at peak, 749 added, 22 deleted).
% 1.23/1.42 ; Feature-vector-row-index has 3,387 nodes (3,387 at peak, 3,474 added, 87 deleted).
% 1.23/1.42 ; Retrieved 1,896 possibly forward subsuming rows in 786 calls.
% 1.23/1.42 ; Retrieved 629 possibly backward subsumed rows in 749 calls.
% 1.23/1.42 ; Path-index has 8,450 entries (8,656 at peak, 9,022 added, 572 deleted).
% 1.23/1.42 ; Path-index has 5,635 nodes (5,641 at peak, 5,741 added, 106 deleted).
% 1.23/1.42 ; Trie-index has 8,450 entries (8,656 at peak, 9,022 added, 572 deleted).
% 1.23/1.42 ; Trie-index has 23,675 nodes (24,262 at peak, 25,202 added, 1,527 deleted).
% 1.23/1.42 ; Retrieved 7,927 generalization terms in 28,353 calls.
% 1.23/1.42 ; Retrieved 5,078 instance terms in 5,054 calls.
% 1.23/1.42 ; Retrieved 532,720 unifiable terms in 8,739 calls.
% 1.23/1.42 ;
% 1.23/1.42 ; The agenda of rows to give has 5174 entries:
% 1.23/1.42 ; 1 with value (4 9) 22 with value (4 22) 3 with value (4 34)
% 1.23/1.42 ; 85 with value (4 11) 14 with value (4 23) 2 with value (4 37)
% 1.23/1.42 ; 127 with value (4 12) 11 with value (4 24) 1 with value (4 43)
% 1.23/1.42 ; 178 with value (4 13) 6 with value (4 25) 1 with value (4 44)
% 1.23/1.42 ; 259 with value (4 14) 10 with value (4 26) 1 with value (4 45)
% 1.23/1.42 ; 221 with value (4 15) 7 with value (4 27) 4 with value (4 46)
% 1.23/1.42 ; 644 with value (4 16) 9 with value (4 28) 2 with value (4 49)
% 1.23/1.42 ; 773 with value (4 17) 13 with value (4 29) 1 with value (4 51)
% 1.23/1.42 ; 1223 with value (4 18) 3 with value (4 30) 1 with value (4 53)
% 1.23/1.42 ; 842 with value (4 19) 2 with value (4 31) 1 with value (4 55)
% 1.23/1.42 ; 434 with value (4 20) 1 with value (4 32) 1 with value (4 59)
% 1.23/1.42 ; 268 with value (4 21) 2 with value (4 33) 1 with value (4 63)
% 1.23/1.42 Evaluation took:
% 1.23/1.42 0.968 seconds of real time
% 1.23/1.42 0.877262 seconds of user run time
% 1.23/1.42 0.090705 seconds of system run time
% 1.23/1.42 [Run times include 0.119 seconds GC run time.]
% 1.23/1.42 0 calls to %EVAL
% 1.23/1.42 0 page faults and
% 1.23/1.42 69,046,520 bytes consed.
% 1.23/1.42 :PROOF-FOUND
% 1.23/1.42 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-09T19:17:23
% 1.23/1.42 :PROOF-FOUND
% 1.23/1.42 *
%------------------------------------------------------------------------------