TSTP Solution File: SET025-9 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : SET025-9 : TPTP v8.1.0. Released v1.0.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:06:05 EDT 2022
% Result : Unsatisfiable 28.03s 28.27s
% Output : Refutation 28.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of clauses : 19 ( 11 unt; 0 nHn; 16 RR)
% Number of literals : 39 ( 6 equ; 22 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(a2,axiom,
( ~ member(X,Y)
| little_set(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',a2) ).
cnf(non_ordered_pair4,axiom,
little_set(non_ordered_pair(X,Y)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',non_ordered_pair4) ).
cnf(ordered_pair,axiom,
ordered_pair(X,Y) = non_ordered_pair(singleton_set(X),non_ordered_pair(X,Y)),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair) ).
cnf(ordered_pair_predicate1,axiom,
( ~ ordered_pair_predicate(X)
| little_set(f2(X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate1) ).
cnf(ordered_pair_predicate2,axiom,
( ~ ordered_pair_predicate(X)
| little_set(f3(X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate2) ).
cnf(ordered_pair_predicate3,axiom,
( ~ ordered_pair_predicate(X)
| X = ordered_pair(f2(X),f3(X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',ordered_pair_predicate3) ).
cnf(14,plain,
( ~ ordered_pair_predicate(X)
| X = non_ordered_pair(singleton_set(f2(X)),non_ordered_pair(f2(X),f3(X))) ),
inference('REWRITE',[status(thm)],[ordered_pair_predicate3,ordered_pair,theory(equality)]) ).
cnf(universal_set,axiom,
( member(X,universal_set)
| ~ little_set(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',universal_set) ).
cnf(infinity1,axiom,
little_set(infinity),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',infinity1) ).
cnf(compose7,axiom,
( member(X,compose(Y,Z))
| ~ little_set(X)
| ~ little_set(U)
| ~ little_set(V)
| ~ little_set(W)
| X != ordered_pair(U,V)
| ~ member(ordered_pair(U,W),Y)
| ~ member(ordered_pair(W,V),Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',compose7) ).
cnf(158,plain,
( member(X,compose(Y,Z))
| ~ little_set(X)
| ~ little_set(U)
| ~ little_set(V)
| ~ little_set(W)
| X != non_ordered_pair(singleton_set(U),non_ordered_pair(U,V))
| ~ member(non_ordered_pair(singleton_set(U),non_ordered_pair(U,W)),Y)
| ~ member(non_ordered_pair(singleton_set(W),non_ordered_pair(W,V)),Z) ),
inference('REWRITE',[status(thm)],[compose7,ordered_pair,theory(equality)]) ).
cnf(an_ordered_pair_predicate,hypothesis,
ordered_pair_predicate(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_ordered_pair_predicate) ).
cnf(prove_predicate_is_small,negated_conjecture,
~ little_set(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_predicate_is_small) ).
cnf(173,plain,
~ member(a,X),
inference('UR-RESOLVE',[status(thm)],[a2,prove_predicate_is_small]) ).
cnf(175,plain,
member(non_ordered_pair(X,Y),universal_set),
inference('HYPERRESOLVE',[status(thm)],[universal_set,non_ordered_pair4]) ).
cnf(179,plain,
little_set(f2(a)),
inference('HYPERRESOLVE',[status(thm)],[ordered_pair_predicate1,an_ordered_pair_predicate]) ).
cnf(180,plain,
little_set(f3(a)),
inference('HYPERRESOLVE',[status(thm)],[ordered_pair_predicate2,an_ordered_pair_predicate]) ).
cnf(557,plain,
a = non_ordered_pair(singleton_set(f2(a)),non_ordered_pair(f2(a),f3(a))),
inference('HYPERRESOLVE',[status(thm)],[14,an_ordered_pair_predicate]) ).
cnf(3563,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[158,175,non_ordered_pair4,179,180,infinity1,175,theory(equality)]),173,557,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET025-9 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 17:11:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 *
% 0.20/0.47 *
% 0.20/0.47 #<PACKAGE "SNARK-USER">
% 0.20/0.47 *
% 0.20/0.47 SNARK-TPTP-OPTIONS
% 0.20/0.47 *
% 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-10T17:11:20
% 0.20/0.48 ; 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-10T17:11:20
% 28.03/28.27
% 28.03/28.27
% 28.03/28.27 #||
% 28.03/28.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.03/28.27 % SZS output start Refutation
% See solution above
% 28.03/28.28 ||#
% 28.03/28.28
% 28.03/28.28 ; Summary of computation:
% 28.03/28.28 ; 31905 formulas have been input or derived (from 187 formulas).
% 28.03/28.28 ; 3563 (11%) were retained. Of these,
% 28.03/28.28 ; 61 ( 2%) were simplified or subsumed later,
% 28.03/28.28 ; 3502 (98%) are still being kept.
% 28.03/28.28 ;
% 28.03/28.28 ; Run time in seconds excluding printing time:
% 28.03/28.28 ; 0.026 0% Read assertion file (1 call)
% 28.03/28.28 ; 0.005 0% Assert (143 calls)
% 28.03/28.28 ; 0.374 1% Process new row (18,336 calls)
% 28.03/28.28 ; 25.945 93% Resolution (372 calls)
% 28.03/28.28 ; 0.005 0% Paramodulation (186 calls)
% 28.03/28.28 ; 0.000 0% Factoring (13 calls)
% 28.03/28.28 ; 0.098 0% Condensing (14,163 calls)
% 28.03/28.28 ; 0.831 3% Forward subsumption (14,163 calls)
% 28.03/28.28 ; 0.098 0% Backward subsumption (3,093 calls)
% 28.03/28.28 ; 0.054 0% Clause clause subsumption (17,084 calls)
% 28.03/28.28 ; 0.243 1% Forward simplification (16,666 calls)
% 28.03/28.28 ; 0.013 0% Backward simplification (3,537 calls)
% 28.03/28.28 ; 0.011 0% Ordering (8,122 calls)
% 28.03/28.28 ; 0.000 0% Sortal reasoning (32 calls)
% 28.03/28.28 ; 0.000 0% Purity testing (1 call)
% 28.03/28.28 ; 0.092 0% Other
% 28.03/28.28 ; 27.795 Total
% 28.03/28.28 ; 27.801 Real time
% 28.03/28.28 ;
% 28.03/28.28 ; Term-hash-array has 6,107 terms in all.
% 28.03/28.28 ; Feature-vector-row-index has 3,090 entries (3,090 at peak, 3,093 added, 3 deleted).
% 28.03/28.28 ; Feature-vector-row-index has 21,547 nodes (21,547 at peak, 21,555 added, 8 deleted).
% 28.03/28.28 ; Retrieved 24,184 possibly forward subsuming rows in 14,163 calls.
% 28.03/28.28 ; Retrieved 880 possibly backward subsumed rows in 3,093 calls.
% 28.03/28.28 ; Path-index has 6,076 entries (6,076 at peak, 6,114 added, 38 deleted).
% 28.03/28.28 ; Path-index has 16,181 nodes (16,181 at peak, 16,220 added, 39 deleted).
% 28.03/28.28 ; Trie-index has 6,076 entries (6,076 at peak, 6,114 added, 38 deleted).
% 28.03/28.28 ; Trie-index has 30,351 nodes (30,351 at peak, 30,398 added, 47 deleted).
% 28.03/28.28 ; Retrieved 20,871 generalization terms in 43,335 calls.
% 28.03/28.28 ; Retrieved 446 instance terms in 443 calls.
% 28.03/28.28 ; Retrieved 44,237,399 unifiable terms in 410,484 calls.
% 28.03/28.28 ;
% 28.03/28.28 ; The agenda of rows to process has 7954 entries:
% 28.03/28.28 ; 142 with value 19 924 with value 27 193 with value 34
% 28.03/28.28 ; 926 with value 20 1388 with value 28 72 with value 35
% 28.03/28.28 ; 212 with value 21 678 with value 29 48 with value 36
% 28.03/28.28 ; 140 with value 22 640 with value 30 24 with value 38
% 28.03/28.28 ; 298 with value 23 203 with value 31 18 with value 39
% 28.03/28.28 ; 320 with value 24 202 with value 32 16 with value 40
% 28.03/28.28 ; 526 with value 25 164 with value 33 2 with value 44
% 28.03/28.28 ; 818 with value 26
% 28.03/28.28 ; The agenda of rows to give has 3321 entries:
% 28.03/28.28 ; 1 with value (4 7) 100 with value (4 26) 38 with value (4 45)
% 28.03/28.28 ; 35 with value (4 8) 195 with value (4 27) 35 with value (4 46)
% 28.03/28.28 ; 42 with value (4 9) 206 with value (4 28) 19 with value (4 47)
% 28.03/28.28 ; 30 with value (4 10) 177 with value (4 29) 2 with value (4 48)
% 28.03/28.28 ; 42 with value (4 11) 115 with value (4 30) 12 with value (4 49)
% 28.03/28.28 ; 28 with value (4 12) 111 with value (4 31) 6 with value (4 50)
% 28.03/28.28 ; 45 with value (4 13) 97 with value (4 32) 2 with value (4 51)
% 28.03/28.28 ; 89 with value (4 14) 91 with value (4 33) 8 with value (4 53)
% 28.03/28.28 ; 102 with value (4 15) 75 with value (4 34) 9 with value (4 56)
% 28.03/28.28 ; 77 with value (4 16) 149 with value (4 35) 2 with value (4 57)
% 28.03/28.28 ; 90 with value (4 17) 176 with value (4 36) 2 with value (4 58)
% 28.03/28.28 ; 107 with value (4 18) 132 with value (4 37) 2 with value (4 59)
% 28.03/28.28 ; 84 with value (4 19) 136 with value (4 38) 9 with value (4 61)
% 28.03/28.28 ; 27 with value (4 20) 46 with value (4 39) 4 with value (4 62)
% 28.03/28.28 ; 58 with value (4 21) 56 with value (4 40) 4 with value (4 65)
% 28.03/28.28 ; 60 with value (4 22) 82 with value (4 41) 4 with value (4 74)
% 28.03/28.28 ; 58 with value (4 23) 69 with value (4 42) 2 with value (4 88)
% 28.03/28.28 ; 60 with value (4 24) 39 with value (4 43) 4 with value (4 94)
% 28.03/28.28 ; 48 with value (4 25) 18 with value (4 44) 4 with value (4 105)
% 28.03/28.28 Evaluation took:
% 28.03/28.28 27.804 seconds of real time
% 28.03/28.28 27.510176 seconds of user run time
% 28.03/28.28 0.288918 seconds of system run time
% 28.03/28.28 [Run times include 0.725 seconds GC run time.]
% 28.03/28.28 0 calls to %EVAL
% 28.03/28.28 0 page faults and
% 28.03/28.28 1,073,304,456 bytes consed.
% 28.03/28.28 :PROOF-FOUND
% 28.03/28.28 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T17:11:48
% 28.03/28.28 :PROOF-FOUND
% 28.03/28.28 *
%------------------------------------------------------------------------------