TSTP Solution File: SET130-6 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET130-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n016.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:43 EDT 2022
% Result : Unsatisfiable 2.17s 2.36s
% Output : Refutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 13 unt; 1 nHn; 10 RR)
% Number of literals : 22 ( 4 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair2,axiom,
( ~ member(X,universal_class)
| member(X,unordered_pair(X,Y)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(singleton_set,axiom,
unordered_pair(X,X) = singleton(X),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(intersection1,axiom,
( ~ member(X,intersection(Y,Z))
| member(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(complement1,axiom,
( ~ member(X,complement(Y))
| ~ member(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(complement2,axiom,
( ~ member(X,universal_class)
| member(X,complement(Y))
| member(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(union,axiom,
complement(intersection(complement(X),complement(Y))) = union(X,Y),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(definition_of_set_builder,axiom,
union(singleton(X),Y) = set_builder(X,Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(104,plain,
complement(intersection(complement(singleton(X)),complement(Y))) = set_builder(X,Y),
inference('REWRITE',[status(thm)],[definition_of_set_builder,union,theory(equality)]) ).
cnf(prove_member_of_triple1_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple1_1) ).
cnf(prove_member_of_triple1_2,negated_conjecture,
~ member(u,set_builder(u,set_builder(y,set_builder(z,null_class)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_member_of_triple1_2) ).
cnf(107,plain,
~ member(u,complement(intersection(complement(singleton(u)),complement(complement(intersection(complement(singleton(y)),complement(complement(intersection(complement(singleton(z)),complement(null_class)))))))))),
inference('REWRITE',[status(thm)],[prove_member_of_triple1_2,104,theory(equality)]) ).
cnf(126,plain,
member(u,unordered_pair(u,X)),
inference('HYPERRESOLVE',[status(thm)],[unordered_pair2,prove_member_of_triple1_1]) ).
cnf(248,plain,
member(u,intersection(complement(singleton(u)),complement(complement(intersection(complement(singleton(y)),complement(complement(intersection(complement(singleton(z)),complement(null_class))))))))),
inference('UR-RESOLVE',[status(thm)],[complement2,107,prove_member_of_triple1_1]) ).
cnf(484,plain,
member(u,singleton(u)),
inference('PARAMODULATE',[status(thm)],[126,singleton_set,theory(equality)]) ).
cnf(884,plain,
~ member(u,complement(singleton(u))),
inference('UR-RESOLVE',[status(thm)],[complement1,484]) ).
cnf(11133,plain,
~ member(u,intersection(complement(singleton(u)),X)),
inference('UR-RESOLVE',[status(thm)],[intersection1,884]) ).
cnf(11134,plain,
$false,
inference('REWRITE',[status(thm)],[248,11133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET130-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n016.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 : Mon Jul 11 05:44:12 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-11T05:44:12
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-07-11T05:44:12
% 2.17/2.36
% 2.17/2.36
% 2.17/2.36 #||
% 2.17/2.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.17/2.36 % SZS output start Refutation
% See solution above
% 2.17/2.36 ||#
% 2.17/2.36
% 2.17/2.36 ; Summary of computation:
% 2.17/2.36 ; 22029 formulas have been input or derived (from 293 formulas).
% 2.17/2.36 ; 11134 (51%) were retained. Of these,
% 2.17/2.36 ; 591 ( 5%) were simplified or subsumed later,
% 2.17/2.36 ; 10543 (95%) are still being kept.
% 2.17/2.36 ;
% 2.17/2.36 ; Run time in seconds excluding printing time:
% 2.17/2.36 ; 0.018 1% Read assertion file (1 call)
% 2.17/2.36 ; 0.003 0% Assert (94 calls)
% 2.17/2.36 ; 0.609 33% Process new row (21,457 calls)
% 2.17/2.36 ; 0.674 36% Resolution (584 calls)
% 2.17/2.36 ; 0.007 0% Paramodulation (292 calls)
% 2.17/2.36 ; 0.000 0% Factoring (6 calls)
% 2.17/2.36 ; 0.013 1% Condensing (1,207 calls)
% 2.17/2.36 ; 0.061 3% Forward subsumption (1,207 calls)
% 2.17/2.36 ; 0.037 2% Backward subsumption (1,174 calls)
% 2.17/2.36 ; 0.007 0% Clause clause subsumption (2,470 calls)
% 2.17/2.36 ; 0.252 13% Forward simplification (21,449 calls)
% 2.17/2.36 ; 0.097 5% Backward simplification (11,120 calls)
% 2.17/2.36 ; 0.004 0% Ordering (2,847 calls)
% 2.17/2.36 ; 0.000 0% Sortal reasoning (32 calls)
% 2.17/2.36 ; 0.000 0% Purity testing (1 call)
% 2.17/2.36 ; 0.091 5% Other
% 2.17/2.36 ; 1.873 Total
% 2.17/2.36 ; 1.874 Real time
% 2.17/2.36 ;
% 2.17/2.36 ; Term-hash-array has 16,562 terms in all.
% 2.17/2.36 ; Feature-vector-row-index has 1,147 entries (1,147 at peak, 1,174 added, 27 deleted).
% 2.17/2.36 ; Feature-vector-row-index has 5,443 nodes (5,443 at peak, 5,565 added, 122 deleted).
% 2.17/2.36 ; Retrieved 2,353 possibly forward subsuming rows in 1,207 calls.
% 2.17/2.36 ; Retrieved 787 possibly backward subsumed rows in 1,174 calls.
% 2.17/2.36 ; Path-index has 15,903 entries (15,904 at peak, 16,615 added, 712 deleted).
% 2.17/2.36 ; Path-index has 6,303 nodes (6,306 at peak, 6,413 added, 110 deleted).
% 2.17/2.36 ; Trie-index has 15,903 entries (15,904 at peak, 16,615 added, 712 deleted).
% 2.17/2.36 ; Trie-index has 48,168 nodes (48,182 at peak, 49,968 added, 1,800 deleted).
% 2.17/2.36 ; Retrieved 13,928 generalization terms in 55,356 calls.
% 2.17/2.36 ; Retrieved 10,121 instance terms in 9,945 calls.
% 2.17/2.36 ; Retrieved 1,464,517 unifiable terms in 14,787 calls.
% 2.17/2.36 ;
% 2.17/2.36 ; The agenda of rows to process has 3 entries:
% 2.17/2.36 ; 1 with value 15 2 with value 17
% 2.17/2.36 ; The agenda of rows to give has 10277 entries:
% 2.17/2.36 ; 75 with value (4 11) 15 with value (4 24) 8 with value (4 36)
% 2.17/2.36 ; 145 with value (4 12) 5 with value (4 25) 2 with value (4 37)
% 2.17/2.36 ; 221 with value (4 13) 8 with value (4 26) 2 with value (4 38)
% 2.17/2.36 ; 412 with value (4 14) 17 with value (4 27) 1 with value (4 43)
% 2.17/2.36 ; 359 with value (4 15) 11 with value (4 28) 1 with value (4 44)
% 2.17/2.36 ; 811 with value (4 16) 12 with value (4 29) 1 with value (4 45)
% 2.17/2.36 ; 1174 with value (4 17) 14 with value (4 30) 3 with value (4 46)
% 2.17/2.36 ; 1968 with value (4 18) 3 with value (4 31) 1 with value (4 49)
% 2.17/2.36 ; 1963 with value (4 19) 1 with value (4 32) 1 with value (4 51)
% 2.17/2.36 ; 1871 with value (4 20) 3 with value (4 33) 1 with value (4 53)
% 2.17/2.36 ; 923 with value (4 21) 2 with value (4 34) 1 with value (4 59)
% 2.17/2.36 ; 224 with value (4 22) 1 with value (4 35) 1 with value (4 63)
% 2.17/2.36 ; 16 with value (4 23)
% 2.17/2.36 Evaluation took:
% 2.17/2.36 1.875 seconds of real time
% 2.17/2.36 1.732242 seconds of user run time
% 2.17/2.36 0.142852 seconds of system run time
% 2.17/2.36 [Run times include 0.254 seconds GC run time.]
% 2.17/2.36 0 calls to %EVAL
% 2.17/2.36 0 page faults and
% 2.17/2.36 136,016,600 bytes consed.
% 2.17/2.36 :PROOF-FOUND
% 2.17/2.36 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T05:44:14
% 2.17/2.36 :PROOF-FOUND
% 2.17/2.36 *
%------------------------------------------------------------------------------